A comparison of list schedules for parallel processing systems

Communications of the ACM

Volumn 17, Issue 12, 1974, Pages 685-690

  Adam, Thomas L ^a   Chandy, K M ^a   Dickson, J R ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

dynamic programming; list scheduling; optimization; parallel processing; precedence graphs; scheduling

Indexed keywords

COMPUTER SYSTEMS, DIGITAL;

EID: 0016313256     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/361604.361619     Document Type: Article

References (20)

1. The HASP System. Doc. for IBM Type 3 Program, HASP-II, Version 3.0, No. 360-D-05.1.014, IBM Corp., Feb. 26, 1971.
2. Strauss, J.C. A simple thruput and response model of EXEC 8 under swapping saturation. Proc. AFIPS 1971 FJCC, Vol. 39. AFIPS Press, Montvale, N.J., pp. 39-49.
3. Buzen, J. Analysis of system bottlenecks using a queueing network model. ACM SIGOPS Workshop on System Performance Evaluation, ACM, New York, 1971.
4. Shemer, J.E., and Heying, D.E. Performance modeling and empirical measurements in a system designed for batch and time sharing users. Proc. AFIPS 1969 FJCC, Vol. 35. AFIPS Press, Montvale, N.J., pp. 17-26.
5. Kimbleton, S.R. and Moore, C.G. A probabilistic framework for system performance evaluation. Proc. ACM SIGOPS Workshop on System Performance Evaluation, ACM, New York, 1971.
6. Wulf, W.A. Performance monitors for multiprogramming systems. Proc. Second Symposium on Operating Systems Principles, ACM, New York, Oct. 1969.
7. Sherman, S., Baskett F., III, and Browne, J.C. Trace driven modeling and analysis of cpu scheduling in a multiprogramming system. Comm. ACM 15, 12 (Dec. 1972), 1063-1069.
8. Wong, K. and Strauss, J.C. Use of a software monitor in the validation of an analytic computer system model. Submitted to Software, Practice and Experience, fall 1974.
9. Chiang, A.T., and Strauss, J.C. Priority control for maximum thruput with equal job class turnaround. Proc. of the Computer Science and Statistics Symposium, Iowa State U., Oct. 1973.
10. Coffman, E. G., and Denning, P. J. Operating Systems Theory. Prentice-Hall, Englewood Cliffs, N.J. (to be published).
11. Ramamoorthy, C.V., Chandy, K.M., and Gonzalez, M.J. Jr. Optimal scheduling strategies in a multi-processor system. IEEE Trans. Comp. C-21, 2 (Feb. 1972), 137-146.
12. 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.
13. Fernandez, E.B., and Bussell, B. Bounds on the number of processors and time for multiprocessor optimal schedules. IEEETrans. Comp., C-22, 8 (Aug. 1973), 745-751.
14. Chandy, K.M., and Dickson, J.R. Scheduling unidentical processors in a stochastic environment. Proc. COMPCON 72, 1972, pp. 171-174.
15. Coffman, E.G., and Graham, R.L. Optimal scheduling for two-processor systems. Acta Informatica, I, 3 (1972), 200-213.
16. Graham, R.L. Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. (Nov. 1966), 1563-1581.
17. Martin, D.F., and Estrin, G. Experiments on models of computations and systems. IEEE Trans. EC, EC-16, 1 (Feb. 1967), 59-69.
18. Gonzalez, M.J. Jr. A decentralized parallel processor system. Ph.D. Diss. U. of Texas at Austin, 1971.
19. 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.
20. Manacher, G.K. Production and stabilization of real-time task schedulers. J. ACM 14, 3 (July 1967), 439-465.