Broadcast Scheduling Optimization for Heterogeneous Cluster Systems

Liu, Pangfeng

doi:10.1006/jagm.2001.1204

Cited by 35 publications

(52 citation statements)

References 21 publications

(36 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This improves over the previous bound 2αT + β [17] where α is the maximum ratio between receiving and sending costs, and can be arbitrarily large theoretically. In a previous paper [19] we show a similar result for a communication model where the communication cost is determined by the sender only. This paper shows that FNF can still achieve guaranteed performance when the model determines the communication costs based on both the sender and the receiver.…”

Section: Introductionsupporting

confidence: 74%

“…In a previous paper we show that FNF gives a broadcast schedule at most twice that of the optimal time for the sender-only communication model [19]. For a more realistic senderreceiver model adapted by this paper, we show that FNF gives a broadcast schedule at most twice that of the optimal time plus a constant.…”

Section: Resultsmentioning

confidence: 62%

“…We will refer to this model as the sender-only model. Based on the sender-only model, an approximation algorithm for reduction with competitive ratio 2 is reported in [20], and the fastest-node-first technique is shown to be also 2-competitive [19]. Despite the fact that the sender-only model is simple and has a high level abstraction of network topology, the speed of the receiving processor is not accounted for.…”

Section: Communication Modelmentioning

confidence: 99%

“…The intuition behind this heuristic is that, by sending the message to those fast processors first, it is likely that the messages will propagate more rapidly. The fastest-node-first technique is very effective in reducing broadcast time [2,17,19]. The FNF has been shown in simulation to have a high probability to find the optimal broadcast time when the transmission time is randomly chosen from a given table [2].…”

Section: Fastest-node-first Scheduling For Broadcastmentioning

confidence: 99%

“…In this section we consider a special case of heterogeneous clusters in which all the sending and receiving costs are power of 2, and we refer to such clusters as power 2 clusters [19]. Similar notation is also used in [17].…”

Section: Power 2 Clustersmentioning

confidence: 99%

See 4 more Smart Citations

An Approximation Algorithm for Broadcast Scheduling in Heterogeneous Clusters

Liu

Wang

Guo

2004

Real-Time and Embedded Computing Systems and Applications

Self Cite

View full text Add to dashboard Cite

Abstract. Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-theshelf processors become cheaper and faster, it is now possible to build a PC or workstation cluster that provides high computing power within a limited budget. However, a cluster may consist of different types of processors and this heterogeneity within a cluster complicates the design of efficient collective communication protocols. This paper shows that a simple heuristic called fastest-node-first (FNF) [2] is very effective in reducing broadcast time for heterogeneous cluster systems. Despite the fact that FNF heuristic does not guarantee an optimal broadcast time for general heterogeneous network of workstation, we prove that FNF always gives near optimal broadcast time in a special case of cluster, and this finding helps us show that FNF delivers guaranteed performance for general clusters. In a previous paper we showed a similar bound on the competitive ratio in a send-only communication model. This paper extends the result to a more realistic sender-receiver model. We show that FNF gives a total broadcast of 2T + β, where T is the optimum time and β is a constant. This improves over the previous bound on 2αT + β [17], where α is a theoretically unbounded ratio of the processor performance in the cluster.

show abstract

Section: Introductionsupporting

confidence: 74%

Section: Resultsmentioning

confidence: 62%

Section: Communication Modelmentioning

confidence: 99%

Section: Fastest-node-first Scheduling For Broadcastmentioning

confidence: 99%

Section: Power 2 Clustersmentioning

confidence: 99%

See 3 more Smart Citations

An Approximation Algorithm for Broadcast Scheduling in Heterogeneous Clusters

Liu

Wang

Guo

2004

Real-Time and Embedded Computing Systems and Applications

Self Cite

View full text Add to dashboard Cite

show abstract

Broadcast scheduling for wide-area parallel distributed systems

Tasaki

Tamura

Sengoku

et al. 2004

Electron. Comm. Jpn. Pt. III

View full text Add to dashboard Cite

SUMMARYParallel distributed systems in which multiple computers are connected through LAN and WAN are widely used at present. One of the important functions of parallel distributed systems is broadcasting to distribute data over an entire system. Broadcast processing greatly affects the performance of parallel distributed systems, and it is desirable to develop a distribution procedure that completes the processing in a short time. Consequently, there have been many approaches to the minimum broadcast time problem, aiming at the optimal distribution procedure. However, not many past studies of this problem consider a wide-area system in which multiple parallel distributed systems are connected. In this context, this paper considers the minimum broadcast time problem for a wide-area parallel distributed system whose topology can be represented by a certain kind of split graph. It is shown that the problem can be solved in polynomial time in the homogeneous parallel distributed system in which the time required for communication is uniform. In addition, a heuristic algorithm is proposed for a heterogeneous parallel distributed system in which the time required for communication is not uniform. Simulation results reveal that an efficient distribution procedure can be derived in a short time.

show abstract

Scheduling for broadcast operation in heterogeneous parallel computing environments

Ooshita

Matsumae

Masuzawa

et al. 2004

Systems & Computers in Japan

View full text Add to dashboard Cite

SUMMARYParallel computing utilizes heterogeneous parallel computing environments in which multiple processors of various kinds are connected by communication links. Efficient collective communication operations are needed to realize efficient parallel computing in parallel computing environments. Although methods for realizing efficient collective communication operations have previously been proposed for homogeneous parallel computing environments, these methods applied as they are to heterogeneous parallel computing environments cannot realize efficient collective communication operations. In this paper, we consider design of an efficient broadcast, which is one of the most important collective communication operations. We show that we can extend the known sufficient condition for Fastest-Node-First (FNF) to output an optimal schedule, where FNF is an efficient heuristic algorithm for the broadcast. We show that we can reduce the time cost of the branch-and-bound search for the optimal schedule.

show abstract

Broadcast Scheduling Optimization for Heterogeneous Cluster Systems

Cited by 35 publications

References 21 publications

An Approximation Algorithm for Broadcast Scheduling in Heterogeneous Clusters

An Approximation Algorithm for Broadcast Scheduling in Heterogeneous Clusters

Broadcast scheduling for wide-area parallel distributed systems

Scheduling for broadcast operation in heterogeneous parallel computing environments

Contact Info

Product

Resources

About