{"title":"Dynamic modeling of replicated objects for dependable soft real-time distributed object systems","authors":"V. Kalogeraki, L. Moser, P. Melliar-Smith","doi":"10.1109/WORDS.1999.806561","DOIUrl":null,"url":null,"abstract":"Soft real time distributed object systems that must be dependable typically replicate application objects on different processors within the distributed system. The paper presents an algorithm for determining the degree of replication of each application object, that aims to maximize the system utility while respecting the resource constraints. The system utility captures the relative importance of the individual objects for the application tasks and the relative rewards of executing the application tasks. The algorithm determines an initial replication degree for each application object and adjusts the replication degree dynamically at run time.","PeriodicalId":302179,"journal":{"name":"1999 Proceedings. Fourth International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"83 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1999 Proceedings. Fourth International Workshop on Object-Oriented Real-Time Dependable Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WORDS.1999.806561","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
Abstract
Soft real time distributed object systems that must be dependable typically replicate application objects on different processors within the distributed system. The paper presents an algorithm for determining the degree of replication of each application object, that aims to maximize the system utility while respecting the resource constraints. The system utility captures the relative importance of the individual objects for the application tasks and the relative rewards of executing the application tasks. The algorithm determines an initial replication degree for each application object and adjusts the replication degree dynamically at run time.