当前位置: X-MOL 学术Real-Time Syst. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Analysis techniques for supporting hard real-time sporadic gang task systems
Real-Time Systems ( IF 1.3 ) Pub Date : 2018-10-09 , DOI: 10.1007/s11241-018-9318-7
Zheng Dong , Cong Liu

This paper first studies the problem of scheduling hard real-time sporadic gang task systems under global earliest-deadline-first on a multiprocessor platform, where a gang application’s threads need to be concurrently scheduled on distinct processors. A novel approach combining new lag-based reasoning and executing/non-executing gang interval analysis technique is introduced, which is able to characterize the parallelism-induced idleness, as a key challenge of analyzing gang task schedules. To the best of our knowledge, this approach yields the first utilization-based test for hard real-time gang task systems. To further handle the clustered scheduling scenario, we propose a partitioning scheme that enables a set of gang tasks to be efficiently assigned and scheduled among multiple clusters.

中文翻译:

支持硬实时零星帮派任务系统的分析技术

本文首先研究了在多处理器平台上在全局最早截止日期优先下调度硬实时零星帮派任务系统的问题,其中帮派应用程序的线程需要在不同的处理器上并发调度。引入了一种结合新的基于滞后的推理和执行/非执行 gang 间隔分析技术的新方法,该方法能够表征并行性引起的空闲,作为分析 gang 任务调度的关键挑战。据我们所知,这种方法产生了第一个针对硬实时帮派任务系统的基于利用率的测试。为了进一步处理集群调度场景,我们提出了一种分区方案,可以在多个集群之间有效地分配和调度一组帮派任务。
更新日期:2018-10-09
down
wechat
bug