Subspace scheduling and parallel implementation of non-systolic regular iterative algorithms

DOI10.1007/BF02477178MaRDI QIDQ5748882zbMATH OpenOpenAlexFDO

Authors Vwani Roychowdhury, T. Kailath

Publication date 1989

Published in Journal of VLSI signal processing systems for signal, image and video technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02477178

zbMATH Keywords

hyperplanar schedulingregular iterative algorithms

Mathematics Subject Classification ID

Distributed algorithms (68W15) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling a system of nonsingular affine recurrence equations onto a processor array
• Some efficient solutions to the affine scheduling problem. I: One- dimensional time
• Systolic algorithms for some scheduling and graph problems
• An improved systolic algorithm for the algebraic path problem
• Design of space-optimal regular arrays for algorithms with linear schedules

Cited in

(3)

• Iterative scheduling algorithms based on the subdivision of the solution space into domains
• Scheduling a system of nonsingular affine recurrence equations onto a processor array
• Comments on scheduling parallel iterative methods on multiprocessor systems. II

This page was built for publication: Subspace scheduling and parallel implementation of non-systolic regular iterative algorithms

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