Placing pipeline stages on a grid: single path and multipath pipeline execution

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 executio...

Full description

Saved in:
Bibliographic Details
Main Authors: Ekasit Kijsipongse, Sudsanguan Ngamsuriyaroj, สุดสงวน งามสุริยโรจน์
Other Authors: Mahidol University. Faculty of Information and Communication Technology
Format: Article
Language:English
Published: 2013
Subjects:
Online Access:https://repository.li.mahidol.ac.th/handle/123456789/10059
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Mahidol University
Language: English
id th-mahidol.10059
record_format dspace
spelling th-mahidol.100592023-04-12T15:23:56Z Placing pipeline stages on a grid: single path and multipath pipeline execution Ekasit Kijsipongse Sudsanguan Ngamsuriyaroj สุดสงวน งามสุริยโรจน์ Mahidol University. Faculty of Information and Communication Technology Grid computing environment Grid data analysis communication intensive 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 2013-03-12T08:41:11Z 2018-03-15T08:55:05Z 2013-03-12T08:41:11Z 2018-03-15T08:55:05Z 2010-01 Article Future Generation Computer Systems. Vol. 26, No. 1 (2010), 50-62 10.1016/j.future.2009.06.005 https://repository.li.mahidol.ac.th/handle/123456789/10059 eng Elsevier (available from ScienceDirect)
institution Mahidol University
building Mahidol University Library
continent Asia
country Thailand
Thailand
content_provider Mahidol University Library
collection Mahidol University Institutional Repository
language English
topic Grid computing environment
Grid
data analysis
communication intensive
spellingShingle Grid computing environment
Grid
data analysis
communication intensive
Ekasit Kijsipongse
Sudsanguan Ngamsuriyaroj
สุดสงวน งามสุริยโรจน์
Placing pipeline stages on a grid: single path and multipath pipeline execution
description 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
author2 Mahidol University. Faculty of Information and Communication Technology
author_facet Mahidol University. Faculty of Information and Communication Technology
Ekasit Kijsipongse
Sudsanguan Ngamsuriyaroj
สุดสงวน งามสุริยโรจน์
format Article
author Ekasit Kijsipongse
Sudsanguan Ngamsuriyaroj
สุดสงวน งามสุริยโรจน์
author_sort Ekasit Kijsipongse
title Placing pipeline stages on a grid: single path and multipath pipeline execution
title_short Placing pipeline stages on a grid: single path and multipath pipeline execution
title_full Placing pipeline stages on a grid: single path and multipath pipeline execution
title_fullStr Placing pipeline stages on a grid: single path and multipath pipeline execution
title_full_unstemmed Placing pipeline stages on a grid: single path and multipath pipeline execution
title_sort placing pipeline stages on a grid: single path and multipath pipeline execution
publishDate 2013
url https://repository.li.mahidol.ac.th/handle/123456789/10059
_version_ 1781414256316514304