Partitioning sporadic task systems upon memory-constrained multiprocessors

Authors:
Sanjoy Baruah
Affiliations:
University of North Carolina
Venue:
ACM Transactions on Embedded Computing Systems (TECS)
Year:
2013

Citing 10
Cited 1

Utilization Bounds for N-Processor Rate MonotoneScheduling with Static Processor Assignment

Real-Time Systems
On multi-dimensional packing problems

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Speed is as powerful as clairvoyance

Journal of the ACM (JACM)
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
On Multidimensional Packing Problems

SIAM Journal on Computing
Rate monotonic vs. EDF: judgment day

Real-Time Systems
Task Partitioning upon Memory-Constrained Multiprocessors

RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
The partitioned dynamic-priority scheduling of sporadic task systems

Real-Time Systems
Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems

Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
A Lookup-Table Driven Approach to Partitioned Scheduling

RTAS '11 Proceedings of the 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium

Partitioned scheduling for real-time tasks on multiprocessor embedded systems with programmable shared srams

Proceedings of the tenth ACM international conference on Embedded software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most prior theoretical research on real-time partitioning algorithms for multiprocessor platforms has focused on ensuring that the cumulative computing requirements of the tasks assigned to each processor does not exceed the processor's processing power. However, computing capacity is often not the only limiting resource: on many multiprocessor platforms each individual computing unit may have limited amounts of multiple additional types of resources (such as local memory) in addition to having limited processing power. We present algorithms for partitioning a collection of sporadic tasks, each characterized by a WCET, a relative deadline, and a period, upon a multiprocessor platform in a manner that is cognizant of such additional constraints as well as the processing capacity constraints.