Partitioned EDF scheduling for multiprocessors using a \(C=D\) task splitting scheme

DOI10.1007/S11241-011-9126-9zbMath1243.68101OpenAlexW2085383769MaRDI QIDQ438181

J. Herrera, H. S. Yoon

Publication date: 30 July 2012

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

Full work available at URL: https://doi.org/10.1007/s11241-011-9126-9

zbMATH Keywords

schedulingmultiprocessorsmulti-coretask-splitting

Mathematics Subject Classification ID

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

Related Items (6)

Quasi-partitioned scheduling: optimality and adaptation in multiprocessor real-time systems ⋮ Unified overhead-aware schedulability analysis for slot-based task-splitting ⋮ Multiprocessor real-time scheduling with arbitrary processor affinities: from practice to theory ⋮ FPSL, FPCL and FPZL schedulability analysis ⋮ Implementation and evaluation of global and partitioned scheduling in a real-time OS ⋮ Architecture aware semi partitioned real-time scheduling on multicore platforms

Cites Work

• Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
• Feasibility problems for recurring tasks on one processor
• Measuring the performance of schedulability tests
• A survey of hard real-time scheduling for multiprocessor systems
• New Algorithms for Bin Packing
• Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems
• Schedulability Analysis for Real-Time Systems with EDF Scheduling
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: Partitioned EDF scheduling for multiprocessors using a \(C=D\) task splitting scheme