Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Leader Election in Asynchronous Distributed Systems
IEEE Transactions on Computers
MPI: The Complete Reference
A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
SIAM Journal on Matrix Analysis and Applications
On Distributed Snapshot Algorithms
APDC '97 Proceedings of the 1997 Advances in Parallel and Distributed Computing Conference (APDC '97)
LAPACK Working Note 95: ScaLAPACK: A Portable Linear Algebra Library for Distributed Memory Computers -- Design Issues and Performance
Elections in a Distributed Computing System
IEEE Transactions on Computers
Hybrid scheduling for the parallel solution of linear systems
Parallel Computing - Parallel matrix algorithms and applications (PMAA'04)
| Hi-index | 0.00 |
We consider a distributed asynchronous system where processes can only communicate by message passing and need a coherent view of the load (e.g., workload, memory) of others to take dynamic decisions (scheduling). We present several mechanisms to obtain a distributed view of such information, based either on maintaining that view or demand-driven with a snapshot algorithm. We perform an experimental study in the context of a real application, an asynchronous parallel solver for large sparse systems of linear equations.