ISSN:
1573-7640
Keywords:
Communicating sequential processes
;
data-driven evaluation
;
fairness
;
generalized guarded commands
;
liveness
;
performance evaluation
;
safety
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract Earlier approaches to execute generalized alternative/repetitive commands of Communicating Sequential Processes (CSP) attempt the selection of guards in a sequential order. Also, these implementations are based on either shared memory or message passing multiprocessor systems. In contrast, we propose an implementation of generalized guarded commands using the data-driven model of computation. A significant feature of our implementation is that it attempts the selection of the guards of a process in parallel. We prove that our implementation is faithful to the semantics of the generalized guarded commands. Further, we have simulated the implementation using discrete-event simulation and measured various performance parameters. The measured parameters are helpful in establishing the fairness of our implementation and its superiority, in terms of efficiency and the parallelism exploited, over other implementations. The simulation study is also helpful in identifying various issues that affect the performance of our implementation. Based on this study, we have proposed an adaptive algorithm which dynamically tunes the extent of parallelism in the implementation to achieve an optimum level of performance.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01421675
