The relative performance of various mapping algorithms is independent of sizable variances in run-time predictions

Proceedings - 7th Heterogeneous Computing Workshop, HCW 1998

Volumn 1998-March, Issue , 1998, Pages 79-87

  Armstrong, Robert ^a   Hensgen, Debra ^a   Kidd, Taylor ^a  

^a Naval Postgraduate School   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SCIENCE;

EXPECTED TIME; GREEDY ALGORITHMS; MAPPING ALGORITHMS; PERFORMANCE COMPARISON; RELATIVE PERFORMANCE; RUNTIME DISTRIBUTIONS; RUNTIMES; SERVER-BASED;

CONFORMAL MAPPING;

EID: 84990920631     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HCW.1998.666547     Document Type: Conference Paper

References (16)

1. Alder, H. L., and Roessler, E. B. Introduction to Probability and Statistics, third ed. Freeman, London, England, 1964.
2. Armstrong, R. K. Investigation of Effect of Different Run-time Distributions on SmartNet Performance. Master's thesis, U.S. Naval Postgraduate School, September 1997.
3. Bailey, D., et al. The NAS Parallel Benchmarks 2.0. Tech. Rep. NAS-95-020, NASA Ames Research Center, December 1995.
4. Beguelin, A., et al. HeNCE: A User' Guide. Oak Ridge National Laboratory and University of Tennessee, December 1992. The document itself is available on the web at cs.utk.edu.
5. Cormen, T. H., Leiserson, C. E., and Rivest, R. L. Introduction to Algorithms. The MIT Press, Cambridge, Massachusetts, 1990.
6. Freund, R., Kidd, T., Hensgen, D., and Moore, L. Smartnet: A Scheduling Framework for Heterogeneous Computing. Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (1996).
7. Hensgen, D., Kidd, T., and Armstrong, R. Comparison of greedy algorithms for scheduling jobs in a heterogeneous environments. In progress.
8. Ibarra, and Kim. Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors. Journal of the ACM (1977).
9. Kidd, T., and Hensgen, D. Why the mean is inadequate for accurate scheduling decisions. In progress.
10. Kidd, T., Hensgen, D., Freund, R., Kussow, M., and Campbell, M. Compute Characteristics: A Useful Characterization of Job Runtimes. In preparation for submission (1998).
11. Neuman, B. C., and Rao, S. The Prospero Resource Manager: A Scalable Framework for Processor Allocation in Distributed Systems. Concurrency: Practice and Experience (1994).
12. Pacheco, P. A User's Guide to MPI. Tech. rep., Department of Mathematics, University of San Francisco, March 1995.
13. Singh, H., and Youssef, A. Mapping and Scheduling Heterogeneous Task Graphs using Genetic Algorithms. Proceedings of the Heterogeneous Computing Workshop (1996).
14. Wang, L., Siegel, H. J., and Roychowdhury, V. P. A Genetic-Algorithm-Based Approach for Task Matching and Scheduling in Heterogeneous Computing Environments. Proceedings of the Heterogeneous Computing Workshop (1996).
15. Weissman, J. B. The Interference Paradigm for Network Job Scheduling. Proceedings of the Heterogeneous Computing Workshop (1996).
16. Zhou, Zheng, Wang, and Delisle. Utopia: A load sharing facility for lage heterogeneous distributed computer systems. Software: Practice and Experience (1993).