Connect public, paid and private patent data with Google Patents Public Datasets

System for transaction processing with parallel execution

Download PDF

Info

Publication number
US20040215594A1
US20040215594A1 US10762898 US76289804A US2004215594A1 US 20040215594 A1 US20040215594 A1 US 20040215594A1 US 10762898 US10762898 US 10762898 US 76289804 A US76289804 A US 76289804A US 2004215594 A1 US2004215594 A1 US 2004215594A1
Authority
US
Grant status
Application
Patent type
Prior art keywords
thread
threads
server
transaction
commit
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US10762898
Inventor
Alexander Somogyi
Adam Messinger
Anno Langen
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
BAE Systems Inc
Original Assignee
BAE Systems Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06QDATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
    • G06Q10/063Operations research or analysis

Abstract

A system for using available server threads to process resources and reduce the overall time of performing XA interactions in two-phase commit protocol implemented by the transaction manager. A TM processing XA interactions dispatches interaction commands for multiple resources to a thread manager, which dispatches the commands to idle server threads. In one embodiment, the TM attempts to dispatch all but one of the interaction commands to separate threads. The primary thread then processes the remaining resource command. Any commands relating to dispatch requests that were unable to be dispatched to separate threads due to unavailability are processed by the primary thread. Once the primary server has processed its interaction commands and received a signal indicating the threads receiving dispatch requests have completed their respective processing of dispatched commands, the next group of commands is processed in a similar manner.

Description

    CLAIM TO PRIORITY
  • [0001]
    The present application claims the benefit of priority under 35 U.S.C. §119(e) to U.S. Provisional Patent Application entitled “PARALLEL TRANSACTION EXECUTION USING JTA INTERFACE” Ser. No. 60/442,319, filed on Jan. 24, 2003, which application is incorporated herein by reference.
  • COPYRIGHT NOTICE
  • [0002]
    A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever.
  • FIELD OF THE INVENTION
  • [0003]
    The current invention relates generally to XA interactions in Java Transaction API, and more particularly to parallel transaction processing in XA interactions in Java Transaction API.
  • BACKGROUND OF THE INVENTION
  • [0004]
    Java standards for web services are constantly being developed. Concurrently, businesses are building important applications on top of web services infrastructures, such as that available in WebLogic Server from BEA Systems of San Jose, Calif. As these applications evolve, they become more complex with more operations to perform. In many implementations, a server may perform transactions involving multiple resources. Transactional guarantees when making updates to the resources are important and should be performed as quickly as possible.
  • [0005]
    The WebLogic Server (WLS) Transaction Manager (TM) provides a full-featured two-phase commit transaction engine that implements the Java Transaction API (JTA) specification. Java 2 Enterprise Edition (J2EE) applications deployed on WLS make use of the TM and the JTA interfaces to effect atomic, persistent changes to data that are managed by one or more transactional resources. Transactional resources, such as RDBMS and messaging systems, support the XAResource interface as defined by the JTA specification. A representative server-resource system 100 is illustrated in FIG. 1. In FIG. 1, an environment for a server computer 110 includes server 120, a first resource 130, and second resource 140. Server 120 includes transaction manager 150. Resources are accessed by an application to perform updates to persistent data. The transaction manager is used to ensure that the updates happen atomically with transactional guaranties. This process is described in more detail in “Open Group Distributed Transactions Processing” by Java Inc, incorporated by reference herein.
  • [0006]
    WLS internally manages several thread pools that are used to process application logic, administrative requests, inter-server communication and other operations specific to server management. The TM utilizes server threads to perform various transaction-related operations on behalf of the application such as coordinating transactions across multiple servers, transaction timeout processing, transaction recovery processing, and other operations. System 200 of FIG. 2 illustrates a server thread of the prior art. As shown, a server 120 includes a thread 210. Previously, accessing transactional resources from within a WLS global transaction would cause the TM to perform all resource interactions from within the thread assigned to the application component. Thus, as shown in FIG. 2, the thread 210 includes all interactions such as access resources R1 and R2, two-phase commit processing which includes preparing resources R1 and R2 and committing resources R1 and R2. The two transactional resources are registered and accessible to applications.
  • [0007]
    There are several XA interactions that take place between the TM and a resource during the course of a transaction as prescribed by the JTA specification. With reference to FIGS. 1 and 2, an application may begin a transaction and update resources 130 and 140 on server 120. The application logic is dispatched to a server thread 210 running in server 120. The application thread then starts a transaction, updates resources, and commits the transaction. Within the thread 210, the application updates data in first resource 130 and then a second resource 140.
  • [0008]
    A method 300 of the prior art for performing a transaction according to the JTA specification is illustrated in FIG. 3. Method 300 begins with start step 305. Next, resources are enlisted at step 310. Resource enlistment occurs when a resource is accessed within the scope of a transaction and it associates the application's changes with a transaction that is under the control of the TM. Thus, when the application commits the transaction, control of the application thread is given to the TM 150. Next, the participating resources are signaled to prepare to commit in step 320. The TM 150 then sequentially prepares each resource. Each resource is asked by the TM whether the application changes made under the transaction can be made permanent. The TM then determines if all resources are able to commit at step 330. Once all resources have responded to the prepare directive, the transaction manager will either commit or abort the transaction and inform the resource participants of the outcome. If the resources do not all respond positively to the prepare request, then operation continues to step 350 where the TM aborts the transaction. The application may alternatively issue an abort request for the transaction and the TM will only invoke the rollback operation on the resources. If all resources commit at step 330, the TM issues a commit operation signal and the transaction proceeds at step 340. After the TM signals for either a commit or an abort, operation ends at step 365. The prepare, rollback and commit operations are issued in sequence to each locally-accessible resource that is enlisted in the transaction on any given server that is participating in the transaction. If there are additional servers and resources participating in the transaction then each server would invoke the XA operations serially for those participating resources that are locally accessible.
  • [0009]
    Performing resource prepare, commit and rollback operations serially as currently done in the prior art can be inefficient since these XA operations may require long processing times. What is needed is a system and method for processing transactions that overcomes the limitations and disadvantages of the prior art.
  • SUMMARY OF THE INVENTION
  • [0010]
    In one embodiment of the present invention, a system for utilizing available server threads to process resources and reduce the overall time of performing XA interactions in two-phase commit protocol implemented by the transaction manager (TM) of the present invention. A TM processing XA interactions dispatches interaction commands for multiple resources to idle server threads. In one embodiment, the TM attempts to dispatch all but one of the interaction commands to separate threads. The primary thread then processes the remaining resource command. Any commands relating to dispatch requests that were unable to be dispatched to separate threads due to unavailability are also processed by the primary thread. Once the primary server has processed its interaction commands and received a signal indicating the threads receiving dispatch requests have completed their respective processing of dispatched commands, the next group of commands is processed in a similar manner.
  • [0011]
    By utilizing available server threads, it is possible to reduce the overall time spent in XA operations when multiple resources are involved in a transaction by performing the XA operations in parallel. Because the methods of the XAResource interface are synchronous, the use of additional threads is required to obtain concurrency. If there are no idle threads available, these operations will be performed in the application's thread.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • [0012]
    [0012]FIG. 1 is an illustration of a system for performing transactions utilizing servers and their resources in accordance with one embodiment of the present invention.
  • [0013]
    [0013]FIG. 2 is an illustration of a serial transaction system having a single thread in accordance with the prior art.
  • [0014]
    [0014]FIG. 3 is an illustration of a method for performing a serial transaction in accordance with the prior art.
  • [0015]
    [0015]FIG. 4 is an illustration of a parallel transaction system utilizing multiple threads in accordance with one embodiment of the present invention.
  • [0016]
    [0016]FIG. 5 is an illustration of a method for performing a parallel transaction in accordance with one embodiment of the present invention.
  • [0017]
    [0017]FIG. 6 is an illustration of the average completion time of a transaction in accordance with one embodiment of the present invention.
  • [0018]
    [0018]FIG. 7 is an illustration of the average response time of a transaction in accordance with one embodiment of the present invention.
  • [0019]
    [0019]FIG. 8 is an illustration of the transaction throughput time in accordance with one embodiment of the present invention.
  • DETAILED DESCRIPTION
  • [0020]
    In one embodiment of the present invention, a system of utilizing available server threads to process resources and reduce the overall time for performing XA interactions in two-phase commit protocol implemented by JTA. A TM that processes XA interactions dispatches interaction commands for multiple resources to idle server threads. In one embodiment, the TM attempts to dispatch all but one of the interaction commands to separate threads. The primary thread then processes the remaining resource command. The primary thread may also process any commands relating to dispatch requests that were unable to be dispatched to separate threads. Once the primary server has processed its interaction commands and received a signal indicating the threads receiving dispatch requests have completed their respective processing of dispatched commands, the next group of commands is processed in a similar manner.
  • [0021]
    By utilizing available server threads, it is possible to reduce the overall time spent in XA operations when multiple resources are involved in a transaction by performing the XA operations in parallel. Because the methods of the XAResource interface are synchronous, the use of additional threads is required to obtain concurrency. In one embodiment of the present invention, if there are N resources enlisted in a transaction, the TM commit/rollback logic will schedule requests to prepare/commit/rollback for the resources numbered 2 through N, where N>1. This provides the potential of all but one of the resource transactions to be dispatched to other threads. If there are no idle threads available, these operations will be performed sequentially in the application's thread.
  • [0022]
    System 400 of FIG. 4 illustrates a server wherein transactions are processed in parallel. System 400 includes server 410, a primary thread 420, T1, thread TX 430, and thread TY 440. Primary thread 420 includes resource access commands, a prepare and a commit command for resource one. Thread TX 430 includes a prepare command for resource two. Thread TY 440 includes a commit command for resource two. As indicated by the time line adjacent to primary thread 420, the commands in the primary thread are processed sequentially in time, but in parallel with commands in thread 430 and thread 440.
  • [0023]
    In the present invention, the application thread drives the two phase-commit protocol. If there is more than one local resource participant for the server, the TM will attempt to dispatch resources 2-N to available threads for execution. The request may be executed in the primary thread if there are no idle threads available. After requests for resources 2 through N have been dispatched, the primary thread will perform the XA operation for resource 1 (R1). After the R1 operation completes, the primary thread will wait until each dispatched resource request has completed and signaled the primary thread. Thus, as shown in system 400, the prepare R1 command and prepare R2 command are performed by threads T1 and TX threads, respectively. The TM does not continue the operation of the thread T1 and process the commit R1 command until the Prepare R2 command has completed and signaled the primary thread T1.
  • [0024]
    The parallel processing of the present invention is further illustrated in method 500 of FIG. 5. Method 500 begins with start step 505. The method of FIG. 5 may be used to invoke several types of XA operations, including resource prepare, commit, and rollback operations. As discussed above, the XA operation type is processed for each resource before processing of the next XA operation begins. The XA operation to be performed depends upon the phase in the two-phase commit protocol being processed. Step 510 signifies that an XA operation associated with a phase of the two-phase commit protocol is selected to be processed. The number and identity of available threads is determined at step 520. In one embodiment, the transaction manager, or TM, provides tasks to the thread pool manager. The thread pools maintained by the server system are then checked to determine which threads are idle. Information for idle threads within the thread pool are determined by the thread manager. Next, the thread pool manager determines if there is an available thread for the current resource XA transaction at step 530. If an idle thread does not exist, operation continues to step 535 wherein the request may be immediately invoked in the current thread or caller's thread as a blocking operation. In this case, the thread pool manager processes the work in the current thread. Thus, when there are no idle threads, the transaction operations are performed in sequence. In yet another embodiment, a dedicated thread pool is used for parallel transaction operations. In this case, instead of using a default thread pool to dispatch transaction operations for idle threads, operations are dispatched to a separate, dedicated pool used for transaction operation. After the operation is invoked in the current thread, operation of method 500 continues to step 550.
  • [0025]
    If a thread is available at step 530, operation continues to step 540 wherein the thread manager dispatches the XA operation to the available thread. Operation then continues to step 550. In one embodiment, only the XA operation for each resource is dispatched. For example, as shown in system 400 of FIG. 4, prepare to commit transactions are handled at the time indicated by indicator 450. At that time, the prepare operations are handled by primary thread 420 for the first resource and thread 430 for the second resource.
  • [0026]
    At step 550, if the TM has attempted to dispatch the current XA operation of all N−1 resources in the transaction, operation continues to step 560. If there are more XA operations, the next resource is addressed as indicated in step 555 and operation continues for the resource at step 520. At step 560, the primary thread then processes the XA operation for resource 1.
  • [0027]
    After the primary thread has processed the XA operations in step 560, the primary thread determines if the threads that received dispatches in step 560 have signaled the primary thread at step 570. In one embodiment, the primary thread determines if the respective threads have signaled the primary thread to indicate their respective commands have been processed. In one embodiment, operation remains at step 570 until all threads receiving dispatched commands have signaled the primary thread. In another embodiment, the primary thread will wait for a pre-determined period of time during which the threads receiving dispatches may signal the primary thread. In this embodiment, if the threads do not signal the primary thread within the time period, a time-out error is logged. If the TM is processing the prepare phase of the two phase commit protocol, then the transaction may be aborted. Once all threads processing dispatched requests have signaled the primary thread, the TM reports results of the XA operation at step 580. Operation then ends at step 595.
  • [0028]
    In one embodiment of the present invention, the signaling mechanism is based on a Java class that maintains a counter of the number of signal events anticipated. The primary thread will invoke a wait method that blocks the caller until the object is signaled the set number of times. The modified prepare/commit/rollback algorithms sets the expected number of signal events to be N−1. Each request that is dispatched to a thread for execution is given a reference to the synchronization object. Upon completing the XA operation the thread will invoke the object's signal method before terminating.
  • [0029]
    [0029]FIGS. 6-8 illustrate data corresponding to traits of the present invention. In FIGS. 6-8, data plots corresponding to three types of XA interaction processing implementations are provided. For each plot, the server is assumed to have three resources, a one second prepare to commit time, and a one second commit time. The darkest plot containing interspersed diamond icons represents the results of 11 free default queue threads and 11 dedicated XA threads. The second darkest plot containing interspersed squares represents 22 free default queue threads. This second darkest plot most resembles the serial processing technique of the prior art. The lightest plot containing interspersed triangles includes 22 free default queue threads, wherein parallel transactions are implemented in the default queue threads if one or more threads are idle.
  • [0030]
    [0030]FIG. 6 illustrates a plot of the average transmission completion time in seconds for varying numbers of client threads used by applications. For low numbers of client threads being used, the parallel transaction processing system provides for much faster processing and better thread utilization than the serial processing technique. As the number of threads in use by a server increase, the average transaction completion time improvement of the parallel processing method over the serial processing method slowly decreases. FIG. 7 illustrates a plot of the average response time. For low numbers of client threads being used, the parallel transaction processing system provides for much faster average response time than the serial processing technique. As the number of threads in use by a server increase, the average response time improvement of the parallel processing method over the serial processing method slowly decreases. FIG. 8 illustrates a plot of the transaction throughput characteristic of the three processing systems. For low numbers of client threads being used, the parallel transaction processing system provides for transactions completed per second than the serial processing technique. As the number of threads in use by a server increase, the transactions per second improvement of the parallel processing method over the serial processing method slowly decreases.
  • [0031]
    As indicated in FIGS. 6-8, server performance improves with the use of the parallel XA feature when client loads are light to moderate. This is due to the utilization of otherwise idle threads. For heavy client loads, where all server threads are being utilized for processing client requests, the behavior and performance is similar to that of serialized XA in that the primary thread processes most of the XA related interactions.
  • [0032]
    In one embodiment of the present invention, available server threads are utilized to process resources and reduce the overall time of performing XA interactions in two-phase commit protocol implemented by the TM of the present invention. A TM that processes XA interactions dispatches interaction commands for multiple resources to idle server threads. In one embodiment, the TM attempts to dispatch all but one of the interaction commands for current command. The primary thread then processes the remaining resource command as well as any commands relating to dispatch requests that failed. Once the primary server has processed its interaction commands and received a signal indicating the threads receiving dispatch requests have completed their respective processing of dispatched commands, the next group of commands is processed in a similar manner.
  • [0033]
    Other features, aspects and objects of the invention can be obtained from a review of the figures and the claims. It is to be understood that other embodiments of the invention can be developed and fall within the spirit and scope of the invention and claims.
  • [0034]
    The foregoing description of preferred embodiments of the present invention has been provided for the purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise forms disclosed. Obviously, many modifications and variations will be apparent to the practitioner skilled in the art. The embodiments were chosen and described in order to best explain the principles of the invention and its practical application, thereby enabling others skilled in the art to understand the invention for various embodiments and with various modifications that are suited to the particular use contemplated. It is intended that the scope of the invention be defined by the following claims and their equivalence.
  • [0035]
    In addition to an embodiment consisting of specifically designed integrated circuits or other electronics, the present invention may be conveniently implemented using a conventional general purpose or a specialized digital computer or microprocessor programmed according to the teachings of the present disclosure, as will be apparent to those skilled in the computer art.
  • [0036]
    Appropriate software coding can readily be prepared by skilled programmers based on the teachings of the present disclosure, as will be apparent to those skilled in the software art. The invention may also be implemented by the preparation of application specific integrated circuits or by interconnecting an appropriate network of conventional component circuits, as will be readily apparent to those skilled in the art.
  • [0037]
    The present invention includes a computer program product which is a storage medium (media) having instructions stored thereon/in which can be used to program a computer to perform any of the processes of the present invention. The storage medium can include, but is not limited to, any type of disk including floppy disks, optical discs, DVD, CD-ROMs, microdrive, and magneto-optical disks, ROMs, RAMs, EPROMs, EEPROMs, DRAMs, VRAMs, flash memory devices, magnetic or optical cards, nanosystems (including molecular memory ICs), or any type of media or device suitable for storing instructions and/or data.
  • [0038]
    Stored on any one of the computer readable medium (media), the present invention includes software for controlling both the hardware of the general purpose/specialized computer or microprocessor, and for enabling the computer or microprocessor to interact with a human user or other mechanism utilizing the results of the present invention. Such software may include, but is not limited to, device drivers, operating systems, and user applications.
  • [0039]
    Included in the programming (software) of the general/specialized computer or microprocessor are software modules for implementing the teachings of the present invention, including, but not limited to, parallel processing of XA interactions in a JTA environment.

Claims (10)

1. A computer program product for execution by a server computer for implementing a two-phase commit protocol, comprising:
computer code for dispatching a first two-phase commit protocol operation from a first thread to a second thread, the first two-phase commit protocol operation associated with a first resource and a first phase of two-phase commit protocol;
computer code for processing a second two-phase commit protocol operation by the first thread, the second two-phase commit protocol operation associated with a second resource and the first phase of two-phase commit protocol; and
computer code for determining the first two-phase commit protocol operation is complete.
2. The computer program product of claim 1 further comprising:
computer code for selecting an idle server thread to process the first two-phase commit protocol operation.
3. The computer program product of claim 2, wherein computer code for selecting includes:
computer code for determining available server threads in a server.
4. The computer program product of claim 3 wherein a thread pool manager determines the available server threads.
5. The computer program product of claim 1 further comprising:
computer code for reporting results of the first and second two-phase commit protocol to a log.
6. A computer program product for execution by a server computer for processing N two-phase commit protocol operations, comprising:
computer code for processing N two-phase commit protocol operations in a first server thread, wherein the computer code for processing for each of N−1 of the two-phase commit protocol operation includes:
computer code for dispatching the two-phase commit protocol operation to a second server thread if a second server thread is determined to be available; and
computer code for processing the two-phase commit protocol operation in the primary thread if no second server thread is determined to be available; and
computer code for processing the remaining two-phase commit protocol operation in the first server thread.
7. The computer program product of claim 6 wherein computer code for dispatching the two-phase commit protocol operation to a second server thread includes:
computer code for determining available server threads in a server; and
computer code for selecting one of the available server threads to be the second server thread.
8. The computer program product of claim 7 wherein a thread pool manager determines the available server threads.
9. The computer program product of claim 6 wherein each of the N two-phase commit protocol operations are associated with a first phase of a two-phase commit protocol.
10. The computer program product of claim 6 further comprising:
computer code for reporting results of the first and second two-phase commit protocol to a log.
US10762898 2003-01-24 2004-01-22 System for transaction processing with parallel execution Abandoned US20040215594A1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US44231903 true 2003-01-24 2003-01-24
US10762898 US20040215594A1 (en) 2003-01-24 2004-01-22 System for transaction processing with parallel execution

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US10762898 US20040215594A1 (en) 2003-01-24 2004-01-22 System for transaction processing with parallel execution
PCT/US2004/001861 WO2004068294A3 (en) 2003-01-24 2004-01-23 Transaction processing with parallel execution

Publications (1)

Publication Number Publication Date
US20040215594A1 true true US20040215594A1 (en) 2004-10-28

Family

ID=33302907

Family Applications (3)

Application Number Title Priority Date Filing Date
US10762898 Abandoned US20040215594A1 (en) 2003-01-24 2004-01-22 System for transaction processing with parallel execution
US10762944 Active 2026-09-17 US7640535B2 (en) 2003-01-24 2004-01-22 Method for transaction processing with parallel execution
US12643775 Active 2025-05-10 US8375359B2 (en) 2003-01-24 2009-12-21 Parallel transaction execution with a thread pool

Family Applications After (2)

Application Number Title Priority Date Filing Date
US10762944 Active 2026-09-17 US7640535B2 (en) 2003-01-24 2004-01-22 Method for transaction processing with parallel execution
US12643775 Active 2025-05-10 US8375359B2 (en) 2003-01-24 2009-12-21 Parallel transaction execution with a thread pool

Country Status (1)

Country Link
US (3) US20040215594A1 (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050097555A1 (en) * 2003-10-30 2005-05-05 International Business Machines Corporation Method, system and program product for processing a transaction
US20080134219A1 (en) * 2003-06-10 2008-06-05 Daniel Michael Dorrance Apparatus for maintaining resource integrity without a unified transaction manager in a software environment
US20100100624A1 (en) * 2003-01-24 2010-04-22 Bea Systems, Inc. Parallel transaction execution with a thread pool
US20140337303A1 (en) * 2013-05-07 2014-11-13 Red Hat, Inc Bandwidth optimized two-phase commit protocol for distributed transactions

Families Citing this family (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8626716B1 (en) * 2004-04-08 2014-01-07 Sprint Communications Company L.P. Service broker enhancements
US8918367B2 (en) * 2004-04-30 2014-12-23 Sap Se Two phase commit emulation for non distributed transactions
US8024355B2 (en) * 2004-12-29 2011-09-20 Sap Ag Dynamic capacity demand profile construction with a persisted capacity demand profile and a collision buffer
US8332443B2 (en) * 2008-12-19 2012-12-11 Microsoft Corporation Masterless distributed batch scheduling engine
US20100169289A1 (en) * 2008-12-30 2010-07-01 International Business Machines Corporation Two Phase Commit With Grid Elements
US9268608B2 (en) * 2009-02-26 2016-02-23 Oracle International Corporation Automatic administration of UNIX commands
US8572617B2 (en) * 2009-07-21 2013-10-29 Sas Institute Inc. Processor-implemented systems and methods for event handling
US8499298B2 (en) 2010-01-28 2013-07-30 International Business Machines Corporation Multiprocessing transaction recovery manager
US9275369B2 (en) 2011-08-24 2016-03-01 Oracle International Corporation Demystifying obfuscated information transfer for performing automated system administration
US20130227520A1 (en) * 2011-09-01 2013-08-29 Eric Hosick Rapid process integration through visual integration and simple interface programming
US8375385B1 (en) * 2011-12-19 2013-02-12 Emc Corporation Techniques for parallel drive upgrade while maintaining host accessibility
US20150149426A1 (en) * 2013-11-22 2015-05-28 Kyu Hwan Kim Transaction commit operations with thread decoupling and grouping of i/o requests

Citations (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5335343A (en) * 1992-07-06 1994-08-02 Digital Equipment Corporation Distributed transaction processing using two-phase commit protocol with presumed-commit without log force
US5884327A (en) * 1996-09-25 1999-03-16 International Business Machines Corporation System, method and program for performing two-phase commit with a coordinator that performs no logging
US5991792A (en) * 1998-01-02 1999-11-23 International Business Machines Corporation Method, apparatus and computer program product for dynamically managing a thread pool of reusable threads in a computer system
US6237024B1 (en) * 1998-03-20 2001-05-22 Sun Microsystem, Inc. Method and apparatus for the suspension and continuation of remote processes
US6349295B1 (en) * 1998-12-31 2002-02-19 Walker Digital, Llc Method and apparatus for performing supplemental searches over a network
US20020178177A1 (en) * 2001-05-28 2002-11-28 Park Nam Shik Parallel logging method for transaction processing system
US20020194377A1 (en) * 1999-11-18 2002-12-19 Gregory David Doolittle Method, system and program products for managing thread pools of a computing environment to avoid deadlock situations
US6567838B1 (en) * 1993-07-13 2003-05-20 International Business Machines Corporation Method, system and program for executing a predicted operation in a computer system after a predetermined period elapses since a user activity
US20030115276A1 (en) * 2001-12-19 2003-06-19 International Business Machines Corporation Message ordering in a messaging system
US20030145021A1 (en) * 2002-01-31 2003-07-31 Jarmo Parkkinen Method and arrangement for serially aligning database transactions
US20030188163A1 (en) * 2002-03-28 2003-10-02 International Business Machines Corporation Adaptive control system and method for optimized invocation of portlets
US6671686B2 (en) * 2000-11-02 2003-12-30 Guy Pardon Decentralized, distributed internet data management
US20040003372A1 (en) * 2002-05-17 2004-01-01 Yuko Sato Apparatus, method, and program product for supporting programming
US20040010551A1 (en) * 2002-07-11 2004-01-15 Chia-Chu Dorland Method and apparatus for automated network polling
US6823356B1 (en) * 2000-05-31 2004-11-23 International Business Machines Corporation Method, system and program products for serializing replicated transactions of a distributed computing environment

Family Cites Families (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE69429686T2 (en) * 1993-02-25 2003-04-30 Sun Microsystems Inc Transaction management system in object
JP3231571B2 (en) * 1994-12-20 2001-11-26 日本電気株式会社 Multithread execution method and execution unit ordered
US5682507A (en) * 1995-06-07 1997-10-28 Tandem Computers, Incorporated Plurality of servers having identical customer information control procedure functions using temporary storage file of a predetermined server for centrally storing temporary data records
US6298370B1 (en) * 1997-04-04 2001-10-02 Texas Instruments Incorporated Computer operating process allocating tasks between first and second processors at run time based upon current processor load
US6105147A (en) * 1997-04-16 2000-08-15 Compaq Computer Corporation Using process pairs as transaction-coordinated resource managers
US6058388A (en) * 1997-06-16 2000-05-02 Compaq Computer Corporation Implementation of escrow-locking scalar quantities via process-pair resource managers
US6157927A (en) * 1998-04-22 2000-12-05 Unisys Corporation Methods and apparatus for enabling a component in a first transaction processing environment to access a resource in another environment that is under the control of an Xatmi complaint transaction manager
US6363401B2 (en) * 1998-10-05 2002-03-26 Ncr Corporation Enhanced two-phase commit protocol
US6529921B1 (en) * 1999-06-29 2003-03-04 Microsoft Corporation Dynamic synchronization of tables
US7290056B1 (en) * 1999-09-09 2007-10-30 Oracle International Corporation Monitoring latency of a network to manage termination of distributed transactions
US7206805B1 (en) * 1999-09-09 2007-04-17 Oracle International Corporation Asynchronous transcription object management system
US6728843B1 (en) * 1999-11-30 2004-04-27 Hewlett-Packard Development Company L.P. System and method for tracking and processing parallel coherent memory accesses
US6434555B1 (en) * 2000-01-24 2002-08-13 Hewlett Packard Company Method for transaction recovery in three-tier applications
US6922685B2 (en) * 2000-05-22 2005-07-26 Mci, Inc. Method and system for managing partitioned data resources
DE10107867A1 (en) 2001-02-20 2002-09-05 Philips Corp Intellectual Pty Magnetic resonance imaging apparatus with an open magnet system
US20020194244A1 (en) * 2001-06-01 2002-12-19 Joan Raventos System and method for enabling transaction-based service utilizing non-transactional resources
US20040199549A1 (en) * 2001-06-25 2004-10-07 Kenneth Oksanen Method and system for performing concurrency control in a relational database
US20040107381A1 (en) * 2002-07-12 2004-06-03 American Management Systems, Incorporated High performance transaction storage and retrieval system for commodity computing environments
US20040215594A1 (en) * 2003-01-24 2004-10-28 Bea Systems, Inc. System for transaction processing with parallel execution
US7353495B2 (en) * 2003-02-28 2008-04-01 Bea Systems, Inc. Method for protection against interleaving transactions using a transaction manager
US7346905B2 (en) * 2003-06-10 2008-03-18 International Business Machines Corporation Apparatus and method for maintaining resource integrity without a unified transaction manager in a software environment
US7484215B2 (en) * 2003-10-30 2009-01-27 International Business Machines Corporation Method, system and program product for processing a transaction
US20090064141A1 (en) * 2007-08-29 2009-03-05 Microsoft Corporation Efficient utilization of transactions in computing tasks

Patent Citations (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5335343A (en) * 1992-07-06 1994-08-02 Digital Equipment Corporation Distributed transaction processing using two-phase commit protocol with presumed-commit without log force
US6567838B1 (en) * 1993-07-13 2003-05-20 International Business Machines Corporation Method, system and program for executing a predicted operation in a computer system after a predetermined period elapses since a user activity
US5884327A (en) * 1996-09-25 1999-03-16 International Business Machines Corporation System, method and program for performing two-phase commit with a coordinator that performs no logging
US5991792A (en) * 1998-01-02 1999-11-23 International Business Machines Corporation Method, apparatus and computer program product for dynamically managing a thread pool of reusable threads in a computer system
US6237024B1 (en) * 1998-03-20 2001-05-22 Sun Microsystem, Inc. Method and apparatus for the suspension and continuation of remote processes
US6349295B1 (en) * 1998-12-31 2002-02-19 Walker Digital, Llc Method and apparatus for performing supplemental searches over a network
US20020194377A1 (en) * 1999-11-18 2002-12-19 Gregory David Doolittle Method, system and program products for managing thread pools of a computing environment to avoid deadlock situations
US6823356B1 (en) * 2000-05-31 2004-11-23 International Business Machines Corporation Method, system and program products for serializing replicated transactions of a distributed computing environment
US6671686B2 (en) * 2000-11-02 2003-12-30 Guy Pardon Decentralized, distributed internet data management
US20020178177A1 (en) * 2001-05-28 2002-11-28 Park Nam Shik Parallel logging method for transaction processing system
US20030115276A1 (en) * 2001-12-19 2003-06-19 International Business Machines Corporation Message ordering in a messaging system
US20030145021A1 (en) * 2002-01-31 2003-07-31 Jarmo Parkkinen Method and arrangement for serially aligning database transactions
US20030188163A1 (en) * 2002-03-28 2003-10-02 International Business Machines Corporation Adaptive control system and method for optimized invocation of portlets
US20040003372A1 (en) * 2002-05-17 2004-01-01 Yuko Sato Apparatus, method, and program product for supporting programming
US20040010551A1 (en) * 2002-07-11 2004-01-15 Chia-Chu Dorland Method and apparatus for automated network polling

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100100624A1 (en) * 2003-01-24 2010-04-22 Bea Systems, Inc. Parallel transaction execution with a thread pool
US8375359B2 (en) * 2003-01-24 2013-02-12 Oracle International Corporation Parallel transaction execution with a thread pool
US20080134219A1 (en) * 2003-06-10 2008-06-05 Daniel Michael Dorrance Apparatus for maintaining resource integrity without a unified transaction manager in a software environment
US7448035B2 (en) * 2003-06-10 2008-11-04 International Business Machines Corporation Apparatus for maintaining resource integrity without a unified transaction manager in a software environment
US20050097555A1 (en) * 2003-10-30 2005-05-05 International Business Machines Corporation Method, system and program product for processing a transaction
US7484215B2 (en) * 2003-10-30 2009-01-27 International Business Machines Corporation Method, system and program product for processing a transaction
US20140337303A1 (en) * 2013-05-07 2014-11-13 Red Hat, Inc Bandwidth optimized two-phase commit protocol for distributed transactions
US9201919B2 (en) * 2013-05-07 2015-12-01 Red Hat, Inc. Bandwidth optimized two-phase commit protocol for distributed transactions

Also Published As

Publication number Publication date Type
US8375359B2 (en) 2013-02-12 grant
US20100100624A1 (en) 2010-04-22 application
US20040216107A1 (en) 2004-10-28 application
US7640535B2 (en) 2009-12-29 grant

Similar Documents

Publication Publication Date Title
Georgakopoulos et al. An overview of workflow management: From process modeling to workflow automation infrastructure
US6256637B1 (en) Transactional virtual machine architecture
US7086065B1 (en) Functional enterprise bean
US5689633A (en) Computer program product and program storage device for including stored procedure user defined function or trigger processing within a unit of work
US5261089A (en) Optimization of commit procedures by utilizing a two-phase commit procedure only when necessary
US6163801A (en) Dynamic communication between computer processes
US6138143A (en) Method and apparatus for asynchronous transaction processing
US5956506A (en) System and method for functionally enhancing procedural software using objects
US6272517B1 (en) Method and apparatus for sharing a time quantum
US7024669B1 (en) Managing workload within workflow-management-systems
US6978279B1 (en) Database computer system using logical logging to extend recovery
US6314114B1 (en) Distributed resource management
US7165186B1 (en) Selective checkpointing mechanism for application components
US6038589A (en) Apparatus, method and computer program product for client/server computing with a transaction representation located on each transactionally involved server
US6233587B1 (en) Extensible framework of key resource manager and transaction manager events for providing native support for foreign-initiated transactions
US7188111B2 (en) System and method for connectivity to structured query language database
US20020165902A1 (en) Independent log manager
US20020138321A1 (en) Fault tolerant and automated computer software workflow
US6671686B2 (en) Decentralized, distributed internet data management
US20040194096A1 (en) Deallocation of computer data in a multithreaded computer
US7076784B1 (en) Software component execution management using context objects for tracking externally-defined intrinsic properties of executing software components within an execution environment
US5991768A (en) Finer grained quiescence for data replication
US5630136A (en) Method and apparatus for serializing access to multithreading unsafe resources
US6477559B1 (en) Method and apparatus for remotely accessing an automatic transaction processing system
US7386586B1 (en) System for scheduling and monitoring computer processes

Legal Events

Date Code Title Description
AS Assignment

Owner name: BEA SYSTEMS, INC., CALIFORNIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:SOMOGYI, ALEXANDER J.;MESSINGER, ADAM;LANGEN, ANNO R.;REEL/FRAME:015522/0427;SIGNING DATES FROM 20040510 TO 20040625