Grain Size Determination for Parallel Processing

IEEE Software

Volumn 5, Issue 1, 1988, Pages 23-32

  Kruatrachue, Boontee ^a   Lewis, Ted ^a  

^a OREGON STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES;

EXTENDED SERIAL AND CONCURRENT PROGRAMMING LANGUAGES; GRAIN PACKING; TOTAL EXECUTION TIME REDUCTION;

COMPUTER SYSTEMS, DIGITAL;

EID: 0023866688     PISSN: 07407459     EISSN: None     Source Type: Journal    
DOI: 10.1109/52.1991     Document Type: Article

References (9)

1. R.G. Babb, “Parallel Processing with Large-Grain Data Flow Techniques,” Computer, July 1984, pp. 55-61.
2. R.L. Graham, “Bounds on Multiprocessing Anomalies and Related Packing Algorithms,” AFIPS Conf. Proc., Vol. 40, AFIPS Press, Montvale, N.J., 1972, pp. 205-217.
3. T.C. Hu, “Parallel Sequencing and Assembly Line Problems,” Operations Research, June 1961, pp. 841-848.
4. C.V. Ramamoorthy, K.M. Chandy, and M.J. Gonzalez, “Optimal Scheduling Strategies in a Multiprocessor System,” IEEE Trans. Computers, Feb. 1972, pp 137-146.
5. T.L. Adam, K.M. Chandy, and J.R. Dickson, “A Comparison of List Schedules for Parallel Processing Systems,” Comm. ACM, Dec. 1974, pp. 685-690.
6. B. Kruatrachue, Static Task Scheduling and Grain Packing in Parallel Processing Systems, PhD dissertation, Electrical and Computer Eng. Dept., Oregon State Univ., Corvallis, 1987.
7. W. Clark, The Gantt Chart, 3rd ed., Pittman and Sons, London, 1952.
8. D. Pountain, A Tutorial Introduction to Occam Programming, Inmos, Colorado Springs, Colo., 1986.
9. C.V. Ramamoorthy and M.J. Gonzalez, “A Survey of the Techniques for Recognizing Parallel Processable Streams in Computer Programs,” Proc. Fall Joint Comp. Conf., CS Press, Los Alamitos, Calif., 1969.