Pages that link to "Item:Q1208588"
From MaRDI portal
The following pages link to Scheduling parallel I/O operations in multiple bus systems (Q1208588):
Displayed 7 items.
- Analysis of approximate algorithms for edge-coloring bipartite graphs (Q673614) (← links)
- Near-optimal, distributed edge colouring via the nibble method (Q1274333) (← links)
- Scheduling multiprocessor tasks -- An overview (Q1278297) (← links)
- Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors (Q1904737) (← links)
- Some simple distributed algorithms for sparse networks (Q5138354) (← links)
- Distributed deterministic edge coloring using bounded neighborhood independence (Q5920296) (← links)
- Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness (Q5961604) (← links)