Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling

Noga Alon; Gil Kalai; Moty Ricklin; Larry Stockmeyer

doi:10.1109/SFCS.1992.267757

Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling

Noga Alon, Gil Kalai, Moty Ricklin, Larry Stockmeyer

Einstein Institute of Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

14 Scopus citations

Abstract

The authors prove a lower bound of Omega (log n/log log n) on the competitive ratio of any (deterministic or randomised) distributed algorithm for solving the mobile user problem on certain networks of n processors. The lower bound holds for various networks, including the hypercube, any network with sufficiently large girth, and any highly expanding graph. A similar Omega (log n/log log n) lower bound is proved for the competitive ratio of the maximum job delay of any distributed algorithm for solving a distributed scheduling problem on any of these networks. The proofs combine combinatorial techniques with tools from linear algebra and harmonic analysis and apply, in particular, a generalization of the vertex isoperimetric problem on the hypercube, which may be of independent interest.

Original language	English
Title of host publication	Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992
Publisher	IEEE Computer Society
Pages	334-343
Number of pages	10
ISBN (Electronic)	0818629002
DOIs	https://doi.org/10.1109/SFCS.1992.267757
State	Published - 1992
Event	33rd Annual Symposium on Foundations of Computer Science, FOCS 1992 - Pittsburgh, United States Duration: 24 Oct 1992 → 27 Oct 1992

Publication series

Name	Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Volume	1992-October
ISSN (Print)	0272-5428

Conference

Conference	33rd Annual Symposium on Foundations of Computer Science, FOCS 1992
Country/Territory	United States
City	Pittsburgh
Period	24/10/92 → 27/10/92

Bibliographical note

Publisher Copyright:
© 1992 IEEE.

Access to Document

10.1109/SFCS.1992.267757

Cite this

Alon, N., Kalai, G., Ricklin, M., & Stockmeyer, L. (1992). Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling. In Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992 (pp. 334-343). Article 267757 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; Vol. 1992-October). IEEE Computer Society. https://doi.org/10.1109/SFCS.1992.267757

@inproceedings{a0b603c2bdba427486b8ed5fee63e712,

title = "Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling",

abstract = "The authors prove a lower bound of Omega (log n/log log n) on the competitive ratio of any (deterministic or randomised) distributed algorithm for solving the mobile user problem on certain networks of n processors. The lower bound holds for various networks, including the hypercube, any network with sufficiently large girth, and any highly expanding graph. A similar Omega (log n/log log n) lower bound is proved for the competitive ratio of the maximum job delay of any distributed algorithm for solving a distributed scheduling problem on any of these networks. The proofs combine combinatorial techniques with tools from linear algebra and harmonic analysis and apply, in particular, a generalization of the vertex isoperimetric problem on the hypercube, which may be of independent interest.",

author = "Noga Alon and Gil Kalai and Moty Ricklin and Larry Stockmeyer",

note = "Publisher Copyright: {\textcopyright} 1992 IEEE.; 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992 ; Conference date: 24-10-1992 Through 27-10-1992",

year = "1992",

doi = "10.1109/SFCS.1992.267757",

language = "אנגלית",

series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",

publisher = "IEEE Computer Society",

pages = "334--343",

booktitle = "Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992",

address = "ארצות הברית",

}

Alon, N, Kalai, G, Ricklin, M & Stockmeyer, L 1992, Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling. in Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992., 267757, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, vol. 1992-October, IEEE Computer Society, pp. 334-343, 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992, Pittsburgh, United States, 24/10/92. https://doi.org/10.1109/SFCS.1992.267757

Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling. / Alon, Noga; Kalai, Gil; Ricklin, Moty et al.
Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society, 1992. p. 334-343 267757 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; Vol. 1992-October).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling

AU - Alon, Noga

AU - Kalai, Gil

AU - Ricklin, Moty

AU - Stockmeyer, Larry

PY - 1992

Y1 - 1992

N2 - The authors prove a lower bound of Omega (log n/log log n) on the competitive ratio of any (deterministic or randomised) distributed algorithm for solving the mobile user problem on certain networks of n processors. The lower bound holds for various networks, including the hypercube, any network with sufficiently large girth, and any highly expanding graph. A similar Omega (log n/log log n) lower bound is proved for the competitive ratio of the maximum job delay of any distributed algorithm for solving a distributed scheduling problem on any of these networks. The proofs combine combinatorial techniques with tools from linear algebra and harmonic analysis and apply, in particular, a generalization of the vertex isoperimetric problem on the hypercube, which may be of independent interest.

AB - The authors prove a lower bound of Omega (log n/log log n) on the competitive ratio of any (deterministic or randomised) distributed algorithm for solving the mobile user problem on certain networks of n processors. The lower bound holds for various networks, including the hypercube, any network with sufficiently large girth, and any highly expanding graph. A similar Omega (log n/log log n) lower bound is proved for the competitive ratio of the maximum job delay of any distributed algorithm for solving a distributed scheduling problem on any of these networks. The proofs combine combinatorial techniques with tools from linear algebra and harmonic analysis and apply, in particular, a generalization of the vertex isoperimetric problem on the hypercube, which may be of independent interest.

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

U2 - 10.1109/SFCS.1992.267757

DO - 10.1109/SFCS.1992.267757

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84971761241

T3 - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

SP - 334

EP - 343

BT - Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992

PB - IEEE Computer Society

T2 - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992

Y2 - 24 October 1992 through 27 October 1992

ER -

Alon N, Kalai G, Ricklin M, Stockmeyer L. Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling. In Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society. 1992. p. 334-343. 267757. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS). doi: 10.1109/SFCS.1992.267757

Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this