Approximation algorithms and heuristics for task scheduling in data-intensive distributed systems

DOI10.1111/ITOR.12527MaRDI QIDQ4624878zbMATH OpenOpenAlexWikidataFDO

Authors Marcelo G. Póvoa, Eduardo C. Xavier

Publication date 20 February 2019

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/itor.12527

zbMATH Keywords

approximation algorithmsdata gridsdata replicationtask scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An SCP-based heuristic approach for scheduling distributed data-intensive applications on global grids
• A data intensive heuristic approach to the two-stage streaming scheduling problem
• Euro-Par 2004 Parallel Processing
• Scheduling distributed clusters of parallel machines : primal-dual and LP-based approximation algorithms
• Scheduling distributed clusters of parallel machines: primal-dual and LP-based approximation algorithms

Cites work

• Approximation Algorithms for Data Placement Problems
• Benchmarking optimization software with performance profiles.
• Bounds for Certain Multiprocessing Anomalies
• Graph clustering
• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• scientific article; zbMATH DE number 1966237 (Why is no real title available?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scalable and Distributed Mechanisms for Integrated Scheduling and Replication in Data Grids

Cited in

(10)

• Heuristics for periodical batch job scheduling in a MapReduce computing framework
• A hybrid scheduler for many task computing in big data systems
• A data intensive heuristic approach to the two-stage streaming scheduling problem
• scientific article; zbMATH DE number 5985624 (Why is no real title available?)
• An SCP-based heuristic approach for scheduling distributed data-intensive applications on global grids
• Data Center Scheduling, Generalized Flows, and Submodularity
• Euro-Par 2004 Parallel Processing
• Scalable and Distributed Mechanisms for Integrated Scheduling and Replication in Data Grids
• Assignment of tasks to machines under data replication with a tie to Steiner systems
• Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories

Describes a project that uses

Uses Software

• OptorSim

This page was built for publication: Approximation algorithms and heuristics for task scheduling in data-intensive distributed systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4624878)