ABSTRACT: Most of the existing packet-scheduling mechanism of WSN use First Come First Served(FCFS),nonpreemptive priority and preemptive prior it scheduling algorithms. These algorithms incur a high processing overhead and long end-to-end data transmission delay due to improper allocation of data packets to queues in multilevel queue scheduling algorithms. Moreover, these algorithms are not dy...

To solve the problem of task scheduling in the cloud computing system, this paper proposes a scheduling algorithm for cloud computing based on the driver of dynamic essential path (DDEP). This algorithm applies a predecessor-task layer priority strategy to solve the problem of constraint relations among task nodes. The strategy assigns different priority values to every task node based on the s...

This paper presents a Probabilistic Preemptive (PP) scheduling discipline for service differentiation in Optical Burst Switching (OBS) networks. The main idea of PP is that a probabilistic parameter is added to the preemptive scheduling discipline. With PP, a high priority burst preempts a low priority burst in a probabilistic manner. By changing the probabilistic parameter, PP can achieve flex...

In this paper, we investigate the quality of several linear-time schedulability tests for preemptive and non-preemptive fixed-priority scheduling of uniprocessor systems. The metric used to assess the quality of these tests is the resource augmentation bound commonly known as the processor speedup factor. The speedup factor of a schedulability test corresponds to the smallest factor by which th...

Grid computing is the federation of pooling resources so as to solve large-scale problems. Scheduling is the main issue in grid computing and is the process of making scheduling decisions over multiple grid resources. In this paper, we propose a scheduling technique which classifies the subtasks based on the priority assigned by the user. This is mainly applicable in places where the high prior...

Task scheduling in cloud environment is a key technical problem on how to allocate available cloud resources to cloud users. Usually, a task in cloud environment can be cut into a serials of subtasks, which have precedence and dependency relationships among themselves. We describe the problem by means of a DAG (Directed Acyclic Graph) model. Then, we propose a priority algorithm for DAG task sc...

We overview in this paper the buffer management and scheduling issues and draw upon published work to illustrate the possible alternatives of GFR implementation. Performance evaluation has also been done on ATM-GFR’s buffer management algorithms and scheduling algorithms. The simulation results have shown that two-static-threshold-buffermanagement and per-VC-buffer management give the best perf...

The Worldwide Interoperability for Microwave Access (WiMAX) is the IEEE 802.16 standard. Scheduling in WiMAX become one of the most challenging issues, since it is responsible for distributing available resources among users to meet the Quality of Service(QOS) criteria such as delay, delay jitter, fairness and throughput requirements. However, no specific scheduling mechanism has been defined t...