Providing service differentiation in wireless networks has attracted much attention in recent research. Existing studies so far have focused on the design of MAC layer protocols to achieve distributed priority scheduling. While these works have been shown to achieve certain differentiation (higher throughput or lower delay for higher priority packets) at MAC layer, they did not consider the pro...

Work-stealing schedulers focus on minimizing overhead in task scheduling. Consequently, they avoid features, such as task priorities, which can add overhead to the implementation. Thus in such schedulers, low priority tasks may be scheduled earlier, delaying the execution of higher priority tasks and possibly increasing overall execution time. In this paper, we develop a decentralized work-stea...

This paper investigates the problem of optimal priority assignment in multiprocessor real-time systems using global fixed task-priority pre-emptive scheduling. Previous work in this area showed that arguably the most effective pseudo-polynomial schedulability tests for global fixed priority pre-emptive scheduling, based on response time analysis, are not compatible with Audsley’s Optimal Priori...

The complex applications are attracted by cloud computing is increased in day to day manner to run in remote data centers. Many applications needs parallel processing capabilities. The nature of parallel application is decrease the utilization of CPU resources as parallelism grows, because of the communication and synchronization between parallel processes. It challenging task but important for...

It has been shown by A.-L. Barabasi that the priority based scheduling rules in single stage queuing systems (QS) generates fat tail behavior for the tasks waiting time distributions (WTD). Such fat tails are due to the waiting times of very low priority tasks which stay un-served almost forever as the task priority indices (PI) are " frozen in time " (i.e. a task priority is assigned once for ...

Fixed-priority scheduling with deferred preemption (FPDS) has been proposed in the literature as a viable alternative to fixed-priority pre-emptive scheduling (FPPS), that obviates the need for non-trivial resource access protocols and reduces the cost of arbitrary preemptions. This paper shows that existing worst-case response time analysis of hard real-time tasks under FPDS, arbitrary phasing...

As vehicular networks become popular and many vehicles want to access data through a roadside unit. In this paper, there was a vehicle to roadside communication and we propose scheduling schemes for efficient delivery of data packets in vehicular adhoc network. On the basis of priority scheduling algorithm vehicles can download/upload the data from RSU. In this paper we can control the congesti...

Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Both algorithms are naturally parallelizable but have heavy data dependencies. Based on experimental results, this paper presents a detailed analysis of the scalability, advantages and disadvantages of each algorithm. Mu...

The analysis of fixed priority preemptive scheduling has been extended in various ways to improve its usefulness for the design of real-time systems. In this paper, we define the layered preemptive priority scheduling policy which generalizes fixed preemptive priorities by combination with other policies in a layered structure. In particular, the combination with the Round Robin scheduling poli...

List scheduling algorithms attempt to minimize latency under resource constraints using a priority list. We propose a new heuristic that can be used in conjunction with any priority function. At each timestep, the proposed clustering heuristic tries to nd a best match between ready operations and the resource set. The heuristic arbitrates among equal priority operations based on operation-clust...