Abstract
This paper addresses the parallelization of loops with irregular assignment computations on cc-NUMA multiprocessors. This loop pattern is distinguished by the existence of loop-carried output data dependences that can only be detected at run-time. A parallelization technique based on the inspector-executor model is proposed in this paper. In the inspector, loop iterations are reordered so that they can be executed in a conflict-free manner during the executor stage. The design of the inspector ensures load-balancing and uniprocessor data write locality exploitation. Experimental results show the scalability of this technique, which is presented as a clear alternative to other existing methods.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arenaz, M., Touriño, J., Doallo, R.: A Compiler Framework to Detect Parallelism in Irregular Codes. In Proceedings of 14th International Workshop on Languages and Compilers for Parallel Computing, LCPC’2001, Cumberland Falls, KY (2001)
Glassner, A.: Graphics Gems. Academic Press (1993)
Gutiérrez, E., Plata, O., Zapata, E.L.: Balanced, Locality-Based Parallel Irregular Reductions. In Proceedings of 14th International Workshop on Languages and Compilers for Parallel Computing, LCPC’ 2001, Cumberland Falls, KY (2001)
Han, H., Tseng, C.-W.: Efficient Compiler and Run-Time Support for Parallel Irregular Reductions. Parallel Computing 26(13–14) (2000) 1861–1887
Knobe, K., Sarkar, V.: Array SSA Form and Its Use in Parallelization. In Proceedings of the 25th ACM SIGACT-SIGPLAN Symposium on the Principles of Programming Languages (1998) 107–120
Lin, Y., Padua, D.A.: On the Automatic Parallelization of Sparse and Irregular Fortran Programs. In: O’Hallaron, D. (ed.): Languages, Compilers, and Run-Time Systems for Scalable Computers. Lecture Notes in Computer Science, Vol. 1511, Springer-Verlag (1998) 41–56
OpenMP Architecture Review Board: OpenMP: A proposed industry standard API for shared memory programming(1997)
Ponnusamy, R., Saltz, J., Choudhary, A., Hwang, Y.-S., Fox, G.: Runtime Support and Compilation Methods for User-Specified Irregular Data Distributions. IEEE Transactions on Parallel and Distributed Systems 6(8) (1995) 815–831
Rauchwerger, L., Padua, D.A.: The LRPD Test: Speculative Run-Time Parallelization of Loops with Privatization and Reduction Parallelization. IEEE Transactions on Parallel and Distributed Systems 10(2) (1999) 160–180
Saad, Y.: SPARSKIT: A Basic Tool Kit for Sparse Matrix Computations. http://www.cs.umn.edu/Research/darpa/SPARSKIT/sparskit.html (1994)
Turek, S., Becker, Chr.: Featflow: Finite Element Software for the Incompressible Navier-Stokes Equations. User Manual. http://www.featflow.de (1998)
Wolfe, M.J.: Optimizing Supercompilers for Supercomputers. Pitman, London and The MIT Press, Cambridge, Massachussets (1989) In the series, Research Monographs in Parallel and Distributed Computing.
Yu, H., Rauchwerger, L.: Adaptive Reduction Parallelization Techniques. In Proceedings of the 14th ACM International Conference on Supercomputing, Santa Fe, NM (2000) 66–77
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arenaz, M., Touriño, J., Doallo, R. (2002). Irregular Assignment Computations on cc-NUMA Multiprocessors. In: Zima, H.P., Joe, K., Sato, M., Seo, Y., Shimasaki, M. (eds) High Performance Computing. ISHPC 2002. Lecture Notes in Computer Science, vol 2327. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47847-7_33
Download citation
DOI: https://doi.org/10.1007/3-540-47847-7_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43674-4
Online ISBN: 978-3-540-47847-8
eBook Packages: Springer Book Archive