A Flexible Schedule Reservation Scheme for Real-Time Service-Oriented Architecture
This paper studies a flexible scheduling data structure that is used to manage out-of-order service requests in real-time service-oriented architecture (RT-SOA) applications. We propose a hierarchical TBTree (hTBTree) to record server availability across a hierarchy of time intervals with different degrees of time granularity. Realtime services need to. nd enough time interval in hTBTree for their requested executions. The structure of hTBTree is designed to record only the availability of a resource during a time interval rather than the speci.c reserved time-slots for each request. It thus will automatically adjust existing reservations within their service intervals to make room for new reservation requests. Simulations have been conducted to study the acceptance ratio and performance of different tree-based data structures. Results show that by allowing. exibility in reservations, hTBTree can accept more realtime service requests compared with other. xed time-slot reservation scheme such as segment tree and the original TBTree. In this way, it also increases the overall system utilization.
Weiran Nie Mark Panahi Kwei-Jay Lin
Department of Electrical Engineering and Computer Science University of California, Irvine Irvine, CA 92697-2625, USA
国际会议
上海
英文
1-8
2010-11-10（万方平台首次上网日期，不代表论文的发表时间）