Heuristics for multi-round divisible loads scheduling with limited memory
type: Item
instance of: scholarly article
title: Heuristics for multi-round divisible loads scheduling with limited memory
zbMATH Open document ID: 1204.68035
published in: Parallel Computing
publication date: 2010-09-02T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 68M14
zbMATH DE Number: 5777724
zbMATH Keywords: scheduling
zbMATH Keywords: divisible loads
zbMATH Keywords: memory limitations
zbMATH Keywords: heuristics
author: Joanna Berlińska
author: M. Drozdowski
describes a project that uses: Genocop
describes a project that uses: MapReduce
MaRDI profile type: Publication
full work available at URL: j.parco.2010.02.004
OpenAlex ID: W1995917368
cites work: Experimental study of scheduling with memory constraints using hybrid methods
cites work: Scheduling for parallel processing
cites work: Parallel Processing and Applied Mathematics
cites work: Scheduling multiple divisible loads in homogeneous star systems
cites work: Optimum divisible load scheduling on heterogeneous stars with limited memory
cites work: Load partitioning and trade-off study for large matrix-vector computations in multicast bus networks with communictaion delays
cites work: Q4692508
cites work: Q4873721
DOI: 10.1016/J.PARCO.2010.02.004
description: scientific article; zbMATH DE number 5777724