Generating efficient local memory access sequences for coupled subscripts in data-parallel programs. (Q1869645): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Generating local addresses and communication sets for data-parallel programs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient computation of address sequences in data parallel programs using closed forms for basis vectors. / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:32, 5 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generating efficient local memory access sequences for coupled subscripts in data-parallel programs. |
scientific article |
Statements
Generating efficient local memory access sequences for coupled subscripts in data-parallel programs. (English)
0 references
28 April 2003
0 references
Coupled subscript
0 references
Block-cyclic distribution
0 references
distributed memory machines
0 references
local memory access sequence
0 references
