Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

34

ORL
2006

favoriteEmaildiscussreport

116views more ORL 2006»

Greedy multiprocessor server scheduling

13 years 11 months ago

Greedy multiprocessor server scheduling

Download www.cse.msu.edu

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.

Carl Bussema, Eric Torng

Real-time Traffic

Flow Time | Identical Machines | ORL 2006 | Unweighted Flow |

claim paper

Related Content

» RealTime Task Replication for Fault Tolerance in Identical Multiprocessor Systems

» Power Aware Scheduling for ANDOR Graphs in MultiProcessor RealTime Systems

» Scheduling Aperiodic Tasks Using Total Bandwidth Server on Multiprocessors

» Multiprocessor EDF and Deadline Monotonic Schedulability Analysis

» Heterogeneous multiprocessor scheduling with differential evolution

» Sporadic Server revisited

» On BestEffort Utility Accrual RealTime Scheduling on Multiprocessors

» Surplus Fair Scheduling A ProportionalShare CPU Scheduling Algorithm for Symmetric Multipr...

» Combined Scheduling of Hard and Soft RealTime Tasks in Multiprocessor Systems

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2006
Where	ORL
Authors	Carl Bussema, Eric Torng

Comments (0)