Abstract: A method, system, and computer program for managing network connectivity between a plurality of nodes and a network resource. The network resource includes a primary path to the nodes and at least one redundant path. A detecting module is configured to determine if the primary path is unavailable to at least one affected node belonging to the plurality of nodes. A switching module is configured to presumptively switch the affected node to the redundant path if the primary path is unavailable. An initiating module configured to initiate a voting procedure among the plurality of nodes to select a new path to the network resource, wherein data flow at the affected node through the redundant path continues during the voting procedure.

Abstract: A method, system, and computer program for managing network connectivity between a plurality of nodes and a network resource. The network resource includes a primary path to the nodes and at least one redundant path. A detecting module is configured to determine if the primary path is unavailable to at least one affected node belonging to the plurality of nodes. A switching module is configured to presumptively switch the affected node to the redundant path if the primary path is unavailable. An initiating module configured to initiate a voting procedure among the plurality of nodes to select a new path to the network resource, wherein data flow at the affected node through the redundant path continues during the voting procedure.

Abstract: Subsequent to a loading of an application program within a first memory space, a first buffer is established within a second memory space and a second buffer is established within a third memory space. The first buffer is operated to store information corresponding to an execution of the application program. The second buffer is operated to store information corresponding to an operating system supporting the execution of the application program. Additionally, a third buffer is established within a fourth memory space, the third buffer being operated to store information indicative of the second memory space and the third memory space to thereby facilitate an examination of the first buffer and the second buffer without any cooperation from the application program and the operating system.

Abstract: A technique for allowing lightweight cooperative multitasking to be used as if it were pre-emptive multitasking, in a fashion that is transparent to the development process. The technique accepts a long-running program which it then transforms into a co-operative multitasking program that yields the processor after a small amount of time has elapsed. This technique imposes a small overhead on the transformed long-running program, but no overhead on the original co-operative multitasking program. This contrasts strongly with the usual case in pre-emptive multitasking, which imposes its overhead on all processes in the system. The transformed long-running program can be throttled either statically or dynamically in response to changing conditions. This technology is designed to be compatible with a variety of approaches to co-operative multitasking asynchronous message-passing systems.