Two processor scheduling
Journal Article
·
· SIAM J. Comput.; (United States)
The authors present a parallel algorithm for the two processor scheduling problem. This algorithm constructs an optimal schedule for unit execution time task systems with arbitrary precedence constraints using a polynomial number of processors and running in time polylog in the size of the input. Whereas previous parallel solutions for the problem made extensive use of randomization, the algorithm is completely deterministic and based on an interesting iteration technique. It is of independent relevance for two more reasons. It provides another example for the apparent difference in complexity between decision and search problems in the context of fast parallel computation, and it gives an algorithm for the matching problem in certain restricted cases.
- Research Organization:
- Dept. of Computer Science, Stanford Univ., Stanford, CA 94305-2085
- OSTI ID:
- 5838878
- Journal Information:
- SIAM J. Comput.; (United States), Journal Name: SIAM J. Comput.; (United States) Vol. 16:4; ISSN SMJCA
- Country of Publication:
- United States
- Language:
- English
Similar Records
Tighter bounds for LPT scheduling on uniform processors
Parallel task scheduling for minimizing processor idle time
Scheduling multiprocessor tasks to minimize schedule length
Journal Article
·
Mon Jun 01 00:00:00 EDT 1987
· SIAM J. Comput.; (United States)
·
OSTI ID:6315088
Parallel task scheduling for minimizing processor idle time
Conference
·
Thu Nov 30 23:00:00 EST 1995
·
OSTI ID:125623
Scheduling multiprocessor tasks to minimize schedule length
Journal Article
·
Thu May 01 00:00:00 EDT 1986
· IEEE Trans. Comput.; (United States)
·
OSTI ID:5791128