Distributed scheduling for disconnected cooperation
From MaRDI portal
Publication:2375304
DOI10.1007/s00446-005-0149-0zbMath1266.68058OpenAlexW2023630812MaRDI QIDQ2375304
Grzegorz Malewicz, Alexander Russell, Alexander A. Schwarzmann
Publication date: 13 June 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-005-0149-0
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)
Related Items (6)
Distributed scheduling for disconnected cooperation ⋮ Dynamic load balancing with group communication ⋮ Emulating shared-memory do-all algorithms in asynchronous message-passing systems ⋮ Latin squares with bounded size of row prefix intersections ⋮ Local Fast Segment Rerouting on Hypercubes ⋮ Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic load balancing with group communication
- The square of a chordal graph
- Distributed scheduling for disconnected cooperation
- Latin squares with bounded size of row prefix intersections
- Weighted sums of certain dependent random variables
- Performing Work Efficiently in the Presence of Faults
- On the value of information in distributed decision-making (extended abstract)
- Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups
- Probability Inequalities for Sums of Bounded Random Variables
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Algorithms - ESA 2003
- Nested balanced incomplete block designs
This page was built for publication: Distributed scheduling for disconnected cooperation