Abstract: A method for enabling access to a data resource, which is held on a file server (25) on a first local area network (LAN) (21a), by a client (28) on a second LAN (21b). A proxy receiver (48) on the second LAN (21b) intercepts a request for the data resource submitted by the client (28) and transmits a message via a wide area network (WAN) (29) to a proxy transmitter (52) on the first LAN (21a), requesting the data resource. The proxy transmitter (52) retrieves a replica of the data resource from the file server (25) and conveys the replica of the data resource over the WAN (29) to the proxy receiver (48), which serves the replica of the data resource from the proxy receiver (48) to the client (28) over the second LAN (21b).

Abstract: A method for selecting a leader node among a plurality of network nodes, comprising: providing a current configuration of selected nodes in replicated state machine based system, wherein a first node is set for handling commands received from clients; executing a consensus protocol by the selected nodes under the current configuration; identifying at least one fault indicative event of the first node; calculating a suggested configuration of selected nodes, wherein a second node is set for handling the commands; informing each member of the suggested configuration and the first node of the suggested configuration; executing the consensus protocol in parallel under both the suggested configuration and the current configuration; and when detecting that the first node is faulty, setting the second node for handling the commands under the current configuration in place of the first node and reconfiguring the current configuration to become the suggested configuration.

Abstract: A method for selecting a leader node among a plurality of network nodes, comprising: providing a current configuration of selected nodes in replicated state machine based system, wherein a first node is set for handling commands received from clients; executing a consensus protocol by the selected nodes under the current configuration; identifying at least one fault indicative event of the first node; calculating a suggested configuration of selected nodes, wherein a second node is set for handling the commands; informing each member of the suggested configuration and the first node of the suggested configuration; executing the consensus protocol in parallel under both the suggested configuration and the current configuration; and when detecting that the first node is faulty, setting the second node for handling the commands under the current configuration in place of the first node and reconfiguring the current configuration to become the suggested configuration.

Abstract: A method for continuously updating a set of replicas. The method comprises storing a plurality of replicas of data in a current configuration of members from a plurality of nodes, receiving a reconfiguration command by a member of said current configuration, selecting at least one estimated configuration from said plurality of nodes, receiving at least one write command by a member of said current configuration, disseminating said at least one write command to each member of said at least one estimated configuration and validating said at least one estimated configuration. At least one estimated configuration processes at least one of the write commands before the validating is completed.

Abstract: A method for continuously updating a set of replicas. The method comprises storing a plurality of replicas of data in a current configuration of members from a plurality of nodes, receiving a reconfiguration command by a member of said current configuration, selecting at least one estimated configuration from said plurality of nodes, receiving at least one write command by a member of said current configuration, disseminating said at least one write command to each member of said at least one estimated configuration and validating said at least one estimated configuration. At least one estimated configuration processes at least one of the write commands before the validating is completed.

Abstract: A method of updating statuses of processes in a network is provided. The method may include the following steps: connecting N processes on a K-connected overlay network of nodes which is in operative association with a computer network; determining an update of subscription and un-subscription statuses of at least some of the processes; generating update messages reflecting the subscriptions and the un-subscriptions, the update messages being differences between previous update and current update; and propagating the update messages through the K-connected graph, such that at least some of the processes transfer the update to its respective K neighboring nodes, wherein at least one of the connecting, the subscribing, the unsubscribing, the generating, and the propagating is executed by at least one processor.

Abstract: A method of updating statuses of processes in a network is provided. The method may include the following steps: connecting N processes on a K-connected overlay network of nodes which is in operative association with a computer network; determining an update of subscription and un-subscription statuses of at least some of the processes; generating update messages reflecting the subscriptions and the un-subscriptions, the update messages being differences between previous update and current update; and propagating the update messages through the K-connected graph, such that at least some of the processes transfer the update to its respective K neighboring nodes, wherein at least one of the connecting, the subscribing, the unsubscribing, the generating, and the propagating is executed by at least one processor.

Abstract: A method for enabling access to a data resource, which is held on a file server (25) on a first local area network (LAN) (21a), by a client (28) on a second LAN (21b). A proxy receiver (48) on the second LAN (21b) intercepts a request for the data resource submitted by the client (28) and transmits a message via a wide area network (WAN) (29) to a proxy transmitter (52) on the first LAN (21a), requesting the data resource. The proxy transmitter (52) retrieves a replica of the data resource from the file server (25) and conveys the replica of the data resource over the WAN (29) to the proxy receiver (48), which serves the replica of the data resource from the proxy receiver (48) to the client (28) over the second LAN (21b).

Abstract: A method for enabling access to a data resource, which is held on a file server (25) on a first local area network (LAN) (21a), by a client (28) on a second LAN (21b). A proxy receiver (48) on the second LAN (21b) intercepts a request for the data resource submitted by the client (28) and transmits a message via a wide area network (WAN) (29) to a proxy transmitter (52) on the first LAN (21a), requesting the data resource. The proxy transmitter (52) retrieves a replica of the data resource from the file server (25) and conveys the replica of the data resource over the WAN (29) to the proxy receiver (48), which serves the replica of the data resource from the proxy receiver (48) to the client (28) over the second LAN (21b).

Abstract: A method and computer program product for batch processing, the method includes: receiving a representation of a batch job that comprises a business logic portion and a non business logic portion; generating in real time business logic batch transactions in response to the representation of the batch job; and executing business logic batch transactions and online transactions; wherein the executing of business logic batch transactions is responsive to resource information and timing information.

Abstract: A method for enabling access to a data resource, which is held on a file server (25) on a first local area network (LAN) (21a), by a client (28) on a second LAN (21b). A proxy receiver (48) on the second LAN (21b) intercepts a request for the data resource submitted by the client (28) and transmits a message via a wide area network (WAN) (29) to a proxy transmitter (52) on the first LAN (21a), requesting the data resource. The proxy transmitter (52) retrieves a replica of the data resource from the file server (25) and conveys the replica of the data resource over the WAN (29) to the proxy receiver (48), which serves the replica of the data resource from the proxy receiver (48) to the client (28) over the second LAN (21b).

Abstract: A method for enabling access to a data resource, which is held on a file server (25) on a first local area network (LAN) (21a), by a client (28) on a second LAN (21b). A proxy receiver (48) on the second LAN (21b) intercepts a request for the data resource submitted by the client (28) and transmits a message via a wide area network (WAN) (29) to a proxy transmitter (52) on the first LAN (21a), requesting the data resource. The proxy transmitter (52) retrieves a replica of the data resource from the file server (25) and conveys the replica of the data resource over the WAN (29) to the proxy receiver (48), which serves the replica of the data resource from the proxy receiver (48) to the client (28) over the second LAN (21b).

Abstract: A method for enabling access to a data resource, which is held on a file server (25) on a first local area network (LAN) (21a), by a client (28) on a second LAN (21b). A proxy receiver (48) on the second LAN (21b) intercepts a request for the data resource submitted by the client (28) and transmits a message via a wide area network (WAN) (29) to a proxy transmitter (52) on the first LAN (21a), requesting the data resource. The proxy transmitter (52) retrieves a replica of the data resource from the file server (25) and conveys the replica of the data resource over the WAN (29) to the proxy receiver (48), which serves the replica of the data resource from the proxy receiver (48) to the client (28) over the second LAN (21b).

Abstract: A technique for rapid retrieval and navigation of assets stored on a computer system involves defining a taxonomy and classification rules according to asset-specific criteria, identifying the stored assets, automatically categorizing the identified assets according to the defined classification system, followed by indexing of the categorized assets. A presentation tool is utilized to display and navigate the indexed assets in a first pane, using a tree view having two integrated hierarchies of classified information. The hierarchies can be specific to a programming language or other code assets. All categories of indexed information in which a said selected element is classified is displayed in a second pane.

Abstract: Disclosed is a system and method for a profiling system wherein profile data is stored in a separable hierarchical fashion such that profile data for each compiled procedure in a computer program can be readily identified and utilized. In particular, each source module has a corresponding profile data file and each procedure has a corresponding procedure profile area. The system and method also includes a mechanism for verifying the existence and validity of profile information, and a mechanism for handling invalid profile information.

Abstract: An apparatus and method reorder portions of a computer program in a way that achieves both enhanced performance and maintainability of the computer program. A global call graph is initially constructed that includes profile data. From the information in the global call graph, an intramodular call graph is generated for each module. Reordering techniques are used to reorder the procedures in each module according to the profile data in each intramodular call graph. An intermodular call graph is generated from the information in the global call graph. Reordering techniques are used to reorder the modules in the computer program. By reordering procedures within modules, then reordering the modules, enhanced performance is achieved without reordering procedures across module boundaries.

Abstract: An apparatus and several methods provide for a more optimized computer program that will have a faster execution time than was possible using the prior art reordering technique that adds to a trace until it finds no more predecessors or successors to add. The apparatus and methods disclosed herein use a variety of methods to reorder the program portions in a more intelligent manner that will improve its run-time performance. Each of these methods involves constructing traces in the control flow graph of the computer program. In a first embodiment, a basic block is only added to a trace if it is not negligible within predetermined limits. This negligibility test results in traces that are not extended for infrequently executed basic blocks. In a second embodiment, a basic block is only added to a trace if it is a perfect partner with the last basic block added to the trace. The concept of a "perfect partner" helps to match basic blocks together in a trace that have the greatest affinity for each other.