Fast broadcast by the divide-and-conquer algorithm

Dongyoung Kim; Dongseung Kim

doi:10.1109/clustr.2004.1392653

ScienceGate Book Chapters

JOURNAL ARTICLE

Fast broadcast by the divide-and-conquer algorithm

Dongyoung Kim Dongseung Kim

Year: 2005 Pages: 487-488

DOI: 10.1109/clustr.2004.1392653

Get Full-Text PDF Get Analytical Report

Abstract

Collective communication functions including the broadcast in cluster computers usually take O(m log P) time in propagating the size-m message to P processors. We have devised a new O(m) broadcast algorithm, independent of the number of processors involved, by using divided-and-conquer algorithm. Details are given below.

Keywords:

Divide and conquer algorithms Computer science Parallel computing Atomic broadcast Algorithm Broadcasting (networking) Cluster (spacecraft) Theoretical computer science Computer network

Metrics

Cited By

0.80

FWCI (Field Weighted Citation Impact)

Refs

0.75

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Distributed systems and fault tolerance

Physical Sciences → Computer Science → Computer Networks and Communications

Interconnection Networks and Systems

Physical Sciences → Computer Science → Computer Networks and Communications

Optimization and Search Problems

Physical Sciences → Computer Science → Computer Networks and Communications

Fast broadcast by the divide-and-conquer algorithm

Abstract

Metrics

Topics

Related Documents

Unified Divide-and-Conquer Algorithm

DeWall: A fast divide and conquer Delaunay triangulation algorithm in Ed

A Fast Divide-and-Conquer Algorithm for Indexing Human Genome Sequences

A rigorous divide-and-conquer algorithm for fast DC-mode extraction

A Divide-and-Conquer Discretization Algorithm