Analysis techniques for supporting hard real-time sporadic gang task systems

DOI10.1007/S11241-018-9318-7zbMATH Open1436.68059OpenAlexW2785863796WikidataQ129160395 ScholiaQ129160395MaRDI QIDQ779459FDOQ779459

Authors: Zheng Dong, Cong Liu 

Publication date: 13 July 2020

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

Full work available at URL: https://doi.org/10.1007/s11241-018-9318-7

Recommendations

• scientific article; zbMATH DE number 1041071
• scientific article; zbMATH DE number 2147037
• Analyzing real-time systems: Theory and tools
• scientific article; zbMATH DE number 5115945
• Composition of Schedulability Analyses for Real-Time Multiprocessor Systems

zbMATH Keywords

hard real-timeearly deadline firstgang task system

Mathematics Subject Classification ID

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

Cites Work

• Computer vision. Algorithms and applications
• Priority-driven scheduling of periodic task systems on multiprocessors
• Title not available (Why is that?)
• Multi-core real-time scheduling for generalized parallel task models
• Integrating job parallelism in real-time scheduling theory
• Gang scheduling performance benefits for fine-grain synchronization
• Scheduling of hard real-time multi-phase multi-thread (MPMT) periodic tasks
• Optimal dataflow scheduling on a heterogeneous multiprocessor with reduced response time bounds

Cited In (2)

• A survey of real-time scheduling on multiprocessor systems
• Hard Real-Time Stationary GANG-Scheduling.

Uses Software

• HPCTOOLKIT

This page was built for publication: Analysis techniques for supporting hard real-time sporadic gang task systems

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