Dynamic processor self-scheduling for general parallel nested loops

Journal Article · Sun Jul 01 00:00:00 EDT 1990 · IEEE Transactions on Computers (Institute of Electrical and Electronics Engineers); (USA)

DOI:https://doi.org/10.1109/12.55693· OSTI ID:6582372

Fang, Z ^[1]; Tang, P ^[2]; Yew, P C ^[3]; Zhu, C Q ^[4]

---

1. Convex Computer Corp., Richardson TX (US)
2. Dept. of Computer Science, Australia National Univ., Canberra ACT 2601 (AU)
3. Illinois Univ., Urbana, IL (USA). Center for Supercomputing Research and Development
4. Computer Center, Fudan Univ., Shanghai (CN)

This paper proposes a processor self-scheduling scheme for general parallel nested loops in multiprocessor systems. Parallel loops usually constitute most of the execution time in scientific application programs. In a general parallel loop structure, parallel loops, serial loops, and If-Then-Else constructs are nested in an arbitrary order, and the execution time of the loop body may vary substantially from iteration to iteration. In the proposed scheme, programs are instrumented to allow processors to schedule loop iterations among themselves dynamically at run time without the involvement of the operating system.

• OSTI ID: 6582372
• Journal Information: IEEE Transactions on Computers (Institute of Electrical and Electronics Engineers); (USA), Vol. 39:7; ISSN 0018-9340
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
SUPERCOMPUTERS
PARALLEL PROCESSING
ARRAY PROCESSORS
COMPUTER ARCHITECTURE
PERFORMANCE
PLANNING
COMPUTERS
DIGITAL COMPUTERS
PROGRAMMING
990200* - Mathematics & Computers