Abstract:
A method and apparatus enables partitioning of data to efficiently store and retrieve data relating to a database system (either a parallel or non-parallel database system). Such partitioning may be performed by receiving information associated with at least one characteristic of the data and performing an algorithm to divide the data into related data segments. The data segments may be stored in a distributive database system based on the characteristic associated with the data.
Abstract:
A multistage interconnect network (MIN) capable of supporting massive parallel processing, including point-to-point and multicast communications between processor modules (PMs) which are connected to the input and output ports of the network. The network is built using interconnected switch nodes arranged in 2 ┌logb N┐ stages, wherein b is the number of switch node input/output ports, N is the number of network input/output ports and ┌logb N┐ indicates a ceiling function providing the smallest integer not less than logb N. The additional stages provide additional paths between network input ports and network output ports, thereby enhancing fault tolerance and lessening contention.
Abstract:
A multistage interconnect network (MIN) capable of supporting massive parallel processing, including point-to-point and multicast communications between processor modules (PMs) which are connected to the input and output ports of the network. The network is built using interconnected switch nodes arranged in 2 log.sub.b N stages, wherein b is the number of switch node input/output ports, N is the number of network input/output ports and log.sub.b N indicates a ceiling function providing the smallest integer not less than log.sub.b N. The additional stages provide additional paths between network input ports and network output ports, thereby enhancing fault tolerance and lessening contention.
Abstract:
A multistage interconnect network (MIN) capable of supporting massive parallel processing, including point-to-point and multicast communications between processor modules (PMs) which are connected to the input and output ports of the network. The network is built using interconnected switch nodes arranged in 2 |logb N| stages, wherein b is the number of switch node input/output ports, N is the number of network input/output ports and |logb N| indicates a ceiling function providing the smallest integer not less than logb N. The additional stages provide additional paths between network input ports and network output ports, thereby enhancing fault tolerance and lessening contention.
Abstract translation:能够支持大规模并行处理的多级互连网络(MIN),包括连接到网络的输入和输出端口的处理器模块(PM)之间的点对点和多点通信。 网络使用2 | logb N |中布置的互连交换机节点构建 阶段,其中b是交换节点输入/输出端口的数量,N是网络输入/输出端口的数量,| logb N | 表示提供不小于logb N的最小整数的天花板功能。附加级提供网络输入端口和网络输出端口之间的附加路径,从而增强容错能力和减少争用。
Abstract:
A multistage interconnect network (MIN) capable of supporting massive parallel processing, including point-to-point and multicast communications between processor modules (PMs) which are connected to the input and output ports of the network. The network is built using interconnected switch nodes arranged in 2 .left brkt-top. log.sub.b N .right brkt-top. stages, wherein b is the number of switch node input/output ports, N is the number of network input/output ports and .left brkt-top. log.sub.b N .right brkt-top. indicates a ceiling function providing the smallest integer not less than log.sub.b N. The additional stages provide additional paths between network input ports and network output ports, thereby enhancing fault tolerance and lessening contention.
Abstract translation:能够支持大规模并行处理的多级互连网络(MIN),包括连接到网络的输入和输出端口的处理器模块(PM)之间的点对点和多点通信。 网络采用2 +539 logb N + 538级布置的互连交换机节点构建,其中b为交换节点输入/输出端口数,N为网络输入/输出端口数,+539 logb N +538表示 提供不小于logb N的最小整数的天花板功能。附加级提供网络输入端口和网络输出端口之间的附加路径,从而增强容错能力和减少争用。
Abstract:
A multistage interconnect network (MIN) capable of supporting massive parallel processing, including point-to-point and multicast communications between processor modules (PMs) which are connected to the input and output ports of the network. The network is built using interconnected switch nodes arranged in 2 [logb N] stages, wherein b is the number of switch node input/output ports, N is the number of network input/output ports and [logb N] indicates a ceiling function providing the smallest integer not less than logb N. The additional stages provide additional paths between network input ports and network output ports, thereby enhancing fault tolerance and lessening contention.
Abstract:
A multistage interconnect network (MIN) capable of supporting massive parallel processing, including point-to-point and multicast communications between processor modules (PMs) which are connected to the input and output ports of the network. The network is built using interconnected switch nodes arranged in 2 log.sub.b N stages, wherein b is the number of switch node input/output ports, N is the number of network input/output ports and log.sub.b N indicates a ceiling function providing the smallest integer not less than log.sub.b N. The additional stages provide additional paths between network input ports and network output ports, thereby enhancing fault tolerance and lessening contention.
Abstract:
A multistage interconnect network (MIN) capable of supporting massive parallel processing, including point-to-point and multicast communications between processor modules (PMs) which are connected to the input and output ports of the network. The network is built using interconnected switch nodes arranged in 2 log.sub.b N stages, wherein b is the number of switch node input/output ports, N is the number of network input/output ports and log.sub.b N indicates a ceiling function providing the smallest integer not less than log.sub.b N. The additional stages provide additional paths between network input ports and network output ports, thereby enhancing fault tolerance and lessening contention.
Abstract:
A fault tolerant disk drive matrix comprises a plurality of disk drives. A mapping method associates a subset of the disk drives with a logical RAID-5 array. Each of the disk drives in the matrix may be associated with a plurality of different logical RAID-5 arrays. Logical units of data are subdivided into blocks and stored in an interleaved manner across the disk drives of the logical RAID-5 array. The arrangement of data and parity blocks on the logical RAID-5 arrays within the matrix reduces throughput degradation when a disk drive fails. In the event of a disk drive failure, data blocks stored on the failed disk drive can be reconstructed using redundancy blocks and data blocks from the surviving disk drives within the logical RAID-5 array. Replacement disk drives may also be provided to substitute for the failed disk drive in the logical RAID-5 array. Thus, the mapping of logical RAID-5 arrays to physical disk drives in the matrix may change in position and identity due to disk drive replacements caused by failures.