Time and Parallel Processor Bounds for Fortran-Like Loops

DOI10.1109/TC.1979.1675434MaRDI QIDQ3853105zbMATH OpenFDO

Authors Utpal Banerjee, S. C. Chen, David Kuck, Ross A. Towle

Publication date 1979

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.1979.1675434

zbMATH Keywords

analysis of programsdata dependenceFortran-like loopsparallel computationprocessor boundsprogram speeduprecurrence relationstime bounds

Mathematics Subject Classification ID

Theory of operating systems (68N25) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited in

(7)

• Data dependence and its application to parallel processing
• Parallel scheduling of recursively defined arrays
• Loop skewing: the wavefront method revisited
• Partitioning and mapping of nested loops for linear array multicomputers
• LOWER TIME AND PROCESSOR BOUNDS FOR EFFICIENT MAPPING OF UNIFORM DEPENDENCE ALGORITHMS INTO SYSTOLIC ARRAYS
• Verification by Parallelization of Parametric Code
• On high-speed computing with a programmable linear array

This page was built for publication: Time and Parallel Processor Bounds for Fortran-Like Loops

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3853105)