A consistent generation of pipeline parallelism and distribution of operations and data among processors (Q2433015): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Some efficient solutions to the affine scheduling problem. I: One- dimensional time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Mapping affine loop nests / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Distribution of operations and data arrays over processors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Mapping uniform loop nests onto distributed memory architectures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maximizing parallelism and minimizing synchronization with affine partitions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A method for parallelizing algorithms by vector scheduling functions / rank | |||
Normal rank |
Latest revision as of 21:17, 24 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A consistent generation of pipeline parallelism and distribution of operations and data among processors |
scientific article |
Statements
A consistent generation of pipeline parallelism and distribution of operations and data among processors (English)
0 references
26 October 2006
0 references
parallel computers with distributed memory
0 references