Long-lived transactions (LLTs) are transactions intended to be executed over an extended period of time ranging from seconds to days. A long-lived transaction is normally organized as a series of activities, with each activity being a discrete transactional unit of work that releases transactional locks upon its execution. The long-lived transaction commits if all its activities complete successfully. Unless an activity requires the result of a previously committed activity, there is no constraint which specifies that the various activities belonging to a long lived transaction should execute sequentially. In this paper we present a solution that combines long-lived transactions and CSP such that in- dependent activities execute in parallel...
Transaction management in different application contexts is still a challenging task. In this paper ...
In web service environments, long transactions need to lock resources - often database services - fo...
One fundamental issue that has yet to be adequately addressed in loosely couple distributed systems ...
A long-running transaction is an interactive component of a distributed system which must be execute...
Transaction management in different application contexts is still a challenging task. In this paper ...
Transaction management in different application contexts is still a challenging task. In this paper ...
AbstractLong-running transactions consist of tasks which may be executed sequentially and in paralle...
If future systems provide efficient support for atomic execution (i.e., by transactional memory), we...
Compensation-based long-running transactions (LRTs) are the main error recovery mechanism in busine...
If future systems provide efficient support for atomic execution (i.e., by transactional memory), we...
Long-Running transactions consist of tasks which may be executed sequentially and in parallel, may ...
Abstract: Many business processes in the enterprise applications are both long running and transacti...
Transaction management in different application contexts is still a challenging task. In this paper ...
Transaction management in different application contexts is still a challenging task. In this paper ...
We study long-running transactions in open component-based distributed applications, such as Web Ser...
Transaction management in different application contexts is still a challenging task. In this paper ...
In web service environments, long transactions need to lock resources - often database services - fo...
One fundamental issue that has yet to be adequately addressed in loosely couple distributed systems ...
A long-running transaction is an interactive component of a distributed system which must be execute...
Transaction management in different application contexts is still a challenging task. In this paper ...
Transaction management in different application contexts is still a challenging task. In this paper ...
AbstractLong-running transactions consist of tasks which may be executed sequentially and in paralle...
If future systems provide efficient support for atomic execution (i.e., by transactional memory), we...
Compensation-based long-running transactions (LRTs) are the main error recovery mechanism in busine...
If future systems provide efficient support for atomic execution (i.e., by transactional memory), we...
Long-Running transactions consist of tasks which may be executed sequentially and in parallel, may ...
Abstract: Many business processes in the enterprise applications are both long running and transacti...
Transaction management in different application contexts is still a challenging task. In this paper ...
Transaction management in different application contexts is still a challenging task. In this paper ...
We study long-running transactions in open component-based distributed applications, such as Web Ser...
Transaction management in different application contexts is still a challenging task. In this paper ...
In web service environments, long transactions need to lock resources - often database services - fo...
One fundamental issue that has yet to be adequately addressed in loosely couple distributed systems ...