We consider the problem of efficiently coupling multiple data-parallel programs at runtime. We propose an approach that establishes a mapping between data structures in different data-parallel programs and implements a user specified consistency model. Mappings are established at runtime and new mappings between programs can be added and deleted while the programs are in execution. Mappings, or the identity of the processors involved, do not have to be known at compile-time or even link-time. Programs can be made to interact with different granularities of interaction without requiring any re-coding. A priori knowledge of data movement requirements allows for buffering of data and overlap of computations between coupled applications. Effici...
Contemporary state-of-the-art runtime systems underlying widely utilized general purpose parallel pr...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 1996.Designing high performance...
When coupling applications running on distributed memory architectures or clusters, the coupling lib...
This paper describes a framework for providing the ability to use multiple specialized data parallel...
This paper describes a framework for providing the ability to use multiple specialized data parallel...
Increased programmability for concurrent applications in distributed systems requires automatic supp...
This paper describes a framework for providing the ability to use multiple specialized data parallel...
In this paper, we introduce a model for managing abstract data structures that map to arbitrary dist...
We present the design and implementation of InterComm, a framework to couple parallel components th...
For a wide variety of applications, both task and data parallelism must be exploited to achieve the ...
For better utilization of computing resources, it is important to consider parallel programming en...
The `free' speed-up stemming from ever increasing processor speed is over. Performance increase in ...
Allowing loose coupling between the components of complex applications has many advantages, such as...
In recent years, clusters of machines connected by a high-speed interconnection network are increasi...
Research on programming distributed memory multiprocessors has resulted in a well-understood program...
Contemporary state-of-the-art runtime systems underlying widely utilized general purpose parallel pr...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 1996.Designing high performance...
When coupling applications running on distributed memory architectures or clusters, the coupling lib...
This paper describes a framework for providing the ability to use multiple specialized data parallel...
This paper describes a framework for providing the ability to use multiple specialized data parallel...
Increased programmability for concurrent applications in distributed systems requires automatic supp...
This paper describes a framework for providing the ability to use multiple specialized data parallel...
In this paper, we introduce a model for managing abstract data structures that map to arbitrary dist...
We present the design and implementation of InterComm, a framework to couple parallel components th...
For a wide variety of applications, both task and data parallelism must be exploited to achieve the ...
For better utilization of computing resources, it is important to consider parallel programming en...
The `free' speed-up stemming from ever increasing processor speed is over. Performance increase in ...
Allowing loose coupling between the components of complex applications has many advantages, such as...
In recent years, clusters of machines connected by a high-speed interconnection network are increasi...
Research on programming distributed memory multiprocessors has resulted in a well-understood program...
Contemporary state-of-the-art runtime systems underlying widely utilized general purpose parallel pr...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 1996.Designing high performance...
When coupling applications running on distributed memory architectures or clusters, the coupling lib...