{"title":"一种在分布式数据库中对软实时事务进行排序的因果阶段协议","authors":"B. Sadeg, L. Amanton, S. Bouzefrane","doi":"10.1109/LCN.2001.990798","DOIUrl":null,"url":null,"abstract":"Real-time database applications are distributed in nature. Incorporating distributed data into a real-time database framework incurs complexity associated with transaction concurrency control and database recovery in a distributed context. This article presents an algorithm that manages soft real-time transactions in a distributed database. It uses a specific causal-ordering protocol to ensure the precedence relationships between transactions. Our algorithm is based on a technique which subdivides transactions into sets. Then the protocol virtually serializes the executions on distributed servers by using causal phase ordering properties. Causal phases are created according to transaction conflicts that may occur between transaction sets. Transactions of the same phase are scheduled according to their criticality and transactions of two successive phases are ensured to commit in a causal partial order This strategy permits us to reduce the execution time, allowing more transactions to meet their deadlines.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A causal-phase protocol to order soft real-time transactions in a distributed database\",\"authors\":\"B. Sadeg, L. Amanton, S. Bouzefrane\",\"doi\":\"10.1109/LCN.2001.990798\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Real-time database applications are distributed in nature. Incorporating distributed data into a real-time database framework incurs complexity associated with transaction concurrency control and database recovery in a distributed context. This article presents an algorithm that manages soft real-time transactions in a distributed database. It uses a specific causal-ordering protocol to ensure the precedence relationships between transactions. Our algorithm is based on a technique which subdivides transactions into sets. Then the protocol virtually serializes the executions on distributed servers by using causal phase ordering properties. Causal phases are created according to transaction conflicts that may occur between transaction sets. Transactions of the same phase are scheduled according to their criticality and transactions of two successive phases are ensured to commit in a causal partial order This strategy permits us to reduce the execution time, allowing more transactions to meet their deadlines.\",\"PeriodicalId\":213526,\"journal\":{\"name\":\"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-11-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.2001.990798\",\"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 LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2001.990798","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A causal-phase protocol to order soft real-time transactions in a distributed database
Real-time database applications are distributed in nature. Incorporating distributed data into a real-time database framework incurs complexity associated with transaction concurrency control and database recovery in a distributed context. This article presents an algorithm that manages soft real-time transactions in a distributed database. It uses a specific causal-ordering protocol to ensure the precedence relationships between transactions. Our algorithm is based on a technique which subdivides transactions into sets. Then the protocol virtually serializes the executions on distributed servers by using causal phase ordering properties. Causal phases are created according to transaction conflicts that may occur between transaction sets. Transactions of the same phase are scheduled according to their criticality and transactions of two successive phases are ensured to commit in a causal partial order This strategy permits us to reduce the execution time, allowing more transactions to meet their deadlines.