Parallel I/O scheduling using randomized, distributed edge coloring algorithms
- 31 May 2003
- journal article
- Published by Elsevier BV in Journal of Parallel and Distributed Computing
- Vol. 63 (6), 611-618
- https://doi.org/10.1016/s0743-7315(03)00015-7
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Near-optimal, distributed edge colouring via the nibble methodTheoretical Computer Science, 1998
- Heuristics for scheduling I/O operationsIEEE Transactions on Parallel and Distributed Systems, 1997
- Applying randomized edge coloring algorithms to distributed communicationPublished by Association for Computing Machinery (ACM) ,1995
- An Ω(√ log log n) lower bound for routing in optical networksPublished by Association for Computing Machinery (ACM) ,1994
- On contention resolution protocols and associated probabilistic phenomenaPublished by Association for Computing Machinery (ACM) ,1994
- High-speed switch scheduling for local-area networksACM Transactions on Computer Systems, 1993
- A doubly logarithmic communication algorithm for the completely connected optical communication parallel computerPublished by Association for Computing Machinery (ACM) ,1993
- Scheduling parallel I/O operations in multiple bus systemsJournal of Parallel and Distributed Computing, 1992
- Efficient optical communication in parallel computersPublished by Association for Computing Machinery (ACM) ,1992
- Removing randomness in parallel computation without a processor penaltyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988