Scheduling parallel I/O operations in multiple bus systems

DOI10.1016/0743-7315(92)90018-IzbMATH Open0786.68013OpenAlexW1982513108MaRDI QIDQ1208588FDOQ1208588

Authors: Ravi Jain, Kiran Somalwar, John Werth, James C. Browne 

Publication date: 16 May 1993

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-7315(92)90018-i

Recommendations

• Parallel I/O scheduling using randomized, distributed edge coloring algorithms.
• Scheduling problems in a practical allocation model
• Publication:4945532
• An approach to parallel algorithm design
• scientific article; zbMATH DE number 1487630

zbMATH Keywords

schedulingparallelismcoloring of bipartite graphinput/output bottleneckmultiprocessor system performanceparallelism of \(I/O\) systems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cited In (10)

• Near-optimal, distributed edge colouring via the nibble method
• Parallel I/O scheduling using randomized, distributed edge coloring algorithms.
• Near-optimal distributed edge coloring
• Distributed deterministic edge coloring using bounded neighborhood independence
• Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness
• Scheduling multiprocessor tasks -- An overview
• Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors
• Scheduling memory accesses through a shared bus
• Some simple distributed algorithms for sparse networks
• Analysis of approximate algorithms for edge-coloring bipartite graphs

This page was built for publication: Scheduling parallel I/O operations in multiple bus systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1208588)