An optimal multiprocessor real-time scheduling algorithm

DOI10.1006/JPDC.1997.1327MaRDI QIDQ1369218zbMATH OpenOpenAlexFDO

Authors Ashok Khemka, R. K. Shyamasundar

Publication date 1997

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/ee13ed728bba9bf2426f2a47c7ef16a100e59c14

zbMATH Keywords

optimal scheduling algorithm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• An optimal scheduling algorithm for preemptable real-time tasks
• Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach
• Some algorithms for analysis and synthesis of real-time multiprocessor computing systems
• A new algorithm for scheduling periodic, real-time tasks

Cited in

(17)

• An optimal scheduling algorithm for preemptable real-time tasks
• LSTF: A new scheduling policy for complex real-time tasks in multiple processor systems
• A fast task-to-processor assignment heuristic for real-time multiprocessor DSP applications
• A survey of real-time scheduling on multiprocessor systems
• Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach
• Optimal Scheduling of Digital Signal Processing Data-flow Graphs using Shortest-path Algorithms
• {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling
• Energy-optimal batching periods for asynchronous multistage data processing on sensor nodes: foundations and an mPlatform case study
• New strategies for assigning real-time tasks to multiprocessor systems
• The study of design optimization about single-processor scheduling algorithms in real-time system
• A composite algorithm for multiprocessor scheduling
• Optimal task scheduling algorithm for cyclic synchronous tasks in general multiprocessor networks
• {\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines
• An optimal boundary fair scheduling algorithm for multiprocessor real-time systems
• Real-time uniprocessor scheduling with fewer preemptions
• Performance bounds on multiprocessor scheduling strategies for statically allocated programs
• Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible

This page was built for publication: An optimal multiprocessor real-time scheduling algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1369218)