Parallel Data processing has emerged to be one of the killer applications for Infrastructure-as-a-Service (IaaS) clouds. One of an IaaS cloud’s key feature is the provisioning of compute resources on demand. The computer resources available in the cloud are highly dynamic and possibly heterogeneous. Nephele is the first data processing framework to explicitly exploit the dynamic resource alloca...

In this paper, we introduce a new concept of semi-preemptive scheduling and we show how it can be used to derive a maximum‡ow based lower bound for the P=rj=Lmax which dominates the well-known preemptive lower bound. We show that, in some cases the proposed bound strictly dominates the preemptive one while having the same complexity.

nowadays, scheduling problems have a considerable application in production and service systems. in this paper, we consider the scheduling of n jobs on a single machine assuming no machine idleness, non-preemptive jobs and equal process times. in many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combinat...

The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline algorithm. The measure has been successfully applied to problems like paging and bin packing. In this paper, we apply it to machine scheduling. We show that for preemptive scheduling, the measure separates multiple p...

in the directory /pub/techreports. Abstracts and compressed postscript files are available via Real-time, multi-tasking software, such as that used in embedded control systems, is notoriously difficult to develop and maintain. Scheduling theory offers a mathematically-sound way of predicting the timing behaviour of sets of communicating, concurrent tasks, but its principles are often unfamiliar...

The CPU scheduling is one of the most important tasks of the operating system. Many algorithms are designed and used in this regard each having advantages and disadvantages. In this paper a new algorithm for the CPU scheduling is presented using FFGA (Fonseca and Fleming’s Genetic Algorithm) multiobjective optimization. Contrary to the classical algorithms in use, it uses the three parameters o...

In heterogeneous computing systems, a suite of different machines is interconnected to provide a variety of computational capabilities to execute collections of real-time application tasks that have diverse requirements. In these systems, machine failures are inevitable and can have an adverse effect on applications executing on the system. To reduce this effect, an efficient scheduling approac...

This paper focuses on providing a solution for online real time services using non-preemptive scheduling algorithm in order to minimize the execution time of the migrated tasks. Earlier, a non-preemptive scheduling with task migration algorithm is used to minimize the penalty. Whenever a task misses its deadline, it will migrate the task to another virtual machine and starts its execution from ...

Project preemption allows resources flow passively from one project or task to another. Due to high-cost and high-risk characteristics of software development, project preemption might have a significant impact on the ultimate completion time of a software project. This article examines the feasibility of the Taguchi’s parameter design to achieve robust resource assignment for multiple software...