We propose a resource management policy that grants or refuses requests for resources based only on the request made and the number of free resources. Computations at runtime are independent of the number of active cases. The policy requires little coordination and is therefore easy to implement in workflow management systems. This policy has been shown to be successful in avoiding deadlocks. In this paper we investigate its performance characteristics.
|Title of host publication||Business Process Management : 3rd International Conference, BPM 2005, Nancy, France, September 5-8, 2005 : proceedings|
|Editors||W.M.P. Aalst, van der, B. Benatallah, F. Casati, F. Curbera|
|Place of Publication||Berlin|
|Publication status||Published - 2005|
|Name||Lecture Notes in Computer Science|