Partitioned Scheduling of Sporadic Task Systems: an ILP-based approach

@inproceedings{Sanjoy2008PartitionedSO,
  title={Partitioned Scheduling of Sporadic Task Systems: an ILP-based approach},
  author={Baruah Sanjoy and Bini Enrico},
  year={2008}
}
The multiprocessor partitioned scheduling of sporadic task systems is considered. The problem of obtaining feasible partitionings under both Earliest Deadline First (EDF) and Fixed Priority (FP) scheduling is represented as integer linear programs comprised of binary (zero / one) integer variables only. 

Citations

Publications citing this paper.
SHOWING 1-10 OF 19 CITATIONS

Modeling Preemptive EDF and FP by Integer Variables

VIEW 10 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-10 OF 20 REFERENCES

Preemptively scheduling hard-real-time sporadic tasks on one processor

  • [1990] Proceedings 11th Real-Time Systems Symposium
  • 1990
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

A comparison of global and partitioned EDF schedulability tests for multiprocessors

T. P. BAKER
  • In Proceeding of the International Conference on Real-Time and Network Systems (Poitiers, France,
  • 2006
VIEW 2 EXCERPTS

Algorithms for Determining the Demand-Based Load of a Sporadic Task System

  • 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06)
  • 2006

The partitioned multiprocessor scheduling of sporadic task systems

  • 26th IEEE International Real-Time Systems Symposium (RTSS'05)
  • 2005

The partitioned scheduling of sporadic real-time tasks on multiprocessor platforms

  • 2005 International Conference on Parallel Processing Workshops (ICPPW'05)
  • 2005

Similar Papers

Loading similar papers…