DEADLOCK PREVENTION IN PROCESSOR SELF-SCHEDULING FOR PARALLEL NESTED LOOPS.

Peiyi Tang, Pen Chung Yew, Zhixi Fang, Chuan Qi Zhu

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

6 Scopus citations

Abstract

Processor self-scheduling is an effective distributed dynamic scheduling scheme for parallel nested loops in multiprocessor systems. Since self-scheduling is nonpreemptive and uses busy-waiting as the basic technique for task synchronization, deadlocks may possibly arise. Conditions that allow deadlock-free processor self-scheduling are identified. Control tokens and data tokens are used to model the precedence relation and data dependences. Control tokens, data tokens, and processors are regarded as three kinds of resources needed by tasks. Using this resource model, three possible self-scheduling schemes with different degrees of parallelism are studied, and a proposal for preventing deadlocks is given.

Original languageEnglish (US)
Title of host publicationProceedings of the International Conference on Parallel Processing
EditorsSartaj K. Sahni
PublisherPennsylvania State Univ Press
Pages11-18
Number of pages8
ISBN (Print)0271006080
StatePublished - Dec 1 1987
EventProc Int Conf Parallel Process 1987 - Universal Park, PA, USA
Duration: Aug 17 1987Aug 21 1987

Other

OtherProc Int Conf Parallel Process 1987
CityUniversal Park, PA, USA
Period8/17/878/21/87

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

  • Cite this

    Tang, P., Yew, P. C., Fang, Z., & Zhu, C. Q. (1987). DEADLOCK PREVENTION IN PROCESSOR SELF-SCHEDULING FOR PARALLEL NESTED LOOPS. In S. K. Sahni (Ed.), Proceedings of the International Conference on Parallel Processing (pp. 11-18). Pennsylvania State Univ Press.