Data Organization in Parallel Computers (The Springer International Series in Engineering and Computer Science, 67) von Wijshoff, Harry A.G.: Like New Hardcover (1989)

Beschreibung

Like New.

Bestandsnummer des Verk�ufers ERICA77308983830486

Verk�ufer kontaktieren

Diesen Artikel melden

Bibliografische Details

Titel: Data Organization in Parallel Computers (The Springer International Series in Engineering and Computer Science, 67)
Verlag: Springer
Erscheinungsjahr: 1989
Sprache: Englisch
ISBN-10: 0898383048
ISBN-13: 9780898383041
Einband: Hardcover
Zustand: Like New
Buchtyp: book

�ber diesen Titel

Inhaltsangabe

The organization of data is clearly of great importance in the design of high performance algorithms and architectures. Although there are several landmark papers on this subject, no comprehensive treatment has appeared. This monograph is intended to fill that gap. We introduce a model of computation for parallel computer architec� tures, by which we are able to express the intrinsic complexity of data or� ganization for specific architectures. We apply this model of computation to several existing parallel computer architectures, e.g., the CDC 205 and CRAY vector-computers, and the MPP binary array processor. The study of data organization in parallel computations was introduced as early as 1970. During the development of the ILLIAC IV system there was a need for a theory of possible data arrangements in interleaved mem� ory systems. The resulting theory dealt primarily with storage schemes also called skewing schemes for 2-dimensional matrices, i.e., mappings from a- dimensional array to a number of memory banks. By means of the model of computation we are able to apply the theory of skewing schemes to var� ious kinds of parallel computer architectures. This results in a number of consequences for both the design of parallel computer architectures and for applications of parallel processing.

Rese�a del editor

The organization of data is clearly of great importance in the design of high performance algorithms and architectures. Although there are several landmark papers on this subject, no comprehensive treatment has appeared. This monograph is intended to fill that gap. We introduce a model of computation for parallel computer architec� tures, by which we are able to express the intrinsic complexity of data or� ganization for specific architectures. We apply this model of computation to several existing parallel computer architectures, e.g., the CDC 205 and CRAY vector-computers, and the MPP binary array processor. The study of data organization in parallel computations was introduced as early as 1970. During the development of the ILLIAC IV system there was a need for a theory of possible data arrangements in interleaved mem� ory systems. The resulting theory dealt primarily with storage schemes also called skewing schemes for 2-dimensional matrices, i.e., mappings from a- dimensional array to a number of memory banks. By means of the model of computation we are able to apply the theory of skewing schemes to var� ious kinds of parallel computer architectures. This results in a number of consequences for both the design of parallel computer architectures and for applications of parallel processing.

��ber diesen Titel� kann sich auf eine andere Ausgabe dieses Titels beziehen.