Preemptive scheduling a set of periodic tasks on multi-processors is studied from the point of view of meeting their service requirements before given deadlines. Suf-cient conditions permitting full utilization of the mul-tiprocessor using the given scheduling algorithm are derived. Complexity of the scheduling algorithms including upper bounds on the number of preemptions are derived. Schemes ...

Most of the tasks in wireless sensor networks (WSN) are requested to run in a real-time way. Neither EDF nor FIFO can ensure real-time scheduling in WSN. A real-time scheduling strategy (RTS) is proposed in this paper. All tasks are divided into two layers and endued diverse priorities. RTS utilizes a preemptive way to ensure hard real-time scheduling. The experimental results indicate that RTS...

In this paper, we analyze a discrete-time preemptive repeat priority queue with resampling. High-priority packets have preemptive repeat priority, and interrupted low-priority packets are subjected to independent retransmission attempts. Both classes contain packets with generally distributed transmission times. We show that the use of generating functions is beneficial for analyzing the system...

We are given a set of jobs, each one specified by its release date, its deadline and its processing volume (work), and a single (or a set of) speed-scalable processor(s). We adopt the standard model in speed-scaling in which if a processor runs at speed s then the energy consumption is s units of energy per time unit, where α > 1 is a small constant. Our goal is to find a schedule respecting th...

The problem of real-time scheduling spans a broad spectrum of algorithms from simple uniprocessor to highly sophisticated multiprocessor scheduling algorithms. In this paper, we study the characteristics and constraints of real-time tasks which should be scheduled to be executed. Analysis methods and the concept of optimality criteria, which leads to design appropriate scheduling algorithms, wi...

A new scheduling formulation for data independent recursive algorithms is proposed. This formulation is intuitive and finds a static rate optimal schedules. Processing elements may be non-preemptive and non-homogenous. Comparisons with some other common scheduling methods to increase throughput is made.

In this paper we consider a non-product form queueing model of a multiprocessor operating system. In order to improve upon model solution time over a discrete-event simulation and a Markov chain based approach, we propose an extension to the shadow technique to allow for any mixture of preemptive and non preemptive priority scheduling strategy combined with class switching. This new technique c...

We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthesis procedure inserts synchronization to ensure that the final program works even with a preemptive scheduler. The correctness specification is implicit, inferred from the non-preemptive behavior. Let us consider sequences of ca...

This presentation is a tutorial given as a survey of the basic problems arising in real-time schedulability analysis on uniprocessor systems. It mainly focuses on on-line scheduling policies (fixed priority policies FPP, and dynamic priority scheduling) on a preemptive scheduling scheme, and insists on the basic concepts of busy period and processor demand. This tutorial is an extract of a lect...

In the paper “The complexity of mean flow time scheduling problems with release times”, by Baptiste, Brucker, Chrobak, Dürr, Kravchenko and Sourd, the authors claimed to prove strong NP-hardness of the scheduling problem P |pmtn, rj | ∑ Cj , namely multiprocessor preemptive scheduling where the objective is to minimize the mean flow time. We point out a serious error in their proof and give a n...