Parallelization of sequential programs is often daunting because of the substantial development cost involved. Various solutions have been proposed to address this concern, including directive-based approaches and parallelization platforms. These solutions have not always been successful, in part because many try to address all types of applications. We propose a platform for parallelization of a class of applications that have similar computational structure, namely graph-structured iterative applications. iC2mpi is a unique proof-of-concept prototype platform that provides relatively easy parallelization of existing sequential programs and facilitates experimentation with static partitioning and dynamic load balancing schemes. We demonstr...
To parallelize an application program for a distributed memory architecture, we can use a precedence...
Existing partitioning algorithms provide limited support for load balancing simulations that are per...
Sequential graph algorithms are implemented through ordered execution of tasks to achieve high work ...
Parallel computing hardware is ubiquitous, ranging from cell-phones with multiple cores to super-com...
In this thesis, we address the problem of efficiently and automatically scaling iterative computatio...
Iterative computation on large graphs has challenged system research from two aspects: (1) how to co...
This paper presents a novel method for the analysis and representation of parallel program with MPI....
This paper addresses the problem of scheduling iterative task graphs on distributed memory architect...
The multicore era has increased the need for highly parallel software. Since automatic parallelizati...
An extensible machine architecture is devised to efficiently support a parallel reduction model of c...
This paper describes basic programming technology to support irregular applications on scalable conc...
Abstract. Load balancing is important for the efficient execution of numer-ical simulations on paral...
Advancement in computer architecture leads to parallelize the sequential algorithm to exploit the co...
xiv, 133 leaves : ill. ; 30 cm.PolyU Library Call No.: [THS] LG51 .H577M COMP 2004 ChanParallel comp...
A method is outlined for optimising graph partitions which arise in mapping un- structured mesh calc...
To parallelize an application program for a distributed memory architecture, we can use a precedence...
Existing partitioning algorithms provide limited support for load balancing simulations that are per...
Sequential graph algorithms are implemented through ordered execution of tasks to achieve high work ...
Parallel computing hardware is ubiquitous, ranging from cell-phones with multiple cores to super-com...
In this thesis, we address the problem of efficiently and automatically scaling iterative computatio...
Iterative computation on large graphs has challenged system research from two aspects: (1) how to co...
This paper presents a novel method for the analysis and representation of parallel program with MPI....
This paper addresses the problem of scheduling iterative task graphs on distributed memory architect...
The multicore era has increased the need for highly parallel software. Since automatic parallelizati...
An extensible machine architecture is devised to efficiently support a parallel reduction model of c...
This paper describes basic programming technology to support irregular applications on scalable conc...
Abstract. Load balancing is important for the efficient execution of numer-ical simulations on paral...
Advancement in computer architecture leads to parallelize the sequential algorithm to exploit the co...
xiv, 133 leaves : ill. ; 30 cm.PolyU Library Call No.: [THS] LG51 .H577M COMP 2004 ChanParallel comp...
A method is outlined for optimising graph partitions which arise in mapping un- structured mesh calc...
To parallelize an application program for a distributed memory architecture, we can use a precedence...
Existing partitioning algorithms provide limited support for load balancing simulations that are per...
Sequential graph algorithms are implemented through ordered execution of tasks to achieve high work ...