服务计算中避免死锁和活锁的资源分配算法  

Deadlock and Livelock Free Resource Allocation Algorithm in Service Oriented Computing

作　　者：章韵[1] 汤楠[1] 

机构地区：[1]南京邮电大学计算机学院,江苏南京210003

出　　处：《微电子学与计算机》2010年第12期69-73,77,共6页Microelectronics & Computer

摘　　要：服务计算系统资源层的目标是满足服务实例的资源分配需求,保证其成功执行而不陷入死锁和活锁.首先将服务资源分配行为形式化为有限状态机;其次提出一种避免死锁和活锁的资源分配算法,它采用并发请求资源的方式,且不需要并发服务实例之间交换消息.仿真实验结果表明,该算法能够避免服务资源分配过程中的死锁和活锁,表现出较高资源分配性能.System resource layer in service oriented computing aims to allocate resources to various service instances to satisfy their requirements,so that each service instance can execute successfully and does not sink into both deadlock and livelock states.Firstly,the resource allocation behavior is formulated as a finite state machine.Secondly,a kind of deadlock and livelock free resource allocation algorithm is proposed,which adopts parallelization of requests for required resources and does not require communication between service instances.Experiment results show that the algorithm can effectively prevent the service resource allocation from deadlock and livelock,and exhibit good resource allocation performance.

关 键 词：服务计算 资源分配 死锁 活锁 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]