The maturity of schedulabilty analysis techniques for fixed-priority preemptive scheduling has enabled the consideration of timing issues at design time using a specification of the tasking architecture and estimates of execution times for tasks. While successful, this approach has limitations since the preemptive multi-tasking model does not scale well for a large number of tasks, and the fixe...

In this paper, a task scheduling problem for cloud computing environment is formulated by using the M/M/n queuing model. A priority assignment algorithm designed to employ new data structure named waiting time matrix assign individual tasks upon arrival. addition this, queue implements unique concept based on principle of Fibonacci heap extracting with highest priority. This work introduces par...

This paper is concerned with the problem of scheduling preemptive tasks subject to precedence constraints in order to minimize the maximum lateness and the makespan. The number of available parallel processors is allowed to vary in time. It is shown that when an Earliest Due Date rst algorithm provides an optimal nonpreemptive schedule for unit-execution-time (UET) tasks, then the preemptive pr...