Problem statement: Cloud is purely a dynamic environment and the existing task scheduling algorithms are mostly static and considered various parameters like time, cost, make span, speed, scalability, throughput, resource utilization, scheduling success rate and so on. Available scheduling algorithms are mostly heuristic in nature and more complex, time consuming and does not consider reliabili...

Scheduling is one of the most successful application areas of constraint programming and, recently, many scheduling problems were modelled and solved by means of constraints. Most of these models confine to a conventional formulation of a constraint satisfaction problem that requires all the variables and the constraints to be specified in advance. However, many application areas like complex p...

Two major problems in grid computing applications are, resource management and job scheduling. These problems do occur due to distributed and heterogeneous nature of the resources. This paper introduces a model in job scheduling in grid computing environments. A dynamic scheduling algorithm is proposed to maximize the resource utilization and minimize processing time of the jobs. The proposed a...

Process scheduling is a classical problem in the field of production planning and control; in particular, effective job shop scheduling remains an essential component in today’s highly dynamic and agile production environment. This paper presents unified framework for solving generic job shop scheduling problems based on the formulation of a job shop into three main classes of problem, namely, ...

This paper reviews scheduling algorithm available in RTOS to schedule the tasks during execution in the Real Time System considering the static priority and evolution in the static priority scheduling in last decade. Real Time Operating System (RTOS) success depends on completion of task in given deadline. Real Time Operating System (RTOS) used, where we require specific application that meet t...

Online scheduling (also known as dynamic scheduling) refers to the real-time coordination of operation processing while new operations are continuously arriving. The objective of this paper is the study of different online scheduling techniques in a dynamic, stochastic job shop scheduling environment. We present a quantitative study of the quality of dispatching and optimizing scheduling techni...

Scheduling divisible workloads in distributed systems has been one of the interesting research problems over the last few years. Most of the scheduling algorithms previously introduced are based on the master-worker paradigm. However, the majority of these algorithms assume that workers are dedicated machines, which is a wrong assumption in distributed environments such as Grids. In this work, ...

In the design process of high-throughput applications, design choices concerning the type of processor architecture and appropriate scheduling mechanism, have to be made. Take a reed-solomon decoder as an example, the amount of clock cycles consumed in decoding a code is dependent on the amount of errors within that code. Since this is not known in advance, and the environment in which the code...