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 static task scheduling problem in distributed systems is important because of optimal usage of available machines and accepted computation time for scheduling algorithm. A PSO-based hybrid algorithm is presented to schedule the tasks represented by a Directed Acyclic Graph (DAG) to a bounded number of heterogeneous processors such that its schedule length is optimized. The algorithm first g...

Scientific workflows have received considerable attention in Grid computing. This paper is concerned with the issue of scheduling scientific workflows and, by considering a commonly used astronomy workflow, Montage, investigates the impact of different strategies to schedule the workflow graph. Our experiments suggest that the rather regular and symmetric nature of the Montage graph allows rath...

This paper describes a new iterative improvement scheduling algorithm called FAMOS for the high-level synthesis of digital systems. The algorithm is based on Kernighan and Lin’s move acceptance strategy and various selection functions defined to represent the cost of hardware resources such as functional units and registers. As demonstrated in experiments, a main feature of the algorithm is tha...

Resource Constrained Project Scheduling Problem is a very important problem in project management, manufacturing and resource optimization. We focus on a variant of RCPSP with time lags and variable activity durations. The solving approach is based on Precedence Constraint Posting that adds new precedence constraints to the original project graph so that all resource conflicts are solved and a ...

Comet is an object-oriented language supporting a constraintbased architecture for local search. This paper presents a collection of abstractions, inspired by constraint-based schedulers, to simplify scheduling algorithms by local search in Comet. The main innovation is the computational model underlying the abstractions. Its core is a precedence graph which incrementally maintains a candidate ...

Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. The traditional message-passing schedule consists of updating all the variable nodes in the graph, using the same pre-update information, followed by updating all the check nodes of the graph, again, using the same pre-update info...

In the area of static scheduling, list scheduling is one of the most common heuristics for the temporal and spatial assignment of a directed acyclic graph (DAG) to a target system. As most scheduling heuristics, list scheduling assumes fully connected homogeneous processors and ignores contention on the communication links. This article extends the list scheduling heuristic for contention aware...