Contention-aware scheduling with task duplication
نویسندگان
چکیده
منابع مشابه
Contention-Aware Scheduling with Task Duplication
Scheduling a task graph onto several processors is a trade-off between maximising concurrency and minimising interprocessor communication. A technique to reduce or avoid interprocessor communication is task duplication. Certain tasks are duplicated on several processors to produce the data locally and avoid the communication among processors. Most algorithms using task duplication are for the c...
متن کاملLink-Contention-Aware Genetic Scheduling Using Task Duplication in Grid Environments
In this paper, we consider the problem of scheduling precedenceconstrained tasks as well as communications in the grid environment where computers and links are heterogeneous and time-sharing. Herein, we propose a novel genetic scheduling algorithm for grid computing. The new algorithm adopts a special chromosome encoding scheme in order to make better use of task duplication. Moreover, knowled...
متن کاملContention-Aware Lock Scheduling for Transactional Databases
Lock managers are among the most studied components in concurrency control and transactional systems. However, one question seems to have been generally overlooked: “When there are multiple lock requests on the same object, which one(s) should be granted first?” Nearly all existing systems rely on a FIFO (first in, first out) strategy to decide which transaction(s) to grant the lock to. In this...
متن کاملCAPS: Contention-Aware Proactive Scheduling for CMPs
Many Chip Multiprocessors (CMPs) rely on shared caches to hide the latency of inter-thread communications as well as to improve effective memory bandwidth. Yet along comes cache contention, which often results in cache thrashing and severe performance degradation. Because of the variety of programs, a suitable schedule can often alleviate the issues significantly. However, it remains an open qu...
متن کاملTask Scheduling With Genetic Approach and Task Duplication Technique
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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2011
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2010.10.004