Show simple item record

dc.contributor.authorAndrews, Gregory R.en_US
dc.date.accessioned2007-04-23T17:38:04Z
dc.date.available2007-04-23T17:38:04Z
dc.date.issued1976-04en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR76-275en_US
dc.identifier.urihttps://hdl.handle.net/1813/6831
dc.description.abstractIn multiprogramming systems, parallel processes compete for access to shared resources and cooperate by exchanging information. Semaphores are a useful means for controlling competition and synchronizing execution and inter-process messages are useful for communication. Neither semaphores nor inter-process message, however, are natural for solving both problems. This paper introduces a new approach, message classes, which combines and extends features of both semaphores and message passing. Using message classes, numerous mutual exclusion, producer/consumer, process communication, and resource allocation problems can be readily solved.en_US
dc.format.extent1103820 bytes
dc.format.extent612655 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleMessage Classes: An Approach to Process Synchronizationen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics