Placing pipeline stages on a Grid: Single path and multipath pipeline execution

Kijsipongse, Ekasit; Ngamsuriyaroj, Sudsanguan

doi:10.1016/j.future.2009.06.005

Cited by 2 publications

(3 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Kijsipongse and Ngamsuriyaroj presented in [21] two methods for optimal pipeline placement on grid systems. The first is a heuristic algorithm for linear pipelines, and the second uses linear programming for multipath pipelines.…”

Section: Related Workmentioning

confidence: 99%

HeDPM: load balancing of linear pipeline applications on heterogeneous systems

et al. 2017

View full text Add to dashboard Cite

This work presents a new algorithm, called Heterogeneous Dynamic Pipeline Mapping, that allows for dynamically improving the performance of pipeline applications running on heterogeneous systems. It is aimed at balancing the application load by determining the best replication (of slow stages) and gathering (of fast stages) combination taking into account processors computation and communication capacities. In addition, the algorithm has been designed with the requirement of keeping complexity low to allow its usage in a dynamic tuning tool. For this reason, it uses an analytical performance model of pipeline applications that addresses hardware heterogeneity and which depends on parameters that can be known in advance or This work has been partially supported by Ministerio de Economía y Competitividad MINECO-Spain under contract TIN2014-53234-C2-1-R and Generalitat de Catalunya GenCat-DIUiE (GRR) 2014-SGR-576.

show abstract

Section: Related Workmentioning

confidence: 99%

HeDPM: load balancing of linear pipeline applications on heterogeneous systems

et al. 2017

View full text Add to dashboard Cite

show abstract

“…[ KN10] proposes a heuristic algorithm called ThroughputPipeline to schedule a chain using interval mappings on Grid computing systems (related processors, bounded multi-port, communication and computation overlapping, no replication), considering routing through intermediate nodes. ThroughputPipeline is based on Dijkstra's shortest path algorithm.…”

Section: Scheduling a Chain Of Tasks With Interval Mappingsmentioning

confidence: 99%

“…[ KN10] considers the problem of scheduling a chain on a grid computer with routing to optimize the throughput. Processors are heterogeneous (related) and communications follow the bounded multi-port model with overlapping.…”

Section: Scheduling a Chain Of Tasks With General Mappingsmentioning

confidence: 99%

A survey of pipelined workflow scheduling

et al. 2013

View full text Add to dashboard Cite

A large class of applications need to execute the same workflow on different data sets of identical size. Efficient execution of such applications necessitates intelligent distribution of the application components and tasks on a parallel machine, and the execution can be orchestrated by utilizing task-, data-, pipelined-, and/or replicated-parallelism. The scheduling problem that encompasses all of these techniques is called pipelined workflow scheduling, and it has been widely studied in the last decade. Multiple models and algorithms have flourished to tackle various programming paradigms, constraints, machine behaviors or optimization goals. This paper surveys the field by summing up and structuring known results and approaches.

show abstract

Placing pipeline stages on a Grid: Single path and multipath pipeline execution

Cited by 2 publications

References 36 publications

HeDPM: load balancing of linear pipeline applications on heterogeneous systems

HeDPM: load balancing of linear pipeline applications on heterogeneous systems

A survey of pipelined workflow scheduling

Contact Info

Product

Resources

About