Optimal scheduling for two-processor systems
β Scribed by E. G. Coffman; R. L. Graham
- Publisher
- Springer-Verlag
- Year
- 1972
- Tongue
- English
- Weight
- 639 KB
- Volume
- 1
- Category
- Article
- ISSN
- 0001-5903
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A new model is presented to describe data-flow algorithms implemented in a multiprocessing system. Called the resource/data flow graph (RDFG), the model explicitly represents cyclo-statie processor schedules as circuits of processor ares that reflect the order that processors execute graph nodes. Th
We consider a reader-writer system consisting of a single server and a fixed number of jobs (or customers) belonging to two classes. Class one jobs are called readers and any number of them can be processed simultaneously. Class two jobs are called writers and they have to be processed one at a time