General approach to multiprocessor scheduling

Thesis/Dissertation · Fri Jan 01 04:00:00 EST 1988

OSTI ID:5501704

Kim, S J

This thesis defines and characterizes scheduling techniques and related heuristic mapping algorithms applicable to a spectrum of multiprocessor systems and a broad class of application programs. The fundamental idea used is that multiprocessor scheduling can be regarded as a series of mappings from a computation graph (representing an application program) to a virtual architecture graph (representing an optimal architecture for the program) and eventually to a physical architecture graph (representing a target multiprocessor system). Linear clustering and linear cluster merging are proposed as effectual heuristics. After linear clustering and merging, the computation graph is transformed into a virtual architecture graph. This graph represents an optimal architecture that compromises between two conflicting goals, minimization of interprocessor communication and maximization of potential parallelism, and satisfies the other goals, throughput enhancement and workload balance, relatively well. Then two efficient scheduling algorithms are developed that map the optimal architecture graph onto a physical architecture graph, which may represent either a homogeneous or a heterogeneous multiprocessor system.

• Research Organization: Texas Univ., Austin, TX (USA)
• OSTI ID: 5501704
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
ALGORITHMS
ARRAY PROCESSORS
COMPUTER ARCHITECTURE
COMPUTER GRAPHICS
DATA PROCESSING
MATHEMATICAL LOGIC
OPTIMIZATION
PARALLEL PROCESSING
PROCESSING
PROGRAMMING
TASK SCHEDULING