The greedy algorithm is optimal for on-line edge coloring
Information Processing Letters
Server-directed collective I/O in Panda
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
PPFS: a high performance portable parallel file system
ICS '95 Proceedings of the 9th international conference on Supercomputing
File-Access Characteristics of Parallel Scientific Workloads
IEEE Transactions on Parallel and Distributed Systems
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
Exploiting local data in parallel array I/O on a practical network of workstations
Proceedings of the fifth workshop on I/O in parallel and distributed systems
Galley: a new parallel file system for scientific applications
Galley: a new parallel file system for scientific applications
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
Routing and scheduling I/O transfers on wormhole-routed mesh networks
Journal of Parallel and Distributed Computing
Out-of-Core Streamline Visualization on Large Unstructured Meshes
IEEE Transactions on Visualization and Computer Graphics
Proceedings of the Second International Conference on Data Engineering
VIP-FS: a VIrtual, Parallel File System for high performance parallel and distributed computing
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
A Software Architecture for Massively Parallel Input-Output
PARA '96 Proceedings of the Third International Workshop on Applied Parallel Computing, Industrial Computation and Optimization
Parallel I/O scheduling using randomized, distributed edge coloring algorithms
Journal of Parallel and Distributed Computing
Performance of Parallel I/O Scheduling Strategies on a Network of Workstations
ICPADS '01 Proceedings of the Eighth International Conference on Parallel and Distributed Systems
Data Transfer Scheduling
PVFS: a parallel file system for linux clusters
ALS'00 Proceedings of the 4th annual Linux Showcase & Conference - Volume 4
Hi-index | 0.00 |
This paper studies distributed scheduling of parallel I/O data transfers on systems that provide data replication. In our previous work, we proposed a centralized algorithm for solving this problem in systems where data transfer information is centrally available. This algorithm finds the optimal scheduling by constructing augmenting paths in the data transfer bipartite graph, requiring O(nmlog n + {\text{n}}^{\text{2}} {\text{log}}^{\frac{3}{2}} n) time, with n nodes and m edges in the bipartite graph. In this paper, we investigate this scheduling problem in distributed systems where data transfer information may not be centrally available. We propose a distributed scheduling algorithm, Highest Degree Lowest Workload First (HDLWF), which approximates the augmenting path algorithm in distributed environments. HDLWF is based on a distributed, two-step scheme that determines appropriate execution order of data requests through a small number of rounds of bidding between clients and I/O servers. Our experimental results indicate that HDLWF yields schedules close to the centralized optimal solution, and in some cases within 3% of the optimal solution.