Scheduling directed task graphs on multiprocessors using simulated annealing

Proceedings - International Conference on Distributed Computing Systems

Volumn 1992-June, Issue , 1992, Pages 20-27

  Nanda, Ashwini K ^a   Degroot, Doug ^b   Stenger, Daniel L ^c  

^a TEXAS A AND M UNIVERSITY   (United States)

^b TEXAS INSTRUMENTS   (United States)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

COST FUNCTIONS; DIRECTED GRAPHS; MULTIPROCESSING SYSTEMS; SIMULATED ANNEALING;

COMMUNICATION OVERHEADS; INDIRECT COSTS; MULTI PROCESSOR SYSTEMS; RUNTIMES; SCHEDULE LENGTH; TASK GRAPH; TOTAL LOSS;

SCHEDULING ALGORITHMS;

EID: 77952716591     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.1992.235059     Document Type: Conference Paper

References (16)

1. T.L. Adam, K.M. Chandy and J.R. Dickinson, " A comparison of List Schedules for Parallel Processing Systems, " Communications of the ACM, pp. 685-690, Dec. 1974.
2. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley Publishing Company, 1974.
3. J. Blazewicz et.al., "Scheduling Multiprocessor Tasks to Minimize Schedule Length, " IEEE Trans, on Computers, pp. 389-393, May 1986.
4. S.W. Bollinger and S.F. Midkiff, "Processor and Link Assignment in Multicomputers using Simulated Annealing, " International Conference on Parallel Processing, pp. 1-7, Aug. 1988.
5. V. Chaudhury and J.K. Aggarwal, "Generalized Mapping of Parallel Algorithms onto Parallel Architectures, " International Conference on Parallel Processing, Aug. 1990.
6. E.G. Coffman and P.J. Denning, Operating System Theory, Prentice-Hall, N.J., 1973.
7. D. DeGroot, "The TI Tapestry Parallel Processing Architecture : Draft 1.0", internal Tech. Report, Texas Instruments, Nov. 1991.
8. K. Efe, "Heuristic Models of Task Assignment Scheduling in Distributed Systems, " IEEE Computer, pp. 50-56, June 1982.
9. C.E. Houstis, "Allocation of Real Time Applications to Distributed Systems, " International Conference on Parallel Processing, Aug. 1987.
10. K .Hwang and J. Xu, "Mapping Partitioned Program Modules onto Multicomputer Nodes Using Simulated Annealing, " International Conference on Parallel Processing, Aug. 1990.
11. S.J. Kim and J.C. Browne, "A General Approach to Mapping of Parallel Computations upon Multiprocessor Architectures, " International Conference on Parallel Processing, Aug. 1988.
12. S. Kirkpatrick et.al., "Optimization by Simulated Annealing, " Science, pp. 670-680, May 1983.
13. W.H. Press et.al., Numerical Recipes in C, Cambridge University Press, Cambridge, pp.343-352, 1989.
14. P.Y. Richard Ma et.al., "A Task Allocation Model for Distributed Computing systems, " IEEE Trans, on Computers, pp. 249-255, Jan. 1982.
15. C. Sih et.al., "Scheduling to Account for Interpro-cessor Communication within Interconnection-Constrained Processor Networks, " International Conference on Parallel Processing, Aug. 1990.
16. E. Zimran et.al., "Performance Efficient Mapping of Applications to Parallel and Distributed Architectures, " International Conference on Parallel Processing, Aug. 1990.