Some efficient solutions to the affine scheduling problem. II: Multidimensional time
type: Item
instance of: scholarly article
title: Some efficient solutions to the affine scheduling problem. II: Multidimensional time
zbMATH Open document ID: 0808.90081
DOI: 10.1007/BF01379404
author: Paul Feautrier
published in: International Journal of Parallel Programming
publication date: 1994-05-05T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 563117
zbMATH Keywords: automatic parallelism detection
zbMATH Keywords: parallelizing compilers
zbMATH Keywords: divide and conquer
zbMATH Keywords: affine schedule
zbMATH Keywords: parallel complexity
zbMATH Keywords: multidimensional schedules
zbMATH Keywords: loop nests
describes a project that uses: PipLib
MaRDI profile type: Publication
cites work: Some efficient solutions to the affine scheduling problem. I: One- dimensional time
cites work: Automatic translation of FORTRAN programs to vector form
cites work: Dataflow analysis of array and scalar references
cites work: Optimal code parallelization using unimodular transformations
cites work: Q3818127
cites work: Parametric integer programming
full work available at URL: https://doi.org/10.1007/bf01379404
OpenAlex ID: W2983923412
description: scientific article; zbMATH DE number 563117