Parallel Scheduling Algorithm Research Articles

A PARALLEL SCHEDULING ALGORITHM FOR TREE STRUCTURED INTERCONNECTION NETWORKS

Global parallel scheduling is a new approach for runtime load balancing. In parallel scheduling, all processors cooperate together to schedule work. Parallel scheduling accurately balances the load by using global load information. As an alternative strategy to the commonly used dynamic scheduling, it provides a high-quality, low-overhead load balancing. This paper presents a parallel scheduling algorithm for interconnection networks of the tree topology. This algorithm minimizes communications and maximize locality.

A PARALLEL SCHEDULING ALGORITHM FOR PARALLEL APPLICATIONS

In this work, a parallel scheduling algorithm for scheduling a set of n partially ordered tasks on an m-processor parallel computing system is studied. The method is based on a conventional list scheduling, in particular, an earliest-task-first approach. Otherwise, the algorithm developed is an original algorithm. It is designed for a hypercube type system and is tested on a Transputer based environment, The time complexity of the algorithm is O(n(log n + log m)). The parallel scheduling algorithm produces the same schdules as its sequential counterpart whose complexity is O(mn 2(log n + log m)), but in a shorter time.

A constraint-based perspective in resource constrained project scheduling

In this study, a new heuristic approach to the resource constrained project scheduling problem is introduced. This approach, which is called local constraint based analysis (LCBA), is more robust than the dispatching rules found in the literature, since it does not depend on an a priori insight as do the dispatching rules. LCBA consists of the application of local essential conditions which respect the current temporal and resource constraints to generate a necessary sequence of activities at a scheduling decision time point in a single-pass parallel scheduling algorithm. LCBA is a time efficient procedure due to the localized aspect with which the activities are handled. Only the activities which are schedulable at the current scheduling time are considered for the application of the essential conditions. LCBA is tested against well-known rules from the literature and some recently developed rules. This testing is done using a set of problems of a special design and also a set of optimally solved problems from a recent benchmark in the literature. It is observed that near optimal time efficient solutions are obtained by LCBA and the procedure's performance is considerably better than that of the dispatching rules.

A parallel algorithm for preemptive scheduling of uniform machines

In this paper we describe a fast parallel algorithm for preemptive scheduling of n independent jobs on m uniform machines. Each job has a processing requirement, and each machine processes jobs at a different rate. The goal of the scheduling algorithm is to find a schedule which minimizes the time at which the last job is completed. T. Gonzalez and S. Sahni have developed a sequential algorithm which solves this problem in O( n + m log m) time. We develop a parallel version of this algorithm for a Concurrent Read Exclusive Write (CREW) shared memory computer. The algorithm runs in O(log n + log 3 m) time using n processors.

On The Scheduling Of Identical Processors With Entrapment

Abstract In an attempt to reduce computational requirements, parallel processor tardiness related scheduling algorithms incorporate a fathoming condition, “entrapment,” which at times helps, whereas, at other times, increases CPU time requirements. This paper establishes certain guidelines that can be used as a priori rule deciding the inclusion or exclusion of the entrapment subroutine part of the scheduling algorithm to solve a given problem. Since entrapment is a dominance condition, the implications of this work can be used to examine the applicability of other such conditions in algorithms designed to solve NP complete problems.

Binary Trees and Parallel Scheduling Algorithms

This paper examines the use of binary trees in the design of efficient parallel algorithms. Using binary trees, we develop efficient algorithms for several scheduling problems. The shared memory model for parallel computation is used. Our success in using binary trees for parallel computations, indicates that the binary tree is an important and useful design tool for parallel algorithms.

Parallel Scheduling Algorithms

Parallel algorithms are given for scheduling problems such as scheduling to minimize the number of tardy jobs, job sequencing with deadlines, scheduling to minimize earliness and tardiness penalties, channel assignment, and minimizing the mean finish time. The shared memory model of parallel computers is used to obtain fast algorithms.

A hybrid algorithm for independent task parallel machine scheduling

A hybrid algorithm for independent task parallel machine scheduling