On Programming Dependences Between Parallel Processes

dc.contributor.authorBelpaire, Geralden_US
dc.date.accessioned2012-03-15T16:25:12Z
dc.date.available2012-03-15T16:25:12Z
dc.date.created1975en_US
dc.date.issued1975en
dc.description.abstractIn order to study the problems of synchronization between concurrent processes, a distinction is made between the level of the formal models, the level of programming tools, and the level of the implementation practicalities. The model is seen as the semantics of the programming tools, and the implementation as the realization of the semantics at a lower level of abstraction. Different classes of problems of synchronization are distinguished (e. g. exclusions, cooperations) and formal rules are defined to characterize them (the rules of dependence). The different classes are defined upon a common root of basic concepts and hypotheses, in order to be able to draw comparisons between them. An important part of the work is dedicated to a formal treatment of the deadlock problem for the class of problems of exclusions between critical sections. An attempt is made to give an answer to the question of understanding what characterizes a problem of synchronization, how it is related to the choice of programming primitives, and what are the effects of the imp1ementation design.en_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.citationTR244en
dc.identifier.urihttp://digital.library.wisc.edu/1793/57930
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleOn Programming Dependences Between Parallel Processesen_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
TR244.pdf
Size:
4.71 MB
Format:
Adobe Portable Document Format