New algorithms for resource reclaiming from precedence constrained tasks in multiprocessor real-time systems

DOI10.1006/JPDC.1997.1354MaRDI QIDQ1373864zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

multiprocessor real-time systemsscheduling of tasks

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

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

Cited in

(3)

• 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
• A new strategy for improving the effectiveness of resource reclaiming algorithms in multiprocessor real-time systems

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)