Results 1 
9 of
9
Scheduling Strategies for MasterSlave Tasking on Heterogeneous Processor Grids
, 2002
"... In this paper, we consider the problem of allocating a large number of independent, equalsized tasks to a heterogeneous "grid" computing platform. We use a nonoriented graph to model a grid, where resources can have different speeds of computation and communication, as well as different ..."
Abstract

Cited by 99 (30 self)
 Add to MetaCart
(Show Context)
In this paper, we consider the problem of allocating a large number of independent, equalsized tasks to a heterogeneous "grid" computing platform. We use a nonoriented graph to model a grid, where resources can have different speeds of computation and communication, as well as different overlap capabilities. We show how to determine the optimal steadystate scheduling strategy for each processor (the fraction of time spent computing and the fraction of time spent communicating with each neighbor). This result holds for a quite general framework, allowing for cycles and multiple paths in the interconnection graph, and allowing for several masters. Because
Broadcast Trees for Heterogeneous Platforms
, 2004
"... In this paper, we deal with broadcasting on heterogeneous platforms. Typically, the message to be broadcast is split into several slices, which are sent by the source processor in a pipeline fashion. A spanning tree is used to implement this operation, and the objective is to find the tree which max ..."
Abstract

Cited by 29 (2 self)
 Add to MetaCart
(Show Context)
In this paper, we deal with broadcasting on heterogeneous platforms. Typically, the message to be broadcast is split into several slices, which are sent by the source processor in a pipeline fashion. A spanning tree is used to implement this operation, and the objective is to find the tree which maximizes the throughput, i.e. the average number of slices sent by the source processor every timeunit. We introduce several heuristics to solve this problem. The good news is that the best heuristics perform quite efficiently, reaching more than 70 % of the absolute optimal throughput, thereby providing a simple yet efficient approach to achieve very good performance for broadcasting on heterogeneous platforms.
Assessing the impact and limits of steadystate scheduling for mixed task and data parallelism on heterogeneous platforms
, 2004
"... ..."
A PolynomialTime Algorithm for Allocating Independent Tasks on Heterogeneous ForkGraphs
, 2002
"... In this paper, we consider the problem of allocating a large number of independent, equalsized tasks to a heterogeneous processor farm. The master processor P 0 can process a task within w 0 timeunits; it communicates a task in d i timeunits to the ith slave P i , 1 i p, which requires w i ..."
Abstract

Cited by 19 (11 self)
 Add to MetaCart
In this paper, we consider the problem of allocating a large number of independent, equalsized tasks to a heterogeneous processor farm. The master processor P 0 can process a task within w 0 timeunits; it communicates a task in d i timeunits to the ith slave P i , 1 i p, which requires w i timeunits to process it. We assume communicationcomputation overlap capabilities for each slave (and for the master), but the communication medium is exclusive: the master can only communicate with a single slave at each timestep. We give a
Optimizing the steadystate throughput of scatter and reduce operations on heterogeneous platforms
, 2005
"... ..."
Complexity results and heuristics for pipelined multicast operations on heterogeneous platforms
, 2004
"... ..."
Optimizing the steadystate throughput of Broadcasts on heterogeneous platforms
, 2003
"... In this paper, we consider the communications involved by the execution of a complex application, deployed on a heterogeneous "grid" platform. Such applications extensively use macrocommunication schemes, for example to broadcast data items. Rather than aiming at minimizing the execution ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
In this paper, we consider the communications involved by the execution of a complex application, deployed on a heterogeneous "grid" platform. Such applications extensively use macrocommunication schemes, for example to broadcast data items. Rather than aiming at minimizing the execution time of a single broadcast, we focus on the steadystate operation. We assume that there is a large number of messages to be broadcast in pipeline fashion, and we aim at maximizing the throughput, i.e. the (rational) number of messages which can be broadcast every timestep. We target heterogeneous platforms, modeled by a graph where resources have di#erent communication and computation speeds. Achieving the best throughput may well require that the target platform is used in totality: we show that neither spanning trees nor DAGs are as powerful as general graphs. We show how
Efficient multicast in heterogeneous networks of wrokstations
 In Proceedings of 2000 International Workshop on Parallel Processing
, 2000
"... Email contact: hadasQcs.hmc. edu This paper studies the problem of eficient multicast in heterogeneous networks of workstations (HNO W s) using a parameterized communication model [3]. This model associates a sending overhead and a receiving overhead with each node as well as a network latency para ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Email contact: hadasQcs.hmc. edu This paper studies the problem of eficient multicast in heterogeneous networks of workstations (HNO W s) using a parameterized communication model [3]. This model associates a sending overhead and a receiving overhead with each node as well as a network latency parameter. The problem of finding optimal multicasts in this model is known to be NPcomplete in the strong sense. Nevertheless, we show that for two different properties that arise in typical HNO Ws, provably nearoptimal and optimal solutions, respectively, can be found in polynomial time. Specifically, we show the following two results: When the ratios of receiving overhead to sending overhead among the nodes is bounded b y constants, solutions within a bounded ratio of optimal can be found in time O(n1ogn). Secondly, i f the number of distinct types of workstations is fixed then optimal solutions can be found in polynomial time. These results provide a practical means of finding optimal and provably nearoptimal multicast schedules in a large class of frequently occurring heterogeneous networks of workstations. 1
Pipelining Broadcasts on Heterogeneous Platforms under the OnePort Model
, 2004
"... In this paper, we consider the communications involved by the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macrocommunication schemes, for example to broadcast data items. Rather than aiming at minimizing the execution time of a single ..."
Abstract
 Add to MetaCart
(Show Context)
In this paper, we consider the communications involved by the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macrocommunication schemes, for example to broadcast data items. Rather than aiming at minimizing the execution time of a single broadcast, we focus on the steadystate operation. We assume that there is a large number of messages to be broadcast in pipeline fashion, and we aim at maximizing the throughput, i.e. the (rational) number of messages which can be broadcast every timestep. We target heterogeneous platforms, modeled by a graph where resources have different communication speeds under the unidirectional oneport model (i.e. at a given time step, a processor can be involved in at most one (incoming or outgoing) communication with one of its neighbors). Achieving the best throughput may well require that the target platform is used in totality: we show that neither spanning trees nor DAGs are as powerful as general graphs. We propose a rather sophisticated polynomial algorithm for determining the optimal throughput that can be achieved using a platform, together with a (periodic) schedule achieving this throughput. The algorithm is based on the use of polynomial oracles and of the ellipsoid method [9, 13] for solving in linear programs in rational numbers. The polynomial compactness of the description comes from the decomposition of the schedule into several broadcast trees that are used concurrently to reach the best throughput. It is important to point out that a concrete scheduling algorithm based upon the steadystate operation is asymptotically optimal, in the class of all possible schedules (not only periodic solutions).