Advanced compiler optimizations for sparse computations

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Advanced compiler optimizations for sparse computations

Full text

Pdf (1.01 MB)

Source

Conference on High Performance Networking and Computing archive
Proceedings of the 1993 ACM/IEEE conference on Supercomputing table of contents

Portland, Oregon, United States

Pages: 430 - 439

Year of Publication: 1993

ISBN:0-8186-4340-4

Authors

A. J. C. Bik	High Performance Computing Division, Department of Computer Science, Leiden University, P.O. Box 9512, 2300 RA Leiden, the Netherlands
H. A. G. Wijshoff	High Performance Computing Division, Department of Computer Science, Leiden University, P.O. Box 9512, 2300 RA Leiden, the Netherlands

Sponsor

SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 14, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/169627.169765 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Utpal K. Banerjee, Dependence Analysis for Supercomputing, Kluwer Academic Publishers, Norwell, MA, 1988
	2	Utpal K. Banerjee, Loop Transformations for Restructuring Compilers: The Foundations, Kluwer Academic Publishers, Norwell, MA, 1993
	3	Aart J.C. Bik. A prototype restructuring compiler. Master's thesis, Utrecht University, 1992. INF/SCR-92-11.
	4	Aart J.C. Bik and Harry A.G. Wijshoff. Advanced compiler optimizations for sparse computations. Technical Report no. 92-24, Dept. of Computer Science, Leiden University, 1992.
	5	Aart J. C. Bik , Harry A. G. Wijshoff, Compilation techniques for sparse matrix computations, Proceedings of the 7th international conference on Supercomputing, p.416-424, July 19-23, 1993, Tokyo, Japan [doi>10.1145/165939.166023]
	6	Aart J. C. Bik , Harry A. G. Wijshoff, On Automatic Data Structure Selection and Code Generation for Sparse Computations, Proceedings of the 6th International Workshop on Languages and Compilers for Parallel Computing, p.57-75, August 12-14, 1993
	7	Ron G. Cytron. Doacross, beyond vectorization for multiprocessors. In Proceedings of the 1986 International Con- }erence on Parallel Processing, pages 836-844, 1986.
	8	Ron G. Cytron. Limited processor scheduling of doacross loops. In Proceedings of the 1987 International Conference on Parallel Processing, pages 226-234, 1987.
	9	E.W. Dijkstra. Cooperating sequential processes. In F. Genuys, editor, Programming Languages. Academic Press, New York, 1968.
	10	Iain S Duff , Albert M Erisman , John K Reid, Direct methods for sparse matrices, Oxford University Press, Inc., New York, NY, 1986
	11	Alan George , Joseph W. Liu, Computer Solution of Large Sparse Positive Definite, Prentice Hall Professional Technical Reference, 1981
	12	David L. Kuck, Structure of Computers and Computations, John Wiley & Sons, Inc., New York, NY, 1978
	13	Zhiyuan Li and Walid Abu-Sufah. On reducing data synchronization in multiprocessed loops. IEEE Transactions on Computers, pages 105-109, 1987.
	14	Samuel P. Midldff. The Dependence Analysis and Synchronization o:f Parallel Programs. PhD thesis, C.S.R.D., 1993.
	15	Samuel P. Midldff and David A. Padua. Compiler generated synchronization for do loops. In Proceedings of the 1986 International Conference on Parallel Processing, pages 544- 551, 1986.
	16	S. P. Midkiff , D. A. Padua, Compiler algorithms for synchronization, IEEE Transactions on Computers, v.36 n.12, p.1485-1495, Dec. 1987 [doi>10.1109/TC.1987.5009499]
	17	David A. Padua , Michael J. Wolfe, Advanced compiler optimizations for supercomputers, Communications of the ACM, v.29 n.12, p.1184-1201, Dec. 1986 [doi>10.1145/7902.7904]
	18	Sergio Pissanetsky. Sparse Matrix Technology. Academic Press, London, 1984.
	19	Constantine D. Polychronopoulos, Parallel Programming and Compilers, Kluwer Academic Publishers, Norwell, MA, 1988
	20	William Pugh , David Wonnacott, An Exact Method for Analysis of Value-based Array Data Dependences, Proceedings of the 6th International Workshop on Languages and Compilers for Parallel Computing, p.546-566, August 12-14, 1993
	21	Michael J. Quinn, Designing efficient algorithms for parallel computers, McGraw-Hill, Inc., New York, NY, 1987
	22	Joel H. Saltz , Ravi Mirchandaney , Kathleen Crowley, The doconsider loop, Proceedings of the 3rd international conference on Supercomputing, p.29-40, June 05-09, 1989, Crete, Greece [doi>10.1145/318789.318794]
	23	Joel H. Salz , Ravi Mirchandaney , Kay Crowley, Run-Time Parallelization and Scheduling of Loops, IEEE Transactions on Computers, v.40 n.5, p.603-612, May 1991 [doi>10.1109/12.88484]
	24	Gerard Tel, Introduction to distributed algorithms, Cambridge University Press, New York, NY, 1994
	25	Michael Joseph Wolfe, Optimizing Supercompilers for Supercomputers, MIT Press, Cambridge, MA, 1990
	26	Chuan-Qi Zhu , Pen-Chung Yew, A scheme to enforce data dependence on large multiprocessor systems, IEEE Transactions on Software Engineering, v.13 n.6, p.726-739, June 1987 [doi>10.1109/TSE.1987.233477]
	27	Hans Zima , Barbara Chapman, Supercompilers for parallel and vector computers, ACM Press, New York, NY, 1990
	28	Zahari Zlatev. Computational Methods :for General Sparse Matrices. Kluwer Academic Publishers, 1991.

CITED BY 2

	Aart J. C. Bik , Harry A. G. Wijshoff, Nonzero structure analysis, Proceedings of the 8th international conference on Supercomputing, p.226-235, July 11-15, 1994, Manchester, England
	Aart J. C. Bik , Harry A. G. Wijshoff, Automatic Data Structure Selection and Transformation for Sparse Matrix Computations, IEEE Transactions on Parallel and Distributed Systems, v.7 n.2, p.109-126, February 1996