Performance prediction based loop scheduling for heterogeneous computing environment
Pages 413 - 421
References
[1]
T. E. Anderson, D. E. Culler, D. A. Patterson, and the NOW team, "A Case for NOW (Networks of Workstations)", IEEE Micro, 1995.
[2]
Y. Belhamissi and M. Jegado, "Scheduling in Distributed System: Survey and Questions", Technical Report 1,~78, iRISA/INR/A, Rennes cedex, France, June 1991.
[3]
T. L. Casavant and J. G. Kuhl, "A Taxonomy of Scheduling in General-Purpose Distributed Computing systems", {EEE 7kans. on Software Engineering, Vol. 14, no. 2, pp. 141-154, Feb. 1988.
[4]
M. Cierniak, W. Li and M. J. Zaki, "Loop Scheduling for Heterogeneity", Technical Report 5,i0, Department of Computer Science, University of Rochester, 1995.
[5]
AI Geist, et al., "PVM: Parallel Virtual Machine A Users' Guide and Tutorial for Networked Parallel Computing", The MIT Press, Cambridge, Massachusetts, London, England, 1994.
[6]
A.S. Grimshaw, J. B. Weissman, E. A. West and E. C. Loyot, "Metasystems: An Approach Combining Parallel Processing and Heterogeneous Distributed Computing Systems", Journal of Parallel and Distributed Computing, 21(3):257-270, 1994.
[7]
R. Hofmann, R. Klar, B. Mohr, A. Quick, and M. Siegle, "Distributed Performance Monitoring: Methods, Tools, and Applications", IEEE 7kans. on Parallel and Distributed Systems, Vol. 5, pp. 585-597, No. 6, June 1994.
[8]
L. B. Hostetler and B. Mirtich, "DLXsim A Simulator for DLX", tip: max.stanford, edu, /pub/hennessy-patterson.software.
[9]
S. Hummel, E. Schonberg and L. Flynn, "Factoring: A Practical and Robust Method for Scheduling Parallel Loops", Proc. of the $upercomputing Conf., pp. 610-619, 1991.
[10]
E. Kremer and J. T. Stasko, "The Visualization of Parallel Systems: An Overview", Journal of Parallel and Distributed Computing, 18, 1993, pp. 105- 117.
[11]
C. Kruskal and A. Weiss, "Allocating Independent Subtasks on Parallel Processors", IEEE 7kans. on Software Engineering, 11:1001-16, October 1985.
[12]
A. R. Lebeck and D. A. Wood, "Active Memory: A New Abstraction for Memory-System Simulation", Proc. of ~he 1995 A CM Sigmetrics Conference, May 1995.
[13]
W. Lin and K. Pingali, "Access Normalization: Loop Restructuring for NUMA Compilers", A CM Trans. on Computer Systems, Nov. 1993.
[14]
I. O. Mahgoub and A. K. Elmagarmid, "Performance Analysis of a Generalized Class of mlevel Hierarchical Multiprocessor Systems", IEEE Trans. on Parallel and Distributed System, Vol. 3, No. 2, March 1992, pp. 129-138.
[15]
C. Maccann, R. Vaswani and J. Zahorjan, "A Dynamic Processor Allocation Policy for Multiprogramming Shared Memory Multiprocessor", ACM Trans. on Computer Systems, Vol. 11, No. 2, pp. 146-178, May 1993.
[16]
D. A. Menasce and L. A. Barroso, "A Methodology for Performance Evaluation of Parallel Applications on Multiprocessors", Journal of Parallel and Distributed Computing, January 1992, pp. 1-14.
[17]
C. L. Mendes, J. C. Wang and D. A. Reed, "Automatic Performance Prediction and Scalability Analysis for Data Parallel Programs", Department of Computer Science, University of Illinois, Technical Report, 1995.
[18]
R. Nelson, D. Towsley and A. N. Tantawi, "Performance Analysis of Parallel Processing Systems", IEEE Trans. on Software Engineering, Vol. 14, No. 4, April 1988, pp. 532-540.
[19]
G. F. Pfister and V. A. Norton," 'Hot Spot' Contention and Combining in Multistage Interconnection Networks", IEEE Trans. on Computers, Vol. C-34, No.10, 1985, pp. 943-948.
[20]
C. Polychronopoulos and D. Kuck, "Guilded Self- Scheduling: A Practical Scheduling Scheme for Parallel Supercomputers", IEEE Trans. on Computers, 36:1425-39, December 1987.
[21]
C. Polychronopoulos, Parallel Programming and Compilers, Kluwer Academic Publishers, 1988.
[22]
P. Tang and P. C. Yew, "Processor Self-scheduling for Multiple Nested Parallel Loops", Proc. of '86 International Conference on Parallel Processing, August 1986.
[23]
A. q~ucker and A. Gupta, "Process Control and Scheduling Issues in Multiprogrammed Shared Memory Multiprocessors", Proc. of the 12th Symposium on Operating System Principles, pp.159- 166, Dec. 1989.
[24]
T. yon Eicken, D. E. Culler, S. C. Goldstein, and K. E. Schaaser, "Active Messages: a Mechanism for Integrated Communication and Computation", Proc. of 19th International Symposium on Computer Architecture, pp. 256-266, Gold Coast, Australia, May 1992.
[25]
X. Zhang, "Performance Measurement and Modeling to Evaluate Various Effects on a Shared Memory Multiprocessor", IEEE Trans. on Software Engineering, Vol. 17, No. 1, 1991, pp. 87-93.
[26]
X. Zhang and X. Qin, "Performance Prediction and Evaluation of Parallel Processing on a NUMA Multiprocessor", IEEE Trans. on Software Engineering, Vol. 17, No. 10, 1991, pp. 1050-1068.
[27]
X. Zhang, Y. Song and Y. Yah, "An Integrated Performance Analysis Environment for Distributed Computing on Heterogeneous Networks of Workstations", Technical Report, High Performance Computing and Software Laboratory, University of Texas at San Antonio, 1995.
[28]
X. Zhang and Z. Xu, "NOWSIM: A Simulator for Network-based Heterogeneous Environment", Technical Report, High Performance Computing and Software Laboratory, University of Texas at San Antonio, 1995.
[29]
X. Zhang, Y. Yah and R. Castaneda, :'Comparative Performance Analysis and Evaluation of Hot Spots on MIN-based and HR-based Shared-memory Architectures'', Proc. of the Fifth IEEE Symposium on Parallel and Distributed Processing, IEEE Computer Society Press, 1993.
Index Terms
- Performance prediction based loop scheduling for heterogeneous computing environment
Recommendations
Performance evaluation of scheduling schemes for NOW with heterogeneous computing power
Special issue: Modeling and simulation in supercomputing and telecommunicationsIn this paper we consider a NOW (Network of Workstations) in which workstations may have different computing power. We introduce 10 space-sharing scheduling policies and four hybrid scheduling policies applicable to the NOW with heterogeneous computing ...
Using Processor Affinity in Loop Scheduling on Shared-Memory Multiprocessors
Loops are the single largest source of parallelism in many applications. One way to exploit this parallelism is to execute loop iterations in parallel on different processors. Previous approaches to loop scheduling attempted to achieve the minimum ...
Parallel loop generation and scheduling
Loop tiling is an efficient loop transformation, mainly applied to detect coarse-grained parallelism in loops. It is a difficult task to apply n-dimensional non-rectangular tiles to generate parallel loops. This paper offers an efficient scheme to apply ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
April 1997
545 pages
ISBN:0897918509
DOI:10.1145/331697
Copyright © 1997 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 April 1997
Check for updates
Author Tags
Qualifiers
- Article
Conference
Acceptance Rates
Overall Acceptance Rate 1,650 of 6,669 submissions, 25%
Upcoming Conference
SAC '25
- Sponsor:
- sigapp
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 328Total Downloads
- Downloads (Last 12 months)7
- Downloads (Last 6 weeks)0
Reflects downloads up to 14 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in