Dynamic Self-Healing Mechanism for Transactional Business Process

Algorithm 1

Self-healing algorithm with scheduling (SA1).

Input: A business process scheduling BPS, time point

Output: An optimal business schedule for current BPS

(1)  construct an original composite service scheduling with time constraint;

(2)  mine all transactional service granularities;

(3)  For , determining its own transactional boundary ();

(4)  Predict running time of each component service in at time point

(5)  If (PT() > ET() + )

(6)        if ( is not the first composite service in )

(7)            record the prefix component service set of ;

(8)            compensate ;

(9)            select a new similar replace to ;

(10)      end if

(11)  end if

(12)  Else if (there exists a paralleled composite for )

(13)         if (PT() + CT()) > (PT() + CT())

(14)              () = () + (PT() + CT()) − (PT() + CT())

(15)              () = () + (PT() + CT()) − (PT() + CT())

(16)         end if

(17)         reconstruct a new scheduling of BPS

(18)  end if