Abstract: A method for managing data includes receiving individually accessible data units, each identified by a key value; storing a plurality of blocks of data, each of at least some of the blocks being generated by combining a plurality of the data units; and providing an index that includes an entry for each of the blocks. One or more of the entries enable location, based on a provided key value, of a block that includes data units corresponding to a range of key values that includes the provided key value.

Abstract: A method for managing data includes receiving individually accessible data units, each identified by a key value; storing a plurality of blocks of data, each of at least some of the blocks being generated by combining a plurality of the data units; and providing an index that includes an entry for each of the blocks. One or more of the entries enable location, based on a provided key value, of a block that includes data units corresponding to a range of key values that includes the provided key value.

Abstract: A method for managing data includes receiving individually accessible data units, each identified by a key value; storing a plurality of blocks of data, each of at least some of the blocks being generated by combining a plurality of the data units; and providing an index that includes an entry for each of the blocks. One or more of the entries enable location, based on a provided key value, of a block that includes data units corresponding to a range of key values that includes the provided key value.

Abstract: Aggregating data includes accepting a first data set that includes records, each record holding a value for each of a plurality of fields. A second data set is generated from the first data set. The second data set includes one or more aggregated records each corresponding to one or more records from the first data set that match values in a subset of fields. A third data set is generated from the second data set. The third data set includes one or more aggregated records each corresponding to one or more aggregated records of the first data set that match values in a subset of fields. An aggregate value associated with an aggregated record in the third data set represents a result of performing a non-cascadable operation on values associated with a plurality of records from the first data set.

Abstract: A method for managing data includes receiving individually accessible data units, each identified by a key value; storing a plurality of blocks of data, each of at least some of the blocks being generated by combining a plurality of the data units; and providing an index that includes an entry for each of the blocks. One or more of the entries enable location, based on a provided key value, of a block that includes data units corresponding to a range of key values that includes the provided key value.

Abstract: Aggregating data includes accepting a first data set that includes records, each record holding a value for each of a plurality of fields. A second data set is generated from the first data set. The second data set includes one or more aggregated records each corresponding to one or more records from the first data set that match values in a subset of fields. A third data set is generated from the second data set. The third data set includes one or more aggregated records each corresponding to one or more aggregated records of the first data set that match values in a subset of fields. An aggregate value associated with an aggregated record in the third data set represents a result of performing a non-cascadable operation on values associated with a plurality of records from the first data set.

Abstract: A method for analyzing the performance and capacity of an application and a parallel processing system. Based upon a graph representation of the application and system and upon supplied performance values, a data file is created which describes the graph and values. Using that data file, performance equations are generated which model the performance of the application and the system. The model is displayed and modified by the user to allow analysis, evaluation, and extrapolation.

Abstract: A method for analyzing the performance and capacity of an application and a parallel processing system. Based upon a graph representation of the application and system and upon supplied performance values, a data file is created which describes the graph and values. Using that data file, performance equations are generated which model the performance of the application and the system. The model is displayed and modified by the user to allow analysis, evaluation, and extrapolation.

Abstract: A method for analyzing the performance and capacity of an application and a parallel processing system. Based upon a graph representation of the application and system and upon supplied performance values, a data file is created which describes the graph and values. Using that data file, performance equations are generated which model the performance of the application and the system. The model is displayed and modified by the user to allow analysis, evaluation, and extrapolation.

Abstract: A computer comprising a plurality of processing elements and an input/output processor interconnected by a routing network. The routing network transfers messages between the processing elements and the input/output processor. The processing elements perform processing operations in connection with data received from the input/output processor in messages transferred over the routing network and transferring processed data to the input/output processor in messages over the routing network, the processing elements being connected as a first selected series of leaf nodes. The input/output processor includes a plurality of input/output buffers connected as a second selected series of leaf nodes of the routing network for generating messages for transfer over the routing network to a series of processing elements forming at least a selected subset of the processing elements during an input/output operation.

Abstract: A mass storage system for connection to a computer. The mass storage system includes a plurality of independently-controllable storage modules, each storage module having a storage element for storing data in a plurality of storage locations and a retrieval arrangement for retrieving data from selected ones of the storage locations. A word assembly arrangement receives data from the storage modules in parallel and generates in response thereto data words for transfer to the computer system. A system control module selectively enables the retrieval arrangements of the storage modules to retrieve in parallel data from corresponding storage locations of all of the storage elements, or to retrieve data from diverse locations in selected storage modules.

Abstract: A method and apparatus are disclosed for operating a multi-unit memory system so that one of such units may readily be replaced in service. The system comprises an error correction code (ECC) generation circuit, a plurality of read/write memory units and at least one spare read/write memory unit. The ECC circuit generates an error correction code for each block of data to be stored in the system and supplies this code along with the block of data to the memory units for storage. The system further comprises means for generating from a sequence of blocks of data and associated error correction codes retrieved from these memory units a sequence of bits which correct an error in the information retrieved from one memory unit and means for writing this sequence of correction bits to the spare read/write memory unit. Advantageously, the system also comprises means for rewriting the sequence of correction bits to a memory unit after a faulty memory unit has been repaired or replaced.