Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups

DOI10.1137/S0097539704440442zbMath1075.68098OpenAlexW2069836237MaRDI QIDQ5317178

Alexander Russell, Chryssis Georgiou, Alexander A. Schwarzmann

Publication date: 16 September 2005

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539704440442

zbMATH Keywords

competitive analysison-line algorithmsrandomized algorithmsindependent tasksdistributed computationpartitionable networkswork complexity

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (8)

Distributed scheduling for disconnected cooperation ⋮ Performing work in broadcast networks ⋮ Dynamic load balancing with group communication ⋮ Dealing with undependable workers in decentralized network supercomputing ⋮ Emulating shared-memory do-all algorithms in asynchronous message-passing systems ⋮ Doing-it-all with bounded work and communication ⋮ A robust randomized algorithm to perform independent tasks ⋮ Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts

This page was built for publication: Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups