Priority scheduling for packets is becoming a hot topic, as attempts 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 low-priority traffic, which both generate variablelength packets. We wil...

The need for priority scheduling arises in many algorithms. In these algorithms, there is a dynamic pool of lightweight, unordered tasks, and some execution orders are more efficient than others. Therefore, each task is given an application-specific priority that is a heuristic measure of its importance for early scheduling, and the runtime system schedules these tasks roughly in this order. Co...

Wireless sensor networks (WSNs) have a wide variety of military and civil applications. The sensor nodes are powered by batteries with limited energy. Hostile or hazardous environments where the sensor nodes are deployed or the sheer number of the sensors prevents replacement or recharge of the batteries. Therefore in WSNs, scheduling of different types of packets is of vital importance to redu...

In fixed-priority scheduling the priority of a job, once assigned, may not change. A new fixed-priority algorthm for scheduling systems of periodic tasks upon identical multiprocessors is proposed. This algorithm has an achievable utilization of (m + 1)/2 upon m unit-capacity processors. It is proven that this algorithm is optimal from the perspective of achievable utilization, in the sense tha...

A task scheduling simulator for timing analysis of the various task sets with different scheduling policies was implemented and tested. The simulator supports the various scheduling policies like Rate Monotonic, deadline monotonic and EDF, widely used for scheduling real time applications. It simulates the task execution for the time period, and then it outputs the time based representation of ...

This paper suggests a decision tree based approach for flexible job shop scheduling with multiple process plans, i.e. each job can be processed through alternative operations, each of which can be processed on alternative machines. The main decision variables are: (a) selecting operation/machine pair; and (b) sequencing the jobs assigned to each machine. As an extension of the priority scheduli...

We consider a scheduling game on parallel related machines, in which jobs try to minimize their completion time by choosing machine be processed on. Each uses an individual priority list decide the order according are processed. prove that it is NP-hard if pure Nash equilibrium exists and characterize four classes of instances guaranteed exist. For each these classes, we give algorithm computes...