The feasibility of general task systems with precedence constraints on multiprocessor platforms

DOI10.1007/S11241-008-9054-5MaRDI QIDQ842732zbMATH OpenOpenAlexFDO

Authors Nathan Fisher, Sanjoy K. Baruah

Publication date 25 September 2009

Published in Real-Time Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11241-008-9054-5

zbMATH Keywords

earliest-deadline-first schedulingfeasibility analysisrecurrent task modelsresource-augmentation analysisschedulability analysis

Mathematics Subject Classification ID

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

Recommendations

• Multiprocessor scheduling under precedence constraints: polyhedral results
• scientific article; zbMATH DE number 622471
• Layer-based scheduling algorithms for multiprocessor-tasks with precedence constraints
• Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
• Probabilistic analysis of scheduling precedence constrained parallel tasks on multicomputers with contiguous processor allocation
• Processor utilization bounds for real-time systems with precedence constraints
• Priority-driven scheduling of periodic task systems on multiprocessors
• Lower bounds on precedence-constrained scheduling for parallel processors.

Cites work

• Dynamic- and static-priority scheduling of recurring real-time tasks
• scientific article; zbMATH DE number 3854804 (Why is no real title available?)
• scientific article; zbMATH DE number 3337815 (Why is no real title available?)
• Optimal time-critical scheduling via resource augmentation
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines

Cited in

(5)

• Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems
• scientific article; zbMATH DE number 1247723 (Why is no real title available?)
• Feasibility Analysis of Conditional DAG Tasks
• Analysis of window-constrained execution time systems
• Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible

This page was built for publication: The feasibility of general task systems with precedence constraints on multiprocessor platforms

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