Abstract: Example implementations relate to management of network topologies. A primary tree having multiple connection graphs is generated for each node in the network. Each connection graph has at least one ordered list of one or more network node connections and the generated connection graphs provide a full network fit for each node in the network. The connection graphs are stored in at least one network switch to be used for network switch functionality. Additional connection graphs are generated for one or more network nodes connections based at least on network link capacity and provide for sharing of one or more of network links between multiple network node connections. The additional connection graphs are stored in the at least one network switch to be used for subsequent network switch functionality.

Abstract: Example implementations relate to management of network topologies. A primary tree having multiple connection graphs is generated for each node in the network. Each connection graph has at least one ordered list of one or more network node connections and the generated connection graphs provide a full network fit for each node in the network. The connection graphs are stored in at least one network switch to be used for network switch functionality. Additional connection graphs are generated for one or more network nodes connections based at least on network link capacity and provide for sharing of one or more of network links between multiple network node connections. The additional connection graphs are stored in the at least one network switch to be used for subsequent network switch functionality.

Abstract: A compound having the structure wherein R is, for example, Y is selected from the group consisting of 1) R5, 2) —C(R1R2) (C(R3R4))0-1Y1R5, and 3) —C(R1R2)—O—Y1R5; R1, R2, R3 and R4 are independently selected from the group consisting of hydrogen and C1-4 alkyl; R5 is; Y1 is selected from the group consisting of C(O)—O— and P(O)(OR6)—O—; and R6 is hydrogen or CH3, or a pharmaceutically acceptable salt thereof, and methods of using the compounds for treating hypertension.

Abstract: A compound having the structure R—Y wherein R is, for example, Y is selected from the group consisting of 1) R5, 2) —C(R1R2)(C(R3R4))0-1Y1R5, and 3) —C(R1R2)—O—Y1R5; R1, R2, R3 and R4 are independently selected from the group consisting of hydrogen and C1-4 alkyl; R5 is Y1 is selected from the group consisting of —C(O)—O— and —P(O)(OR6)—O—; and R6 is hydrogen or CH3, or a pharmaceutically acceptable salt thereof, and methods of using the compounds for treating hypertension.

Abstract: A method and related computer program product of preventing write corruption in a redundant array in a computer system, comprising detecting a write failure from a calling application to at least one disk of the redundant array, writing failure information to non-volatile storage; returning an I/O error to the calling application; reading the failure information from the non-volatile storage during the next system reboot; and reconfiguring the array to eliminate the failed disk.

Abstract: A compound having the structure R—Y wherein R is, for example, Y is selected from the group consisting of 1) R5, 2) —C(R1R2)(C(R3R4))0-1Y1R5, and 3) —C(R1R2)—O—Y1R5; R1, R2, R3 and R4 are independently selected from the group consisting of hydrogen and C1-4 alkyl; R5 is Y1 is selected from the group consisting of —C(O)—O— and —P(O)(OR6)—O—; and R6 is hydrogen or CH3, or a pharmaceutically acceptable salt thereof, and methods of using the compounds for treating hypertension.

Abstract: A compound having the structure wherein R is an angiotensin receptor antagonist active group, Y is -Y1-Y2-Y3-Y4-Y5-; Y1 is C(R1R2); R1 is selected from the group consisting of hydrogen and C1-4 alkyl; R2 is selected from the group consisting of hydrogen, C1-4 alkyl, and —OC(O)C1-4 alkyl; Y2 is O or CH2; Y3 is C(O) or CH2; Y4 is O or CH2; Y5 is —(CH2)1-2—(X)0-1—(CH2)0-1— or is absent; X is —O— or —CR3R4—; and R3 and R4 are independently selected from the group consisting of hydrogen and C1-C4 alkyl; or a pharmaceutically acceptable salt or hydrate thereof, which is useful for treating hypertension.

Abstract: A compound having the structure wherein R is an angiotensin receptor antagonist active group, and Y is 1) —(CH2)3R5, 2) —C(O)(CH2)2R5, 3) —C(R1R2)OC(O)O(CH2)nR5, wherein n is 1 or 2, 4) —C(R1R2)OC(O)CH2CH2R5, 5) —C(R1R2)OC(O)OCH2CH2C(R3R4)R5, provided that when Y is —C(O)(CH2)2R5, then R is R1, R2, R3 and R4 are independently selected from the group consisting of hydrogen and C1-4 alkyl; R5 is —CH(ONO2)CH(ONO2)R6; R6 is selected from CH3, CH2CH3 and CH(CH3)2; or a pharmaceutically acceptable salt or hydrate thereof, which is useful for treating hypertension.

Abstract: A compound having the structure (Formula I), wherein R an angiotensin receptor antagonist active group, Y is Y1—Y2—Y3—Y4—Y5. Y1 is C(R1R2); R1 is selected from the group consisting of hydrogen and C1-4 alkyl; R2 is selected from the group consisting of hydrogen, C1-4 alkyl, and -0C(0)C1-4 alkyl; Y2 is O or CH2; Y3 is C(O) or CH2; Y4 is O or CH2; Y5 is —(CH2)1-2—(X)0-1—CH2)0-1— or is absent; X is —O— or —CR3R4—; and R3 and R4 are independently selected from the group consisting of hydrogen and C1-C4 alkyl; or a pharmaceutically acceptable salt or hydrate thereof, which is useful for treating hypertension.

Abstract: A compound having the structure wherein R is an angiotensin receptor antagonist active group, Y is -Y1-Y2-Y3-Y4-Y5-; Y1 is C(R1R2); R1 is selected from the group consisting of hydrogen and C1-4 alkyl; R2 is selected from the group consisting of hydrogen, C1-4 alkyl, and —OC(O)C1-4 alkyl; Y2 is O or CH2; Y3 is C(O) or CH2; Y4 is O or CH2; Y5 is —(CH2)1-2—(X)0-1—(CH2)0-1— or is absent; X is —O— or —CR3R4—; and R3 and R4 are independently selected from the group consisting of hydrogen and C1-C4 alkyl; or a pharmaceutically acceptable salt or hydrate thereof, which is useful for treating hypertension.

Abstract: A method and related computer program product for combining resources of multiple RAID controllers and managing them as a single entity, comprising searching the RAID controllers for the most appropriate version of the firmware to be executed, determining whether a more appropriate version of the firmware was previously loaded into system memory, unloading inappropriate versions of the firmware, loading the most appropriate version of the firmware and initializing all RAID controllers as a commonly managed entity having combined resources.

Abstract: A method, system and computer program product for a generic data storage interface for local and remote networked storage is provided. It comprises providing a data storage interface accessible by an operating system, transmitting data from an application running on the operating system to the data storage interface and selectively storing the data using the same data storage interface in either a local or a remote networked storage location.

Abstract: A method, system and computer program product for a generic data storage interface for local and remote networked storage is provided. It comprises providing a data storage interface accessible by an operating system, transmitting data from an application running on the operating system to the data storage interface and selectively storing the data using the same data storage interface in either a local or a remote networked storage location. Firmware for the common data storage interface assigns a unique identifier that classifies an I/O request as a local or remote networked I/O request and adds the I/O request to a common stack for local and remote networked data storage elements. When an I/O request is removed from the stack, the unique identifier is used to identify the I/O request as a local or remote networked I/O request. Local I/O requests are executed via a local bus such as PCI, or SCSI.

Abstract: A method and related computer program product for achieving high performance I/O write rates in a redundant array using a fully recoverable communication queue stored in NVRAM on a RAID controller comprising, receiving an I/O write request from an application, determining if the I/O request is an inline write command, writing inline write commands into a command queue stored in NVRAM, notifying the application generating the I/O request of command completion and requesting the operating system for further I/Os.

Abstract: A system provides dual use of a general purpose input/output (I/O) line. In an embodiment, the system comprises a controlling circuit having a dual purpose I/O line that is selectively operable in a serial transmit mode or an I/O mode. A first circuit that receives a serial data stream when the controlling circuit operates in the serial transmit mode is coupled to the I/O line. A second circuit that generates and transmits a signal when the controlling circuit operates in the I/O mode is also coupled to the I/O line. Finally, a third circuit is disposed between the second circuit and the I/O line. In an embodiment, when the controlling circuit operates in the serial transmit mode, the third circuit maintains the second circuit in an idle state, and when the controlling circuit operates in the I/O mode, the third circuit permits the second circuit to transmit the signal to the controlling circuit.

Abstract: An LED interface circuit provides connection options for one or more types of LEDs. In an embodiment, the circuit includes an input node that receives an LED control signal, and an output that has a first output node, and a second output node. A driving circuit is disposed between the input header and the output. The driving circuit has a non-inverted input node and an inverted output node. In an embodiment, the inverted output node is capable of sinking current. The non-inverted input node is coupled to the input header and to the first output node, while the inverted output node is coupled to the second output node. The output of the LED interface circuit is capable of driving a plurality of different types of LED displays.

Abstract: A method and related computer program product of preventing write corruption in a redundant array in a computer system, comprising detecting a write failure from a calling application to at least one disk of the redundant array, writing failure information to non-volatile storage; returning an I/O error to the calling application; reading the failure information from the non-volatile storage during the next system reboot; and reconfiguring the array to eliminate the failed disk.

Abstract: A method and related computer program product for combining resources of multiple RAID controllers and managing them as a single entity, comprising searching the RAID controllers for the most appropriate version of the firmware to be executed, determining whether a more appropriate version of the firmware was previously loaded into system memory, unloading inappropriate versions of the firmware, loading the most appropriate version of the firmware and initializing all RAID controllers as a commonly managed entity having combined resources.

Abstract: A method and related computer program product of obtaining temporary conventional memory usage in BIOS. The method and program product comprises disabling processor interrupts, saving a predetermined amount of system memory to a temporary storage location outside system memory, using the predetermined system memory space for BIOS specific needs, restoring the predetermined amount of system memory from the temporary storage location to the predetermined system memory space, and then re-enabling the processor interrupts.

Abstract: A fault tolerant method transforms physically contiguous data in-place on a disk by partitioning the physically contiguous data into an empty region physically adjacent to data regions including a first data region and a last data region, the first and last data regions at opposing ends of the physically contiguous data regions. The physically contiguous data are transformed in an order beginning with the first data region and ending with the last data region. The transforming step perform first locking and reading the first data region, second, transforming the first data region, third, writing and unlocking the transformed first data region to the empty region, and fourth, declaring the first data region as the empty region while declaring the empty region as the first region. The first through fourth steps are repeated for each data region, until completion, to transform the physically contiguous data in-place on the disk.