A consistent generation of pipeline parallelism and distribution of operations and data among processors
From MaRDI portal
Publication:2433015
DOI10.1134/S0361768806030078zbMath1103.68375MaRDI QIDQ2433015
N. A. Likhoded, E. V. Adutskevich
Publication date: 26 October 2006
Published in: Programming and Computer Software (Search for Journal in Brave)
Related Items
Sufficient conditions for the determination and use of data in the same granular parallel computation process, Parallelization of sequential programs: distribution of arrays among processors and structurization of communications, Unnamed Item
Cites Work
- Some efficient solutions to the affine scheduling problem. I: One- dimensional time
- Maximizing parallelism and minimizing synchronization with affine partitions
- Mapping uniform loop nests onto distributed memory architectures
- Mapping affine loop nests
- A method for parallelizing algorithms by vector scheduling functions
- Distribution of operations and data arrays over processors