{"title":"如何在不付费的情况下获得实时事务的序列化性","authors":"M. Graham","doi":"10.1109/REAL.1993.393515","DOIUrl":null,"url":null,"abstract":"A new approach to the problem of achieving serializability for real-time transaction systems is presented. It is shown that certain properties that have been claimed to be characteristic of real-time systems are sufficient in themselves to guarantee that the system will run serializably, without any extra effort having to be taken. These systems can be said to achieve serializability \"for free.\".<<ETX>>","PeriodicalId":198313,"journal":{"name":"1993 Proceedings Real-Time Systems Symposium","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":"{\"title\":\"How to get serializability for real-time transactions without having to pay for it\",\"authors\":\"M. Graham\",\"doi\":\"10.1109/REAL.1993.393515\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new approach to the problem of achieving serializability for real-time transaction systems is presented. It is shown that certain properties that have been claimed to be characteristic of real-time systems are sufficient in themselves to guarantee that the system will run serializably, without any extra effort having to be taken. These systems can be said to achieve serializability \\\"for free.\\\".<<ETX>>\",\"PeriodicalId\":198313,\"journal\":{\"name\":\"1993 Proceedings Real-Time Systems Symposium\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"28\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1993 Proceedings Real-Time Systems Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/REAL.1993.393515\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1993 Proceedings Real-Time Systems Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/REAL.1993.393515","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
How to get serializability for real-time transactions without having to pay for it
A new approach to the problem of achieving serializability for real-time transaction systems is presented. It is shown that certain properties that have been claimed to be characteristic of real-time systems are sufficient in themselves to guarantee that the system will run serializably, without any extra effort having to be taken. These systems can be said to achieve serializability "for free.".<>