scientific article; zbMATH DE number 7559355

DOI10.4230/LIPIcs.ECRTS.2019.21MaRDI QIDQ5089127

Björn B. Brandenburg, Mitra Nasri, Geoffrey Nelissen

Publication date: 18 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

precedence constraintsOpenMPschedulability analysisglobal multiprocessor schedulingworst-case response timenon-preemptive jobsparallel DAG tasks

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling
• Periodicity of real-time schedules for dependent periodic tasks on identical multiprocessor platforms
• Feasibility analysis of sporadic real-time multiprocessor task systems
• Schedulability analysis of DAG tasks with arbitrary deadlines under global fixed-priority scheduling
• Measuring the performance of schedulability tests
• The non-preemptive scheduling of periodic tasks upon multiprocessors
• Combinatorial abstraction refinement for feasibility analysis of static priorities
• Energy-Efficient Multi-Core Scheduling for Real-Time DAG Tasks
• Improved Schedulability Analysis Using Carry-In Limitation for Non-Preemptive Fixed-Priority Multiprocessor Scheduling
• Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks

This page was built for publication: