Thumbnail
Access Restriction
Subscribed

Author Lipton, Richard J.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Deadlock free ♦ Interruptible ♦ Reduction ♦ Computation sequence ♦ Indivisible ♦ Parallel program ♦ Verification method ♦ Process ♦ Semaphore
Abstract When proving that a parallel program has a given property it is often convenient to assume that a statement is indivisible, i.e. that the statement cannot be interleaved with the rest of the program. Here sufficient conditions are obtained to show that the assumption that a statement is indivisible can be relaxed and still preserve properties such as halting. Thus correctness proofs of a parallel system can often be greatly simplified.
Description Affiliation: Yale Univ., New Haven, CT (Lipton, Richard J.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 18
Issue Number 12
Page Count 5
Starting Page 717
Ending Page 721


Open content in new tab

   Open content in new tab
Source: ACM Digital Library