MrsP is a FIFO spin-based protocol that adopts a helping mechanism, where a resource holder can migrate to a remote processor to keep executing if it is preempted. In practice, allowing resource-holding tasks to migrate can raise implementation issues and run-time corner cases. In this paper, we present an investigation of the correctness and efficiency of implementing MrsP in fully partitioned systems. We identify potential race conditions and corner cases of the protocol due to the use of migrations. Then, new facilities are proposed to pre- vent the issues and to provide more efficient resource-accessing behaviours. Finally, evaluations are performed to demonstrate the impact of the run-time issues and to testify the effect of proposed f...
Spin locks are a synchronization mechanisms used to provide mutual exclusion to shared software reso...
This paper introduces a novel admission test for partitioned CBS reservations on multi-core systems,...
In this dissertation we present a methodology for predicting the best priority pair for a given co-s...
In this paper we consider a spin-based multiprocessor locking protocol, named the Multiprocessor res...
In this paper we consider a spin-based multi-processor locking protocol, named the Multiprocessor re...
The original MrsP proposal presented a new multiprocessor resource sharing protocol based on the pro...
This paper investigates preemptive spin-based global resource sharing protocols for resource-constra...
Managing shared resources in multiprocessor real-time systems can often lead to considerable schedul...
Recently, the flexible spin-lock model (FSLM) has been introduced, unifying spin-based and suspensio...
Various approaches can be utilized upon resource locking for mutually exclusive resource access in m...
This paper proposes a new strategy to integrate shared resources and precedence constraints among re...
In this work, by using dynamic analysis techniques, we analyze how a workload can be accelerated in ...
Motivated by the increasingly wide adoption of realtime workload with self-suspending behaviors, and...
In this work, we characterized the memory performance-and in particular the impact of coherence over...
Microarchitectural techniques, such as superscalar instruction issue, Out-Of-Order instruction execu...
Spin locks are a synchronization mechanisms used to provide mutual exclusion to shared software reso...
This paper introduces a novel admission test for partitioned CBS reservations on multi-core systems,...
In this dissertation we present a methodology for predicting the best priority pair for a given co-s...
In this paper we consider a spin-based multiprocessor locking protocol, named the Multiprocessor res...
In this paper we consider a spin-based multi-processor locking protocol, named the Multiprocessor re...
The original MrsP proposal presented a new multiprocessor resource sharing protocol based on the pro...
This paper investigates preemptive spin-based global resource sharing protocols for resource-constra...
Managing shared resources in multiprocessor real-time systems can often lead to considerable schedul...
Recently, the flexible spin-lock model (FSLM) has been introduced, unifying spin-based and suspensio...
Various approaches can be utilized upon resource locking for mutually exclusive resource access in m...
This paper proposes a new strategy to integrate shared resources and precedence constraints among re...
In this work, by using dynamic analysis techniques, we analyze how a workload can be accelerated in ...
Motivated by the increasingly wide adoption of realtime workload with self-suspending behaviors, and...
In this work, we characterized the memory performance-and in particular the impact of coherence over...
Microarchitectural techniques, such as superscalar instruction issue, Out-Of-Order instruction execu...
Spin locks are a synchronization mechanisms used to provide mutual exclusion to shared software reso...
This paper introduces a novel admission test for partitioned CBS reservations on multi-core systems,...
In this dissertation we present a methodology for predicting the best priority pair for a given co-s...