In data grid, using reservation is accepted to provide scheduling and service quality. Users need to have an access to the stored data in geographical environment, which can be solved by using replication, and an action taken to reach certainty. As a result, users are directed toward the nearest version to access information. The most important point is to know in which sites and distributed sy...

Consider a task scheduling problem of a given fine grained task graph on distributed-memory parallel machines. In this paper, we report that schedules with small makespan generated by existing task scheduling algorithms do not usually become fast parallel programs on distributed-memory parallel machines. That is caused by no consideration to message packaging. To obtain fast parallel programs u...

The task scheduling problem in heterogeneous system is known as NP-hard. Recently, Bajaj and Agrawal proposed an algorithm TANH (Task duplication-based scheduling Algorithm for Network of Heterogeneous systems) with optimality conditions, which are wider than previous optimality conditions. TANH algorithm combines the clustering technique with task duplication. We propose two postprocessing alg...

 To use services transparently in a distributed environment, the Utility Grids develop a cyber-infrastructure. The parameters of the Quality of Service such as the allocation-cost and makespan have to be dealt with in order to schedule workflow application tasks in the Utility Grids. Optimization of both target parameters above is a challenge in a distributed environment and may conflict one an...

In the face of a large number of task requests submitted by users, the data center in the cloud need not only to finish these massive tasks but also to satisfy the user's service demand. How to divide the resources of the system reasonably and schedule these tasks efficiently is a problem that need be solved in the cloud computing. The task scheduling of workflow is a kind of scheduling model f...

Task scheduling is an important and challenging issue of Cloud computing. Existing solutions to task scheduling problems are unsuitable for Cloud computing because they only focus on a specific purpose like the minimization of execution time or workload and do not use characteristics of Cloud computing for task scheduling. A task scheduler in Cloud computing has to satisfy cloud users with the ...

Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...

Algorithm research of task scheduling is one of the key techniques in grid computing. This paper firstly describes a DAG task scheduling model used in grid computing environment, secondly discusses generational scheduling (GS) and communication inclusion generational scheduling (CIGS) algorithms. Finally, an improved CIGS algorithm is proposed to use in grid computing environment, and it has be...

Function design of embedded real-time system introduced the problem of real-time task scheduling with precedence constraint which needs that scheduling sequence produced by algorithm satisfying not only real-time constraint of every task, but also precedence constraint among tasks. Based on parallel topological sort, this paper presents a new on-line scheduling algorithm OSA-RPC which can set p...

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