New algorithms for resource reclaiming from precedence constrained tasks in multiprocessor real-time systems
DOI10.1006/JPDC.1997.1354zbMATH Open0888.68016OpenAlexW1974051526MaRDI QIDQ1373864FDOQ1373864
Authors: G. Manimaran, C. Siva Ram Murthy, Machiraju Vijay, Krithi Ramamritham 
Publication date: 17 December 1997
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/367af354893dfc04e67ba1d9200e6117740141ea
Recommendations
- A new strategy for improving the effectiveness of resource reclaiming algorithms in multiprocessor real-time systems
- M-CASH: A real-time resource reclaiming algorithm for multiprocessor platforms
- A new algorithm for scheduling periodic, real-time tasks
- Some algorithms for analysis and synthesis of real-time multiprocessor computing systems
- scientific article; zbMATH DE number 1192099
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cited In (3)
- A new strategy for improving the effectiveness of resource reclaiming algorithms in multiprocessor real-time systems
- M-CASH: A real-time resource reclaiming algorithm for multiprocessor platforms
- An applicable method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources
This page was built for publication: New algorithms for resource reclaiming from precedence constrained tasks in multiprocessor real-time systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373864)
