Malleable scheduling for flows of jobs and applications to MapReduce

DOI10.1007/s10951-018-0576-yzbMath1434.90065OpenAlexW2885567011WikidataQ129423530 ScholiaQ129423530MaRDI QIDQ2304112

Viswanath Nagarajan, Kirsten Hildrum, Andrey Balmin, Joel L. Wolf

Publication date: 6 March 2020

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-018-0576-y

zbMATH Keywords

precedence constraintsapproximation algorithmsMapReduceparallel scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (2)

Improved upper bounds for online malleable job scheduling ⋮ Malleable scheduling for flows of jobs and applications to MapReduce

Uses Software

• MapReduce
• Hive
• Jaql

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling malleable tasks with precedence constraints
• Scheduling for parallel processing
• A 2.5 times optimal algorithm for packing in two dimensions
• Real-time scheduling of linear speedup parallel tasks
• A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
• Scheduling MapReduce jobs under multi-round precedences
• Scheduling parallel tasks with sequential heads and tails
• Malleable scheduling for flows of jobs and applications to MapReduce
• Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
• Scheduling with Deadlines and Loss Functions
• An approximation algorithm for scheduling malleable tasks under general precedence constraints
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Orthogonal Packings in Two Dimensions
• Bounds for Multiprocessor Scheduling with Resource Constraints
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Smart SMART Bounds for Weighted Response Time Scheduling
• Speed is as powerful as clairvoyance
• Minimization of the maximum delay in servicing systems with interruption
• Bounds for Certain Multiprocessing Anomalies
• New applications of the Muntz and Coffman algorithm
• Fast and simple approximation schemes for generalized flow.

This page was built for publication: Malleable scheduling for flows of jobs and applications to MapReduce