A route-based signal preemption strategy is developed to provide the most efficient and safe route for an emergency vehicle under a given network and traffic conditions. It combines an on-line route selection procedure and a dynamic sequential preemption method. The on-line route selection module first quantifies the level of congestion for each link on a given network using a congestion index ...

Increasing demand for multimedia and distributed applications in recent years has drawn renewed attention to Quality of Services (QoS) routing in IP/MPLS network. This paper presents several new algorithms to be implemented for that purpose. We look, in a first part of the problem at organizing the mapping of Label Switching Paths (LSPs) throughout the network such that we can compromise betwee...

We propose an architecture for implementing discrete-time control algorithms on a non-real-time operating system so that sensing and actuation occur at precise times, even if the OS preempts the control task. The architecture has the controller perform its computation on one processor and its sensing/actuation on a separate microcontroller. The controller sends arrays of future time-stamped act...

Preemption threshold scheduling (PTS) enables designing scalable real-time systems. PTS not only decreases the run-time overhead of the system, but can also be used to decrease the number of threads and the memory requirements of the system. In this paper, we combine preemption threshold scheduling with dynamic voltage scaling to enable energy efficient scheduling in real-time systems. We consi...

Project preemption allows resources flow passively from one project or task to another. Due to high-cost and high-risk characteristics of software development, project preemption might have a significant impact on the ultimate completion time of a software project. This article examines the feasibility of the Taguchi’s parameter design to achieve robust resource assignment for multiple software...

Limited Preemptive Fixed Preemption Point scheduling (LP-FPP) has the ability to decrease and control the preemption-related overheads in the real-time task systems, compared to other limited or fully preemptive scheduling approaches. However, existing methods for computing the preemption overheads in LP-FPP systems rely on over-approximation of the evicting cache blocks (ECB) calculations, pot...