Abstract: 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.