Real-time service process admission control with schedule reorganization

This paper addresses the problem of resource reservation for applications using the real-time service-oriented architecture paradigm. Real-time services must be completed by their deadlines. They can be scheduled anywhere within an execution interval. Some services have a large execution interval which gives them more flexibility during admission control. However, the conventional approach for real-time process scheduling is to reserve a fixed schedule on the first come, first served basis and thus does not take advantage of this flexibility. In this paper, a reorganization algorithm is presented to relocate existing reservations in order to accommodate new requests that have less flexibility. For service process reservations, intermediate deadlines may also be adjusted to further increase the flexibility of service reservations. Simulation results show that reorganization can greatly enhance the acceptance ratio of real-time requests in most situations.