2011/06/14 by Luís Nogueira, Nogueira, Luís, Luís Miguel Pinho +1
Computer Science · #Distributed #Distributed and Parallel Computing Systems #FOS: Computer and information sciences #Operating Systems (cs.OS) #Parallel #Parallel Computing and Optimization Techniques #Real-Time Systems Scheduling #and Cluster Computing (cs.DC) #cs.DC #cs.OS
paper · pdf · doi:10.48550/arxiv.1106.2766
WiP Session of the 31st IEEE Real-Time Systems Symposium
arxiv created 2011/06/14 · openalex publication_date 2011/06/14 · arxiv updated 2011/06/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Developing an efficient server-based real-time scheduling solution that supports dynamic task-level parallelism is now relevant to even the desktop and embedded domains and no longer only to the high performance computing market niche. This paper proposes a novel approach that combines the constant bandwidth server abstraction with a work-stealing load balancing scheme which, while ensuring isolation among tasks, enables a task to be executed on more than one processor at a given time instant.