{"title":"CHAOS/sup /:支持实时原子事务","authors":"A. Gheith, K. Schwan","doi":"10.1109/FTCS.1989.105620","DOIUrl":null,"url":null,"abstract":"CHAOS/sup art/ is an object-based, real-time operating system kernel that provides an extended notion of atomic transactions as the basic mechanisms for programming real-time, embedded applications. These transactions are expressed as object invocations with guaranteed timing, consistency, and recovery attributes. The mechanisms implemented by CHAOS/sup art/ kernel provide a predictable, accountable, and efficient basis for programming with real-time transactions. These mechanisms are predictable because they have well-defined upper bounds on their execution times that are (can be) determined before their execution. They are accountable because their decisions are guaranteed to be honored as long as the system is in an application-specific safe state.<<ETX>>","PeriodicalId":230363,"journal":{"name":"[1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"CHAOS/sup art/: support for real-time atomic transactions\",\"authors\":\"A. Gheith, K. Schwan\",\"doi\":\"10.1109/FTCS.1989.105620\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"CHAOS/sup art/ is an object-based, real-time operating system kernel that provides an extended notion of atomic transactions as the basic mechanisms for programming real-time, embedded applications. These transactions are expressed as object invocations with guaranteed timing, consistency, and recovery attributes. The mechanisms implemented by CHAOS/sup art/ kernel provide a predictable, accountable, and efficient basis for programming with real-time transactions. These mechanisms are predictable because they have well-defined upper bounds on their execution times that are (can be) determined before their execution. They are accountable because their decisions are guaranteed to be honored as long as the system is in an application-specific safe state.<<ETX>>\",\"PeriodicalId\":230363,\"journal\":{\"name\":\"[1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers\",\"volume\":\"63 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-06-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FTCS.1989.105620\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FTCS.1989.105620","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
CHAOS/sup art/: support for real-time atomic transactions
CHAOS/sup art/ is an object-based, real-time operating system kernel that provides an extended notion of atomic transactions as the basic mechanisms for programming real-time, embedded applications. These transactions are expressed as object invocations with guaranteed timing, consistency, and recovery attributes. The mechanisms implemented by CHAOS/sup art/ kernel provide a predictable, accountable, and efficient basis for programming with real-time transactions. These mechanisms are predictable because they have well-defined upper bounds on their execution times that are (can be) determined before their execution. They are accountable because their decisions are guaranteed to be honored as long as the system is in an application-specific safe state.<>
![[1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
