A Note on Optimal Time Broadcast in Faulty Hypercubes

David Peleg

doi:10.1006/jpdc.1995.1054

A Note on Optimal Time Broadcast in Faulty Hypercubes

David Peleg

Weizmann Institute of Science

Research output: Contribution to journal › Article › peer-review

11 Scopus citations

Abstract

This note describes an algorithm for broadcasting a message on the n-dimensional hypercube in optimal time (n time units) and optimal communication (2ⁿ - 1 messages) in the presence of up to n - 2 arbitrary node or edge faults, assuming the set of faults is known to all nodes of the hypercube.

Original language	English
Pages (from-to)	132-135
Number of pages	4
Journal	Journal of Parallel and Distributed Computing
Volume	26
Issue number	1
DOIs	https://doi.org/10.1006/jpdc.1995.1054
State	Published - Apr 1995
Externally published	Yes

Access to Document

10.1006/jpdc.1995.1054

Cite this

@article{3d2bbb9f574b498ba4e094fcbcfffe1c,

title = "A Note on Optimal Time Broadcast in Faulty Hypercubes",

abstract = "This note describes an algorithm for broadcasting a message on the n-dimensional hypercube in optimal time (n time units) and optimal communication (2n - 1 messages) in the presence of up to n - 2 arbitrary node or edge faults, assuming the set of faults is known to all nodes of the hypercube.",

author = "David Peleg",

year = "1995",

month = apr,

doi = "10.1006/jpdc.1995.1054",

language = "אנגלית",

volume = "26",

pages = "132--135",

journal = "Journal of Parallel and Distributed Computing",

issn = "0743-7315",

publisher = "Academic Press Inc.",

number = "1",

}

TY - JOUR

T1 - A Note on Optimal Time Broadcast in Faulty Hypercubes

AU - Peleg, David

PY - 1995/4

Y1 - 1995/4

N2 - This note describes an algorithm for broadcasting a message on the n-dimensional hypercube in optimal time (n time units) and optimal communication (2n - 1 messages) in the presence of up to n - 2 arbitrary node or edge faults, assuming the set of faults is known to all nodes of the hypercube.

AB - This note describes an algorithm for broadcasting a message on the n-dimensional hypercube in optimal time (n time units) and optimal communication (2n - 1 messages) in the presence of up to n - 2 arbitrary node or edge faults, assuming the set of faults is known to all nodes of the hypercube.

UR - http://www.scopus.com/inward/record.url?scp=0040705615&partnerID=8YFLogxK

U2 - 10.1006/jpdc.1995.1054

DO - 10.1006/jpdc.1995.1054

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0040705615

SN - 0743-7315

VL - 26

SP - 132

EP - 135

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

IS - 1

ER -

A Note on Optimal Time Broadcast in Faulty Hypercubes

Abstract

Access to Document

Other files and links

Fingerprint

Cite this