Sciweavers

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

33

RTAS
2011
IEEE

favoriteEmaildiscussreport

331views Embedded Systems» more RTAS 2011»

A Lookup-Table Driven Approach to Partitioned Scheduling

12 years 8 months ago

A Lookup-Table Driven Approach to Partitioned Scheduling

Download www.cs.unc.edu

The partitioned preemptive EDF scheduling of implicitdeadline sporadic task systems on an identical multiprocessor platform is considered. Lookup tables, at any selected degree of accuracy, are pre-computed for the multiprocessor platform. By using these lookup tables, task partitioning can be performed in time polynomial in the representation of the task system being partitioned. Although the partitioning will not in general be optimal, the degree of deviation from optimality is bounded according to the degree of accuracy selected during the pre-computation of the lookup tables.

Bipasa Chattopadhyay, Sanjoy K. Baruah

Real-time Traffic

Embedded Systems | Lookup Tables | Multiprocessor | RTAS 2011 | Time Polynomial |

claim paper

Related Content

» Power constrained and defectprobability driven SoC test scheduling with test set partition...

» SchedulabilityDriven Partitioning and Mapping for MultiCluster RealTime Systems

» Performance and Interface Buffer Size Driven Behavioral Partitioning for Embedded Systems

» Physical placement driven by sequential timing analysis

» ModelDriven Architecture for Hard RealTime Systems From Platform Independent Models to Cod...

Post Info
More Details (n/a)

Added	22 Aug 2011
Updated	22 Aug 2011
Type	Journal
Year	2011
Where	RTAS
Authors	Bipasa Chattopadhyay, Sanjoy K. Baruah

Comments (0)