Generating an efficient broadcast sequence using reflected Gray codes

Moore, Jason A.; Quinn, Michael J.

doi:10.1109/71.642946

Cited by 4 publications

(6 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [19], Moore and Quinn considered broadcast operation on multicomputers and constructed the broadcast tree using reflected Gray Code. The objective of their approach is to minimize overall communication time and achieve the load-balance of a series of communications.…”

Section: Related Workmentioning

confidence: 99%

“…The one-to-all broadcast is widely used in parallel algorithm design to send identical data to all other processors, in order to disseminate global information, such as the problem size or application parameters. Therefore, numerous broadcast algorithms have been implemented for different MPP architectures, such as mesh, hypercube, or systolic array [18,19,23].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Scheduling for atomic broadcast operation in heterogeneous networks with one port model

Hsu

Tsai

2009

J Supercomput

View full text Add to dashboard Cite

With the emergence of the network technologies, heterogeneous computing has become a wide accept paradigm for distributed and network computing. In this paper, we present different algorithms aiming to efficiently perform atomic oneto-all broadcast in a heterogeneous network with a one port model. The proposed algorithms are divided into graph-based and tree-based ones. In graph-based algorithms, we present Nearest Neighbor First and Maximum Degree Neighbor First schemes. A prescheduling strategy with constructing a message forwarding table for avoiding redundant transmissions is applied as runtime support. In the tree-based approaches, there are five heuristic algorithms: Nearest Neighbor First, Maximum Degree Neighbor First, Maximum Height Subtree First, Maximum Subtree First, and Maximum Weighted Subtree First, proposed based on different network characteristics. To evaluate the performance of the proposed techniques, we have developed a simulator that contains a parametric graph generator for generating network graphs with various characteristics. We have implemented all of the proposed scheduling algorithms on the simulator. The performance results show that the Maximum Weighted Subtree First performs best in high degree heterogeneous environments. On the contrary, with homogeneous-like environments, the graph-based Nearest Neighbor First will be the best choice. In summary, contribution of this study relies on informing significant suggestions for adapting proper broadcasting mechanism in different heterogeneous platforms.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Scheduling for atomic broadcast operation in heterogeneous networks with one port model

Hsu

Tsai

2009

J Supercomput

View full text Add to dashboard Cite

show abstract

“…The series of broadcasts problems has been considered by Moore and Quinn [9], and by Desprez et al [10], but with a different perspective: they consider that distinct processor sources successively broadcast one message, and their goal is to load-balance this series of communications. Here, we assume that the same source processor initiates all the broadcasts: This is closer to a master-slave paradigm where the master disseminates the information to the slaves in a pipelined fashion, for instance, the data needed to solve a collection of (independent) problem instances.…”

Section: Series Of Broadcastsmentioning

confidence: 99%

“…As mentioned in the introduction, Moore and Quinn [9] and Desprez et al [10] already investigated the Series of broadcasts problems, but with a different perspective: they focus on optimizing their performance of a series of broadcast operations from distinct source nodes. In this problems, either we look for the optimal order (that is the case in the paper of Moore and Quinn), or the order of the sending source nodes is fixed (in the paper of Desprez et al), but in all cases, the goal is to minimize the contention between several concurrent broadcasts from distinct sources.…”

Section: Related Workmentioning

confidence: 99%

Pipelining broadcasts on heterogeneous platforms

Beaumont

Legrand

Marchal

et al. 2005

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Abstract-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 steady-state 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 time-step. We target heterogeneous platforms, modeled by a graph where resources have different 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 to compute the best throughput using linear programming, and how to exhibit a periodic schedule, first when restricting to a DAG, and then when using a general graph. 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 steady-state operation is asymptotically optimal, in the class of all possible schedules (not only periodic solutions).

show abstract

“…The series of broadcasts problems has been considered by Moore and Quinn (1997) and Desprez et al (1993), but with a different perspective. They consider that distinct processor sources successively broadcast one message, and their goal is to load-balance this series of communications.…”

Section: Introductionmentioning

confidence: 99%

Complexity Results for Collective Communications on Heterogeneous Platforms

Beaumont¹,

Marchal²,

Robert

2006

The International Journal of High Performance Computing Applica

View full text Add to dashboard Cite

In this paper, we consider the communications involved in the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macro-communication schemes, for example to broadcast data items, either to all resources (broadcast) or to a restricted set of targets (multicast). Rather than aiming at minimizing the execution time of a single collective communication, we focus on the steady-state operation. We assume that there is a large number of messages to be broadcast or multicast in pipelined fashion, and we aim at maximizing the throughput, i.e. the (rational) number of messages which can be broadcast or multicast every timestep. We target heterogeneous platforms, modeled by a graph where resources have different communication and computation speeds. Achieving the best throughput may well require that the target platform is used in totality: different messages may need to be transferred along different paths.The main focus of the paper is on complexity results. We aim at presenting a unified framework for analyzing the complexity of collective communication schemes. We concentrate on the classification (whether maximizing the throughput is a polynomial or NP-hard problem), rather than actually providing efficient polynomial algorithms (when such algorithms are known, we refer to bibliographical pointers).

show abstract

Generating an efficient broadcast sequence using reflected Gray codes

Cited by 4 publications

References 13 publications

Scheduling for atomic broadcast operation in heterogeneous networks with one port model

Scheduling for atomic broadcast operation in heterogeneous networks with one port model

Pipelining broadcasts on heterogeneous platforms

Complexity Results for Collective Communications on Heterogeneous Platforms

Contact Info

Product

Resources

About