Scheduling parallel I/O operations in multiple bus systems
From MaRDI portal
Recommendations
Cited in
(11)- 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
- Scheduling multiprocessor tasks -- An overview
- Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness
- Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors
- Scheduling memory accesses through a shared bus
- Scheduling periodic I/O access with bi-colored chains: models and algorithms
- 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)