Online Scheduling of Task Graphs on Heterogeneous Platforms
نویسندگان
چکیده
منابع مشابه
Online Task Scheduling on Heterogeneous Clusters: An Experimental Study
We study the problem of scheduling applications composed of a large number of tasks on heterogeneous clusters. Tasks are identical, independent from each other, and can hence be computed in any order. The goal is to execute all the tasks as quickly as possible. We use the Master-Worker paradigm, where tasks are maintained by the master which will hand out batches of a variable amount of tasks t...
متن کاملSPAGHETtI: Scheduling/Placement Approach for Task-Graphs on HETerogeneous archItecture
We propose a new algorithm, called SPAGHETtI, for static scheduling tasks on an unbounded heterogeneous resources where resources belongs to di↵erent architecture (e.g. CPU or GPU). We show that this algorithm is optimal in complexity O(|E||A| + |V ||A|), where |E| is the number of edges, |V | the number of vertices of the scheduled DAG and |A| the number of architectures – usually a small valu...
متن کاملOnline Task Allocation in Client-Server Large Scale Heterogeneous Platforms
In this paper, we consider the problem of the online allocation of a very large number of identical tasks on a masterslave platform. Initially, several masters hold or generate tasks that are transfered and processed by slave nodes. The goal is to maximize the overall throughput achieved using this platform, i.e., the (fractional) number of tasks that can be processed within one time unit. We m...
متن کاملScheduling divisible workloads on heterogeneous platforms q
In this paper, we discuss several algorithms for scheduling divisible workloads on heterogeneous systems. Our main contributions are (i) new optimality results for single-round algorithms and (ii) the design of an asymptotically optimal multi-round algorithm. This multi-round algorithm automatically performs resource selection, a difficult task that was previously left to the user. Because it i...
متن کاملScheduling directed a-cyclic task graphs on a bounded set of heterogeneous processors using task duplication
In a distributed computing environment, the schedule by which tasks are assigned to processors is critical to minimizing the overall run-time of the application. However, the problem of discovering the schedule that gives the minimum finish time is NP-Complete. This paper addresses static scheduling of a directed a-cyclic task graph (DAG) on a heterogeneous, bounded set of distributed processor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2020
ISSN: 1045-9219,1558-2183,2161-9883
DOI: 10.1109/tpds.2019.2942909