Realizing an optimal task scheduling by taking into account the business importance of jobs has become a matter of interest in pay and use model of Cloud computing. Introduction of an appropriate model for an efficient task scheduling technique could derive benefit to the service providers as well as clients. In this paper, we have addressed two major challenges which has implications on the pe...

The media, especially the video delivery over mobile channels may be affected by link outages and transmission bit rate variations due to the actual channel condition and the used wireless interface. In this paper we present the use of Priority-based Transmission Scheduling of SVC media data to overcome link outages and reduction in channel bit rate in mobile networks. The Priority-based Transm...

This paper studies multiprocessor scheduling for aperiodic tasks where future arrivals are unknown. A previously proposed priority-driven scheduling algorithm for periodic tasks with migration capability is extended to aperiodic scheduling and is shown to have a capacity bound of 0:5. This bound is close to the best achievable for a priority-driven scheduling algorithm. With an infinite number ...

Android mobile operating system which is based on Linux Kernel 2.6, has open source license and adaptability to user driven applications. As all other operating systems it has all the basic features like process scheduling, memory management, process management etc associated with it. Any mobile platform works smoothly when the process scheduling is performed in a proper way. Ideal platform is ...

This paper introduces a new packet scheduling algorithm for multi-media traffic. The proposed modified priority queuing (MPQ) packet scheduling algorithm, realizing the high priority traffic service employs exponential distributions with the higher averages respectively, secures the reduction in the mean waiting time regarding the high priority traffic sensitive to delay. Thus, we could meet th...

Real-time systems often consist of a number of independent processes which operate under an age constraint. In such systems, the maximum time from the start of process L i in cycle k to the end in cycle k+1 must not exceed the age constraint A i for that process. Multiprocessors provide a scalable and cost-effective way of meeting the performance demands of such systems. The age constraint can ...

A priority based packet scheduling scheme is proposed which aims at scheduling different types of data packets, such as real time and non-real-time data packets at sensor nodes with resource constraints in Wireless Sensor Networks. Most of the existing packet-scheduling mechanisms of Wireless Sensor Networks use First Come First Served (FCFS), non-preemptive priority and preemptive priority sch...

CPU scheduling is the basis of multi programmed operating system. The idea of multiprogramming is relatively simple, if a process (job) is waiting for an I/O request, then CPU switches from one job to another job so that CPU is always busy and computer becomes more productive. Scheduling is a fundamental operating system function, almost all computer resources are scheduled before use. The CPU ...

priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. the discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. on the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....

A new optimality criterion and associated scheduling and dropping algorithm are presented for multiclass packets with deadlines. Equal length packets with deadlines and priority labels are either scheduled by their deadlines or dropped on or possibly before their deadlines. An L-bit priority label is used to handle up to 2 priority classes. A scheduling policy is called lex-optimal within the c...