Referenced Items are not available for this document.
In a shared-memory parallel processing environment there are a number of inherent hardware and software bottlenecks. One of these bottlenecks is the exclusive accesses that are needed to the shared variables within a critical section. The time cost of synchronization of processes which require access to the critical section can be minimized by using optimal scheduling methods. This paper presents a set of pre-run-time optimal scheduling algorithms for accessing the critical sections by the processes which are spawned at FORK operation and are terminated at the associated JOIN operation
Published in:
Computing and Information, 1992. Proceedings. ICCI '92., Fourth International Conference on
Date of Conference: 28-30 May 1992
- Page(s):
- 123 - 127
- Meeting Date :
- 28 May 1992-30 May 1992
- Print ISBN:
- 0-8186-2812-X
- INSPEC Accession Number:
- 4368376
- Conference Location :
- Toronto, Ont.
- Digital Object Identifier :
- 10.1109/ICCI.1992.227690
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
