This book studies algorithmic issues associated with cooperative execution of multiple independent tasks by distributed computing agents including partitionable networks. It provides the most significant algorithmic solution developed and available today for do-all computing for distributed systems (including partitionable networks), and is the first monograph that deals with do-all computing for distributed systems. The book is structured to meet the needs of a professional audience composed of researchers and practitioners in industry. This volume is also suitable for graduate-level students in computer science.
Cited By
- Georgiou C and Kowalski D (2019). On the competitiveness of scheduling dynamically injected tasks on processes prone to crashes and restarts, Journal of Parallel and Distributed Computing, 84:C, (94-107), Online publication date: 1-Oct-2015.
- Fernández Anta A, Georgiou C, Kowalski D and Zavou E (2015). Online parallel scheduling of non-uniform tasks, Theoretical Computer Science, 590:C, (129-146), Online publication date: 26-Jul-2015.