ACM Home Page
Please provide us with feedback. Feedback
A comparison of list schedules for parallel processing systems
Full text PdfPdf (624 KB)
Source
Communications of the ACM archive
Volume 17 ,  Issue 12  (December 1974) table of contents
Pages: 685 - 690  
Year of Publication: 1974
ISSN:0001-0782
Authors
Thomas L. Adam  Univ. of Texas at Austin, Austin
K. M. Chandy  Univ. of Texas at Austin, Austin
J. R. Dickson  Univ. of Texas at Austin, Austin
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 30,   Downloads (12 Months): 163,   Citation Count: 75
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/361604.361619
What is a DOI?

ABSTRACT

The problem of scheduling two or more processors to minimize the execution time of a program which consists of a set of partially ordered tasks is studied. Cases where task execution times are deterministic and others in which execution times are random variables are analyzed. It is shown that different algorithms suggested in the literature vary significantly in execution time and that the B-schedule of Coffman and Graham is near-optimal. A dynamic programming solution for the case in which execution times are random variables is presented.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Ramamoorthy, C.V., Chandy, K.M., and Gonzalez, M.J. Jr. Optimal scheduling strategies in a multi-processor system. IEEETrans. Comp. C-21, 2 (Feb. 1972), 137-146.
 
3
Ramamoorthy, C.V., and Gonzalez, M.J. Jr. A survey of techniques for recognizing parallel processable streams in computer programs. Proc. AFIPS 1969 FJCC, Vol. 35, AFIPS Press, Montvale, N.J., pp. 1-17.
 
4
Fernandez, E.B., and Bussell, B. Bounds on the number of processors and time for multiprocessor optimal schedules. IEEE Trans. Comp., C-22, 8 (Aug. 1973), 745-751.
 
5
Chandy, K.M., and Dickson, J.R. Scheduling unidentical processors in a stochastic environment. Proc. COMPCON '72, 1972, pp. 171-174.
 
6
Coffman, E.G., and Graham, R.L. Optimal scheduling for two-processor systems. Acta Informatica, 1, 3 (1972), 200--213.
 
7
Graham, R.L. Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. (Nov. 1966), 1563-1581.
 
8
Martin, D.F., and Estrin, G. Experiments on models of computations and systems. IEEE Trans. EC, EC-16, 1 (Feb. 1967), 59-69.
 
9
Gonzalez, M.J. Jr. A decentralized parallel processor system. Ph.D. Diss. U. of Texas at Austin, 1971.
 
10
Krone, M. Heuristic programming applied to scheduling models. Proc. Fifth Ann. Conf. on Inform. Sci. and Syst. Elec. Eng. Dep., Princeton U., (1971), pp. 841-848.
11

CITED BY  75

Collaborative Colleagues:
Thomas L. Adam: colleagues
K. M. Chandy: colleagues
J. R. Dickson: colleagues