Abstract:
PROBLEM TO BE SOLVED: To provide a processor load balancing method to overcome drawbacks of the prior art. SOLUTION: A computer-implemented method for distributing a plurality of tasks to a plurality of processing nodes in a processor network includes: a step of calculating a task process consumption value with respect to the tasks; a step of calculating a measured node processor consumption value for the nodes; a step of calculating a target node processor consumption value for the nodes, the target node processor consumption value indicating optimal node processor consumption; a step of 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 the node i; and a step of distributing the tasks among the nodes so as 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. Further, the method comprises a multidimensional balancing matrix with each dimension thereof representing a node corresponding to a different processor type and each cell representing tasks assigned to multiple nodes. COPYRIGHT: (C)2008,JPO&INPIT
Abstract:
Hierin werden Systeme, Verfahren und Produkte zur Transaktionsverwaltung für Datenbanksysteme bereitgestellt. Ein Aspekt sieht das Annotieren eines auf einer Datenverarbeitungseinheit vorhandenen Datenobjektes mittels der Datenverarbeitungseinheit unter Verwendung wenigstens eines Transaktions-Tag vor, wobei das wenigstens eine Transaktions-Tag so konfiguriert ist, dass es einen Status eines dazugehörigen Datenobjektes anzeigt; das Verarbeiten wenigstens einer Datenbanktransaktion unter Verwendung eines transaktionsorientierten Speicherprozesses, wobei ein Zugriff auf das wenigstens eine Datenobjekt auf der Grundlage des Status des wenigstens einen Datenobjektes festgelegt wird; und das Aktualisieren des Status des wenigstens einen Datenobjektes als Reaktion auf einen versuchten Zugriff auf das wenigstens eine Datenobjekt durch die wenigstens eine Datenbanktransaktion. Hierein werden darüber hinaus weitere Ausführungsformen und Aspekte beschrieben.
Abstract:
A method, information processing system, and computer readable storage medium are provided for dynamically managing accelerator resources. A first set of hardware accelerator resources (122) is initially assigned to a first information processing system (104), and a second set of hardware accelerator resources (124) is initially assigned to a second information processing system (106). Jobs running on the first and second information processing systems (116, 118) are monitored (132). When one of the jobs fails to satisfy a goal, at least one hardware accelerator resource in the second set of hardware accelerator resources from the second information processing system are dynamically reassigned (138) to the first information processing system.
Abstract:
Systems, methods, and products for database system transaction management are provided herein. One aspect provides for annotating via a computing device at least one data object residing on the computing device utilizing at least one transaction tag, the at least one transaction tag being configured to indicate a status of an associated data object; processing at least one database transaction utilizing a transactional memory process, wherein access to the at least one data object is determined based on the status of the at least one data object; and updating the status of the at least one data object responsive to an attempted access of the at least one data object by the at least one database transaction. Other embodiments and aspects are also described herein.
Abstract:
Upon receipt of a request for service, 202, a workload manager according to the present invention classifies the request, 204, into a particular type of service and places the work on a logical queue to be executed, 206. Routing queues place the work, using initiators, 208, on one of many available nodes. The work is distributed to the nodes based on accounting, availability and past performance of all nodes considered. Once the work is completed notification is given to the management module, 216. Changes are made periodically to the system to meet demands for service and/or conserve resources, 212, in accordance with recorded statistics. These changes are made by a policy manager which may start additional initiators or add additional router capacity to handle the current workload. The workload manager learns the need of programs over time, 218, and does not require the intervention of a system administrator. The system does not rely on system specific metrics but may use performance metrics. Additionally, the workload manager allows objects to be distributed through the cluster of workstations, while behaving as if they were initiated locally on the machine on which they run. 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.
Abstract:
A method, information processing system, and computer readable storage medium are provided for dynamically managing accelerator resources. A first set of hardware accelerator resources (122) is initially assigned to a first information processing system (104), and a second set of hardware accelerator resources (124) is initially assigned to a second information processing system (106). Jobs running on the first and second information processing systems (116, 118) are monitored (132). When one of the jobs fails to satisfy a goal, at least one hardware accelerator resource in the second set of hardware accelerator resources from the second information processing system are dynamically reassigned (138) to the first information processing system.
Abstract:
Database system transaction management comprises annotating via a computing device at least one database data object (e.g. table 202, page 203, rows 204 within database 201) residing on the computing device utilizing at least one transaction tag 205, the at least one transaction tag 205 being configured to indicate a status of an associated data object; processing at least one database transaction utilizing a transactional memory (TM) process, wherein access to the at least one data object is determined based on the status of the at least one data object; and updating the status of the at least one data object responsive to an attempted access of the at least one data object by the at least one database transaction. The tag updates may be handled utilizing hardware transaction management (HTM) optimistically lock-free.
Abstract:
In a multi-user application environment with Java, both codesource access checking and verification of the user who is executing code are employed for access checking. An end user uses a Web browser to access a Web server. An execution thread is established for an end user. The HTTP page and function requested by the user cause the Web application server to invoke a Java Virtual Machine (JVM) which in turn invokes a requested Java servlet. When the Secure Class Loader loads a Java class into the JVM, the code base Uniform URL and the Digital Certificate that was used to sign the class are used by the Secure Class Loader to create the codesource Java object. The JVM includes a Java Security Manager (JSM) class that invokes classes that invoke an underlying system security manager. Conditional access checking includes the capability to control access to resources based on the user and on the Java servlet classes being executed. If the codesource indicated by a Conditional Access List matches the codesource specified in the profile, the system security manager will allow access.