Generational scheduling for dynamic task management in heterogeneous computing systems

Information Sciences

Volumn 106, Issue 3-4, 1998, Pages 219-236

  Carter, Brent R ^a   Watson, Daniel W ^b   Freund, Richard F ^c   Keith, Elaine ^d   Mirabile, Francesca ^c   Siegel, Howard Jay ^e  

^a IBM   (United States)

^b Utah State University ^*  (United States)

^c Naval Command   (United States)

^d SCIENCE APPLICATIONS INTERNATIONAL CORPORATION   (United States)

^e PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SYSTEMS PROGRAMMING; DATA TRANSFER; RESPONSE TIME (COMPUTER SYSTEMS); USER INTERFACES;

DYNAMIC TASK MANAGEMENT; HETEROGENEOUS COMPUTING;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0032066676     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(97)10012-3     Document Type: Article

References (16)

1. A. Khokhar, V.K. Prasanna, M. Shaaban, C.L. Wang, Heterogeneous computing: challenges and opportunities, IEEE Computer 26 (6) (1993) 18-27.
2. R.F. Freund, H.J. Siegel, Heterogeneous processing, IEEE Computer 26 (6) (1993) 13-17.
3. H.G. Dietz, W.E. Cohen, B.K. Grant, Would you run it here... or there? AHS: Automatic Heterogeneous Supercomputing, 1993 International Conference on Parallel Processing, 2 (1993) 217-221.
4. M.M. Eshaghian, R.F. Freund, Cluster-M paradigms for high-order heterogeneous procedural specification computing, Workshop on Heterogeneous Processing, 1992, pp. 47-49.
5. R.F. Freund, Optimal selection theory for superconcurrency, Supercomputing 89 (1989) 47-50.
6. B. Narahari, A. Youssef, H.-A. Choi, Matching and scheduling in a generalized optimal selection theory, Heterogeneous Computing Workshop, 1994, pp. 1-8.
7. M. Tan, J.K. Antonio, H.J. Siegel, Y.A. Li, Scheduling and data relocation for sequentially executed subtasks in a heterogeneous computing system, Heterogeneous Computing Workshop, 1995, pp. 109-120.
8. D.W. Watson, J.K. Antonio, H.J. Siegel, M.J. Atallah, Static program decomposition among machines in an SIMD/SPMD heterogeneous environment with non-Constant mode switching costs, Heterogeneous Computing Workshop, 1994, pp. 58-65.
9. D. Fernandez-Baca, Allocating modules to processors in a distributed system, IEEE Transactions on Software Engineering SE-15 (11) (1989) 1427-1436.
10. T.L. Adam, K.M. Chandy, J.R. Dickson, A Comparison of list schedules for parallel processing systems, Communications of the ACM 17 (12) (1974) 685-690.
11. H. El-Rewini, T.G. Lewis, Scheduling parallel program tasks onto arbitrary target machines, Journal of Parallel and Distributed Computing 9 (1990) 138-153.
12. P. Shroff, D.W. Watson, N.F. Flann, R.F. Freund, Genetic simulated annealing for scheduling data-dependent tasks in heterogeneous environments, Heterogeneous Computing Workshop 1996, pp. 98-104.
13. T.L. Adam, K.M. Chandy, J.R. Dickson, A comparison of list schedules for parallel processing systems, Communications of the ACM 17 (12) (1974) 685-690.
14. G.C. Sih, E.A. Lee, A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures, IEEE Transactions on Parallel and Distributed Systems 4 (2) (1993) 175-187.
15. T. Kidd, D. Hensgen, R. Freund, L. Moore, SmartNet: A scheduling framework for heterogeneous computing, International Symposium on Parallel Architectures, Algorithms, and Networks, Beijing, China, 1996.
16. Garcy and Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman Publishing, 1979.