Data Mappings in Large Parallel Computers

Parallel computers (such as vector machines and array-processors) feature the availability of many, highly pipelined processing units and many memory banks that can be accessed independently in parallel at great speed. Aside from needing adequately parallelized (“vectorized”) algorithms, their application requires general storage mappings for distributing vector data and retrieving it from memory at low cost. Data mappings of this kind, also known as “skewing schemes”, were first considered during the design of the ILLIAC IV in the late nineteen sixties. We survey known results and recent advances of the remarkable theory of skewing schemes.

[1]  Paul Budnik,et al.  The Organization and Use of Parallel Memories , 1971, IEEE Transactions on Computers.

[2]  Duncan H. Lawrie,et al.  The Prime Memory System for Array Access , 1982, IEEE Transactions on Computers.

[3]  Peter C. Patton,et al.  The Future of Parallel Processing , 1973, IEEE Transactions on Computers.

[4]  Duncan H. Lawrie,et al.  A Practical Algorithm for the Solution of Triangular Systems on a Parallel Processing System , 1982, IEEE Transactions on Computers.

[5]  Michael J. Flynn,et al.  Some Computer Organizations and Their Effectiveness , 1972, IEEE Transactions on Computers.

[6]  Walter T. Federer,et al.  On the Nonexistence of Knut Vik Designs for All Even Orders , 1975 .

[7]  W. Ahrens,et al.  Mathematische Unterhaltungen und Spiele , 2009 .

[8]  E. Wright,et al.  An Introduction to the Theory of Numbers , 1939 .

[9]  Kenneth J. Thurber.  Large scale computer architecture: Parallel and associative processors , 1976 .

[10]  David J. Kuck.  ILLIAC IV Software and Application Programming , 1968, IEEE Transactions on Computers.

[11]  A. Hedayat,et al.  A Complete Solution to the Existence and Nonexistence of Knut Vik Designs and Orthogonal Knut Vik Designs , 1977, J. Comb. Theory A.

[12]  Duncan H. Lawrie,et al.  Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.

[13]  H. T. Kung.  The Structure of Parallel Algorithms , 1980, Adv. Comput..

[14]  J. van Leeuwen,et al.  Periodic storage schemes with a minimum number of memory banks , 1983 .

[15]  Jan van Leeuwen,et al.  Periodic versus arbitrary tessellations of the plane using polyominos of a single type , 1983 .

[16]  Daniel P. Siewiorek,et al.  A survey of highly parallel computing , 1982, Computer.

[17]  Generalized Latin squares on the torus , 1978, Discret. Math..

[18]  Henry D. Shapiro,et al.  Theoretical Limitations on the Efficient Use of Parallel Memories , 1978, IEEE Transactions on Computers.

[19]  J. van Leeuwen,et al.  A linearity condition for periodic skewing schemes , 1983 .

[20]  J. Schwartz.  Large Parallel Computers , 1966, JACM.