{"title":"The design and implementation of a real-time data dispatching system","authors":"N. Perng, N. Tsai, Jen-Wei Hsieh, Tei-Wei Kuo","doi":"10.1109/ISORC.2003.1199264","DOIUrl":null,"url":null,"abstract":"This paper describes the design of a real-time data dispatching system (RTDDS), which is motivated by the needs of a performance guarantee on real-time data services by front-end clients. RTDDS consists of homogeneous machines with a quality of service performance guarantee. We address the resource allocation problems and consider Bin-Packing algorithms to assign requests to machines of RTDDS. Processes scheduling over each machine is done autonomously by SRP-based algorithms. The goal is to maximize the number of concurrent clients and to meet the individual quality of service requirements of clients at the same time.","PeriodicalId":204411,"journal":{"name":"Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing, 2003.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing, 2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISORC.2003.1199264","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This paper describes the design of a real-time data dispatching system (RTDDS), which is motivated by the needs of a performance guarantee on real-time data services by front-end clients. RTDDS consists of homogeneous machines with a quality of service performance guarantee. We address the resource allocation problems and consider Bin-Packing algorithms to assign requests to machines of RTDDS. Processes scheduling over each machine is done autonomously by SRP-based algorithms. The goal is to maximize the number of concurrent clients and to meet the individual quality of service requirements of clients at the same time.