General purpose parallel architectures
Handbook of theoretical computer science (vol. A)
Fast randomized algorithms for distributed edge coloring
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Efficient optical communication in parallel computers
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
High-speed switch scheduling for local-area networks
ACM Transactions on Computer Systems (TOCS)
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
An Ω(√ log log n) lower bound for routing in optical networks
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
On contention resolution protocols and associated probabilistic phenomena
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Applying randomized edge coloring algorithms to distributed communication: an experimental study
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
SIAM Journal on Computing
Heuristics for Scheduling I/O Operations
IEEE Transactions on Parallel and Distributed Systems
Near-optimal, distributed edge colouring via the nibble method
ESA '95 Selected papers from the third European symposium on Algorithms
Nearly optimal distributed edge colouring in O(log log n) rounds
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Input/Output in Parallel and Distributed Computer Systems
Input/Output in Parallel and Distributed Computer Systems
Near-Optimal Distributed Edge Coloring
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Scheduling Data TTransfers in Parallel Computers and Communications Systems
Scheduling Data TTransfers in Parallel Computers and Communications Systems
Distributed Scheduling of Parallel I/O in the Presence of Data Replication
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Adaptive parallel I/O scheduling algorithm for multiprogrammed systems
Future Generation Computer Systems - Parallel input/output management techniques (PIOMT) in cluster and grid computing
PPM: a highly efficient parallel particle-mesh library for the simulation of continuum systems
Journal of Computational Physics
Adaptive parallel I/O scheduling algorithm for multiprogrammed systems
Future Generation Computer Systems - Parallel input/output management techniques (PIOMT) in cluster and grid computing
Distributed edge coloration for bipartite networks
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
On evaluating decentralized parallel I/O scheduling strategies for parallel file systems
VECPAR'06 Proceedings of the 7th international conference on High performance computing for computational science
Abstractions and Middleware for Petascale Computing and Beyond
International Journal of Distributed Systems and Technologies
| Hi-index | 0.01 |
A growing imbalance in CPU and I/O speeds has led to a communications bottleneck in distributed architectures, especially for data-intensive applications such as multimedia information systems, databases, and Grand Challenge problems. Our solution is to schedule parallel I/O operations explicitly. We present a class of decentralized scheduling algorithms that eliminate contention for I/O ports while maintaining an efficient use of bandwidth. These algorithms, based on edge-coloring and matching of bipartite graphs, rely upon simple heuristics to obtain shorter schedules. We use simulation to evaluate the ability of our algorithms to obtain near optimal solutions in a distributed context, and compare our work with that of other researchers. Our results show that our algorithms produce schedules within 5% of the optimal schedule, a substantial improvement over existing algorithms.