Scheduling Independent Moldable Tasks on Multi-Cores with GPUs
نویسندگان
چکیده
منابع مشابه
Scheduling Independent Tasks on Multi-cores with GPU Accelerators
More and more computers use hybrid architectures combining multi-core processors and hardware accelerators like GPUs (Graphics Processing Units). We present in this paper a new method for scheduling efficiently parallel applications with m CPUs and k GPUs, where each task of the application can be processed either on a core (CPU) or on a GPU. The objective is to minimize the maximum completion ...
متن کاملScheduling Moldable BSP Tasks
Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computers. We focus our attention on special characteristics of BSP tasks, which can use fewer processors than the original required, but with a particular cost model. We discuss the problem of scheduling a batch of BSP tasks on a fixed number of computers. The objective is to minimize the completion tim...
متن کاملHierarchical Scheduling for Moldable Tasks extended version
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application at a larger level of granularity than in other models (corresponding typically to numerical routines) where the tasks can themselves be executed in parallel on any number of processors. Clusters of SMP (symmetric Multi...
متن کاملSimple Algorithms for Scheduling Moldable Tasks
We study the classical problem of scheduling a set T of n moldable tasks on m processors, which arises in multiprocessor scheduling from large scale parallel computations. This problem has been extensively studied for the objective of minimizing the makespan under the assumption of monotonic tasks, that is for tasks whose workload increases when executed in parallel on multiple processors; so f...
متن کاملOptimizing the stretch of independent tasks on a cluster: From sequential tasks to moldable tasks
This paper addresses the problem of scheduling non-preemptive moldable tasks to minimize the stretch of the tasks in an online non-clairvoyant setting. To the best of the authors’ knowledge, this problem has never been studied before. To tackle this problem, first the sequential sub-problem is studied through the lens of the approximation theory. An algorithm, called DASEDF, is proposed and, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2017
ISSN: 1045-9219
DOI: 10.1109/tpds.2017.2675891