Doing-it-All with Bounded Work and Communication

We consider the Do-All problem, where \(p\) cooperating processors need to complete \(t\) similar and independent tasks in an adversarial setting. Here we deal with a synchronous message passing system with processors that are subject to crash failures. Efficiency of algorithms in this setting is me...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org
Main Authors: Chlebus, Bogdan S, Gąsieniec, Leszek, Kowalski, Dariusz R, Schwarzmann, Alexander A
Format: Paper
Language:English
Published: Ithaca Cornell University Library, arXiv.org 19.07.2018
Subjects:
Algorithms
Communication
Complexity
Crashes
Lower bounds
Message passing
Microprocessors
Processors
ISSN:2331-8422
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract We consider the Do-All problem, where \(p\) cooperating processors need to complete \(t\) similar and independent tasks in an adversarial setting. Here we deal with a synchronous message passing system with processors that are subject to crash failures. Efficiency of algorithms in this setting is measured in terms of work complexity (also known as total available processor steps) and communication complexity (total number of point-to-point messages). When work and communication are considered to be comparable resources, then the overall efficiency is meaningfully expressed in terms of effort defined as work + communication. We develop and analyze a constructive algorithm that has work \(O( t + p \log p\, (\sqrt{p\log p}+\sqrt{t\log t}\, ) )\) and a nonconstructive algorithm that has work \(O(t +p \log^2 p)\). The latter result is close to the lower bound \(\Omega(t + p \log p/ \log \log p)\) on work. The effort of each of these algorithms is proportional to its work when the number of crashes is bounded above by \(c\,p\), for some positive constant \(c < 1\). We also present a nonconstructive algorithm that has effort \(O(t + p ^{1.77})\).
AbstractList We consider the Do-All problem, where \(p\) cooperating processors need to complete \(t\) similar and independent tasks in an adversarial setting. Here we deal with a synchronous message passing system with processors that are subject to crash failures. Efficiency of algorithms in this setting is measured in terms of work complexity (also known as total available processor steps) and communication complexity (total number of point-to-point messages). When work and communication are considered to be comparable resources, then the overall efficiency is meaningfully expressed in terms of effort defined as work + communication. We develop and analyze a constructive algorithm that has work \(O( t + p \log p\, (\sqrt{p\log p}+\sqrt{t\log t}\, ) )\) and a nonconstructive algorithm that has work \(O(t +p \log^2 p)\). The latter result is close to the lower bound \(\Omega(t + p \log p/ \log \log p)\) on work. The effort of each of these algorithms is proportional to its work when the number of crashes is bounded above by \(c\,p\), for some positive constant \(c < 1\). We also present a nonconstructive algorithm that has effort \(O(t + p ^{1.77})\).
Author Schwarzmann, Alexander A
Kowalski, Dariusz R
Gąsieniec, Leszek
Chlebus, Bogdan S
Author_xml – sequence: 1
  givenname: Bogdan
  surname: Chlebus
  middlename: S
  fullname: Chlebus, Bogdan S
– sequence: 2
  givenname: Leszek
  surname: Gąsieniec
  fullname: Gąsieniec, Leszek
– sequence: 3
  givenname: Dariusz
  surname: Kowalski
  middlename: R
  fullname: Kowalski, Dariusz R
– sequence: 4
  givenname: Alexander
  surname: Schwarzmann
  middlename: A
  fullname: Schwarzmann, Alexander A
BookMark eNotzUtLAzEUQOEgCtbavcsB16n3JrlNsqzjEwpuCi5LJslo6jTReag_X0FXZ_edM3acS46MXSAslSGCK9d_p88lKrBLpRGP2ExIidwoIU7ZYhj2ACBWWhDJGYObkvILTyNfd131lcbX6rpMOcRQPZf-rXI5VHU5HKacvBtTyefspHXdEBf_nbPt3e22fuCbp_vHer3hjlBzCoCgkFrljYOGhNQuWt80GH20TpBH0G0I1Bj0rfVAuhEQW4tOtquIcs4u_9j3vnxMcRh3-zL1-fe4E2CFEZqMlj9F8kZM
ContentType Paper
Copyright 2018. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2018. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID 8FE
8FG
ABJCF
ABUWG
AFKRA
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
HCIFZ
L6V
M7S
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
DOI 10.48550/arxiv.1409.4711
DatabaseName ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central Essentials
ProQuest Central Database Suite (ProQuest)
ProQuest Technology Collection
ProQuest One Community College
ProQuest Central Korea
SciTech Premium Collection
ProQuest Engineering Collection
Engineering Database
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
DatabaseTitle Publicly Available Content Database
Engineering Database
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest One Academic UKI Edition
ProQuest Central Korea
Materials Science & Engineering Collection
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
Engineering Collection
DatabaseTitleList Publicly Available Content Database
Database_xml – sequence: 1
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Physics
EISSN 2331-8422
Genre Working Paper/Pre-Print
GroupedDBID 8FE
8FG
ABJCF
ABUWG
AFKRA
ALMA_UNASSIGNED_HOLDINGS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
FRJ
HCIFZ
L6V
M7S
M~E
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
ID FETCH-LOGICAL-a517-5d010415f4c8a0b5237ae9cbb1ece9a25c107fdd5b81cf9c057b20ef91a3f6e13
IEDL.DBID M7S
IngestDate Mon Jun 30 09:32:56 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a517-5d010415f4c8a0b5237ae9cbb1ece9a25c107fdd5b81cf9c057b20ef91a3f6e13
Notes SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
OpenAccessLink https://www.proquest.com/docview/2092827587?pq-origsite=%requestingapplication%
PQID 2092827587
PQPubID 2050157
ParticipantIDs proquest_journals_2092827587
PublicationCentury 2000
PublicationDate 20180719
PublicationDateYYYYMMDD 2018-07-19
PublicationDate_xml – month: 07
  year: 2018
  text: 20180719
  day: 19
PublicationDecade 2010
PublicationPlace Ithaca
PublicationPlace_xml – name: Ithaca
PublicationTitle arXiv.org
PublicationYear 2018
Publisher Cornell University Library, arXiv.org
Publisher_xml – name: Cornell University Library, arXiv.org
SSID ssj0002672553
Score 1.6607506
SecondaryResourceType preprint
Snippet We consider the Do-All problem, where \(p\) cooperating processors need to complete \(t\) similar and independent tasks in an adversarial setting. Here we deal...
SourceID proquest
SourceType Aggregation Database
SubjectTerms Algorithms
Communication
Complexity
Crashes
Lower bounds
Message passing
Microprocessors
Processors
Title Doing-it-All with Bounded Work and Communication
URI https://www.proquest.com/docview/2092827587
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEA7aKnjyjY9a9uA1dbPdbDYnsdqioGXRIvVU8phAobR1txZ_vpN1q4jgxWNIDhkmzMz3zWSGkPPIsFA6llIbqgQBigYqueM0TRwAc4igy2bPz_ei30-HQ5lVhFtRlVWubGJpqO3MeI4cQbpEdIDRrbicv1I_NcpnV6sRGuuk7rsksLJ07-mLY4kSgRFz-zM7WbbuulD5-3jZ8l2eWmiW2S8LXLqV3vZ_L7RD6pmaQ75L1mC6RzbLck5T7JPwZoYuiY4X9GoyCTzXGnT8_CSwgWfHAzW1wY-vIQdk0OsOrm9pNRuBKo5-hVuPoxh3sUlVqBFNCgXSaM3AgFQRRxUIZy3XKTNOGozKdBSCk0y1XQKsfUhq09kUjkiAB-I4tM6FQsdRBAoSsJESieZKWJYck8ZK_lH1vovRt_Anf2-fki0MMVLPhjLZILVF_gZnZMMsF-Mib5J6p9vPHpul2nCV3T1kLx-IIqKN
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LTwIxEJ4gaPTkOz5Q96DHxW1hHz0YoyKBgIREYriRbjtNSAggi6g_yv_odAGNMfHGwXM3TbePme_7Op0BOOeKecKwyNWeDIigxOgK3_huFBhEZohBp8menxphsxl1OqKVgY_FWxgbVrmwiamh1kNlNXIi6YLYAaHb8Hr07NqqUfZ2dVFCY7Yt6vj-SpQtuaqVaX0vOK_ct--q7ryqgCt9ssi-tgyE-aakIunFxMNCiULFMUOFQnKfBh8arf04YsoIRXgm5h4awWTRBMiK1O0K5AhFcJFGCj5-STo8CAmgF2eXoWmmsEs5futNCzapVIG8APtl8FMvVtn8Z_-_BbmWHOF4GzI42IG1NFhVJbvglYfkcN3exL3p9x2rJDu3tjoUasdq_44caOfHw5c9aC9jjPuQHQwHeAAOfVAqedoYL4xLnKPEADWXYRD7MtQsOIT8Yrq789ObdL_n-ujv5jNYr7YfGt1GrVk_hg0CU5HVfZnIQ3YyfsETWFXTSS8Zn6Y7xYHuklfmE-RJ_HQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Doing-it-All+with+Bounded+Work+and+Communication&rft.jtitle=arXiv.org&rft.au=Chlebus%2C+Bogdan+S&rft.au=G%C4%85sieniec%2C+Leszek&rft.au=Kowalski%2C+Dariusz+R&rft.au=Schwarzmann%2C+Alexander+A&rft.date=2018-07-19&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422&rft_id=info:doi/10.48550%2Farxiv.1409.4711