Dynamic scheduling of real-time tasks under precedence constraints
Real-Time Systems
Service-Oriented Computing: Key Concepts and Principles
IEEE Internet Computing
Elastic reservations for efficient bandwidth utilization in LambdaGrids
Future Generation Computer Systems - Special section: Data mining in grid computing environments
Rescheduling co-allocation requests based on flexible advance reservations and processor remapping
GRID '08 Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing
A Framework for Real-Time Service-Oriented Architecture
CEC '09 Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing
Real-Time Guarantees in Flexible Advance Reservations
COMPSAC '09 Proceedings of the 2009 33rd Annual IEEE International Computer Software and Applications Conference - Volume 02
Achieving Predictability and Service Differentiation in Web Services
ICSOC-ServiceWave '09 Proceedings of the 7th International Joint Conference on Service-Oriented Computing
Fault tolerance in networks with an advance reservation service
IWQoS'03 Proceedings of the 11th international conference on Quality of service
A Flexible Schedule Reservation Scheme for Real-Time Service-Oriented Architecture
CEC '10 Proceedings of the 12th IEEE International Conference on Commerce and Enterprise Computing
A Flexible Service Reservation Scheme for Real-Time SOA
ICEBE '11 Proceedings of the 2011 IEEE 8th International Conference on e-Business Engineering
Meeting End-to-End Deadlines through Distributed Local Deadline Assignments
RTSS '11 Proceedings of the 2011 IEEE 32nd Real-Time Systems Symposium
| Hi-index | 0.00 |
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.