Abstract
The issue of effectiveness of private caches for processors were studied. Since time for all processors to access the shared memory simultaneously is usually much longer than the time for a processor to access its own private cache, scheduling with private caches falls into the distributed memory model where the lower bound applies. The effectiveness of private caches were shown by proving that a version of Dynamic Equi-partition Scheduling Policy (DEQ) achieves a mean response time with five times the optimal mean response time in the cache clock time for a large class of parallel jobs well accepted in the parallel scheduling community. This shows an improvement of system performance by using private caches over that of purely shared memory.
| Original language | English |
|---|---|
| Title of host publication | Annual ACM Symposium on Parallel Algorithms and Architectures |
| Pages | 82-88 |
| DOIs | |
| Publication status | Published - 1996 |
| Externally published | Yes |
| Event | Proceedings of the 1996 8th Annual ACM Symposium on Parallel Algorithms and Architectures - Padua, Italy Duration: 24 Jun 1996 → 26 Jun 1996 |
Conference
| Conference | Proceedings of the 1996 8th Annual ACM Symposium on Parallel Algorithms and Architectures |
|---|---|
| City | Padua, Italy |
| Period | 24/06/96 → 26/06/96 |
Bibliographical note
Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].Publisher's Copyright Statement
- This full text is made available under CC-BY 4.0. https://creativecommons.org/licenses/by/4.0/
Fingerprint
Dive into the research topics of 'On multiprocessor system scheduling'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver