Title :
Binary Trees and Parallel Scheduling Algorithms
Author :
Dekel, Eliezer ; Sahni, Sartaj
Author_Institution :
Program in Computer Science, University of Texas
fDate :
3/1/1983 12:00:00 AM
Abstract :
This paper examines the use of binary trees in the design of efficient parallel algorithms. Using binary trees, we develop efficient algorithms for several scheduling problems. The shared memory model for parallel computation is used. Our success in using binary trees for parallel computations, indicates that the binary tree is an important and useful design tool for parallel algorithms.
Keywords :
Complexity; design methodologies; parallel algorithms; scheduling; shared memory model; Algorithm design and analysis; Binary trees; Computational modeling; Computer architecture; Concurrent computing; Design methodology; Parallel algorithms; Processor scheduling; Read-write memory; Scheduling algorithm; Complexity; design methodologies; parallel algorithms; scheduling; shared memory model;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1983.1676223
