Abstract: A hybrid reconfiguration scheme can allow for fast partial network reconfiguration with different routing algorithms of choice in different subparts of the network. Partial reconfigurations can be orders of magnitude faster than the initial full configuration, thus making it possible to consider performance-driven reconfigurations in lossless networks.

Abstract: A device, method, and computer readable storage medium for routing in a computational grid arranged in a fat-tree, including performing preprocessing, performing base path routing to determine rules for routing in switches based on stored switch level, switch group, links between switches, links between switches and hosts, and fat-tree type, and performing run-time processing, including detecting a path fault, and determining at least one redundant path for the path fault. The base path routing determines a first routing rule that specifies a certain destination in every switch. The run-time processing further performs searching for a first match between a packet and a source-destination pair, and when the first match is not found, performs searching for a second match between the packet and the first routing rule that specifies the certain destination. By using routing rules that specific a destination, the routing in a computational grid can significantly scale up.

Abstract: A hybrid reconfiguration scheme can allow for fast partial network reconfiguration with different routing algorithms of choice in different subparts of the network. Partial reconfigurations can be orders of magnitude faster than the initial full configuration, thus making it possible to consider performance-driven reconfigurations in lossless networks.

Abstract: A hybrid reconfiguration scheme can allow for fast partial network reconfiguration with different routing algorithms of choice in different subparts of the network. Partial reconfigurations can be orders of magnitude faster than the initial full configuration, thus making it possible to consider performance-driven reconfigurations in lossless networks.

Abstract: A device and method for providing balanced routing paths in a computational grid including determining a type of topology of the computational grid having a plurality of levels, wherein each level includes a plurality of switches, determining whether the type of topology of the computational grid is a fat-tree, determining whether the fat-tree is odd, determining whether the fat-tree is a regular fat-tree, computing a first set of routing paths for the computational grid based on the determining of whether the fat-tree is odd and is a regular fat-tree, computing a second set of routing paths for the computational grid using a topology agnostic routing technique, and configuring forwarding tables in said switches with the first set of computed routing paths when the topology is determined to be a fat-tree and with the second set of computed routing paths when the topology is determined to not be a fat-tree.

Abstract: A device, method, and computer readable storage medium for routing in a computational grid arranged in a fat-tree, including performing preprocessing, performing base path routing to determine rules for routing in switches based on stored switch level, switch group, links between switches, links between switches and hosts, and fat-tree type, and performing run-time processing, including detecting a path fault, and determining at least one redundant path for the path fault. The base path routing determines a first routing rule that specifies a certain destination in every switch. The run-time processing further performs searching for a first match between a packet and a source-destination pair, and when the first match is not found, performs searching for a second match between the packet and the first routing rule that specifies the certain destination. By using routing rules that specific a destination, the routing in a computational grid can significantly scale up.

Abstract: A device and method for providing balanced routing paths in a computational grid including determining a type of topology of the computational grid having a plurality of levels, wherein each level includes a plurality of switches, determining whether the type of topology of the computational grid is a fat-tree, determining whether the fat-tree is odd, determining whether the fat-tree is a regular fat-tree, computing a first set of routing paths for the computational grid based on the determining of whether the fat-tree is odd and is a regular fat-tree, computing a second set of routing paths for the computational grid using a topology agnostic routing technique, and configuring forwarding tables in said switches with the first set of computed routing paths when the topology is determined to be a fat-tree and with the second set of computed routing paths when the topology is determined to not be a fat-tree.

Abstract: A hybrid reconfiguration scheme can allow for fast partial network reconfiguration with different routing algorithms of choice in different subparts of the network. Partial reconfigurations can be orders of magnitude faster than the initial full configuration, thus making it possible to consider performance-driven reconfigurations in lossless networks.

Abstract: A hybrid reconfiguration scheme can allow for fast partial network reconfiguration with different routing algorithms of choice in different subparts of the network. Partial reconfigurations can be orders of magnitude faster than the initial full configuration, thus making it possible to consider performance-driven reconfigurations in lossless networks.

Abstract: A hybrid reconfiguration scheme can allow for fast partial network reconfiguration with different routing algorithms of choice in different subparts of the network. Partial reconfigurations can be orders of magnitude faster than the initial full configuration, thus making it possible to consider performance-driven reconfigurations in lossless networks.

Abstract: A hybrid reconfiguration scheme can allow for fast partial network reconfiguration with different routing algorithms of choice in different subparts of the network. Partial reconfigurations can be orders of magnitude faster than the initial full configuration, thus making it possible to consider performance-driven reconfigurations in lossless networks.

Abstract: A hybrid reconfiguration scheme can allow for fast partial network reconfiguration with different routing algorithms of choice in different subparts of the network. Partial reconfigurations can be orders of magnitude faster than the initial full configuration, thus making it possible to consider performance-driven reconfigurations in lossless networks.

Abstract: The present invention relates to a method for identifying inaccurate time measurements in a local area network. The local area network comprises a sending device (2), such as a time client, a destination device (3), such as a timeserver, and a switching device and/or a store-and-forward device (6). A time request packet (4) is rejected if it arrives at the time client or timeserver within a given or calculated minimum distance from the preceding network packet. The time request packet (4) is also rejected if it falls outside a set of calculated error limits based on a set of estimates. Those estimates are kept in the time client memory and updated according to a given set of rules.

Abstract: A method for caulking or grouting a corner wherein a roll or tape having two double-sided adhesive strips 12 and 12? attached to a backing strip 14 such that adhesive strips 12 and 12? are parallel to one another and are spaced apart forming a uniform, intermediate channel and folded in half, forming an exposed edge of the backing strip is inserted into the corner of a wall, the roll of tape is used as a guide by holding the roll flush against a first wall and unrolled, adhering the outer strip along the entire length of the second wall, then cut and unfolded such that the outer adhesive strip becomes adhered to the entire length of the first wall, forming a uniform channel into which caulk or grout can be applied.

Abstract: The present invention relates to a method for identifying inaccurate time measurements in a local area network. The local area network comprises a sending device (2), such as a time client, a destination device (3), such as a timeserver, and a switching device and/or a store-and-forward device (6). A time request packet (4) is rejected if it arrives at the time client or timeserver within a given or calculated minimum distance from the preceding network packet. The time request packet (4) is also rejected if it falls outside a set of calculated error limits based on a set of estimates. Those estimates are kept in the time client memory and updated according to a given set of rules.

Abstract: A method for improved Network Time Protocol time synchronization in a computer network (1) where the computer network comprises a time client (2) and a timeserver (3). To eliminate network access errors at the client side, the actual time of leaving is stored in the time client (2) as a special time stamp (T11) and later substituted for T1 in the calculations. To eliminate network access errors at the server side, the time request packet is duplicated and returned twice, the second time containing the time stamp when the first packet left the server (T31). To eliminate network transversal jitter when using a switched network, a packet with a multicast is used and the time stamp (T11) is taken when the time request packet is reflected back from the switch and (T31) is taken when the reply packet is reflected back from the switch.