Workflows are computational representations of business processes. When workflows are changed, a strategy for dealing with actual running workflow instances is needed, since workflows are typically longrunning processes. As the basic strategies abort and flush are rarely applicable, hybrid workflow schemas have to be defined (transitional provisions) for the continuation of these instances. In ...

Distributed execution of logic programs on heterogeneous pro cessors requires e cient task distribution and engine synchronization to exploit the potential for performance This paper presents a task driven scheduling technique to distribute tasks to engines e ectively It consists of a dynamic hierarchy of distributed scheduling components able to adapt to program characteristics and the platfor...

To advance the coordinative business processing cognition of conceptual workkow spec-iications, several fundamental extensions of execution dependency, over and above process to process triggering, are recognised. These include: information passing through buuers and messaging, abort handling, and the application of decomposition for decision processing. The addition of these concepts, however,...

Timely detection and response to catastrophic events during the launch and ascent phase of the Ares I launch system is of paramount importance to crew safety. This requires an abort system capable of detecting and confirming conditions that may lead to catastrophic failure, notifying the crew of the problem, and responding in time to allow the crew to escape safely. The Ares I Abort Failure Det...

For many practical systems that are required to perform critical tasks, it is commonly observed tasks can be performed multiple times within a limited time improve task success probability. Such property referred as redundancy. This paper contributes by studying the optimal adaptive maintenance and abort strategies of continuously degraded considering two kinds redundancy system safety reliabil...

Prior condition synchronization primitives for memory transactions either force waiting transactions to abort (the retry construct), or force them to commit (also called punctuation in the literature). Although these primitives are useful in some settings, they do not enable programmers to conveniently express idioms that require synchronous communication (e.g., n-way rendezvous operations) bet...

In Transactional Memory workloads, conflicts among transactions necessitate that some transactions either block, or else abort. The more common approach, aborting, is under-studied. Much effort has explored the use of schedulers and gatekeepers when the global abort rate is high. Handling short spikes in the abort rate, especially due to a single transaction with a high likelihood of conflict, ...

DEFINITION The 2-phase commit (2PC) protocol is a distributed algorithm to ensure the consistent termination of a transaction in a distributed environment. Thus, via 2PC an unanimous decision is reached and enforced among multiple participating servers whether to commit or abort a given transaction, thereby guaranteeing atomicity. The protocol proceeds in two phases, namely the prepare (or voti...

Many existing real time commit protocols try to improve system performance by allowing a committing cohort to lend its data to an executing cohort, thus reducing data inaccessibility. They block the borrower from sending WORKDONE/PREPARED message and restrict them from lending data so that transaction abort chain is limited to one. Thus, transaction execution time increases. This paper proposes...