面向实时SOA的灵活服务预约方案

S. Zhou, Kwei-Jay Lin
{"title":"面向实时SOA的灵活服务预约方案","authors":"S. Zhou, Kwei-Jay Lin","doi":"10.1109/ICEBE.2011.17","DOIUrl":null,"url":null,"abstract":"This paper addresses the problem of resource reservation for applications built using the real-time service-oriented architecture (RT-SOA) paradigm. Real-time services can choose some time inside of a large interval for execution reservation. This property gives services more chance to be accepted by the schedulability admission control. However, the traditional way of advance reservation on fixed schedules does not take advantage of this flexibility. In this paper, a reorganization algorithm is presented to relocate existing reservations if necessary to accommodate new requests that have a less flexibility. Simulation results show that reorganization can enhance the acceptance ratio of real-time requests in almost all situations. When jobs have flexible real-time requirements, acceptance ratio can be greatly enhanced.","PeriodicalId":231641,"journal":{"name":"2011 IEEE 8th International Conference on e-Business Engineering","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Flexible Service Reservation Scheme for Real-Time SOA\",\"authors\":\"S. Zhou, Kwei-Jay Lin\",\"doi\":\"10.1109/ICEBE.2011.17\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper addresses the problem of resource reservation for applications built using the real-time service-oriented architecture (RT-SOA) paradigm. Real-time services can choose some time inside of a large interval for execution reservation. This property gives services more chance to be accepted by the schedulability admission control. However, the traditional way of advance reservation on fixed schedules does not take advantage of this flexibility. In this paper, a reorganization algorithm is presented to relocate existing reservations if necessary to accommodate new requests that have a less flexibility. Simulation results show that reorganization can enhance the acceptance ratio of real-time requests in almost all situations. When jobs have flexible real-time requirements, acceptance ratio can be greatly enhanced.\",\"PeriodicalId\":231641,\"journal\":{\"name\":\"2011 IEEE 8th International Conference on e-Business Engineering\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE 8th International Conference on e-Business Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICEBE.2011.17\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE 8th International Conference on e-Business Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEBE.2011.17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文讨论了使用实时面向服务架构(RT-SOA)范例构建的应用程序的资源预留问题。实时服务可以在较大的时间间隔内选择一些时间进行执行预留。此属性使服务更有可能被可调度性允许控件接受。然而,传统的固定时间提前预订方式并没有利用这种灵活性。在本文中,提出了一种重组算法,在必要时重新定位现有的预订,以适应灵活性较低的新请求。仿真结果表明,在几乎所有情况下,重组都能提高实时请求的接受率。当作业具有灵活的实时性要求时,可大大提高接受率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Flexible Service Reservation Scheme for Real-Time SOA
This paper addresses the problem of resource reservation for applications built using the real-time service-oriented architecture (RT-SOA) paradigm. Real-time services can choose some time inside of a large interval for execution reservation. This property gives services more chance to be accepted by the schedulability admission control. However, the traditional way of advance reservation on fixed schedules does not take advantage of this flexibility. In this paper, a reorganization algorithm is presented to relocate existing reservations if necessary to accommodate new requests that have a less flexibility. Simulation results show that reorganization can enhance the acceptance ratio of real-time requests in almost all situations. When jobs have flexible real-time requirements, acceptance ratio can be greatly enhanced.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信