DocumentCode
3162087
Title
The effects of multiprogramming on barrier synchronization
Author
Markatos, Evangelos ; Crovella, Mark ; Das, Prakash ; Dubnicki, Cezary ; LeBlanc, Thomas
Author_Institution
Dept. of Comput. Sci., Rochester Univ., NY, USA
fYear
1991
fDate
2-5 Dec 1991
Firstpage
662
Lastpage
669
Abstract
One of the most common ways to share a multiprocessor among several applications is to give each application a set of dedicated processors. To ensure fairness, an application may receive fewer processors than it has processes. Unless an application can easily adjust the number of processes it employs during execution, several processes from the same application may have to share a processor. The authors quantify the performance penalty that arises when more than one process from the same application runs on a single processor of a NUMA (Non Uniform Memory Access) multiprocessor. They consider programs that use coarse-grain parallelism and barrier synchronization because they are particularly sensitive to multiprogramming. They quantify the impact on the performance of an application of quantum size, frequency of synchronization, and the type of barrier used. They conclude that dedicating processors to an application, even without migration or dynamic adjustment of the number of processes, is an effective scheduling policy for programs that synchronize frequently using barriers
Keywords
multiprogramming; scheduling; synchronisation; NUMA; barrier synchronization; coarse-grain parallelism; dedicated processors; fairness; multiprogramming; performance; scheduling; Application software; Computer science; Degradation; Dynamic scheduling; Frequency synchronization; Hardware; Kernel; Parallel processing; Parallel programming; Processor scheduling;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing, 1991. Proceedings of the Third IEEE Symposium on
Conference_Location
Dallas, TX
Print_ISBN
0-8186-2310-1
Type
conf
DOI
10.1109/SPDP.1991.218199
Filename
218199
Link To Document