On linear skewing schemes and d-ordered vectors
Journal Article
·
· IEEE Trans. Comput.; (United States)
Linear skewing schemes were introduced in the nineteen sixties, to provide a simple class of storage mappings for N x N matrices for use in vector processors with a large number of memory banks. Conditions on linear skewing schemes guarantee conflict-free access to rows, columns, and/or (anti-) diagonals are usually presented in terms of conditions on so-called d-ordered vectors. The authors argue that these formulations are mathematically imprecise, and revise and extend the existing theory. Several claims are proved to bound the minimum number of memory banks needed for successful linear skewing by, e.g., the smallest prime number greater than or equal to N.
- Research Organization:
- Dept. of Computer Science, Univ. of Utrecht, 3508 TA Utrecht
- OSTI ID:
- 6831485
- Journal Information:
- IEEE Trans. Comput.; (United States), Vol. C-36:2
- Country of Publication:
- United States
- Language:
- English
Similar Records
Vector access performance in parallel memories using a skewed storage scheme
Logical data skewing schemes for interleaved memories in vector processors
Generalized schemes for access and alignment of data in parallel processors with self-routing interconnection networks
Journal Article
·
Tue Dec 01 00:00:00 EST 1987
· IEEE Trans. Comput.; (United States)
·
OSTI ID:6831485
Logical data skewing schemes for interleaved memories in vector processors
Book
·
Fri Jan 01 00:00:00 EST 1988
·
OSTI ID:6831485
Generalized schemes for access and alignment of data in parallel processors with self-routing interconnection networks
Journal Article
·
Fri Feb 01 00:00:00 EST 1991
· Journal of Parallel and Distributed Computing; (United States)
·
OSTI ID:6831485