Performing Work with Asynchronous Processors: Message-Delay-Sensitive Bounds

Dariusz R. Kowalski, Alex A. Shvartsman

Research output: Contribution to conferencePaper

Abstract

This paper considers the problem of performing tasks in asynchronous distributed settings. This problem, called Do-All, has been substantially studied in synchronous models, but there is a dearth of efficient algorithms for asynchronous message-passing processors. Do-All can be trivially solved without any communication by an algorithm where each processor performs all tasks. Assuming p processors and t tasks, this requires work Θ(p · t). Thus it is important to develop subquadratic solutions (when p and t are comparable) by trading computation for communication. Following the observation that it is not possible to obtain subquadratic work when the message delay d is substantial, e.g., d = Θ(t), this work pursues a message-delay-sensitive approach. Here the upper bounds on work and communication are given as functions of p, t, and d, the upper bound on message delays, however algorithms have no knowledge of d and they cannot rely on the existence of an upper bound on d. This paper presents two families of asynchronous algorithms achieving, for the first time, subquadratic work as long as d = o(t). The first family uses as its basis a shared-memory algorithm without having to emulate atomic registers assumed by that algorithm. The second family uses specific permutations of tasks, with certain combinatorial properties, to sequence the work of the processors. Another important contribution in this work is the first delay-sensitive lower bound for this problem that helps explain the behavior of our algorithms.

Original languageEnglish (US)
Pages265-274
Number of pages10
StatePublished - Dec 1 2003
Externally publishedYes
EventTwenty-Second Annual ACM Symposium on Principles of Distributed Computing, PODC 2003 - Boston, MA, United States
Duration: Jul 13 2003Jul 16 2003

Conference

ConferenceTwenty-Second Annual ACM Symposium on Principles of Distributed Computing, PODC 2003
CountryUnited States
CityBoston, MA
Period7/13/037/16/03

Fingerprint

Communication
Message passing
Data storage equipment

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Kowalski, D. R., & Shvartsman, A. A. (2003). Performing Work with Asynchronous Processors: Message-Delay-Sensitive Bounds. 265-274. Paper presented at Twenty-Second Annual ACM Symposium on Principles of Distributed Computing, PODC 2003, Boston, MA, United States.

Performing Work with Asynchronous Processors : Message-Delay-Sensitive Bounds. / Kowalski, Dariusz R.; Shvartsman, Alex A.

2003. 265-274 Paper presented at Twenty-Second Annual ACM Symposium on Principles of Distributed Computing, PODC 2003, Boston, MA, United States.

Research output: Contribution to conferencePaper

Kowalski, DR & Shvartsman, AA 2003, 'Performing Work with Asynchronous Processors: Message-Delay-Sensitive Bounds', Paper presented at Twenty-Second Annual ACM Symposium on Principles of Distributed Computing, PODC 2003, Boston, MA, United States, 7/13/03 - 7/16/03 pp. 265-274.
Kowalski DR, Shvartsman AA. Performing Work with Asynchronous Processors: Message-Delay-Sensitive Bounds. 2003. Paper presented at Twenty-Second Annual ACM Symposium on Principles of Distributed Computing, PODC 2003, Boston, MA, United States.
Kowalski, Dariusz R. ; Shvartsman, Alex A. / Performing Work with Asynchronous Processors : Message-Delay-Sensitive Bounds. Paper presented at Twenty-Second Annual ACM Symposium on Principles of Distributed Computing, PODC 2003, Boston, MA, United States.10 p.
@conference{b34a873a8ea04f45b432cf998302ba26,
title = "Performing Work with Asynchronous Processors: Message-Delay-Sensitive Bounds",
abstract = "This paper considers the problem of performing tasks in asynchronous distributed settings. This problem, called Do-All, has been substantially studied in synchronous models, but there is a dearth of efficient algorithms for asynchronous message-passing processors. Do-All can be trivially solved without any communication by an algorithm where each processor performs all tasks. Assuming p processors and t tasks, this requires work Θ(p · t). Thus it is important to develop subquadratic solutions (when p and t are comparable) by trading computation for communication. Following the observation that it is not possible to obtain subquadratic work when the message delay d is substantial, e.g., d = Θ(t), this work pursues a message-delay-sensitive approach. Here the upper bounds on work and communication are given as functions of p, t, and d, the upper bound on message delays, however algorithms have no knowledge of d and they cannot rely on the existence of an upper bound on d. This paper presents two families of asynchronous algorithms achieving, for the first time, subquadratic work as long as d = o(t). The first family uses as its basis a shared-memory algorithm without having to emulate atomic registers assumed by that algorithm. The second family uses specific permutations of tasks, with certain combinatorial properties, to sequence the work of the processors. Another important contribution in this work is the first delay-sensitive lower bound for this problem that helps explain the behavior of our algorithms.",
author = "Kowalski, {Dariusz R.} and Shvartsman, {Alex A.}",
year = "2003",
month = "12",
day = "1",
language = "English (US)",
pages = "265--274",
note = "Twenty-Second Annual ACM Symposium on Principles of Distributed Computing, PODC 2003 ; Conference date: 13-07-2003 Through 16-07-2003",

}

TY - CONF

T1 - Performing Work with Asynchronous Processors

T2 - Message-Delay-Sensitive Bounds

AU - Kowalski, Dariusz R.

AU - Shvartsman, Alex A.

PY - 2003/12/1

Y1 - 2003/12/1

N2 - This paper considers the problem of performing tasks in asynchronous distributed settings. This problem, called Do-All, has been substantially studied in synchronous models, but there is a dearth of efficient algorithms for asynchronous message-passing processors. Do-All can be trivially solved without any communication by an algorithm where each processor performs all tasks. Assuming p processors and t tasks, this requires work Θ(p · t). Thus it is important to develop subquadratic solutions (when p and t are comparable) by trading computation for communication. Following the observation that it is not possible to obtain subquadratic work when the message delay d is substantial, e.g., d = Θ(t), this work pursues a message-delay-sensitive approach. Here the upper bounds on work and communication are given as functions of p, t, and d, the upper bound on message delays, however algorithms have no knowledge of d and they cannot rely on the existence of an upper bound on d. This paper presents two families of asynchronous algorithms achieving, for the first time, subquadratic work as long as d = o(t). The first family uses as its basis a shared-memory algorithm without having to emulate atomic registers assumed by that algorithm. The second family uses specific permutations of tasks, with certain combinatorial properties, to sequence the work of the processors. Another important contribution in this work is the first delay-sensitive lower bound for this problem that helps explain the behavior of our algorithms.

AB - This paper considers the problem of performing tasks in asynchronous distributed settings. This problem, called Do-All, has been substantially studied in synchronous models, but there is a dearth of efficient algorithms for asynchronous message-passing processors. Do-All can be trivially solved without any communication by an algorithm where each processor performs all tasks. Assuming p processors and t tasks, this requires work Θ(p · t). Thus it is important to develop subquadratic solutions (when p and t are comparable) by trading computation for communication. Following the observation that it is not possible to obtain subquadratic work when the message delay d is substantial, e.g., d = Θ(t), this work pursues a message-delay-sensitive approach. Here the upper bounds on work and communication are given as functions of p, t, and d, the upper bound on message delays, however algorithms have no knowledge of d and they cannot rely on the existence of an upper bound on d. This paper presents two families of asynchronous algorithms achieving, for the first time, subquadratic work as long as d = o(t). The first family uses as its basis a shared-memory algorithm without having to emulate atomic registers assumed by that algorithm. The second family uses specific permutations of tasks, with certain combinatorial properties, to sequence the work of the processors. Another important contribution in this work is the first delay-sensitive lower bound for this problem that helps explain the behavior of our algorithms.

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

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

M3 - Paper

AN - SCOPUS:0347076899

SP - 265

EP - 274

ER -