The basic and prime job in parallel multiprocessor environment is accurately mapping of tasks and set the scheduling of different tasks on different processors to minimize the makespan. Total runtime is time taken time for all jobs with the individual runtime of tasks and their communication cost among tasks. In parallel multiprocessor environment, an optimal scheduling of parallel tasks having...

Task duplication is an effective scheduling technique for reducing the response time of workflow applications in dynamic grid computing systems. Task duplication based scheduling algorithms generate shorter schedules without sacrificing efficiency but leave the computing resources over consumed due to the heavily duplications. In this paper, we try to minimize the duplications of tasks from the...

On multicore platforms, reliable task execution, as well low energy consumption, are essential. Dynamic Voltage/Frequency Scaling (DVFS) is typically used for savings, but with a negative impact on reliability, especially when the applied frequency low. Using high frequencies, required to meet reliability constraints, or replicating tasks increases consumption. To reduce while enhancing and sat...

This paper suggests a technique for analyzing the performance of checkpointing schemes with task duplication. We show how this technique can be used to derive the average execution time of a task and other important parameters related to the performance of checkpointing schemes. The analysis results are used to study and compare the performance of four existing checkpointing schemes. Our compar...

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

Duplication based heuristics have been used for scheduling precedence constrained tasks with significant communication in them. Duplicating heavily communicating subtasks of a task on to the same processor improves the schedulability as a larger number of tasks meet their deadlines. However, this reduction comes at the cost of extra computing power required for duplicating subtasks. In this pap...

1 In this paper, we explore the problem of scheduling parallel programs using task duplication for message-passing multicomputers. Task duplication means scheduling a parallel program by redundantly executing some of the tasks on which other tasks of the program critically depend. This can reduce the start times of tasks waiting for messages from tasks residing in other processors. There have b...

Duplication based heuristics have been widely utilized for scheduling communication intensive, precedence constrained tasks on multiple processors. Duplicating the predecessor of a task on the processor to which the task is assigned can result in the minimization of the communication cost. This helps in reducing the schedule length. However, this reduction comes at the cost of extra computing p...