Deadlock Free Specification based on Local Process Properties
Deadlock Free Specification based on Local Process Properties
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.
Deadlock Freedom
350-359
Simpson, Duncan
d0137fe2-f7ac-4e8d-9a2a-a72058b7f9f3
Reeve, Jeff
dd909010-7d44-44ea-83fe-a09e4d492618
Sloot, P.M.A
4b8fcc78-f6cf-4200-b019-4623c5307007
Abramson, D
80866542-475b-4269-bbac-3578e4b7d734
Dongarra, J.J
260dc8cc-49ea-4db7-9658-86288dd4f77c
June 2003
Simpson, Duncan
d0137fe2-f7ac-4e8d-9a2a-a72058b7f9f3
Reeve, Jeff
dd909010-7d44-44ea-83fe-a09e4d492618
Sloot, P.M.A
4b8fcc78-f6cf-4200-b019-4623c5307007
Abramson, D
80866542-475b-4269-bbac-3578e4b7d734
Dongarra, J.J
260dc8cc-49ea-4db7-9658-86288dd4f77c
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, .
Abstract
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.
More information
Published date: June 2003
Keywords:
Deadlock Freedom
Organisations:
EEE
Identifiers
Local EPrints ID: 257612
URI: http://eprints.soton.ac.uk/id/eprint/257612
ISSN: 0302-9743
PURE UUID: 49eee071-d3c9-457a-971b-129a357c35bd
Catalogue record
Date deposited: 26 Jun 2003
Last modified: 14 Mar 2024 05:59
Export record
Contributors
Author:
Duncan Simpson
Author:
Jeff Reeve
Editor:
P.M.A Sloot
Editor:
D Abramson
Editor:
J.J Dongarra
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics