Abstract: During operation, the system of an embodiment of the present invention receives a representation of multiple objective functions as well as a representation of a domain of interest for the multiple objective functions. Next, the system stores the representations in a memory within the computer system. The system then performs an interval optimization process to compute guaranteed bounds on a Pareto front for the multiple objective functions. During this interval optimization process, the system maintains influence information for boxes in the domain of interest, wherein for a given box, the influence information identifies other boxes which are in the range of influence of the given box and/or in the domain of influence of the given box. The system uses this influence information to identify boxes to be tested against each other for domination. After the boxes are tested, the system eliminates boxes which are certainly dominated by other boxes.

Abstract: A system that solves a parametric multi-objective optimization problem in a combined design space and parameter space using interval techniques is described. The design space contains design-space variables fixed for a selected design; the parameter space contains variable parameters for the selected design. Multiple-objective functions are specified for optimization.

Abstract: One embodiment of the present invention provides a system that uses a computer to evaluate a function within a domain using an interval computing technique. During operation, the system receives the function and the domain over which the function is to be evaluated. Next, the system creates a set of sampling subdomains within the domain by generating a set of boxes of different sizes which are located at different positions across the domain. The system then performs evaluations on the set of sampling subdomains to generate evaluation results. Next, the system sorts the evaluation results based on box size. The system then selects a box size from the different box sizes by identifying a largest box size which achieves tight bounds on the evaluation results. The system next discretizes the domain into subdomains of the selected box size.

Abstract: System and method for the unique naming of resources in networked environments including peer-to-peer network environments. Embodiments may be used to generate network resource identifiers that uniquely identify resources such as processes over time and across the networked environment. One embodiment may be implemented as a resource name generator that generates unique identifiers for resources in networked environments. One embodiment may generate unique network resource identifiers for processes from information including, but not limited to, a host address that uniquely identifies on the network the host machine of the resource for which the unique network resource identifier is being generated, a current time (e.g. obtained from the host machine or alternatively from an external source such as an atomic time server), and a process identifier of the process that uniquely identifies the process among current processes on the host machine.

Abstract: System and method for submitting and performing computational tasks in a distributed heterogeneous networked environment. Embodiments may allow tasks to be submitted and run in parallel on a network of heterogeneous computers implementing a variety of operating environments. In one embodiment, a user on an originating node may advertise code on the network. Peer nodes that respond to the advertisement may receive the code. A job to be executed by the code may be split into separate tasks to distributed to the peer nodes that received the code. These tasks may be advertised on the network. Tasks may be assigned to peer nodes that respond to the task advertisements. The peer nodes may then work on the assigned tasks. Once a peer node's work on a task is completed, the peer node may return the results of the task to the originating node.

Abstract: One embodiment of the present invention provides a system that solves a parametric multi-objective optimization problem in a combined design space and parameter space using interval techniques, wherein the design space contains design-space variables which are fixed for a selected design, and wherein the parameter space contains parameters which are variables for the selected design. During operation, the system first receives a design-optimization problem at a computer system, wherein the problem is specified by multiple-objective functions which are to be optimized in the combined design space and parameter space. Next, the system initializes a design-variable box spanning the design space.

Abstract: One embodiment of the present invention provides a system that uses interval techniques to solve a multi-objective optimization problem. During operation, the system receives a representation of multiple objective functions (ƒ1, . . . , ƒn) at a computer system, wherein (ƒ1, . . . , ƒn) are scalar functions of a vector x=(x1, . . . , xn). The system also receives a representation of a domain of interest for the multiple objective functions. Next, the system performs an interval optimization process to compute guaranteed bounds on a Pareto front for the objective functions (ƒ1, . . . , fn), wherein for each point on the Pareto front, an improvement in one objective function cannot be made without adversely affecting at least one other objective function. While performing the interval optimization process, the system applies a direct-comparison technique between subdomains of the domain of interest to eliminate subdomains that are certainly dominated by other subdomains.

Abstract: One embodiment of the present invention provides a system and method for determining a cache optimized ordering of cells in an unstructured graph. Cells bounding a region defined along a portion of a stored logically-defined grid are identified and each cell is added into an element of a level set array block in order of traversal through the region along the boundary. The level set array block is reordered for each additional cell in the data object that is contiguous to at least one such cell added previously to the level set array block. Each such additional cell is added into an element of the level set array block. Each cell remaining in the data object independent of any element in the level set array block is iteratively added.

Abstract: System and method for the unique naming of resources in networked environments including peer-to-peer network environments. Embodiments may be used to generate network resource identifiers that uniquely identify resources such as processes over time and across the networked environment. One embodiment may be implemented as a resource name generator that generates unique identifiers for resources in networked environments. One embodiment may generate unique network resource identifiers for processes from information including, but not limited to, a host address that uniquely identifies on the network the host machine of the resource for which the unique network resource identifier is being generated, a current time (e.g. obtained from the host machine or alternatively from an external source such as an atomic time server), and a process identifier of the process that uniquely identifies the process among current processes on the host machine.

Abstract: One embodiment of the present invention provides a system and method for determining a cache optimized ordering of cells in an unstructured graph. Cells bounding a region defined along a portion of a stored logically-defined grid are identified and each cell is added into an element of a level set array block in order of traversal through the region along the boundary. The level set array block is reordered for each additional cell in the data object that is contiguous to at least one such cell added previously to the level set array block. Each such additional cell is added into an element of the level set array block. Each cell remaining in the data object independent of any element in the level set array block is iteratively added.

Abstract: System and method for submitting and performing computational tasks in a distributed heterogeneous networked environment. Embodiments may allow tasks to be submitted and run in parallel on a network of heterogeneous computers implementing a variety of operating environments. In one embodiment, a user on an originating node may advertise code on the network. Peer nodes that respond to the advertisement may receive the code. A job to be executed by the code may be split into separate tasks to distributed to the peer nodes that received the code. These tasks may be advertised on the network. Tasks may be assigned to peer nodes that respond to the task advertisements. The peer nodes may then work on the assigned tasks. Once a peer node's work on a task is completed, the peer node may return the results of the task to the originating node.

Abstract: The present invention utilizes peer groups in a distributed architecture to decentralize its task dispatching and post-processing functions and to provide the ability to manage and run many different applications simultaneously, in an efficient and reliable manner. Jobs may be submitted to a task dispatcher or to a monitor which distributes the jobs to task dispatchers. Through a series of processes, the task dispatchers may then distribute the jobs to workers. This allows work to be distributed without utilizing a centralized server.

Abstract: The present invention utilizes peer groups in a distributed architecture to decentralize its task dispatching and post-processing functions and to provide the ability to manage and run many different applications simultaneously, in an efficient and reliable manner. Jobs may be submitted to a task dispatcher or to a monitor which distributes the jobs to task dispatchers. Through a series of processes, the task dispatchers may then distribute the jobs to workers. This allows work to be distributed without utilizing a centralized server.