Unified overhead-aware schedulability analysis for slot-based task-splitting

DOI10.1007/S11241-014-9204-XzbMATH Open1314.68095OpenAlexW1992153785MaRDI QIDQ488236FDOQ488236

Pedro F. Souto, Konstantinos Bletsas, Paulo Baltarejo Sousa, Benny Akesson, Eduardo Tovar

Publication date: 23 January 2015

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

Full work available at URL: http://hdl.handle.net/10400.22/5407

zbMATH Keywords

schedulability analysismultiprocessor systemsslot-based task-splitting algorithmssystem overheads

Mathematics Subject Classification ID

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

Cites Work

• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Improved cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems
• Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
• Proportionate progress: A notion of fairness in resource allocation
• Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound
• Partitioned EDF scheduling for multiprocessors using a \(C=D\) task splitting scheme

Cited In (2)

• Title not available (Why is that?)
• Uneven memory regulation for scheduling IMA applications on multi-core platforms

Uses Software

• LITMUS

This page was built for publication: Unified overhead-aware schedulability analysis for slot-based task-splitting

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