Minimum and Maximum Utilization Bounds for Multiprocessor RM Scheduling

@inproceedings{Lpez2001MinimumAM,
  title={Minimum and Maximum Utilization Bounds for Multiprocessor RM Scheduling},
  author={Jos{\'e} Mar{\'i}a L{\'o}pez and Jos{\'e} Luis D{\'i}az and Daniel F. Garc{\'i}a},
  booktitle={ECRTS},
  year={2001}
}
This paper deals with the problem of finding utilization bounds for multiprocessor Rate Monotonic scheduling with partitioning. The minimum and maximum utilization bounds among all the reasonable allocation algorithms are calculated. We prove that the utilization bound associated with the reasonable allocation heuristic Worst Fit (WF) is equal to that minimum. In addition, we prove that the utilization bound associated with the heuristics First Fit Decreasing (FFD) and Best Fit Decreasing (BFD… CONTINUE READING
Highly Cited
This paper has 55 citations. REVIEW CITATIONS
32 Extracted Citations
13 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 32 extracted citations

55 Citations

0510'05'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 55 citations based on the available data.

See our FAQ for additional information.

Referenced Papers

Publications referenced by this paper.

Similar Papers

Loading similar papers…