Deadlock Free Specification based on Local Process Properties
Simpson, Duncan and Reeve, Jeff, Sloot, P.M.A, Abramson, D and Dongarra, J.J (eds.) (2003) Deadlock Free Specification based on Local Process Properties. Lecture Notes in Computer Science, 2659, 350-359.
We present a design methodology for the construction of parallel programs that is deadlock free, Provided that the ``components'' of the program are constructed according to a set of locally applied rules. In our model, a parallel program is a set of processes and a set of events. Each event is shared by two processes only and each process progresses cyclically. Events are distinguished as input and output events with respect to their two participating processes. On each cycle a process must complete all output events that it offers to the environment, be prepared to accept any, and accept at least one, of its input events before completing any computations and starting a new cycle. We show that however the events are distributed among the processes, the program is deadlock free.
|Divisions:||Faculty of Physical and Applied Science > Electronics and Computer Science > EEE
|Date Deposited:||26 Jun 2003|
|Last Modified:||07 Mar 2012 17:36|
|Contributors:||Simpson, Duncan (Author)
Reeve, Jeff (Author)
Sloot, P.M.A (Editor)
Abramson, D (Editor)
Dongarra, J.J (Editor)
|Further Information:||Google Scholar|
|ISI Citation Count:||0|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)