A dynamic matching and scheduling algorithm for heterogeneous computing systems

Maheswaran, Muthucumaru; Siegel, Howard Jay

doi:10.1109/hcw.1998.666545

Cited by 139 publications

(87 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The list of nodes is generated at compile time and the cost of running tasks on every PE is known in advance. Some relevant works on this area are [20,11,14,15]. However, communication cost in heterogeneous multicore systems is several orders of magnitude smaller than in distributed systems.…”

Section: Related Workmentioning

confidence: 99%

Predictive Runtime Code Scheduling for Heterogeneous Architectures

Jiménez

Vilanova²,

Gelado³

et al. 2009

High Performance Embedded Architectures and Compilers

View full text Add to dashboard Cite

Abstract. Heterogeneous architectures are currently widespread. With the advent of easy-to-program general purpose GPUs, virtually every recent desktop computer is a heterogeneous system. Combining the CPU and the GPU brings great amounts of processing power. However, such architectures are often used in a restricted way for domain-specific applications like scientific applications and games, and they tend to be used by a single application at a time. We envision future heterogeneous computing systems where all their heterogeneous resources are continuously utilized by different applications with versioned critical parts to be able to better adapt their behavior and improve execution time, power consumption, response time and other constraints at runtime. Under such a model, adaptive scheduling becomes a critical component. In this paper, we propose a novel predictive user-level scheduler based on past performance history for heterogeneous systems. We developed several scheduling policies and present the study of their impact on system performance. We demonstrate that such scheduler allows multiple applications to fully utilize all available processing resources in CPU/GPUlike systems and consistently achieve speedups ranging from 30% to 40% compared to just using the GPU in a single application mode.

show abstract

Section: Related Workmentioning

confidence: 99%

Predictive Runtime Code Scheduling for Heterogeneous Architectures

Jiménez

Vilanova²,

Gelado³

et al. 2009

High Performance Embedded Architectures and Compilers

View full text Add to dashboard Cite

show abstract

“…Roughly speaking, one can distinguish between approaches that assume that the participating systems, or agents controlling these systems, are cooperative and approaches that assume that the participating agents/systems are non-cooperative. Examples of the former (classical) approaches are DLS [49], HEFT [55], CPOP [55], ILHA [3] and PCT [36]. All these approaches mainly focus on optimizing some performance criteria such as makespan and required communication between processors.…”

Section: Concurrent Coordination: Autonomous Task Planningmentioning

confidence: 99%

Coordination by design and the price of autonomy

Mors

Yadati

Witteveen

et al. 2009

Auton Agent Multi-Agent Syst

View full text Add to dashboard Cite

We consider a multi-agent planning problem as a set of activities that has to be planned by several autonomous agents. In general, due to the possible dependencies between the agents' activities or interactions during execution of those activities, allowing agents to plan individually may lead to a very inefficient or even infeasible solution to the multi-agent planning problem. This is exactly where plan coordination methods come into play. In this paper, we aim at the development of coordination by design techniques that (i) let each agent construct its plan completely independent of the others while (ii) guaranteeing that the joint combination of their plans always is coordinated. The contribution of this paper is twofold. Firstly, instead of focusing only on the feasibility of the resulting plans, we will investigate the additional costs incurred by the coordination by design method, that means, we propose to take into account the price of autonomy: the ratio of the costs of a solution obtained by coordinating selfish agents versus the costs of an optimal solution. Secondly, we will point out that in general there exist at least two ways to achieve coordination by design: one called concurrent decomposition and the other sequential decomposition. We will briefly discuss the applicability of these two methods, and then illustrate them with two specific coordination problems: coordinating tasks and coordinating resource usage. We also investigate some aspects of the price of autonomy of these two coordination methods.

show abstract

“…Given a function for each architecture that describes the run-time of a task on this processing unit they propose different heuristics to minimize the overall finishing time. In addition to those and other static techniques [6], several dynamic methods have been proposed [21,29,17].…”

Section: Related Workmentioning

confidence: 99%

A Static Task Partitioning Approach for Heterogeneous Systems Using OpenCL

Grewe

O’Boyle

2011

Lecture Notes in Computer Science

152

124

View full text Add to dashboard Cite

Abstract. Heterogeneous multi-core platforms are increasingly prevalent due to their perceived superior performance over homogeneous systems. The best performance, however, can only be achieved if tasks are accurately mapped to the right processors. OpenCL programs can be partitioned to take advantage of all the available processors in a system. However, finding the best partitioning for any heterogeneous system is difficult and depends on the hardware and software implementation.We propose a portable partitioning scheme for OpenCL programs on heterogeneous CPU-GPU systems. We develop a purely static approach based on predictive modelling and program features. When evaluated over a suite of 47 benchmarks, our model achieves a speedup of 1.57 over a state-of-the-art dynamic run-time approach, a speedup of 3.02 over a purely multi-core approach and 1.55 over the performance achieved by using just the GPU.

show abstract

A dynamic matching and scheduling algorithm for heterogeneous computing systems

Cited by 139 publications

References 7 publications

Predictive Runtime Code Scheduling for Heterogeneous Architectures

Predictive Runtime Code Scheduling for Heterogeneous Architectures

Coordination by design and the price of autonomy

A Static Task Partitioning Approach for Heterogeneous Systems Using OpenCL

Contact Info

Product

Resources

About