|
|||||
|
|
Greedy multiprocessor server scheduling |
|
| Authors: | Carl Bussema |
| Institution: | Department of Computer Science and Engineering, Michigan State University, East Lansing, MI 48824, USA |
| Abstract: | 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. |
| Keywords: | Online scheduling Algorithms Flow Multiprocessor _method=retrieve& _eid=1-s2 0-S0167637705000933& _mathId=si4 gif& _pii=S0167637705000933& _issn=01676377& _acct=C000051805& _version=1& _userid=1154080& md5=89f9e82c989c5175f562805cbab55e06')" style="cursor:pointer ?p Norm" target="_blank">" alt="Click to view the MathML source" title="Click to view the MathML source">?p Norm Greedy |
| 本文献已被 ScienceDirect 等数据库收录！ | |