Speed scaling of processes with arbitrary speedup curves on a multiprocessor

We consider the setting of a multiprocessor where the speeds of the m processors can be individually scaled. Jobs arrive over time and have varying degrees of parallelizability. A nonclairvoyant scheduler must assign the jobs to processors, and scale the speeds of the processors. We consider the objective of energy plus flow time. For jobs that may have side effects or that are not checkpointable, we show an (m(-1)/2 ) bound on the competitive ratio of any deterministic algorithm. Here m is the number of processors and is the exponent of the power function. For checkpointable jobs without side effects, we give an O(log m)competitive algorithm. Thus for jobs that may have side effects or that are not checkpointable, the achievable competitive ratio grows quickly with the number of processors, but for checkpointable jobs without side effects, the achievable competitive ratio grows slowly with the number of processors. We then show a lower bound of (log1/ m) on the competitive ratio of ...

• Type: Conference
• Year: 2009
• Where: SPAA
• Authors: Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs
• Keywords: Achievable Competitive Ratio, Checkpointable Jobs, O(log M)competitive Algorithm, Parallel Computing, SPAA 2009