Abstract: A method and system for determining and sending or posting an electronic value for an index is provided. A list of sectors is obtained. The system then accesses a database storing company information. Eligible securities are selected, assigned to sectors and ranked within each sector. A weight for each eligible security is determined. An amount for the index value of the selected eligible securities based on the weighting is calculated. The index value may be posted or outputted electronically.

Abstract: A method and system for determining and sending or posting an electronic value for an index is provided. A list of sectors is obtained. The system then accesses a database storing company information. Eligible securities are selected, assigned to sectors and ranked within each sector. A weight for each eligible security is determined. An amount for the index value of the selected eligible securities based on the weighting is calculated. The index value may be posted or outputted electronically.

Abstract: Methods, apparatus, and computer program products are disclosed for computer hardware fault administration carried out in a parallel computer, where the parallel computer includes a plurality of compute nodes. The compute nodes are coupled for data communications by at least two independent data communications networks, where each data communications network includes data communications links connected to the compute nodes. Typical embodiments carry out hardware fault administration by identifying a location of a defective link in the first data communications network of the parallel computer and routing communications data around the defective link through the second data communications network of the parallel computer.

Abstract: Locating hardware faults in a parallel computer, including defining within a tree network of the parallel computer two or more sets of non-overlapping test levels of compute nodes of the network that together include all the data communications links of the network, each non-overlapping test level comprising two or more adjacent tiers of the tree; defining test cells within each non-overlapping test level, each test cell comprising a subtree of the tree including a subtree root compute node and all descendant compute nodes of the subtree root compute node within a non-overlapping test level; performing, separately on each set of non-overlapping test levels, an uplink test on all test cells in a set of non-overlapping test levels; and performing, separately from the uplink tests and separately on each set of non-overlapping test levels, a downlink test on all test cells in a set of non-overlapping test levels.

Abstract: Executing an allgather operation on a parallel computer that includes a plurality of compute nodes where the compute nodes are organized into at least one operational group of compute nodes for collective parallel operations of the parallel computer, and each compute node in the operational group is assigned a unique rank. In such a parallel computer, executing an allgather operation may include configuring on each compute node in an operational group of compute nodes a memory buffer with contribution data for an allreduce operation at a rank-dependent position in each memory buffer and zeros in all other positions in each memory buffer and executing on the compute nodes in the operational group, with the entire contents of each memory buffer, an allreduce operation with a bitwise OR function.

Abstract: Methods, apparatus, and computer program products are disclosed for computer hardware fault diagnosis carried out in a parallel computer, where the parallel computer includes a plurality of compute nodes. The compute nodes are coupled for data communications by at least two independent data communications networks, where each data communications network includes data communications links among the compute nodes. Typical embodiments carry out hardware fault diagnosis by executing a collective operation through a first data communications network upon a plurality of the compute nodes of the computer, executing the same collective operation through a second data communications network upon the same plurality of the compute nodes of the computer, and comparing results of the collective operations.

Abstract: Locating hardware faults in a data communications network of a parallel computer. Such a parallel computer includes a plurality of compute nodes and a data communications network that couples the compute nodes for data communications and organizes the compute node as a tree. Locating hardware faults includes identifying a next compute node as a parent node and a root of a parent test tree, identifying for each child compute node of the parent node a child test tree having the child compute node as root, running a same test suite on the parent test tree and each child test tree, and identifying the parent compute node as having a defective link connected from the parent compute node to a child compute node if the test suite fails on the parent test tree and succeeds on all the child test trees.

Abstract: An apparatus, program product and method checks for nodal faults in a group of nodes comprising a center node and all adjacent nodes. The center node concurrently communicates with the immediately adjacent nodes in three dimensions. The communications are analyzed to determine a presence of a faulty node or connection.

Abstract: An apparatus, program product and method enable nodal fault detection by sequencing communications between all system nodes. A master node may coordinate communications between two slave nodes before sequencing to and initiating communications between a new pair of slave nodes. The communications may be analyzed to determine the nodal fault.

Abstract: An apparatus, program product and method logically divides a group of nodes and causes node pairs comprising a node from each section to communicate. Results from the communications may be analyzed to determine performance characteristics, such as bandwidth and proper connectivity.

Abstract: An apparatus, program product and method for detecting nodal faults may simultaneously cause designated nodes of a cell to communicate with all nodes adjacent to each of the designated nodes. Furthermore, all nodes along the axes of the designated nodes are made to communicate with their adjacent nodes, and the communications are analyzed to determine if a node or connection is faulty.

Abstract: An apparatus, program product and method determine a nodal fault along the boundary, or face, of a computing cell. Nodes on adjacent cell boundaries communicate with each other, and the communications are analyzed to determine if a node or connection is faulty.

Abstract: An apparatus, program product and method checks for nodal faults in a row of nodes by causing each node in the row to concurrently communicate with its adjacent neighbor nodes in the row. The communications are analyzed to determine a presence of a faulty node or connection.