## Guest Editorial on Multiprocessor Operating Systems This special issue on multiprocessor operating systems started with a discussion at Sandia National Labs during the summer of 1995. We had heard rumors that USENIX Computing Systems would soon be ceasing publication, and USENIX had recently co
Guest editorial: multiprocessor scheduling
β Scribed by Alan Burns, Laurent George
- Book ID
- 118811197
- Publisher
- Springer US
- Year
- 2013
- Tongue
- English
- Weight
- 153 KB
- Volume
- 49
- Category
- Article
- ISSN
- 0922-6443
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We show that the greedy highest density first (HDF) algorithm is (1 + )-speed O(1)-competitive for the problem of minimizing the p norms of weighted flow time on m identical machines. Similar results for minimizing unweighted flow provide insight into the power of migration.
Most papers in the scheduling field assume that a job can be processed by only one machine at a time. Namely, they use a one-job-on-one-machine model. In many industry settings, this may not be an adequate model. Motivated by human resource planning, diagnosable microprocessor systems, berth allocat