Resource sharing under server-based multiprocessor scheduling

Abstract

In this paper, we investigate a mechanism for handling resource sharing among tasks under a server-based scheduling technique in multiprocessor platforms, which combines partitioned and global scheduling to benefit a better scheduling method compared to conventional techniques.

Multiprocessor Real-Time Locking Protocols: A Systematic Review

“…Link-based global scheduling has been implemented and evaluated in LITMUS RT [35,52], a real-time extension of the Linux kernel. 3 critical section (on processor 1) blocked (shared resource locked)…”

“…A notable exception is Afshar et al's work [3] on semaphore protocols for semi-partitioned fixed-priority (SP-FP) scheduling. Since known techniques for partitioned scheduling are readily applicable to nonmigratory tasks, the novel challenge that must be addressed when targeting semi-partitioned systems is migratory tasks.…”

“…Since known techniques for partitioned scheduling are readily applicable to nonmigratory tasks, the novel challenge that must be addressed when targeting semi-partitioned systems is migratory tasks. To this end, Afshar et al [3] proposed two protocol variants, both using priority-ordered wait queues and priority boosting.…”

“…In the first protocol variant, the Migration-based Locking Protocol under Semi-Partitioned Scheduling (MLPS) [3], each task is assigned a marked processor on which it must execute all its critical sections.…”

“…(NMLPS) [3] lets migratory tasks execute their critical sections on their current processor (i.e., on whichever processor they happen to be executing at the time of lock acquisition). This avoids any superfluous migrations, but causes greater analysis uncertainty as it is now unclear on which processor a critical section will be executed.…”