Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userMode Change Protocol for Multi-Mode Real-Time Systems upon Identical Multiprocessors
115
0
0.0
(
0
)
Added by
Vincent N\\'elis
Publication date
2008
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
In this paper, we propose a synchronous protocol without periodicity for scheduling multi-mode real-time systems upon identical multiprocessor platforms. Our proposal can be considered to be a multiprocessor extension of the uniprocessor protocol called Minimal Single Offset protocol.
rate research
Read More
Real-time scheduling and locking protocols are fundamental facilities to construct time-critical systems. For parallel real-time tasks, predictable locking protocols are required when concurrent sub-jobs mutually exclusive access to shared resources. This paper for the first time studies the distributed synchronization framework of parallel real-time tasks, where both tasks and global resources are partitioned to designated processors, and requests to each global resource are conducted on the processor on which the resource is partitioned. We extend the Distributed Priority Ceiling Protocol (DPCP) for parallel tasks under federated scheduling, with which we proved that a request can be blocked by at most one lower-priority request. We develop task and resource partitioning heuristics and propose analysis techniques to safely bound the task response times. Numerical evaluation (with heavy tasks on 8-, 16-, and 32-core processors) indicates that the proposed methods improve the schedulability significantly compared to the state-of-the-art locking protocols under federated scheduling.
Linear-Rate Multi-Mode Systems is a model that can be seen both as a subclass of switched linear systems with imposed global safety constraints and as hybrid automata with no guards on transitions. We study the existence and design of a controller for this model that keeps the state of the system within a given safe set for the whole time. A sufficient and necessary condition is given for such a controller to exist as well as an algorithm that finds one in polynomial time. We further generalise the model by adding costs on modes and present an algorithm that constructs a safe controller which minimises the peak cost, the average-cost or any cost expressed as a weighted sum of these two. Finally, we present numerical simulation results based on our implementation of these algorithms.
We present a new method to diagnose strong coupling in multi-mode open systems. Our method presents a non-trivial extension of exceptional point (EP) analysis employed for such systems; specifically, we show how eigenvectors can not only reproduce all the features predicted by EPs but are also able to identify the physical modes that hybridize in different regions of the strong coupling regime. As a demonstration, we apply this method to study hybridization physics in a three-mode optomechanical system and determine the parameter regime for efficient sideband cooling of the mechanical oscillator in the presence of reservoir correlations.
We study the isoscalar and isovector $J=0,1$ mesons with the overlap operator within two flavour lattice QCD. After subtraction of the lowest-lying Dirac eigenmodes from the valence quark propagator all disconnected contributions vanish and all possible point-to-point $J=0$ correlators become identical, signaling a simultaneous restoration of both $SU(2)_L times SU(2)_R$ and $U(1)_A$ symmetries. The ground states of the $pi,sigma,a_0,eta$ mesons do not survive this truncation. All possible $J=1$ states have a very clean exponential decay and become degenerate, demonstrating a $SU(4)$ symmetry of a dynamical QCD-like string.
This paper presents a new strategy for scheduling soft real-time tasks on multiple identical cores. The proposed approach is based on partitioned CPU reservations and it uses a reclaiming mechanism to reduce the number of missed deadlines. We introduce the possibility for a task to temporarily migrate to another, less charged, CPU when it has exhausted the reserved bandwidth on its allocated CPU. In addition, we propose a simple load balancing method to decrease the number of deadlines missed by the tasks. The proposed algorithm has been evaluated through simulations, showing its effectiveness (compared to other multi-core reclaiming approaches) and comparing the performance of different partitioning heuristics (Best Fit, Worst Fit and First Fit).
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
