Results 1 
7 of
7
LoadBalancing Iterative Computations on Heterogeneous Clusters
"... We focus on mapping iterative algorithms onto heterogeneous clusters. The application data is partitioned over the processors, which are arranged along a virtual ring. At each iteration, independent calculations are carried out in parallel, and some communications take place between consecutive p ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
We focus on mapping iterative algorithms onto heterogeneous clusters. The application data is partitioned over the processors, which are arranged along a virtual ring. At each iteration, independent calculations are carried out in parallel, and some communications take place between consecutive processors in the ring. The question is to determine how to slice the application data into chunks, and assign these chunks to the processors, so that the total execution time is minimized. A major
Data Redistribution Algorithms For Heterogeneous Processor Rings
, 2004
"... We consider the problem of redistributing data on homogeneous and heterogeneous ring of processors. The problem arises in several applications, each time after that a loadbalancing mechanism is invoked (but we do not discuss the loadbalancing mechanism itself). We provide algorithms that aim at op ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
We consider the problem of redistributing data on homogeneous and heterogeneous ring of processors. The problem arises in several applications, each time after that a loadbalancing mechanism is invoked (but we do not discuss the loadbalancing mechanism itself). We provide algorithms that aim at optimizing the data redistribution, both for unidirectional and bidirectional rings, and we give complete proofs of correctness. One major contribution of the paper is that we are able to prove the optimality of the proposed algorithms in all cases except that of a bidirectional heterogeneous ring, for which the problem remains open.
Scheduling and Data Redistribution Strategies on Star Platforms
"... In this work we are interested in the problem of scheduling and redistributing data on masterslave platforms. We consider the case were the workers possess initial loads, some of which having to be redistributed in order to balance their completion times. We assume that the data consists of indepen ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
In this work we are interested in the problem of scheduling and redistributing data on masterslave platforms. We consider the case were the workers possess initial loads, some of which having to be redistributed in order to balance their completion times. We assume that the data consists of independent and identical tasks. As the general case is NPcomplete in the strong sense, we propose three heuristics. Simulations consolidate the theoretical results. 1.
Mapping and LoadBalancing Iterative Computations
 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
, 2004
"... This paper is devoted to mapping iterative algorithms onto heterogeneous clusters. The application data is partitioned over the processors, which are arranged along a virtual ring. At each iteration, independent calculations are carried out in parallel, and some communications take place between c ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
This paper is devoted to mapping iterative algorithms onto heterogeneous clusters. The application data is partitioned over the processors, which are arranged along a virtual ring. At each iteration, independent calculations are carried out in parallel, and some communications take place between consecutive processors in the ring. The question is to determine how to slice the application data into chunks, and to assign these chunks to the processors, so that the total execution time is minimized. One major difficulty is to embed a processor ring into a network that typically is not fully connected, so that some communication links have to be shared by several processor pairs. We establish a complexity result that assesses the difficulty of this problem, and we design a practical heuristic that provides efficient mapping, routing, linksharing, and data distribution schemes.
Resource Descriptions for Job Scheduling in DISCWorld
, 1998
"... The DISCWorld system requires the description and mapping of data, software and computational resources to allow user queries or requests to be scheduled. We review the distributed scheduling problem and discuss mechanisms for expressing and operating upon the necessary distributed job control i ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The DISCWorld system requires the description and mapping of data, software and computational resources to allow user queries or requests to be scheduled. We review the distributed scheduling problem and discuss mechanisms for expressing and operating upon the necessary distributed job control information. We focus upon techniques that can be expressed in a portable fashion using Java and a World Wide Web software infrastructure, constraining the problem to deal with the well characterised highlevel service applications employed in DISCWorld. 1
Load Balancing for Minimizing Execution Time of a Target Job on a Network of Heterogeneous Workstations
 Proc. 6 th Workshop on Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science
, 1911
"... A network of workstations (NOWs) may be employed for high performance computing where execution time of a target job is to be minimized. Job arrival rate and size are "random" on a NOWs. In such an environment, partitioning (load balancing) a target job based on only the first order moments (mean ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
A network of workstations (NOWs) may be employed for high performance computing where execution time of a target job is to be minimized. Job arrival rate and size are "random" on a NOWs. In such an environment, partitioning (load balancing) a target job based on only the first order moments (means) of system parameters is not optimal. In this paper, it is proposed to consider the second order moments (standard deviations) also in load balancing in order to minimize execution time of a target job on a set of workstations where the roundrobin job scheduling policy is adopted. It has been verified through computer simulation that the proposed static and dynamic load balancing schemes can significantly reduce execution time of a target job in a NOWs environment, compared to cases where only the means of the parameters are used. Key Words: Dynamic load balancing, Execution time, Network of workstation, Roundrobin job scheduling, Standard deviation, Static load balancing, Stochas...
Static LoadBalancing Techniques For Iterative Computations On Heterogeneous Clusters
, 2003
"... This paper is devoted to static load balancing techniques for mapping iterative algorithms onto heterogeneous clusters. The application data is partitioned over the processors. At each iteration, independent calculations are carried out in parallel, and some communications take place. The questio ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
This paper is devoted to static load balancing techniques for mapping iterative algorithms onto heterogeneous clusters. The application data is partitioned over the processors. At each iteration, independent calculations are carried out in parallel, and some communications take place. The question