Scheduling parallel I/O operations in multiple bus systems

DOI10.1016/0743-7315(92)90018-IzbMath0786.68013OpenAlexW1982513108MaRDI QIDQ1208588

John Werth, Ravi Jain, Kiran Somalwar, 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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (8)

Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors ⋮ Near-optimal distributed edge coloring ⋮ Some simple distributed algorithms for sparse networks ⋮ Analysis of approximate algorithms for edge-coloring bipartite graphs ⋮ Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness ⋮ Distributed deterministic edge coloring using bounded neighborhood independence ⋮ Near-optimal, distributed edge colouring via the nibble method ⋮ Scheduling multiprocessor tasks -- An overview

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