Algorithms for hierarchical and semi-partitioned parallel scheduling
type: Item
instance of: scholarly article
title: Algorithms for hierarchical and semi-partitioned parallel scheduling
zbMATH Open document ID: 1479.90079
author: Vincenzo Bonifaci
author: Gianlorenzo D'Angelo
author: Alberto Marchetti-Spaccamela
published in: Journal of Computer and System Sciences
publication date: 2021-06-30T00:00:00Z
full work available at URL: affinity-ipdps.pdf
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 7365383
zbMATH Keywords: processor affinities
zbMATH Keywords: makespan minimization
zbMATH Keywords: unrelated machines
zbMATH Keywords: laminar family
zbMATH Keywords: wrap-around rule
zbMATH Keywords: clustered scheduling
MaRDI profile type: Publication
OpenAlex ID: W2725268594
cites work: Improved approximation algorithms for scheduling parallel jobs on identical clusters
cites work: The power of preemption on unrelated machines and applications to scheduling orders
cites work: Parallel machine scheduling with job assignment restrictions
cites work: Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
cites work: A factor 2 approximation algorithm for the generalized Steiner network problem
cites work: Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding
cites work: Structural parameters for scheduling with assignment restrictions
cites work: Global wire routing in two-dimensional arrays
cites work: Iterative Methods in Combinatorial Optimization
cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
cites work: Approximation algorithms for scheduling unrelated parallel machines
cites work: Assigning sporadic tasks to unrelated machines
cites work: Scheduling with deadlines and loss functions
cites work: Parallel machine scheduling with nested job assignment restrictions
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: An approximation algorithm for the generalized assignment problem
cites work: Survey of scheduling techniques for addressing shared resources in multicore processors
DOI: 10.1016/J.JCSS.2021.03.006
description: scientific article; zbMATH DE number 7365383