skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Deadlock prevention in processor self-scheduling for parallel nested loops

Abstract

Processor self-scheduling is an effective distributed dynamic scheduling scheme for parallel nested loops in multiprocessor systems. A parallel nested loop structure can be considered as a task system. A task is an interation (or several iterations) of an innermost loop body and the execution order of tasks is determined by a precedence relation. Data dependences among statements are enforced either by the precedence relation or by explicit synchronization. Since self-scheduling is non-preemptive and uses busy-waiting as the basic technique for task synchronization, deadlocks may possibly arise. This paper identifies conditions that allow deadlock-free processor self-scheduling. It uses control tokens and data tokens to model the precedence relation and data dependences. Both control tokens and data tokens, together with processors, are regarded as three kinds of resources needed by tasks. Based on this resource model, we study three possible self-scheduling schemes with different degrees of parallelism, and propose to use appropriate scheduling priority for allocating processors to prevent deadlocks. 12 refs., 7 figs.

Authors:
; ; ;
Publication Date:
Research Org.:
Illinois Univ., Urbana (USA). Center for Supercomputing Research and Development; Wichita State Univ., KS (USA). Dept. of Computer Science
OSTI Identifier:
5768508
Report Number(s):
DOE/ER/25001-39; CONF-870831-5; CSRD-626
ON: DE88003573
DOE Contract Number:  
FG02-85ER25001
Resource Type:
Conference
Resource Relation:
Conference: International conference on parallel processing, St. Charles, IL, USA, 17 Aug 1987; Other Information: Portions of this document are illegible in microfiche products
Country of Publication:
United States
Language:
English
Subject:
99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; ARRAY PROCESSORS; TASK SCHEDULING; PARALLEL PROCESSING; SYNCHRONIZATION; DATA PROCESSING; PROCESSING; PROGRAMMING; 990210* - Supercomputers- (1987-1989)

Citation Formats

Tang, Peiyi, Yew, Pen-Chung, Fang, Zhixi, and Zhu, Chuan-Qi. Deadlock prevention in processor self-scheduling for parallel nested loops. United States: N. p., 1987. Web.
Tang, Peiyi, Yew, Pen-Chung, Fang, Zhixi, & Zhu, Chuan-Qi. Deadlock prevention in processor self-scheduling for parallel nested loops. United States.
Tang, Peiyi, Yew, Pen-Chung, Fang, Zhixi, and Zhu, Chuan-Qi. 1987. "Deadlock prevention in processor self-scheduling for parallel nested loops". United States.
@article{osti_5768508,
title = {Deadlock prevention in processor self-scheduling for parallel nested loops},
author = {Tang, Peiyi and Yew, Pen-Chung and Fang, Zhixi and Zhu, Chuan-Qi},
abstractNote = {Processor self-scheduling is an effective distributed dynamic scheduling scheme for parallel nested loops in multiprocessor systems. A parallel nested loop structure can be considered as a task system. A task is an interation (or several iterations) of an innermost loop body and the execution order of tasks is determined by a precedence relation. Data dependences among statements are enforced either by the precedence relation or by explicit synchronization. Since self-scheduling is non-preemptive and uses busy-waiting as the basic technique for task synchronization, deadlocks may possibly arise. This paper identifies conditions that allow deadlock-free processor self-scheduling. It uses control tokens and data tokens to model the precedence relation and data dependences. Both control tokens and data tokens, together with processors, are regarded as three kinds of resources needed by tasks. Based on this resource model, we study three possible self-scheduling schemes with different degrees of parallelism, and propose to use appropriate scheduling priority for allocating processors to prevent deadlocks. 12 refs., 7 figs.},
doi = {},
url = {https://www.osti.gov/biblio/5768508}, journal = {},
number = ,
volume = ,
place = {United States},
year = {Thu Jan 01 00:00:00 EST 1987},
month = {Thu Jan 01 00:00:00 EST 1987}
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share: