Brief Announcement: Optimally work-competitive scheduling for cooperative computing with merging groups

Chryssis Georgiou, Alexander Russell, Alex A. Shvartsman

Research output: Contribution to conferencePaperpeer-review

Abstract

The development of algorithms with guaranteed work efficiency for any pattern of fragmentations and merges of the underlying network is addressed. Current results are discussed for the abstract setting where asynchronous processors start performing tasks in isolation and where an adversary can force an arbitrary pattern of merges. Following a merge, processors are able to share their knowledge about the computational progress prior to the merge.

Original languageEnglish (US)
Pages132
Number of pages1
StatePublished - 2002
Externally publishedYes
EventProceedings of the Twenty - First Annual ACM Symposium on Principles of Distributed Computing PODC 2002 - Monterey, CA, United States
Duration: Jul 21 2002Jul 24 2002

Conference

ConferenceProceedings of the Twenty - First Annual ACM Symposium on Principles of Distributed Computing PODC 2002
Country/TerritoryUnited States
CityMonterey, CA
Period7/21/027/24/02

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Brief Announcement: Optimally work-competitive scheduling for cooperative computing with merging groups'. Together they form a unique fingerprint.

Cite this