A flexible schedule reservation scheme for real-time service-oriented architecture

Weiran Nie*, Mark Panahi, Kwei Jay Lin

*此作品的通信作者

研究成果: 圖書/報告稿件的類型會議稿件同行評審

7 引文 斯高帕斯(Scopus)

摘要

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 find 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 specific 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 flexibility in reservations, hTBTree can accept more realtime service requests compared with other fixed time-slot reservation scheme such as segment tree and the original TBTree. In this way, it also increases the overall system utilization.

原文英語
主出版物標題Proceedings - 12th IEEE International Conference on Commerce and Enterprise Computing, CEC 2010
頁面1-8
頁數8
DOIs
出版狀態已出版 - 2010
對外發佈
事件12th IEEE Conference on Commerce and Enterprise Computing, CEC 2010 - Shanghai, 中國
持續時間: 10 11 201012 11 2010

出版系列

名字Proceedings - 12th IEEE International Conference on Commerce and Enterprise Computing, CEC 2010

Conference

Conference12th IEEE Conference on Commerce and Enterprise Computing, CEC 2010
國家/地區中國
城市Shanghai
期間10/11/1012/11/10

指紋

深入研究「A flexible schedule reservation scheme for real-time service-oriented architecture」主題。共同形成了獨特的指紋。

引用此