Time and Parallel Processor Bounds for Fortran-Like Loops
From MaRDI portal
Publication:3853105
DOI10.1109/TC.1979.1675434zbMath0419.68020MaRDI QIDQ3853105
David Kuck, Ross A. Towle, Utpal Banerjee, S. C. Chen
Publication date: 1979
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
parallel computationrecurrence relationsdata dependencetime boundsprocessor boundsanalysis of programsFortran-like loopsprogram speedup
Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)
Related Items
Data dependence and its application to parallel processing ⋮ Partitioning and mapping of nested loops for linear array multicomputers ⋮ Parallel scheduling of recursively defined arrays ⋮ On high-speed computing with a programmable linear array ⋮ Verification by Parallelization of Parametric Code ⋮ Loop skewing: the wavefront method revisited ⋮ LOWER TIME AND PROCESSOR BOUNDS FOR EFFICIENT MAPPING OF UNIFORM DEPENDENCE ALGORITHMS INTO SYSTOLIC ARRAYS