4.5 Article

Multi-resource scheduling of moldable workflows

Related references

Note: Only part of the references are listed.
Article Computer Science, Software Engineering

Multi-resource allocation in cloud data centers: A trade-off on fairness and efficiency

Suhan Jiang et al.

Summary: Fair allocation has been a topic of intensive study in economics and computer science, particularly in the context of multi-resource allocation in shared computer systems. Traditional methods often focus on abstracting multiple resources as a single resource bundle, but this may not meet the needs of diverse users. A promising approach, dominant resource fairness (DRF), has been proposed to equalize each user's dominant share while considering efficiency. This article introduces a new mechanism, 2-dominant resource fairness (2-DF), which takes into account a user's secondarily desired resource in addition to the dominant resource, and extends the concept to k-dominant resource fairness (k-DF).

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE (2021)

Article Computer Science, Theory & Methods

Scheduling on Two Types of Resources: A Survey

Olivier Beaumont et al.

ACM COMPUTING SURVEYS (2020)

Article Computer Science, Software Engineering

Fast approximation algorithms for task-based runtime systems

Olivier Beaumont et al.

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE (2018)

Article Computer Science, Theory & Methods

An Improved Approximation for Scheduling Malleable Tasks with Precedence Constraints via Iterative Method

Chi-Yeh Chen

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS (2018)

Article Computer Science, Hardware & Architecture

Randomized Algorithms for Scheduling Multi-Resource Jobs in the Cloud

Konstantinos Psychas et al.

IEEE-ACM TRANSACTIONS ON NETWORKING (2018)

Article Computer Science, Information Systems

P-Aware: a proportional multi-resource scheduling strategy in cloud data center

Hang Zhou et al.

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS (2016)

Article Computer Science, Theory & Methods

A multi-dimensional job scheduling

Mehdi Sheikhalishahi et al.

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE (2016)

Article Computer Science, Hardware & Architecture

KNIGHTS LANDING: SECOND-GENERATION INTEL XEON PHI PRODUCT

Avinash Sodani et al.

IEEE MICRO (2016)

Proceedings Paper Computer Science, Information Systems

Superlinear Speedup in HPC Systems: why and when?

Sasko Ristov et al.

PROCEEDINGS OF THE 2016 FEDERATED CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SYSTEMS (FEDCSIS) (2016)

Article Computer Science, Theory & Methods

Multi-Resource Fair Allocation in Heterogeneous Cloud Computing Systems

Wei Wang et al.

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS (2015)

Article Computer Science, Information Systems

Multi-Resource Packing for Cluster Schedulers

Robert Grandl et al.

ACM SIGCOMM COMPUTER COMMUNICATION REVIEW (2014)

Article Computer Science, Interdisciplinary Applications

PaRSRC: Exploiting Heterogeneity to Enhance Scalability

George Bosilca et al.

COMPUTING IN SCIENCE & ENGINEERING (2013)

Article Computer Science, Theory & Methods

A 3.42-Approximation Algorithm for Scheduling Malleable Tasks under Precedence Constraints

Chi-Yeh Chen et al.

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS (2013)

Article Computer Science, Software Engineering

StarPU: a unified platform for task scheduling on heterogeneous multicore architectures

Cedric Augonnet et al.

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE (2011)

Article Computer Science, Theory & Methods

A 3/2-approximation algorithm for scheduling independent monotonic malleable tasks

Gregory Mounie et al.

SIAM JOURNAL ON COMPUTING (2007)

Article Computer Science, Theory & Methods

An improved two-step algorithm for task and data parallel scheduling in distributed memory machines

Savina Bansal et al.

PARALLEL COMPUTING (2006)

Article Computer Science, Theory & Methods

An Approximation Algorithm for Scheduling Malleable Tasks under General Precedence Constraints

Klaus Jansen et al.

ACM TRANSACTIONS ON ALGORITHMS (2006)

Article Management

An approximation algorithm for scheduling trees of malleable tasks

R Lepère et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2002)