A consistent generation of pipeline parallelism and distribution of operations and data among processors
From MaRDI portal
Publication:2433015
Recommendations
Cites work
- A method for parallelizing algorithms by vector scheduling functions
- Distribution of operations and data arrays over processors
- Mapping affine loop nests
- Mapping uniform loop nests onto distributed memory architectures
- Maximizing parallelism and minimizing synchronization with affine partitions
- Some efficient solutions to the affine scheduling problem. I: One- dimensional time
Cited in
(13)- Maximizing parallelism and minimizing synchronization with affine partitions
- Paralleling loop nests in computing systems with a small number of processors and a common memory
- A solution of the cache ping-pong problem in multiprocessor systems
- Mapping uniform loop nests onto distributed memory architectures
- Mapping affine loop nests
- Mapping loop nests to multipipelined architecture
- Cyclic software pipelining and translation of DO-loops for tightly coupled multiprocessor systems
- Optimal use of mixed task and data parallelism for pipelined computations
- 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
- Maximum Pipelining Of Array Computation: A Pipelined Code Mapping Scheme For Dataflow Computers
- Multi-dimensional parallelization considering conditions of data localization
- Locality estimation of parallel algorithm for distributed memory computers
This page was built for publication: A consistent generation of pipeline parallelism and distribution of operations and data among processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2433015)
