With the innovation of cloud computing industry lots of services were provided based on different deployment criteria. Nowadays everyone tries to remain connected and demand maximum utilization of resources with minimum timeand effort. Thus, making it an important challenge in cloud computing for optimum utilization of resources. To overcome this issue, many techniques have been proposed ...

Some CPU scheduling algorithms such as First-Come-First-Serve (FCFS), Shortest Job First (SJF), Priority, Round Robin (R-R), Multilevel Queue(MQ) and Multilevel Feedback Queue (MFQ has been elaborated and assessed on the basic CPU scheduling objectives i.e.; average waiting(AWT), average turnaround (ATT)and average response time(ART), average CPU utilization (AU)and average throughput(AT). Thes...

In this paper we introduce a new deadline driven disk scheduling algorithm designed for multimedia servers. The proposed algorithm supports real time requests with multiple priorities, e.g., those for di erent object classes in digital library applications. The proposed algorithm enhances utilization of disk bandwidth by (a) maintaining one queue for all requests, and (b) optimizing the seek ti...

In the cloud computing, many of the users send requests to cloud at the same time to access services. Thus, a big challenge of scheduling of these tasks is in cloud computing. Many algorithms like FCFS, SJF, Priority based, RR, MLQ, LSTR used to schedule the tasks in cloud computing. In cloud computing, most of the data centers consume vast amount of energy and take much more time to schedule t...

Most of the existing packet scheduling mechanisms of the wireless sensor network use First Come First Served (FCFS) non pre emptive priority and pre emptive priority scheduling algorithms. The above algorithms have high processing overhead and also long end-to-end data transmission delay. In FCFS concept the data packet which is entering the node first will go out first from the node, and the p...

A novel cross-layer wireless resource allocation algorithm called DBMQT is proposed which distributes the resource based on dynamic buffer allocation mechanism for orthogonal frequency division multiplex access (OFDMA) system. The aim of allocation algorithm is to maximize system throughput while satisfying the QoS requirement for multi-user and multi-service. The algorithm consists of two step...

In this paper, we consider several discrete-time priority queues with priority jumps. In a priority scheduling scheme with priority jumps, real-time and non-real-time packets arrive in separate queues, i.e., the highand low-priority queue respectively. In order to deal with possibly excessive delays however, non-real-time packets in the low-priority queue can in the course of time jump to the h...

A real time QoS aware adaptive radio resource management algorithm for downlink of multi-cell and multi user MIMO-OFDMA system. This purposed scheduling algorithm takes account queue status, transmission rates, channel state information and priority of the user for subcarrier, power and bit allocation in MU-MIMO-OFDMA system. Subcarrier selection is based on the priority of the user and eigenva...