Abstract: Embodiments herein present a virtual memory technique for efficiently solving connected problems in a distributed environment. An exemplary method begins by selectively loading computing task segments into a first node, wherein the number of computing task segments is the maximum number of computing task segments that will fit within the first node. The computing task segments are enclosed within wrappers, wherein the wrappers are streamed into the first node at a maximum rate that a disk can read and write data. Further, the wrappers comprise priority wrappers that must be computed in order to process the computing task segments; and thus, the priority wrappers are loaded into the first node first. In addition, the computing task segments comprise computing task segment block collections, wherein the method creates a list of computing task segment block collection jobs that must be completed in order to process one of the computing task segments.

Abstract: Embodiments herein present a system, method, etc. for an efficient super cluster implementation for solving connected problems in a distributed environment. More specifically, the system adapts computing latency to communication latency, wherein the system comprises VPPs wrapped within OCW layers. The VPPs represent a subset of an overall computer task; and, the OCW layers are adapted to enclose the VPPs. Specifically, the number of OCWs that enclose a VPP correspond to the number of computing iterations that may be locally executed by the VPP during an inter-VPP communication cycle. In addition, each VPP comprises collections of OPCs, wherein the OPCs comprise data, methods, and pointers to neighbors. The OPCs are indexed separately based on whether the OPC is part of an OCW layer.

Abstract: A message pathway selection system dynamically selects an optimum message pathway for transmitting messages. The system dynamically optimizes a message pathway according to various criteria such as, for example, efficiency, economy, data requirements, auditing requirements, security, data size, etc. The system can direct a message to bypass an infrastructure messaging server, using a direct message pathway. The system can also switch from an infrastructure messaging server to a direct method. The system can also utilize an infrastructure messaging pathway either as an alternative or in parallel with the direct message pathway. The system allows an application to use a single communication system for both a direct mode and an infrastructure mode of data transfer. The present system can bypass the infrastructure message pathway, thus reducing message latency, number of messages sent, and improving overall bandwidth.

Abstract: The disclosed massive multi-player on-line gaming environment and method eliminate the coordination and synchronization problems between servers by assigning each game user to a specific client proxy server for game duration and utilizing a space information distribution center to indicate client specific changes in game space. Such configuration eliminates the need to use “grey” areas around partitioning boundaries and servers having to “own” client objects thereby improving massive multi-player on-line gaming scalability.

Abstract: A method and system for balancing server work load for cellular phone client-proxy applications in an environment where the clients change position within a given geographic area is disclosed. The method comprises the steps of mapping, monitoring, automatically re-mapping the system when required, updating a map address book, and updating a client address book. The system has a mapping system and a communication system connected to a plurality of servers, proxy servers and applications by an internal network. The proxy servers are connected to a plurality of clients by the Internet. If a threshold is exceeded, the monitoring program sends a message to a mapping program. Upon receipt of the message, the mapping program uses a rules engine to calculate a new map graph to remove load from an overloaded server (or servers) and to adjust communication requirements for data by reconfiguring partitions.

Abstract: The initial partitioning of a distributed computing problem can be critical, and is often a source of tedium for the user. A method is provided that automatically segments the problem into fixed sized collections of original program cells (OPCs) based on the complexity of the problem specified, and the combination of computing agents of various caliber available for the overall job. The OPCs that are on the edge of a collection can communicate with OPCs on the edges of neighboring collections, and are indexed separately from OPCs that are within the ‘core’ or inner non-edge portion of a collection. Consequently, core OPCs can iterate independently of whether any communication occurs between collections and groups of collections (VPPs). All OPCs on an edge have common dependencies on remote information (i.e., their neighbors are all on the same edge of a neighboring collection).