Loading...
Please wait, while we are loading the content...
Similar Documents
High performance synchronization algorithms for multiprogrammed multiprocessors (1995)
| Content Provider | CiteSeerX |
|---|---|
| Author | Wisniewski, Robert W. Kontothanassis, Leonidas I. Scott, Michael L. |
| Description | Scalable busy-wait synchronization algorithms are essential for achieving good parallel program performance on large scale multiprocessors. Such algorithms include mutual exclusion locks, reader-writer locks, and barrier synchronization. Unfortunately, scalable synchronization algorithms are particularly sensitive to the effects of multiprogramming: their performance degrades sharply when processors are shared among different applications, or even among processes of the same application. In this paper we describe the design and evaluation of scalable scheduler-conscious mutual exclusion locks, reader-writer locks, and barriers, and show that by sharing information across the kernel/application interface we can improve the performance of scheduler-oblivious |
| File Format | |
| Language | English |
| Publisher Date | 1995-01-01 |
| Publisher Institution | Proc., 5th ACM Symp. on Principles and Practice of Parallel Programming (PPoPP |
| Access Restriction | Open |
| Subject Keyword | Reader-writer Lock Mutual Exclusion Lock Scalable Synchronization Algorithm Multiprogrammed Multiprocessor Kernel Application Performance Degrades Scalable Scheduler-conscious Mutual Exclusion Lock Scalable Busy-wait Synchronization Algorithm Good Parallel Program Performance Different Application Large Scale Multiprocessor High Performance Synchronization Algorithm |
| Content Type | Text |
| Resource Type | Article |
