Rudolf Eigenmann
Rudolf Eigenmann has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Samuel P. Midkiff
Purdue University
3 shared publications - Ayon Basumallik
Purdue University, School of Electrical and Computer Engineering, West Lafayette, IN 47907-1285 USA
2 shared publications - Dheya Mustafa
The Hashemite University
2 shared publications - Amit Sabne
Purdue University
1 shared publication - Aurangzeb
Purdue University
1 shared publication - Chirag Dave
Qualcomm, San Diego, USA
1 shared publication
Latest Publications
- 20 February 2016
- Published by Springer Nature
- p. 140-155
HYDRA : Extending Shared Address Programming for Accelerator Clusters
- 20 February 2016
- Published by Springer Nature
- p. 140-155
HYDRA : Extending Shared Address Programming for Accelerator Clusters
- 1 May 2015
- Published by Springer Nature
- p. 253-267
\pi Abstraction: Parallelism-Aware Array Data Flow Analysis for OpenMP
- 1 May 2015
- Published by Springer Nature
- p. 253-267
\pi Abstraction: Parallelism-Aware Array Data Flow Analysis for OpenMP
- 20 May 2014
- Published by Springer Nature in Journal of Grid Computing
- Vol. 12 (4) , 593-613
Reliable and Efficient Distributed Checkpointing System for Grid Environments
- 20 May 2014
- Published by Springer Nature in Journal of Grid Computing
- Vol. 12 (4) , 593-613
Reliable and Efficient Distributed Checkpointing System for Grid Environments
- 19 March 2014
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 43 (4) , 549-571
PETRA: Performance Evaluation Tool for Modern Parallelizing Compilers
- 19 March 2014
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 43 (4) , 549-571
PETRA: Performance Evaluation Tool for Modern Parallelizing Compilers
- 17 July 2013
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 41 (6) , 751-752
Compiler Infrastructure
- 17 July 2013
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 41 (6) , 751-752
Compiler Infrastructure
- 10 August 2012
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 41 (6) , 753-767
The Cetus Source-to-Source Compiler Infrastructure: Overview and Evaluation
- 10 August 2012
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 41 (6) , 753-767
The Cetus Source-to-Source Compiler Infrastructure: Overview and Evaluation
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15302075,p. 1-8
Programming Distributed Memory Sytems Using OpenMP
OpenMP has emerged as an important model and language extension for shared-memory parallel programming. On shared-memory platforms, OpenMP offers an intuitive, incremental approach to parallel programming. In this paper, we present techniques that extend the ease of shared-memory parallel programming in OpenMP to distributed-memory platforms as well. First, we describe a combined compile-time/runtime system that uses an underlying software distributed shared memory system and exploits repetitive data access behavior in both regular and irregular program sections. We present a compiler algorithm to detect such repetitive data references and an API to an underlying software distributed shared memory system to orchestrate the learning and proactive reuse of communication patterns. Second, we introduce a direct translation of standard OpenMP into MPI message-passing programs for execution on distributed memory systems. We present key concepts and describe techniques to analyze and efficiently handle both regular and irregular accesses to shared data. Finally, we evaluate the performance achieved by our approaches on representative OpenMP applications.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15302075,p. 1-8
Programming Distributed Memory Sytems Using OpenMP
OpenMP has emerged as an important model and language extension for shared-memory parallel programming. On shared-memory platforms, OpenMP offers an intuitive, incremental approach to parallel programming. In this paper, we present techniques that extend the ease of shared-memory parallel programming in OpenMP to distributed-memory platforms as well. First, we describe a combined compile-time/runtime system that uses an underlying software distributed shared memory system and exploits repetitive data access behavior in both regular and irregular program sections. We present a compiler algorithm to detect such repetitive data references and an API to an underlying software distributed shared memory system to orchestrate the learning and proactive reuse of communication patterns. Second, we introduce a direct translation of standard OpenMP into MPI message-passing programs for execution on distributed memory systems. We present key concepts and describe techniques to analyze and efficiently handle both regular and irregular accesses to shared data. Finally, we evaluate the performance achieved by our approaches on representative OpenMP applications.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3 (15302075) , 1-8
Open Internet-based Sharing for Desktop Grids in iShare
This paper presents iShare, a distributed peer-to-peer Internet-sharing system, that facilitates the sharing of diverse resources located in different administrative domains over the Internet. iShare addresses the challenges of resource management in desktop grids, and integrates these resources with production grids. In this paper, we present a brief overview of the iShare system and describe how iShare leverages existing standards to provide novel solutions to the problems of resource dissemination, resource allocation and trust in desktop grids. We also discuss how iShare integrates production grid systems, such as the Teragrid, with desktop resources and compare the iShare approach with Web-based user portals for production grids. To quantitatively evaluate our techniques, we measured the efficiency of resource allocation in iShare and the overheads associated with establishing trust and providing the iShare user interface for production grids. The evaluation results demonstrate that iShare enables open Internet sharing with efficiency, reliability, and security.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3 (15302075) , 1-8
Open Internet-based Sharing for Desktop Grids in iShare
This paper presents iShare, a distributed peer-to-peer Internet-sharing system, that facilitates the sharing of diverse resources located in different administrative domains over the Internet. iShare addresses the challenges of resource management in desktop grids, and integrates these resources with production grids. In this paper, we present a brief overview of the iShare system and describe how iShare leverages existing standards to provide novel solutions to the problems of resource dissemination, resource allocation and trust in desktop grids. We also discuss how iShare integrates production grid systems, such as the Teragrid, with desktop resources and compare the iShare approach with Web-based user portals for production grids. To quantitatively evaluate our techniques, we measured the efficiency of resource allocation in iShare and the overheads associated with establishing trust and providing the iShare user interface for production grids. The evaluation results demonstrate that iShare enables open Internet sharing with efficiency, reliability, and security.
- 15 December 2000
- Published by Elsevier in Mathematics and Computers in Simulation
- Vol. 54 (4-5) , 307-320
Towards a compilation paradigm for computational applications on the information power grid
- 15 December 2000
- Published by Elsevier in Mathematics and Computers in Simulation
- Vol. 54 (4-5) , 307-320
Towards a compilation paradigm for computational applications on the information power grid