{"title":"使用多不变数据结构的实时原子事务处理","authors":"I. Yen, Biao Chen, I. Chen","doi":"10.1109/HASE.1999.809491","DOIUrl":null,"url":null,"abstract":"Many multiple server systems are now being used for heavily accessed web services. Performance, availability, and real-time transaction processing are important requirements for many of these applications. In this paper, we apply the multi-invariant data structure (MIDS) concept for real-time transaction processing. We used the MIDS scheme to develop a highly available, reliable, real-time transaction processing algorithm. We show that with very little overhead compared to the two-phase commit protocol, we achieve non-blocking atomic transaction processing. Also, the algorithm is suitable for real-time processing since a task can be preempted at any point of execution without expensive recovery procedure.","PeriodicalId":369187,"journal":{"name":"Proceedings 4th IEEE International Symposium on High-Assurance Systems Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Real-time atomic transaction processing using multi-invariant data structure\",\"authors\":\"I. Yen, Biao Chen, I. Chen\",\"doi\":\"10.1109/HASE.1999.809491\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many multiple server systems are now being used for heavily accessed web services. Performance, availability, and real-time transaction processing are important requirements for many of these applications. In this paper, we apply the multi-invariant data structure (MIDS) concept for real-time transaction processing. We used the MIDS scheme to develop a highly available, reliable, real-time transaction processing algorithm. We show that with very little overhead compared to the two-phase commit protocol, we achieve non-blocking atomic transaction processing. Also, the algorithm is suitable for real-time processing since a task can be preempted at any point of execution without expensive recovery procedure.\",\"PeriodicalId\":369187,\"journal\":{\"name\":\"Proceedings 4th IEEE International Symposium on High-Assurance Systems Engineering\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-11-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 4th IEEE International Symposium on High-Assurance Systems Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HASE.1999.809491\",\"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 4th IEEE International Symposium on High-Assurance Systems Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HASE.1999.809491","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Real-time atomic transaction processing using multi-invariant data structure
Many multiple server systems are now being used for heavily accessed web services. Performance, availability, and real-time transaction processing are important requirements for many of these applications. In this paper, we apply the multi-invariant data structure (MIDS) concept for real-time transaction processing. We used the MIDS scheme to develop a highly available, reliable, real-time transaction processing algorithm. We show that with very little overhead compared to the two-phase commit protocol, we achieve non-blocking atomic transaction processing. Also, the algorithm is suitable for real-time processing since a task can be preempted at any point of execution without expensive recovery procedure.