摘要:
A computer-implemented method for distributing a plurality of tasks over a plurality of processing nodes in a processor network includes the following steps: calculating a task process consumption value for the tasks; calculating a measured node processor consumption value for the nodes; calculating a target node processor consumption value for the nodes, the target node processor consumption value indicating optimal node processor consumption; calculating a load index value as a difference between the calculated node processor consumption value for a node i and the target node processor consumption value for node i; and distributing the tasks among the nodes to balance a processor workload among the nodes, according to the calculated load index value, such that the calculated load index value of each node is substantially zero. The method further embodies a multi-dimensional balancing matrix, each dimension of the matrix representing a node corresponding to a different processor type and each cell representing tasks assigned to multiple nodes.
摘要:
A distributed Java virtual machine method and system for managing distributed heterogeneous network nodes to timely and efficiently meet demand for service requests. Upon receipt of a request for service, Java workload manager (JWLM) of the present invention classifies the request into a particular type of service, places the work on a logical queue to be executed. Routing queues place the work on one of many available nodes. The work is distributed to the nodes based on accounting, availability and past performance of all nodes considered. Changes are made periodically to the system to meet demands for service and/or conserve resources. JWLM of the present invention learns the needs of programs over time and does not require the intervention of a system administrator. The system does not rely on system specific metrics. JWLM may use performance metrics. Additionally, the present invention allows objects to be distributed and run on distributed workstations by distributing work through the cluster of workstations, while behaving as if it were initiated locally on the machine on which it runs. The similar type of work sent to different workstations may have the same class names, and the classpath may hold different implementations of that object at a particular workstation. Thus, at dynamic compilation time, if a platform has a more efficient feature than others, a work unit is dynamically compiled with the more efficient feature.
摘要:
A solution for managing a set of simulations within a grid infrastructure is provided. In particular, a solution is provided in which distinct simulations (e.g., virtual worlds, distributed simulations, and/or the like) and/or simulation instances (e.g., virtual world instances) can be concurrently managed in a single grid infrastructure.
摘要:
A computer-implemented method for distributing a plurality of tasks over a plurality of processing nodes in a processor network includes the following steps: calculating a task process consumption value for the tasks; calculating a measured node processor consumption value for the nodes; calculating a target node processor consumption value for the nodes, the target node processor consumption value indicating optimal node processor consumption; calculating a load index value as a difference between the calculated node processor consumption value for a node i and the target node processor consumption value for node i; and distributing the tasks among the nodes to balance a processor workload among the nodes, according to the calculated load index value, such that the calculated load index value of each node is substantially zero. The method further embodies a multi-dimensional balancing matrix, each dimension of the matrix representing a node corresponding to a different processor type and each cell representing tasks assigned to multiple nodes.
摘要:
A method and apparatus for use in a computing environment to run a variety of applications in logical partitions. The apparatus includes one or more logical processors (LPs), one or more logical partitions (LPARs) configured to each access a share of processing resources of the LPs in accordance with predefined instructions, and an LPAR manager configured to determine an operational mode of each of the LPARs and any available amount of an excess of the share of the processing resources of the LPs and to dispatch the processing resources of at least a subset of the LPs to the LPARs in accordance with the respective predetermined shares and with respect to the determined operational mode of the respective LPARs and the amount, if any, of the excess share.
摘要:
An apparatus and method for distributing traffic across a group of machines using application instance statistics. In order to perform load balancing in accordance with the present invention, a method of generating weights to bias load balancing distributions is provided. The application instances to which traffic is being distributed, or the application middleware, are instrumented to establish certain metrics about the application while running. The application instance instrumentation will provide application statistics such as number of successful transactions, application response times, application topology, importance of transactions being processed, time the application is blocked waiting for resources, resource consumption data, and the like. These metrics are collected, processed, and then presented as a set of weights to the load balancing apparatus to govern its distribution of traffic. With such application metrics available, traffic can be disbursed based on the current state of the application instances and other application instances in the transaction's path, the application instance's likelihood to complete the request, or even higher level business-oriented goals.
摘要:
Improved techniques are disclosed for processing transactions or requests in a data processing system. For example, a method for processing requests in a system including a plurality of nodes includes the following steps. At least two nodes of the plurality of nodes receive a plurality of requests. The two nodes exchange information to determine an order for processing requests. The two nodes process the requests in accordance with the order. The order may include a total order or a partial order.
摘要:
The present invention relates to the visualization of complex information using a set of navigable landmasses. A method for generating a visualization of a programming code base using a set of navigable landmasses in accordance with an embodiment of the present invention includes: representing each of a plurality of different code components using a respective landmass; adjusting a size of each landmass based on a number of lines of code in the code component corresponding to the landmass; and displaying the landmasses.
摘要:
The present invention provides an interface (as well as associated methods, systems, program products, etc.) for masking changes to a computer application. In general, the interface comprises a facade for facilitating interaction between the interface and a user; a dialog wizard for receiving a set of instructions for the computer application from the user pursuant to an interaction between the user and the facade; and a set of workflows linking the interface with the computer application, the set of workflows being configured to interpret the set of instructions and to direct a behavior of the application based on the interpretation. That is, the set of workflows are configured to convert the set of instructions into a set of commands that are understood by the computer application.
摘要:
A system includes first and second virtual machines (VM) representing a master and a client respectively. A class file is loading by the first virtual machine into shared memory. The class file includes sharable and non-sharable data, and also references sharable and non-sharable data (including code). When it is desired to load the same class into the second virtual machine, the class is first located within said shared memory. A mirror copy of the class is then formed within private memory in the second virtual machine. Finally the non-sharable data of the class is completed in the private memory. Thereafter, an application in the second virtual machine can utilise the class on the basis of the sharable data in the shared memory of the first virtual machine, and the non-sharable data from the private memory of the second virtual machine.