Partitioning Problems in Parallel, Pipeline, and Distributed Computing
IEEE Transactions on Computers
Optimal partitioning of sequences
Journal of Algorithms
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
Future Generation Computer Systems - Special issue on metacomputing
Distributed processing of very large datasets with DataCutter
Parallel Computing - Clusters and computational grids for scientific computing
Introduction to Algorithms
Executing multiple pipelined data analysis operations in the grid
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Image Processing or the Grid: A Toolkit or Building Grid-enabled Image Processing Applications.
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
Power laws and the AS-level internet topology
IEEE/ACM Transactions on Networking (TON)
Scheduling divisible workloads on heterogeneous platforms
Parallel Computing - Parallel matrix algorithms and applications (PMAA '02)
A Proposal of Pipelined Image Processing in a Grid Environment
SAINT-W '04 Proceedings of the 2004 Symposium on Applications and the Internet-Workshops (SAINT 2004 Workshops)
Parallel Programming: Techniques and Applications Using Networked Workstations and Parallel Computers (2nd Edition)
Visualization in Grid Computing Environments
VIS '04 Proceedings of the conference on Visualization '04
Filter Decomposition for Supporting Coarse-Grained Pipelined Parallelism
ICPP '05 Proceedings of the 2005 International Conference on Parallel Processing
Scheduling Data Flow Applications Using Linear Programming
ICPP '05 Proceedings of the 2005 International Conference on Parallel Processing
Multiround Algorithms for Scheduling Divisible Loads
IEEE Transactions on Parallel and Distributed Systems
A performance prediction framework for scientific applications
Future Generation Computer Systems
Parallel Programming in C with MPI and OpenMP
Parallel Programming in C with MPI and OpenMP
AINA '07 Proceedings of the 21st International Conference on Advanced Networking and Applications
Distributed Visualization Using VTK in Grid Environments
CCGRID '07 Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid
ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 01
Sampling large Internet topologies for simulation purposes
Computer Networks: The International Journal of Computer and Telecommunications Networking
Visualization Pipeline for Medical Datasets on Grid Computing Environment
ICCSA '07 Proceedings of the The 2007 International Conference Computational Science and its Applications
Predict task running time in grid environments based on CPU load predictions
Future Generation Computer Systems
Patterns for parallel programming
Patterns for parallel programming
One-dimensional partitioning for heterogeneous systems: Theory and practice
Journal of Parallel and Distributed Computing
A new paradigm: Data-aware scheduling in grid computing
Future Generation Computer Systems
Mapping Linear Workflows with Computation/Communication Overlap
ICPADS '08 Proceedings of the 2008 14th IEEE International Conference on Parallel and Distributed Systems
A survey of pipelined workflow scheduling: Models and algorithms
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
In a Grid computing environment, several applications such as scientific data analysis and visualization are naturally computation and communication intensive. These applications can be decomposed into a sequence of pipeline stages which can be placed on different Grid nodes for concurrent execution. Due to the aggregation of the computation and communication costs involved, finding the way to place such pipeline stages on a Grid in order to achieve the maximum application throughput becomes a challenging problem. This paper proposes a solution that considers both the pipeline placement and the data movement between stages. Specifically, we try to minimize the computation cost of the pipeline stages while preventing the communication overhead between successive stages from dominating the entire processing time. Our proposed solution consists of two novel methods. The first method is single path pipeline execution, which exploits only temporal parallelism, and the second method is multipath pipeline execution, which considers both temporal and spatial parallelism inherent in any pipeline applications. We evaluate our work in a simulated environment and also conduct a set of experiments in a real Grid computing system. When compared with the results from several traditional placement methods, our proposed methods give the highest throughput.