PROCESSOR SELF-SCHEDULING FOR MULTIPLE-NESTED PARALLEL LOOPS.

Peiyi Tang, Pen Chung Yew

Research output: Chapter in Book/Report/Conference proceedingConference contribution

165 Scopus citations

Abstract

Processor self-scheduling is a useful scheme in a multiprocessor system if the execution time of each iteration in a parallel loop is not known in advance and varies substantially, or if there are multiple nestings in parallel loops which makes static scheduling difficult and inefficient. By using efficient synchronization primitives, the operating system is not needed for loop scheduling. The overhead for the processor self-scheduling is small. A self-scheduling scheme is presented for a single-nested parallel loop and is extended to multiple-nested parallel loops. Barrier synchronization mechanisms for the self-scheduling schemes are also discussed.

Original languageEnglish (US)
Title of host publicationProceedings of the International Conference on Parallel Processing
EditorsKai Hwang, Steven M. Jacobs, Earl E. Swartzlander
PublisherIEEE
Pages528-535
Number of pages8
ISBN (Print)0818607246
StatePublished - Dec 1 1986

Publication series

NameProceedings of the International Conference on Parallel Processing
ISSN (Print)0190-3918

Fingerprint Dive into the research topics of 'PROCESSOR SELF-SCHEDULING FOR MULTIPLE-NESTED PARALLEL LOOPS.'. Together they form a unique fingerprint.

Cite this