Abstract: Examples of a no rollback threshold for an audit trail are disclosed. In one example implementation according to aspects of the present disclosure, a method may include processing, by a computing system, a database transaction, and determining, by the computing system, whether a transaction span of the transaction exceeds a no rollback threshold for an audit trail. The method may include, in response to determining that the transaction span exceeds the no rollback threshold, converting, by the computing system, the transaction into a no rollback transaction. Additionally, the method may include, in response to determining that the transaction span exceeds the no rollback threshold, abandoning, by the computing system, the transaction if an error is encountered during the processing the transaction.

Abstract: A method for transaction registration is described herein. The method includes sending, for a transaction manager, a registration request for a transaction. The method also performing data accesses on a data server. The registration request is non-blocking to the data accesses. The method further includes performing a two-phase commit process for the data server if the registration request is accepted. Additionally, the method includes handling the rollback if the transaction registration is rejected.

Abstract: A method for transaction registration is described herein. The method includes sending, for a transaction manager, a registration request for a transaction. The method also performing data accesses on a data server. The registration request is non-blocking to the data accesses. The method further includes performing a two-phase commit process for the data server if the registration request is accepted. Additionally, the method includes handling the rollback if the transaction registration is rejected.

Abstract: Examples of a no rollback threshold for an audit trail are disclosed. In one example implementation according to aspects of the present disclosure, a method may include processing, by a computing system, a database transaction, and determining, by the computing system, whether a transaction span of the transaction exceeds a no rollback threshold for an audit trail. The method may include, in response to determining that the transaction span exceeds the no rollback threshold, converting, by the computing system, the transaction into a no rollback transaction. Additionally, the method may include, in response to determining that the transaction span exceeds no rollback threshold, abandoning, by the computing system, the transaction if an error is encountered during the processing the transaction.

Abstract: A method of scheduling in a mixed workload environment. A high priority workload requiring bounded response times is executed on the same system with a low priority workload that is capable of tying up the CPU and multiple volume storage resources of the system by causing multiple concurrent I/O operations, thereby increasing the response times of the high priority workload beyond acceptable bounds. The method of scheduling prevents the response times of the high priority workload from increasing beyond the acceptable bounds by deferring the dispatch of processes servicing the current low priority workload for a time that depends on the priority of the low priority work and by not performing concurrent I/O operations that are requested by the current low priority work, when there is sufficient higher priority activity on the storage resource.

Abstract: A method of scheduling in a mixed workload environment. A high priority workload requiring bounded response times is executed on the same system with a low priority workload that is capable of tying up the CPU and multiple volume storage resources of the system by causing multiple concurrent I/O operations, thereby increasing the response times of the high priority workload beyond acceptable bounds. The method of scheduling prevents the response times of the high priority workload from increasing beyond the acceptable bounds by deferring the dispatch of processes servicing the current low priority workload for a time that depends on the priority of the low priority work and by not performing concurrent I/O operations that are requested by the current low priority work, when there is sufficient higher priority activity on the storage resource.