Mick Seaman Use of the proposed IEEE 802.3 Ethernet frame preemption capability could result in frame reordering. Without a change in the MACsec specification (IEEE Std 802.1AE) or in the way it is used it would not be possible to use MACsec to provide strict replay protection. This note has been revised to detail the use of multiple SCs1 per port, following the 802.1 Security Task Group discus...

In this paper, we address for safety critical applications the problem of multiprocessor real-time scheduling while taking into account the exact preemption cost. In the framework of multiprocessor real-time partitioned scheduling, we propose a greedy heuristic which balances the load of the tasks on all the processors and minimizes the response time of the applications. That heuristic uses a s...

In optical burst switching (OBS) networks, burst with different numbers of hops experience unfairness in terms of the burst loss probability. In this paper, we propose a preemptive scheme based on the number of transit hops in OBS networks. In our proposed scheme, preemption is performed with two thresholds; one is for the total number of hops of a burst and the other is for the number of trans...

domain. Assume thatM represents the set of all memory blocks and Dc captures the set of inclusion patterns of a memory block in a two-level cache hierarchy. The domain of the analysis (D) is the set of all valid mappings fromM to Dc as follows. D : M → (Dc ∪ {⊤}) (1) ACM Transactions on Embedded Computing Systems, Vol. V, No. N, Article A, Publication date: January YYYY. A:10 S. Chattopadhyay a...

In safety-critical applications, the use of advanced real-time scheduling techniques is significantly limited by the difficulty of finding tight estimations of worst-case execution parameters. This problem is further complicated by the use of cache memories, which reduce the predictability of the executing threads due to cache misses. In this paper, we analyze the effects of preemptions on wors...

The aim of this paper is the introduction of preemption in a compositional model, called M-nets, which is based on Petri nets and hence provided with a concurrent semantics. We propose a way to model preemptible systems by extending the M-net model with priorities and the M-net algebra with a preemption operator. We show that these extensions can be seen as a high-level version of the well stud...

We investigate the problem of scheduling the maintenance of edges in a network, motivated by the goal of minimizing outages in transportation or telecommunication networks. We focus on maintaining connectivity between two nodes over time; for the special case of path networks, this is related to the problem of minimizing the busy time of machines. We show that the problem can be solved in polyn...

The paper describes creation of a contention-aware environment in a large-scale distributed system where the contention occurs to access resources between external and local requests. To resolve the contention, we propose and implement a preemption mechanism in the InterGrid platform, which is a platform for largescale distributed system and uses virtual machines for resource provisioning. The ...