Scheduling occurs in every organization without considering the nature of its activities. In this regard, numerous scholars have attempted to schedule via divergent methods including classical scheduling, genetic algorithm, neural network and fuzzy logic and so on. Studies in manufacturing scheduling mostly deal with priority rules without any consideration of the system states. An appropriate ...

We present a hierarchic scheduling framework for Linux called Group Scheduling that facilitates the creation of arbitrary thread schedulers. Traditional approaches to developing new scheduling semantics require semantic mappings onto existing schedulers, such as static-priority. Group Scheduling allows for a direct implementation of semantics, allowing clear mappings at any level a developer de...

Improvements in schedulability tests for global fixed-priority and EDF scheduling in a homogeneous multiprocessor (symmetric multiprocessing) environment have shown that the worst-case guaranteed achievable utilization levels for global EDF scheduling equals what can be achieved with partitioned scheduling, and both ways of applying EDF scheduling out-perform fixed-priority scheduling, for sets...

In this paper, we introduce and analyze a modified HOL (head-of-the-line) priority scheduling discipline. The modification is incorporated to cope with the so-called starvation problem of regular HOL priority queues. We consider a discrete-time single-server queueing system with two priority queues of infinite capacity and with the introduced priority scheme. We show that the use of probability...

Priority scheduling for packets is becoming a hot topic, as attemps are being made to integrate voice services in existing data networks. In this paper, we consider a discrete-time queueing system with head-of-line (HOL) non-preemptive priority scheduling. Two classes of traffic will be considered, i.e., high-priority and lowpriority traffic, which both generate variable-length packets. We will...

This paper studies static-priority preemptive scheduling on a multiprocessor using partitioned scheduling. We propose a new scheduling algorithm and prove that if the proposed algorithm is used and if less than 50% of the capacity is requested then all deadlines are met. It is known that for every static-priority multiprocessor scheduling algorithm, there is a task set that misses a deadline al...