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...

Efficient task mapping and scheduling is a crucial factor for achieving high performance in multimedia wireless sensor networks. This paper presents Quality of Service (QoS) constrained task mapping and scheduling algorithm for multi-hop clustered wireless sensor networks. With the objective of meeting high performance and providing real-time guarantees, the algorithm simultaneously schedules t...

Cloud computing environments facilitate applications by providing visualized resources that can be provisioned dynamically. The advent of cloud computing as a new model of service provisioning in distributed systems, encourages researchers to investigate its benefits and drawbacks in executing scientific applications such as workflows. One of the fundamental issues in this environment is relate...

The scheduling of Out-Tree task graphs is one of the critical factors in implementing the compilers of parallel languages and improving the performance of parallel computing. Although there are a few heterogeneity based algorithms in the literature suitable for scheduling Out-Tree task graphs, they usually require significantly high scheduling costs and may not deliver good quality schedules wi...

Cloud computing is a technology in distributed computing which facilitates pay per model based on user demand and requirement. Cloud can be defined as a collection of virtual machines. This includes both computational and storage facility. The goal of cloud computing is to provide efficient access to remote and geographically distributed resources. Cloud Computing is developing day by day and f...

OO-line task scheduling remains important for real-time systems since such algorithms may be used to schedule tasks known at the time of system initialization. The LDA algorithm described in this paper uses both task laxities and deadlines when deciding processor allocation and task scheduling for a multipro-cessor system. The algorithm is diierent from existing algorithms (1) in its use of dis...

We proposed a task scheduling in cloud computing based on intelligence firefly algorithm aimed at the disadvantages of cloud computing task scheduling. Firstly, on the basis of cloud model, used intelligence firefly algorithm with strong ability of global searching to find the better solution of cloud computing task scheduling then turned the better solution into the initial pheromone of improv...

Efficient scheduling algorithm is required to use the grid resources properly. List scheduling heuristic algorithms are to schedule the application programs and produces sub optimal solutions. An evolutionary based scheduling algorithm will produce an optimal solution. The proposed algorithm, namely, “Grid Scheduling Strategy using GA” (GSSGA) adopts the genetic algorithm to solve the dependent...

This paper considers the scheduling of parallel realtime tasks with arbitrary-deadlines. Each job of a parallel task is described as a directed acyclic graph (DAG). In contrast to prior work in this area, where decomposition-based scheduling algorithms are proposed based on the DAG-structure and inter-task interference is analyzed as self-suspending behavior, this paper generalizes the federate...

Time constraint is the main factor in real time operating system. Different scheduling algorithm is used to schedule the task. The Earliest Deadline First and Ant Colony Optimization is a dynamic scheduling algorithm used in a real time system and it is most beneficial scheduling algorithm for single processor real-time operating systems when the systems are preemptive and under loaded. The mai...