Pub Date : 2003-10-01DOI: 10.1109/WORDS.2003.1267534
A. Talevski, E. Chang, T. Dillon
Generally software is seen as something that is purchased off-the-shelf. However, this perception is incorrect, as off-the-shelf software represents only 15 percent of all software development. The remaining 85 percent represents specialized software developed for large organizations to help them meet their unique requirements. The competitive nature of such organizations typically results in rapidly evolving software requirements. Component-based software engineering techniques lend themselves favorably to the development of reconfigurable software. However, component integration and reconfiguration complexity issues make component-oriented programs difficult to maintain, expand and widely reuse. In this paper we propose a distributed Meta model driven framework that eases software customization and redirects this task away from the software developer to the software user. Through the use of an application generator tool we realize the concept of ‘model once, generate anywhere’.
{"title":"Meta Model Driven Framework for the Integration and Extension of Application Components","authors":"A. Talevski, E. Chang, T. Dillon","doi":"10.1109/WORDS.2003.1267534","DOIUrl":"https://doi.org/10.1109/WORDS.2003.1267534","url":null,"abstract":"Generally software is seen as something that is purchased off-the-shelf. However, this perception is incorrect, as off-the-shelf software represents only 15 percent of all software development. The remaining 85 percent represents specialized software developed for large organizations to help them meet their unique requirements. The competitive nature of such organizations typically results in rapidly evolving software requirements. Component-based software engineering techniques lend themselves favorably to the development of reconfigurable software. However, component integration and reconfiguration complexity issues make component-oriented programs difficult to maintain, expand and widely reuse. In this paper we propose a distributed Meta model driven framework that eases software customization and redirects this task away from the software developer to the software user. Through the use of an application generator tool we realize the concept of ‘model once, generate anywhere’.","PeriodicalId":350761,"journal":{"name":"2003 The Ninth IEEE International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134007309","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-10-01DOI: 10.1109/WORDS.2003.1267507
S. Cimmino, C. Marchetti, R. Baldoni
In the last two decades the development of Total Order (TO) broadcast and multicast communication over asynchronous distributed systems have been one of the main research issues in dependable distributed computing. As a result, a huge amount of works has been carried out, ranging from service speci.cations to a variety of TO implementations over different communication platforms. Differences among such speci.cations can make very difficult the choice of the right TO primitive, by an application designer, to enable the application to meet its correctness requirements. The aim of this paper is thus to present a clear classification of total order broadcast specifications. In particular, six specifications of total order broadcast primitives proposed in the literature are organized into a hierarchy that allows (i) to classify existing implementations of total order communication primitives, and (ii) to select the right primitive according to the application requirements in order to maximize performance.
{"title":"A Guided Tour on Total Order Specifications","authors":"S. Cimmino, C. Marchetti, R. Baldoni","doi":"10.1109/WORDS.2003.1267507","DOIUrl":"https://doi.org/10.1109/WORDS.2003.1267507","url":null,"abstract":"In the last two decades the development of Total Order (TO) broadcast and multicast communication over asynchronous distributed systems have been one of the main research issues in dependable distributed computing. As a result, a huge amount of works has been carried out, ranging from service speci.cations to a variety of TO implementations over different communication platforms. Differences among such speci.cations can make very difficult the choice of the right TO primitive, by an application designer, to enable the application to meet its correctness requirements. The aim of this paper is thus to present a clear classification of total order broadcast specifications. In particular, six specifications of total order broadcast primitives proposed in the literature are organized into a hierarchy that allows (i) to classify existing implementations of total order communication primitives, and (ii) to select the right primitive according to the application requirements in order to maximize performance.","PeriodicalId":350761,"journal":{"name":"2003 The Ninth IEEE International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129448286","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-10-01DOI: 10.1109/WORDS.2003.1267547
M. D. Cin
The paper presents an UML profile which defines a language for specifying, analysing and documenting dependability mechanisms. It helps to cope with the complexity of fault-tolerant system design by providing specifications of (common) dependability constructs that can be incorporated into models of fault-tolerant real-time systems.
{"title":"Extending UML towards a Useful OO-Language for Modeling Dependability Features","authors":"M. D. Cin","doi":"10.1109/WORDS.2003.1267547","DOIUrl":"https://doi.org/10.1109/WORDS.2003.1267547","url":null,"abstract":"The paper presents an UML profile which defines a language for specifying, analysing and documenting dependability mechanisms. It helps to cope with the complexity of fault-tolerant system design by providing specifications of (common) dependability constructs that can be incorporated into models of fault-tolerant real-time systems.","PeriodicalId":350761,"journal":{"name":"2003 The Ninth IEEE International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116846545","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-10-01DOI: 10.1109/WORDS.2003.1267491
S. Schemmer, E. Nett
Tasks controlling a mobile system’s interactions with its environment must be performed reliably and in real-time. Motion control, for example, directs a system’s motions based on information about the environment. As such information is usually incomplete and inaccurate, we developed a solution in which mobile systems perform a distributed fusion of their sensor data. In this paper, we address the scheduling of the local processing tasks of the fusion. The particular problem of the real-time scheduling of these tasks lies in their unpredictable execution times, which do not allow using worst-case values. TAFT (time-aware fault-tolerant) scheduling allows working with expected-case execution times and still achieves a predictable timing behavior. It aborts task instances that would miss their deadline and ensures a timely exception handling. We exploit application-inherent redundancy to tolerate task abortions. We present measurements showing the dynamic nature of the execution times and the reliability of task execution.
{"title":"Achieving Reliable and Timely Task Execution in Mobile Embedded Applications","authors":"S. Schemmer, E. Nett","doi":"10.1109/WORDS.2003.1267491","DOIUrl":"https://doi.org/10.1109/WORDS.2003.1267491","url":null,"abstract":"Tasks controlling a mobile system’s interactions with its environment must be performed reliably and in real-time. Motion control, for example, directs a system’s motions based on information about the environment. As such information is usually incomplete and inaccurate, we developed a solution in which mobile systems perform a distributed fusion of their sensor data. In this paper, we address the scheduling of the local processing tasks of the fusion. The particular problem of the real-time scheduling of these tasks lies in their unpredictable execution times, which do not allow using worst-case values. TAFT (time-aware fault-tolerant) scheduling allows working with expected-case execution times and still achieves a predictable timing behavior. It aborts task instances that would miss their deadline and ensures a timely exception handling. We exploit application-inherent redundancy to tolerate task abortions. We present measurements showing the dynamic nature of the execution times and the reliability of task execution.","PeriodicalId":350761,"journal":{"name":"2003 The Ninth IEEE International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114930316","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/WORDS.2003.1267483
Brian Randell
I was most honoured, but also somewhat confused, by the invitation to give a banquet speech about the late great Edsger Dijkstra at WORDS 2003. This is because the term "banquet speech" is American, and translating it into the English term "after-dinner speech" is rather misleading. In Britain an "after-dinner speech" is meant to be, above all, humorous, so as to be capable of entertaining, and retaining at least the attention, if not the enthusiasm, of an audience that have just eaten and drunk, to excess in all probability. But the privilege of talking to you about Edsger Dijkstra is not an occasion for humour — or at least only occasional humour, in the very personal portrait I’m going to try and give you of one of computer science’s intellectual giants, one I am honoured to have called a friend. I have another cause for misgivings. What I can say about Dijkstra is bound to seem inadequate to any of you who knew him — and will feel to me to be inadequate for any who didn’t. But with these caveats, let me begin. You have, I believe, all been given a copy of a leaflet [Campbell-Kelly 2002] about Dijkstra — I hope you’ve had a chance to read it. My aim is not to relate all the factual statements it contains, which between them amply testify to the extent and importance of his contributions to computer science, but rather to augment these statements with some mainly personal recollections — and also to encourage all of you to explore for yourself some of his work through his many writings. I should explain the background to this leaflet. It was produced for a British Computer Society meeting last year honouring the memory of Edsger Dijkstra, a meeting at which Tony Hoare and I were the main speakers. I used the invitation to speak at the meeting as an opportunity to tell Ria Dijkstra (Edsger’s widow) and a lot of people who knew Dijkstra well, or at least knew lots about Dijkstra, what a debt I owed to him. I will use here some of the remarks I made on that occasion, but I will include rather more information about Dijkstra’s work and its significance than I did in my brief talk at the BCS meeting.
{"title":"Edsger Dijkstra","authors":"Brian Randell","doi":"10.1109/WORDS.2003.1267483","DOIUrl":"https://doi.org/10.1109/WORDS.2003.1267483","url":null,"abstract":"I was most honoured, but also somewhat confused, by the invitation to give a banquet speech about the late great Edsger Dijkstra at WORDS 2003. This is because the term \"banquet speech\" is American, and translating it into the English term \"after-dinner speech\" is rather misleading. In Britain an \"after-dinner speech\" is meant to be, above all, humorous, so as to be capable of entertaining, and retaining at least the attention, if not the enthusiasm, of an audience that have just eaten and drunk, to excess in all probability. But the privilege of talking to you about Edsger Dijkstra is not an occasion for humour — or at least only occasional humour, in the very personal portrait I’m going to try and give you of one of computer science’s intellectual giants, one I am honoured to have called a friend. I have another cause for misgivings. What I can say about Dijkstra is bound to seem inadequate to any of you who knew him — and will feel to me to be inadequate for any who didn’t. But with these caveats, let me begin. You have, I believe, all been given a copy of a leaflet [Campbell-Kelly 2002] about Dijkstra — I hope you’ve had a chance to read it. My aim is not to relate all the factual statements it contains, which between them amply testify to the extent and importance of his contributions to computer science, but rather to augment these statements with some mainly personal recollections — and also to encourage all of you to explore for yourself some of his work through his many writings. I should explain the background to this leaflet. It was produced for a British Computer Society meeting last year honouring the memory of Edsger Dijkstra, a meeting at which Tony Hoare and I were the main speakers. I used the invitation to speak at the meeting as an opportunity to tell Ria Dijkstra (Edsger’s widow) and a lot of people who knew Dijkstra well, or at least knew lots about Dijkstra, what a debt I owed to him. I will use here some of the remarks I made on that occasion, but I will include rather more information about Dijkstra’s work and its significance than I did in my brief talk at the BCS meeting.","PeriodicalId":350761,"journal":{"name":"2003 The Ninth IEEE International Workshop on Object-Oriented Real-Time Dependable Systems","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116956579","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：