Article

Free access

An efficient uniform run-time scheme for mixed regular-irregular applications

Authors:

Dhruva R. Chakrabarti,

Nagaraj Shenoy,

Alok Choudhary,

Prithviraj BanerjeeAuthors Info & Claims

ICS '98: Proceedings of the 12th international conference on Supercomputing

Pages 61 - 68

https://doi.org/10.1145/277830.277848

Published: 13 July 1998 Publication History

PDF eReader

References

[1]

R. Mirchandaney, J. Saltz, R. M. Smith, D. M. Nicol and Kay Crowley, Principles of Run-time Support for Parallel Processors, Proceedings of the 1988 ACM international Conference on Supercomputing, pages 140-152, July 1988.]]

Digital Library

Google Scholar

[2]

Joel Saltz el. al., A Manual for the CHAOS Runtime Library, UMIACS, University of Maryland, 1994.]]

Digital Library

Google Scholar

[3]

A. Lain and P. Banerjee, Exploiting Spatial Regularity in Irregular Iterative Applications, Proc. of the 9th International Parallel Processing Symposium, pp. 820-827, Santa Barbara, CA, 1995.]]

Digital Library

Google Scholar

[4]

R. Das, M. Uysal, J. Saltz, Y. S. Hwang, Communication Optimizations for Irregular Scientific Computations on Distributed Memory Architectures, Journal of Parallel and Distributed Computing, vol. 22, no. 3, pages 462-479, September 1994.]]

Digital Library

Google Scholar

[5]

Ravi Ponnusamy, Joel Saltz, Alok Choudhary, Runtime- Compilation Techniques for Data Partitioning and Communication Schedule Reuse, Proceedings Supercomputing '93 pages 361-370, November 1993.]]

Digital Library

Google Scholar

[6]

Dhruva R. Chakrabarti, Antonio Lain and Prithviraj Banerjee, Evaluation of Compiler and Runtime Library Approaches for Supporting Parallel Regular Applications, To appear in The International Parallel Processing Symposium, Orlando, Florida, March 1998.]]

Digital Library

Google Scholar

[7]

G. AgarwaI, A. Sussman and J. Saltz, Efcient Runtime Support for Parallelizing Block Structured Applications, Proceedings of Scalable High-Performance Computing Conference, 1994, pp. 158-167.]]

Google Scholar

[8]

S. Hiranandani, K. Kennedy and C. Tseng, Compiling FortranD for MIMD distributed memory machines, Communications of the ACM, vol. 35, No. 8, pp. 66-80, Aug. 1992.]]

Digital Library

Google Scholar

[9]

S. Chatterjee, J. R. Gilbert, F. J. E. Long, R. Schreiber and S. H. Teng, Generating Local Addresses and Communication Sets for Data-Parallel Programs, Proceedings of the Fourth ACM SIGPLAN Symposium on Principles & Practices of Parallel Programming, San Diego, CA, May 1993, pages 149-158.]]

Digital Library

Google Scholar

[10]

S. P. Midkiff, Local Iteration Set Computation for Block-Cyclic Distributions, Proceedings of the 24th International Conference on Parallel Processing, Oconomowoc, WI, 1995.]]

Google Scholar

[11]

S. K. S. Gupta, S. D. Kaushik, S. Mufti, S. Sharma, C. H. Huang and P. Sadayappan, On Compiling Array Expressions for Efficient Execution on Distributed Memory Machines, Proc. of the 22nd International Conference on Parallel Processing, IL, 1993.]]

Digital Library

Google Scholar

[12]

C. Ancourt, F. Coelho, F. Irigoin and lq. Keryell, A Linear Algebra F~amework for Static HPF Code Distribution, Proceedings of the Fourth Workshop on Compilers for Parallel Computers, Delft, The Netherlands, Dec. 1993.]]

Google Scholar

[13]

Ernesto Su, Compiler Framework for Distributed-Memory Message-Passing Multicomputers, Ph.D. Thesis, University of Illinois at Urbana-Champaign, 1997.]]

Google Scholar

[14]

Dhruva R. Chakrabarti, Nagaraj Shenoy, Alok Choudhary and Prithviraj Banerjee, A Uniform Scheme for ParaUelizing Mixed Regular-Irregular Applications, Technical Report No. CPDC- TR-9802-01I, Center for Parallel & Distributed Computing, Northwestern University, February 1998.]]

Google Scholar

[15]

Antonio Lain, Compiler and Run-time Support for Irregular Computations, PhD thesis, University of illinois at Urbana- Champaign, 1995.]]

Digital Library

Google Scholar

[16]

The Portland Group, Inc., pghpf Version 2.2, 1997.]]

Google Scholar

[17]

M. Gupta, S. Midkiff, E. Schonberg, V. Seshadri, D. Shields, K. Y. Wang, W. M. Ching and T. Ngo, An HPF compiler for the IBM SP-~, Proceedings of Supercomputing '95, San Diego, CA, December 1995.]]

Digital Library

Google Scholar

[18]

Yousef Saad, SPARSKIT: a basic tool-kit for sparse matrix computations (Version ~), http://www.cs.umn.edu/Research/ arpa/SPARSKIT/sparskit.html.]]

Google Scholar

[19]

Lanczos Algorithm, http:///www.netlib.org//lanczos.]]

Google Scholar

[20]

P. Banerjee, J. Chandy, M. Gupta, E. W. Hodges IV, J. G. Holm, A. Lain, D. J. Palermo, S. Ramaswamy and E. Su, The PARADIGM compiler for distributed-memory multicomputers, iEEE Computer, vol. 28, No. 10, pp. 37-47, Oct. 1995.]]

Digital Library

Google Scholar

[21]

High Performance Fortran Language Specification, Version ~.0, High Performance Fortran Forum, January 31, 1997.]]

Google Scholar

[22]

ITPACK, http://www.netlib, org/itpack/index.html.]]

Google Scholar

[23]

M. Ujaldon and E. Zapata, Ej~cient resolution of sparse indirections in data.parallel compilers, Proceedings of the 9th ACM International Conference on Supercomputing, pp. 117-126, July 1995.]]

Digital Library

Google Scholar

[24]

Scott R. Kohn and Scott B. Baden, A robust parallel programming model for dynamic non-uniform scientific computations, Proceedings of SHPCC, 1994.]]

Google Scholar

Cited By

View all

Rünger GSchwind M(2009)Parallelization Strategies for Mixed Regular-Irregular Applications on Multicore-SystemsProceedings of the 8th International Symposium on Advanced Parallel Processing Technologies10.1007/978-3-642-03644-6_30(375-388)Online publication date: 21-Aug-2009
https://dl.acm.org/doi/10.1007/978-3-642-03644-6_30
Runger GSchwind M(2008)Performance effects of gram-schmidt orthogonalization on multi-core infiniband clusters2008 IEEE International Symposium on Parallel and Distributed Processing10.1109/IPDPS.2008.4536474(1-8)Online publication date: Apr-2008
https://doi.org/10.1109/IPDPS.2008.4536474
Runger GSchwind M(2008)Cache optimization for mixed regular and irregular computations2008 IEEE International Symposium on Parallel and Distributed Processing10.1109/IPDPS.2008.4536184(1-8)Online publication date: Apr-2008
https://doi.org/10.1109/IPDPS.2008.4536184
Show More Cited By

Index Terms

An efficient uniform run-time scheme for mixed regular-irregular applications

Recommendations

Efficient Java exception handling in just-in-time compilation
Research Articles

Java uses exceptions to provide elegant error handling capabilities during program execution. However, the presence of exception handlers complicates the job of the just-in-time (JIT) compiler, while exceptions are rarely used in most programs. This ...
A Reconfigurable Run-Time System for Filter-Stream Applications
SBAC-PAD '08: Proceedings of the 2008 20th International Symposium on Computer Architecture and High Performance Computing

The development of high level abstractions for programming distributed systems is becoming a crucial effort in computer science. Several frameworks have been proposed, which expose simplified programming abstractions that are useful for a broad class of ...
Run-time efficient probabilistic model checking
ICSE '11: Proceedings of the 33rd International Conference on Software Engineering

Unpredictable changes continuously affect software systems and may have a severe impact on their quality of service, potentially jeopardizing the system's ability to meet the desired requirements. Changes may occur in critical components of the system, ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ICS '98: Proceedings of the 12th international conference on Supercomputing

July 1998

464 pages

ISBN:089791998X

DOI:10.1145/277830

Chairmen:
Greg Egan
Monash Univ.
,
Richard Brent
Oxford Univ.; and Australian National Univ., Canberra, Australia
,
Dennis Gannon
Indiana Univ.

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 July 1998

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ICS98

Sponsor:

SIGARCH
IEEE-CS

ICS98: 1998 International Conference on Supercomputing

Melbourne, Australia

Acceptance Rates

Overall Acceptance Rate 629 of 2,180 submissions, 29%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
236
Total Downloads

Downloads (Last 12 months)19
Downloads (Last 6 weeks)6

Reflects downloads up to 23 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Rünger GSchwind M(2009)Parallelization Strategies for Mixed Regular-Irregular Applications on Multicore-SystemsProceedings of the 8th International Symposium on Advanced Parallel Processing Technologies10.1007/978-3-642-03644-6_30(375-388)Online publication date: 21-Aug-2009
https://dl.acm.org/doi/10.1007/978-3-642-03644-6_30
Runger GSchwind M(2008)Performance effects of gram-schmidt orthogonalization on multi-core infiniband clusters2008 IEEE International Symposium on Parallel and Distributed Processing10.1109/IPDPS.2008.4536474(1-8)Online publication date: Apr-2008
https://doi.org/10.1109/IPDPS.2008.4536474
Runger GSchwind M(2008)Cache optimization for mixed regular and irregular computations2008 IEEE International Symposium on Parallel and Distributed Processing10.1109/IPDPS.2008.4536184(1-8)Online publication date: Apr-2008
https://doi.org/10.1109/IPDPS.2008.4536184
Kadayif IKandemir M(2004)Quasidynamic Layout Optimizations for Improving Data LocalityIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2004.7015:11(996-1011)Online publication date: 1-Nov-2004
https://dl.acm.org/doi/10.1109/TPDS.2004.70
Chakrabarti DBanerjee PFurnari MGallopoulos E(2001)Global optimization techniques for automatic parallelization of hybrid applicationsProceedings of the 15th international conference on Supercomputing10.1145/377792.377827(166-180)Online publication date: 17-Jun-2001
https://dl.acm.org/doi/10.1145/377792.377827
Chakrabarti DBanerjee P(2001)Static Single Assignment Form for Message-Passing ProgramsInternational Journal of Parallel Programming10.1023/A:100763301897329:2(139-184)Online publication date: 1-Apr-2001
https://dl.acm.org/doi/10.1023/A%3A1007633018973
Chakrabarti DBanerjee P(2001)Accurate Data and Context Management in Message-Passing ProgramsLanguages and Compilers for Parallel Computing10.1007/3-540-44905-1_8(117-132)Online publication date: 12-Jun-2001
https://doi.org/10.1007/3-540-44905-1_8
Bandera GUjaldón MZapata E(2000)Compile and Run-Time Support for the Parallelization of Sparse Matrix Updating AlgorithmsThe Journal of Supercomputing10.1023/A:102656332332817:3(263-276)Online publication date: 1-Nov-2000
https://dl.acm.org/doi/10.1023/A%3A1026563323328
Bandera GZapata E(2000)Improving the Sparse Parallelization Using Semantical Information at Compile-TimeEuro-Par 2000 Parallel Processing10.1007/3-540-44520-X_44(331-339)Online publication date: 18-Aug-2000
https://doi.org/10.1007/3-540-44520-X_44
Fraguela BDoallo RZapata E(1999)Automatic analytical modeling for the estimation of cache misses1999 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.PR00425)10.1109/PACT.1999.807544(221-231)Online publication date: 1999
https://doi.org/10.1109/PACT.1999.807544
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Efficient Java exception handling in just-in-time compilation

A Reconfigurable Run-Time System for Filter-Stream Applications

Run-time efficient probabilistic model checking