Guest editorial: special issue on Real-Time and Network Systems
- 134 Downloads
The paper entitled “Real-Time Multiprocessor Locks with Nesting: Optimizing the Common Case” is written by Catherine E. Nemitz, Tanya Amert and James H. Anderson. The work proposes an efficient adaptation of real-time nested locking protocol that ensures contention-sensitive non-nested lock requests and incurs low lock/unlock overhead comparable to that of single-resource protocols. The authors have shown the schedulability benefits by presenting a large-scale schedulability study that compares their variants to existing protocols.
The paper entitled “A Parallel Branch-and-Bound Algorithm to Compute a Tighter Tardiness Bound for Preemptive Global EDF” is written by Mauro Leoncini, Manuela Montangero and Paolo Valente. The paper introduces a parallel exact algorithm, based on branch-and-bound algorithm, to compute an upper bound to tardiness of preemptive Global EDF schedulers. The authors have extensively compared their approach against existing polynomial-time algorithms.
The paper entitled “Schedulability Analysis of DAG Tasks with Arbitrary Deadlines under Global Fixed-Priority Scheduling” is written by José Fonseca, Geoffrey Nelissen and Vincent Nélis. The work proposes an improved response time analysis for the global fixed-priority (G-FP) scheduling of sporadic real-time tasks when each task is modeled by a directed acyclic graph (DAG) of concurrent sub-tasks. Their approach shows significant improvements on the schedulability of DAG tasks for randomly generated task sets compared to state-of-the-art techniques.
The paper entitled “Hard Real-Time Application Mapping Reconfiguration for NoC-Based Many-Core Systems” is written by Behnaz Pourmohseni, Stefan Wildermann, Michael Glaß and Jürgen Teich. The work introduces a reconfiguration methodology to enable predictable reconfigurations among a given set of pre-computed mappings. A case study on thermal management of many-core systems highlights the benefits of the approach.