Implementation and Verification of Concurrent Sorting Algorithms with CSP based Architecture

Abstract

Communicating Sequential Processes (CSP) based architecture is regarded as a useful method in the development of concurrent embedded systems. Products around us are embedded in many computer systems. Concurrent processing by software is necessary in multi-core and multi-processor environments to make more effective use of hardware resources. There is strong demand for hierarchy, resource constraints, and safety for implementation of embedded systems. We implemented a sorting model as a concurrent system in an experiment. We tried to design, implement, and verify concurrent sorting model with CSP based architecture. In this study, we try to parallelize of sorting as the subject of embedded systems for implementing. Because sorting has been widely studied, it is suitable as the subject of parallelization. We also evaluated the system. We will consider the usefulness of CSP, which we present in this paper, using examples of development.

Small-World Architecture for Parallel Processors

“…For the purpose of synchronization, to the memory access even in the case, the CSP mechanism is intended for use in main memory data, but as a communication channel. Because of CSP based architecture, applications are not limited to conventional array processing applications, but also include wide areas of applications such as multimedia, signal processing, sorting and so on [2] [3]. A parallel process network is represented by the network of communicating processes, shown in Fig.…”