{"title":"分布式实时事务的仿真","authors":"P. V. D. van der Stok, P. Thijssen","doi":"10.1109/WPDRTS.1994.365646","DOIUrl":null,"url":null,"abstract":"Distributed nested objects are considered as the building blocks for distributed real-time systems. Objects are stored in memory. Objects can be related in two ways: (1) syntactically: they have a common object from which they are invoked and (2) time-wise: the actions on the objects always occur at the same moments. The consistency of a set of related objects is assured with concurrency control algorithms originating from database systems. Three types of algorithms are considered: optimistic concurrency control, time stamp ordering and two phase locking. The performance of these three algorithms are compared.<<ETX>>","PeriodicalId":275053,"journal":{"name":"Second Workshop on Parallel and Distributed Real-Time Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Simulation of distributed real-time transactions\",\"authors\":\"P. V. D. van der Stok, P. Thijssen\",\"doi\":\"10.1109/WPDRTS.1994.365646\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Distributed nested objects are considered as the building blocks for distributed real-time systems. Objects are stored in memory. Objects can be related in two ways: (1) syntactically: they have a common object from which they are invoked and (2) time-wise: the actions on the objects always occur at the same moments. The consistency of a set of related objects is assured with concurrency control algorithms originating from database systems. Three types of algorithms are considered: optimistic concurrency control, time stamp ordering and two phase locking. The performance of these three algorithms are compared.<<ETX>>\",\"PeriodicalId\":275053,\"journal\":{\"name\":\"Second Workshop on Parallel and Distributed Real-Time Systems\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-04-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Second Workshop on Parallel and Distributed Real-Time Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WPDRTS.1994.365646\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Second Workshop on Parallel and Distributed Real-Time Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WPDRTS.1994.365646","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Distributed nested objects are considered as the building blocks for distributed real-time systems. Objects are stored in memory. Objects can be related in two ways: (1) syntactically: they have a common object from which they are invoked and (2) time-wise: the actions on the objects always occur at the same moments. The consistency of a set of related objects is assured with concurrency control algorithms originating from database systems. Three types of algorithms are considered: optimistic concurrency control, time stamp ordering and two phase locking. The performance of these three algorithms are compared.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
