Sciweavers

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

12

IPPS
2007
IEEE

favoriteEmaildiscussreport

130views Distributed And Parallel Com...» more IPPS 2007»

Competitive Analysis of Partitioned Scheduling on Uniform Multiprocessors

13 years 11 months ago

Competitive Analysis of Partitioned Scheduling on Uniform Multiprocessors

Download www.cecs.uci.edu

Consider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed Sp. Tasks can be preempted but they cannot migrate between processors. We propose an algorithm which can schedule all task sets that any other possible algorithm can schedule assuming that our algorithm is given processors that are three times faster.

Björn Andersson, Eduardo Tovar

Real-time Traffic

Distributed And Parallel Computing | IPPS 2007 | Meeting Deadlines | Speed Sp | Uniform Multiprocessor |

claim paper

Related Content

» Task Assignment on Uniform Heterogeneous Multiprocessors

» FaultTolerant Partitioning Scheduling Algorithms in RealTime Multiprocessor Systems

» Competitive TwoLevel Adaptive Scheduling Using Resource Augmentation

» The Case for Fair Multiprocessor Scheduling

» Responsetime analysis of arbitrarily activated tasks in multiprocessor systems with shared...

» Semipartitioned Scheduling of Sporadic Task Systems on Multiprocessors

» Partitioning Parallel Applications on Multiprocessor Reservations

» RealTime Scheduling with Task Splitting on Multiprocessors

» An AverageCase Analysis for RateMonotonic Multiprocessor RealTime Scheduling

Post Info
More Details (n/a)

Added	03 Jun 2010
Updated	03 Jun 2010
Type	Conference
Year	2007
Where	IPPS
Authors	Björn Andersson, Eduardo Tovar

Comments (0)