Analysis Techniques for Supporting Hard Real-Time Sporadic Gang Task Systems

Abstract

This paper studies the problem of scheduling hard real-time sporadic gang task systems under global earliest-deadline-first, 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 parallelisminduced 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.