In the last decade, scheduling of Directed Acyclic Graph (DAG) application in the context of Grid environment has attracted attention of many researchers. However, deployment of Grid environment requires skills, efforts, budget, and time. Although various simulation toolkits or frameworks are available for simulating Grid environment, either they support different possible studies in Grid compu...

A novel integer linear programming (ILP) formulation for resource-constrained scheduling problems is presented. Existing ILP-based methods for the same problem typically have a complexity (measured in terms of the number of unknown integer variables) that is proportional to the latency bound of the problem. Hence, they are restricted in scope (e.g., high-level synthesis). Our approach consists ...

Path cover is a well-known intractable problem that finds a minimum number of vertex disjoint paths in a given graph to cover all the vertices. We show that a variant, where the objective function is not the number of paths but the number of length-0 paths (that is, isolated vertices), turns out to be polynomial-time solvable. We further show that another variant, where the objective function i...

In the above paper [1], the second paragraph of the introduction was accidentally omitted. This paragraph and corresponding citations should appear as follows. As for iterative decoding of LDPC codes, there are two main scheduling approaches, probabilistic approaches and deterministic approaches. Although both scheduling approaches provide better complexity/performance tradeoff than their stand...

Test scheduling increases parallelism of test application and reduces the test cost. In this paper, we present a novel scheduling algorithm for testing embedded core-based System-on-Chips. Given a system integrated with a set of cores and a set of test resources, we construct a set of power constrained concurrent test sets from a power-constrained test compatibility graph (P-TCG). Furthermore, ...

Scheduling is an emergent area in Grid Environment. It is essential to utilize the processors efficiently and minimize the schedule length. In Grid Environment, tasks are dependent on each other. We use Directed Acyclic Graph (DAG) to solve task scheduling problems. In this paper, we have proposed a new scheduling algorithm called M-Level Sufferage-based Scheduling Algorithm (MSSA) for minimizi...

The cyclic permutation flow shop is one flow shop that repetitively produces product mix under permutation schedules. We propose that the cyclic permutation flow shop given the general job sequence can be modeled as a time event graph, based on which the mixed-integer programming method is applied to find the optimal schedule with maximum throughput. Two cases of cyclic permutation flow shops w...

In this paper a novel technique for resource-constrained loop pipelining is presented. RCLP is based on several dependence graph operations: loop unrolling, operation retiming, resource-constrained scheduling, and span reduction. All these operations are focused to nd a minimum length schedule able to be executed with a limited number of resources and thus maximizing resource utilization. Exper...

Distributed computing systems implement redundancy to reduce the job completion time and variability. Despite a large body of work about redundancy, analytical performance evaluation techniques in queuing is still an open problem. In this work, we take one step forward analyze scheduling policies with redundancy. particular, study pattern shared servers among replicas different jobs. To end, em...

Daewoo Shipbuilding Company, one of the largest shipbuilders in the world, had difficulties with planning and scheduling its production process. To solve the problems, Korea Advanced Institute of Science and Technology (KAIST) and Daewoo have been jointly performing the DAS (DAewoo Shipbuilding Scheduling) Project for three years from 1991 to 1993. To develop the integrated scheduling systems, ...