Estimating real-time service process response time using server utilizations
SOCA（2010）
摘要
In this paper, we study the algorithms to estimate the response times of service executions during real-time service composition. By using reservation schedules to derive server utilization, we can compute a more realistic response time for each service than its static execution time. Reservation schedules are kept in a system data structure called hierarchical TBTree (hTBTree). Using these response time estimates, integer programming or graph search algorithms can be used to compose a service process which is more likely to meet its end-to-end deadline. We conduct performance study to compare compositions with and without using server utilizations.
更多查看译文
关键词
static execution time,service executions,tree data structures,reservation schedules,integer programming,data structure,end-to-end deadline,search problems,graph search algorithms,real-time service process response time,hierarchical tbtree,service-oriented architecture,graph theory,server utilizations,schedules,service oriented architecture,estimation,real time systems,servers,computational modeling,real time
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要