{"title":"分布式实时数据库系统仿真模型","authors":"Ö. Ulusoy, G. Belford","doi":"10.1109/SIMSYM.1992.227558","DOIUrl":null,"url":null,"abstract":"Each transaction in a real-time database system is associated with a timing constraint in the form of a deadline. Efficient transaction scheduling algorithms are required to minimize the number of missed transaction deadlines. In this paper, a performance evaluation model is provided to enable distributed real-time database system designers to analyze transaction scheduling algorithms. The model is developed progressing from a simple mathematical analysis to complicated simulations. The paper also provides an example simulation experiment implemented using the model presented.<<ETX>>","PeriodicalId":215380,"journal":{"name":"Proceedings. 25th Annual Simulation Symposium","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"A simulation model for distributed real-time database systems\",\"authors\":\"Ö. Ulusoy, G. Belford\",\"doi\":\"10.1109/SIMSYM.1992.227558\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Each transaction in a real-time database system is associated with a timing constraint in the form of a deadline. Efficient transaction scheduling algorithms are required to minimize the number of missed transaction deadlines. In this paper, a performance evaluation model is provided to enable distributed real-time database system designers to analyze transaction scheduling algorithms. The model is developed progressing from a simple mathematical analysis to complicated simulations. The paper also provides an example simulation experiment implemented using the model presented.<<ETX>>\",\"PeriodicalId\":215380,\"journal\":{\"name\":\"Proceedings. 25th Annual Simulation Symposium\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-04-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 25th Annual Simulation Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIMSYM.1992.227558\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 25th Annual Simulation Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIMSYM.1992.227558","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A simulation model for distributed real-time database systems
Each transaction in a real-time database system is associated with a timing constraint in the form of a deadline. Efficient transaction scheduling algorithms are required to minimize the number of missed transaction deadlines. In this paper, a performance evaluation model is provided to enable distributed real-time database system designers to analyze transaction scheduling algorithms. The model is developed progressing from a simple mathematical analysis to complicated simulations. The paper also provides an example simulation experiment implemented using the model presented.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
