Robust static resource allocation of DAGs in a heterogeneous multicore system

Authors:
Luis Diego Briceño;Jay Smith;Howard Jay Siegel;Anthony A. Maciejewski;Paul Maxwell;Russ Wakefield;Abdulla Al-Qawasmeh;Ron C. Chiang;Jiayin Li
Affiliations:
-;-;-;-;-;-;-;-;-
Venue:
Journal of Parallel and Distributed Computing
Year:
2013

Citing 26
Cited 0

Allocating Modules to Processors in a Distributed System

IEEE Transactions on Software Engineering
The GENITOR algorithm and selection pressure: why rank-based allocation of reproductive trials is best

Proceedings of the third international conference on Genetic algorithms
Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors

IEEE Transactions on Parallel and Distributed Systems
Task matching and scheduling in heterogeneous computing environments using a genetic-algorithm-based approach

Journal of Parallel and Distributed Computing - Special issue on parallel evolutionary computing
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors

Journal of the ACM (JACM)
A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems

Journal of Parallel and Distributed Computing
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing

IEEE Transactions on Parallel and Distributed Systems
QoS and Contention-Aware Multi-Resource Reservation

Cluster Computing
Optimal Task Assignment in Heterogeneous Distributed Computing Systems

IEEE Concurrency
Heterogeneous Computing: Challenges and Opportunities

Computer
A Distributed Heterogeneous Supercomputing Management System

Computer
Hypertool: A Programming Aid for Message-Passing Systems

IEEE Transactions on Parallel and Distributed Systems
A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures

IEEE Transactions on Parallel and Distributed Systems
An integrated technique for task matching and scheduling onto distributed heterogeneous computing systems

Journal of Parallel and Distributed Computing - Problems in parallel and distributed computing: Solutions based on evolutionary paradigms
Task Matching and Scheduling in Heterogeneous Systems Using Simulated Evolution

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Measuring the Robustness of a Resource Allocation

IEEE Transactions on Parallel and Distributed Systems
Iterative list scheduling for heterogeneous computing

Journal of Parallel and Distributed Computing
A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems

Parallel Computing - Heterogeneous computing
Static allocation of resources to communicating subtasks in a heterogeneous ad hoc grid environment

Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Push-Pull: Deterministic Search-Based DAG Scheduling for Heterogeneous Cluster Systems

IEEE Transactions on Parallel and Distributed Systems
A hybrid Branch-and-Bound and evolutionary approach for allocating strings of applications to heterogeneous distributed computing systems

Journal of Parallel and Distributed Computing
Stochastic robustness metric and its use for static resource allocations

Journal of Parallel and Distributed Computing
Robust resource allocation in a cluster based imaging system

Parallel Computing
List scheduling with duplication for heterogeneous computing systems

Journal of Parallel and Distributed Computing
Evaluation and Optimization of the Robustness of DAG Schedules in Heterogeneous Environments

IEEE Transactions on Parallel and Distributed Systems
Scheduling with uncertainties on new computing platforms

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this study, we consider an environment composed of a heterogeneous cluster of multicore-based machines used to analyze satellite data. The workload involves large data sets and is subject to a deadline constraint. Multiple applications, each represented by a directed acyclic graph (DAG), are allocated to a dedicated heterogeneous distributed computing system. Each vertex in the DAG represents a task that needs to be executed and task execution times vary substantially across machines. The goal of this research is to assign the tasks in applications to a heterogeneous multicore-based parallel system in such a way that all applications complete before a common deadline, and their completion times are robust against uncertainties in execution times. We define a measure that quantifies robustness in this environment. We design, compare, and evaluate five static resource allocation heuristics that attempt to maximize robustness. We consider six different scenarios with different ratios of computation versus communication, and loose and tight deadlines.