<abstract><p>We consider a basic preemptive scheduling problem where $ n non-simultaneously released jobs are to be processed by m unrelated parallel machines so as minimize maximum job completion time. An optimal LP-solution has been used construct an schedule for simultaneously in time O(n^3) $. We propose fast O(m) algorithm that finds case the above possesses "small enough" numb...

The OS scheduler’s memory and runtime overheads form crucial design constraints for embedded systems implemented on low-cost hardware platforms. Table-driven scheduling can provide a high level of schedulability; however, it also consumes significant amounts of memory. By contrast, effective non-preemptive scheduling policies, such as the non-workconserving Critical-Window EDF (CW-EDF), have lo...

A simple fork and join type of job structure has been extensively used for performance evaluation of processor scheduling policies in multiprocessor systems. However, parallel programs often exhibit a more complicated structure. It is not clear how the program structure affects the performance of processor scheduling policies. This paper studies the impact of the program structure on the perfor...

ABSTRACT: Most of the existing packet-scheduling mechanism of WSN use First Come First Served(FCFS),nonpreemptive priority and preemptive prior it scheduling algorithms. These algorithms incur a high processing overhead and long end-to-end data transmission delay due to improper allocation of data packets to queues in multilevel queue scheduling algorithms. Moreover, these algorithms are not dy...

Modern safety-critical systems, such as avionics, tend to be mixed-critical, because integration of different tasks with different assurance requirements can effectively reduce their costs in terms of hardware, at the risk, however to increase the costs for certification, in particular in the context of proving their schedulability. To simplify the certification costs such systems use Time Trig...

In many industrial systems, design complexity is partly reduced by the use of non-preemptive message passing or execution. Doing so, context switch overheads are diminished and resource sharing mechanisms are simplified. However, in a mixedcriticality system, long blocking time caused by non-preemptive execution of a task which has lower priority than some other high criticality (HC) tasks migh...

Blieberger, J. and U . Schmid, Preemptive LCFS scheduling in hard real-time applications, Performance Evaluation 15 (1992) 203-215 . We investigate the real-time behaviour of a (discrete time) single server system with preemptive LCFS task scheduling . The main result deals with the probability distribution of a random variable SRD(T), which describes the time the system operates without violat...