High performance massively parallel abstract data type components

Abstract

An approach for designing high-performance ADT (abstract data type) components for massively parallel systems without sacrificing information hiding is presented. This approach merges information hiding clients and servers to achieve high communication bandwidth for transmitting requests and receiving responses. It uses multi-entry data structures, massive-state-transition interface operations, and a four-level decomposition approach to achieve both structured programming and information hiding within the ADT implementation. To facilitate the systematic design of various ADTs, they have been classified into three classes: unrelated, crystalline, and amorphous collections. The authors present general design decisions for each layer of each class of ADT and illustrate the theory with a detailed example from each class.<>