Packet distribution on a ring

David Peleg; Allen Van Gelder

doi:10.1016/0743-7315(89)90006-3

Packet distribution on a ring

David Peleg, Allen Van Gelder

Stanford University

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

4 Scopus citations

Abstract

The balanced packet distribution problem on a ring of n processors requires that randomly arriving packets be stored at nodes as evenly as possible by passing packets (and other messages) around the ring. We give a protocol to achieve balanced distribution with an average message complexity of √n per packet and to show that the protocol is optimal, up to lower order terms, for unidirectional rings.

Original language	English
Pages (from-to)	558-567
Number of pages	10
Journal	Journal of Parallel and Distributed Computing
Volume	6
Issue number	3
DOIs	https://doi.org/10.1016/0743-7315(89)90006-3
State	Published - Jun 1989
Externally published	Yes

Bibliographical note

Funding Information:
* Supported in part by a Weizmann fellowship and by Contract ONR NOOO1 4-85-C-073 1. t Current address: CIS, Applied Sciences, UCSC, Santa Cruz, CA 95064.

Access to Document

10.1016/0743-7315(89)90006-3License: CC BY-NC-ND

Cite this

@article{c1b78cc91d5347eab6e5485fbc086a17,

title = "Packet distribution on a ring",

abstract = "The balanced packet distribution problem on a ring of n processors requires that randomly arriving packets be stored at nodes as evenly as possible by passing packets (and other messages) around the ring. We give a protocol to achieve balanced distribution with an average message complexity of √n per packet and to show that the protocol is optimal, up to lower order terms, for unidirectional rings.",

author = "David Peleg and {Van Gelder}, Allen",

note = "Funding Information: * Supported in part by a Weizmann fellowship and by Contract ONR NOOO1 4-85-C-073 1. t Current address: CIS, Applied Sciences, UCSC, Santa Cruz, CA 95064.",

year = "1989",

month = jun,

doi = "10.1016/0743-7315(89)90006-3",

language = "אנגלית",

volume = "6",

pages = "558--567",

journal = "Journal of Parallel and Distributed Computing",

issn = "0743-7315",

publisher = "Academic Press Inc.",

number = "3",

}

TY - JOUR

T1 - Packet distribution on a ring

AU - Peleg, David

AU - Van Gelder, Allen

N1 - Funding Information: * Supported in part by a Weizmann fellowship and by Contract ONR NOOO1 4-85-C-073 1. t Current address: CIS, Applied Sciences, UCSC, Santa Cruz, CA 95064.

PY - 1989/6

Y1 - 1989/6

N2 - The balanced packet distribution problem on a ring of n processors requires that randomly arriving packets be stored at nodes as evenly as possible by passing packets (and other messages) around the ring. We give a protocol to achieve balanced distribution with an average message complexity of √n per packet and to show that the protocol is optimal, up to lower order terms, for unidirectional rings.

AB - The balanced packet distribution problem on a ring of n processors requires that randomly arriving packets be stored at nodes as evenly as possible by passing packets (and other messages) around the ring. We give a protocol to achieve balanced distribution with an average message complexity of √n per packet and to show that the protocol is optimal, up to lower order terms, for unidirectional rings.

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

U2 - 10.1016/0743-7315(89)90006-3

DO - 10.1016/0743-7315(89)90006-3

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

AN - SCOPUS:0024679927

SN - 0743-7315

VL - 6

SP - 558

EP - 567

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

IS - 3

ER -

Packet distribution on a ring

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this