Data Transfer Scheduling

Authors:
Kiran K Somalwar
Affiliations:
-
Venue:
Data Transfer Scheduling
Year:
1988

Citing 0
Cited 3

Scheduling parallel I/O operations

ACM SIGARCH Computer Architecture News - Special issue on input/output in parallel computer systems
Heuristics for Scheduling I/O Operations

IEEE Transactions on Parallel and Distributed 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of data transfer scheduling is a problem of multiple resource allocation. It is cast as an edge coloring problem. Several exact algorithms for edge coloring, in the literature, are described. A new algorithm for edge coloring, when no color can be used more than k times, is designed and analyzed. Several inexact algorithms are described and evaluated for their cost effectiveness.