Minimizing the schedule length for a parallel 3D-grid precedence graph
type: Item
instance of: scholarly article
title: Minimizing the schedule length for a parallel 3D-grid precedence graph
zbMATH Open document ID: 0947.90575
DOI: 10.1016/0377-2217(95)00297-9
author: Evripidis Bampis
author: Denis Trystram
author: Jean-Claude König
published in: European Journal of Operational Research
publication date: 1999-02-22T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1252956
zbMATH Keywords: precedence graph
zbMATH Keywords: grid
zbMATH Keywords: scheduling
zbMATH Keywords: communications
zbMATH Keywords: overhead
MaRDI profile type: Publication
full work available at URL: 0377-2217(95)00297-9
OpenAlex ID: W2080512320
cites work: Impact of communications of the complexity of the parallel Gaussian elimination
cites work: Scheduling Multiprocessor Tasks to Minimize Schedule Length
cites work: Q4023677
cites work: A state-of-the-art review of parallel-machine scheduling research
cites work: Parallel Gaussian elimination on an MIMD computer
cites work: Q4198056
cites work: Solving Linear Algebraic Equations on an MIMD Computer
cites work: A Communication-Time Tradeoff
cites work: Optimal scheduling algorithms for parallel Gaussian elimination
description: scientific article; zbMATH DE number 1252956