Is the schedule clause really necessary in OpenMP?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2716, Issue , 2003, Pages 147-159

  Ayguadé, Eduard ^a   Blainey, Bob ^b   Duran, Alejandro ^a   Labarta, Jesús ^a   Martínez, Francisco ^a   Martorell, Xavier ^a   Silvera, Raúl ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b IBM TORONTO LAB   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK MANAGEMENT; SCHEDULING;

DATA LOCALITY; EXPERT PROGRAMMERS; LOOP ITERATION; NUMERICAL APPLICATIONS; PARALLEL LOOPS; SCHEDULING POLICIES; SCHEDULING STRATEGIES; TARGET ARCHITECTURES;

APPLICATION PROGRAMMING INTERFACES (API);

EID: 35248845008     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45009-2_12     Document Type: Article

References (12)

1. T.H. Tzen and L.M. Ni. Trapezoid self-scheduling scheme for parallel computers. IEEE Trans. on Parallel and Distributed Systems, 4(1):87-98, 1993.
2. E. Schonberg, S.F. Hummel, and L.E. Flynn. Factoring: A practical and robust method for scheduling parallel loops. Communications of the ACM, 35(8):90-101, 1992.
3. S. Lucco. A dynamic scheduling method for irregular parallel programs. In Proceedings of ACM SIGPLAN'92 Conference on Programming Language Desing and Implementation, pages 220-211, 1992.
4. Kelvin K. Yule and David J. Lilja. Categorizing parallel loops based on iteration execution time variances. Technical Report HPPC-94-13, University of Minnesota, 1994.
5. E. P. Markatos and T. J. LeBlanc. Using processor affinity in loop scheduling on shared-memory multiprocessors. Technical Report TR410, 1992.
6. S. Subramaniam and D.L. Eager. Affinity scheduling of unbalanced workloads. In SuperComputer'94 Conference Proceedings, 1994.
7. J. Mark Bull. Feedback guided dynamic loop scheduling: Algorithms and experiments. In European Conference on Parallel Processing, pages 377-382, 1998.
8. Francis H. Dang and Lawrence Rauchwerger. Speculative parallelization of partially parallel loops. In Languages, Compilers, and Run-Time Systems for Scalable Computers, pages 285-299, 2000.
9. Babak Hamidzadeh and David J. Lilja. Self-adjusting scheduling: An on-line optimization technique for locality management and load balancing. In International Conference on Parallel Processing, pages 39-46, 1994.
10. Vishal Aslot, Max Domeika, Rudolf Eigenmann, Greg Gaertner, Wesley B. Jones, and Bodo Parady. SPEComp: A new benchmark suite for measuring parallel computer performance. Lecture Notes in Computer Science, 2104, 2001.
11. D. H. Bailey, E. Barszcz, J. T. Barton, D. S. Browning, R. L. Carter, D. Dagum, R. A. Fatoohi, P. O. Frederickson, T. A. Lasinski, R. S. Schreiber, H. D. Simon, V. Venkatakrishnan, and S. K. Weeratunga. The NAS Parallel Benchmarks. The International Journal of Supercomputer Applications, 5(3):63-73, Fall 1991.
12. Steve Behling et al. The POWER4 processor introduction and tuning guide. Technical Report SG24-7041-00, International Technical Support Organization, November 2001. ISBN 0738423556.