{"title":"Improving dependability of service oriented architectures for pervasive computing","authors":"Domenico Cotroneo, C. D. Flora, S. Russo","doi":"10.1109/WORDS.2003.1218068","DOIUrl":"https://doi.org/10.1109/WORDS.2003.1218068","url":null,"abstract":"Service oriented programming - which combines distributed object computing, component-based and Web-based concepts - has recently emerged as a promising approach to develop dynamic and heterogeneous service provision environments. Such systems are referenced in literature as service oriented architectures. Classic strategies to address dependability in distributed object computing middleware may not be straightforwardly applied to service oriented architectures (SOAs) for pervasive computing, since they operate in quite different contexts compared to traditional DOC middleware. In this paper, our focus is on dependability issues of SOAs. In particular, we identify dependability requirements of such systems during their life cycle showing how these requirements may change depending on the time phase (discovery, lookup, setup, delivery). We also explore the suitability of Jini technology as an enabling infrastructure to improve availability and reliability, describing both the benefits and drawbacks of a Jini-based solution in the context of a case study application, namely PRINCEPS.","PeriodicalId":225796,"journal":{"name":"Proceedings of the Eighth International Workshop on Object-Oriented Real-Time Dependable Systems, 2003. (WORDS 2003).","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129402665","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}
{"title":"Towards composable distributed real-time and embedded software","authors":"K. Balasubramanian, Nanbor Wang, D. Schmidt","doi":"10.1109/WORDS.2003.1218087","DOIUrl":"https://doi.org/10.1109/WORDS.2003.1218087","url":null,"abstract":"The complexity of building and validating software is a growing challenge for developers of distributed real-time and embedded (DRE) applications. While DRE applications are increasingly based on commercial off-the-shelf (COTS) hardware and software elements, substantial time and effort are spent integrating these elements into applications. Integration challenges stem largely from a lack of higher level abstractions for composing complex applications. As a result, considerable application-specific \"glue code\" must be rewritten for each successive DRE application. This paper makes three contributions to the study of composing reusable middleware from standard components in DRE applications: it (1) describes the limitations of current approaches in middleware composition, (2) discusses the minimum set of requirements required of reusable middleware components, and (3) presents recurring patterns for software composition as applied to CIAO (Component-Integrated ACE ORB), our open-source component model implementation.","PeriodicalId":225796,"journal":{"name":"Proceedings of the Eighth International Workshop on Object-Oriented Real-Time Dependable Systems, 2003. (WORDS 2003).","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131153077","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}
C. Gill, Venkita Subramonian, J. Parsons, H. Huang, Stephen Torri, D. Niehaus, D. Stuart
{"title":"ORB middleware evolution for networked embedded systems","authors":"C. Gill, Venkita Subramonian, J. Parsons, H. Huang, Stephen Torri, D. Niehaus, D. Stuart","doi":"10.1109/WORDS.2003.1218080","DOIUrl":"https://doi.org/10.1109/WORDS.2003.1218080","url":null,"abstract":"Standards-based COTS (common-off-the-shelf) middleware has been shown to be effective in meeting a range of functional and QoS (quality of service) requirements for distributed real-time and embedded (DRE) systems. Each standard makes limiting assumptions, often implicit, about the fundamental set of system capabilities and constraints typical of the domain to which the standard applies. When the characteristics of a particular class of systems violates a standard's assumptions, it may be appropriate to modify or extent the standard and its conforming implementations to better match the actual characteristics of that class of systems while still exploiting the capabilities of the standard. In this paper, we argue that key assumptions upon which even the more advanced middleware standards are based, e.g., Real-Time CORBA (RT-CORBA), are violated by an important class of DRE systems characterized by the following properties: (1) highly connected networks of (2) numerous memory-constrained endsystems, with (3) stringent timeliness requirements, and (4) support for adaptive reconfiguration of computation and communication elements and their associated timeliness requirements. We describe our recent work on nORB, a small footprint ORB middleware framework for the Boeing Open Experimental Platform (OEP) under the DARPA Nest program, to meet this entire set of requirements by adapting, unifying, and extending patterns and techniques from earlier related research on COTS middleware frameworks, such as UBI-core, ACE, Kokyu, and TAO.","PeriodicalId":225796,"journal":{"name":"Proceedings of the Eighth International Workshop on Object-Oriented Real-Time Dependable Systems, 2003. (WORDS 2003).","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133558347","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}
{"title":"Self*: a data-flow oriented component framework for pervasive dependability","authors":"C. Fetzer, Karin Högstedt","doi":"10.1109/WORDS.2003.1218067","DOIUrl":"https://doi.org/10.1109/WORDS.2003.1218067","url":null,"abstract":"Both the scale and the reach of computer systems and embedded devices have been expanding constantly over the last few decades. As computer systems become pervasive, their criticality increases because they become an even more integral part of the infrastructure upon which our society depends. Hence, pervasive systems are likely to become \"society critical\" and their dependable operation must be ensured. Since the number of computing nodes in a pervasive system will be much greater than in traditional dependable systems, the operating cost per node needs to become much lower. Therefore, more cost effective dependability mechanisms need to be deployed to achieve the desired degree of dependability at a given maximum operating cost. In this paper, we explain the notion of pervasive dependability and outline some of the challenges we face in achieving pervasive dependability. We then describe our component based data-flow oriented middleware that we use as a test bed to investigate how to address these challenges.","PeriodicalId":225796,"journal":{"name":"Proceedings of the Eighth International Workshop on Object-Oriented Real-Time Dependable Systems, 2003. (WORDS 2003).","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130396954","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}
{"title":"Reliable Compare&Swap for fault-tolerant synchronization","authors":"Philippe Raipin Parvédy, M. Raynal","doi":"10.1109/WORDS.2003.1218065","DOIUrl":"https://doi.org/10.1109/WORDS.2003.1218065","url":null,"abstract":"This paper presents two Compare&Swap protocols that, with respect to omission failures, are (1) fault-tolerant and (2) gracefully degrading, respectively. It shows that fault-tolerance and graceful degradation are close but distinct concepts, and that graceful degradation is inherently more costly than fault-tolerance. These Compare&Swap protocols are derived from consensus protocols proposed by Jayanti et al. (1999).","PeriodicalId":225796,"journal":{"name":"Proceedings of the Eighth International Workshop on Object-Oriented Real-Time Dependable Systems, 2003. (WORDS 2003).","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121040183","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}
{"title":"Operating system supports to enhance fault tolerance of real-time systems","authors":"Y. Nakamoto","doi":"10.1109/WORDS.2003.1218060","DOIUrl":"https://doi.org/10.1109/WORDS.2003.1218060","url":null,"abstract":"The virtual memory functions in real-time operating systems have been used in real-time systems. The virtual memory functions of real-time operating systems enhance the fault-tolerance of real-time systems because their memory protection mechanism isolates faulty real-time tasks. Recent RISC processors provide virtual memory support through software-managed translation lookaside buffer (TLB) in software. In real-time systems, managing TLB entries is the most important issue because overhead at TLB miss time greatly affects overall performance of the system. In this paper, we propose several virtual memory management algorithms by comparing overheads at task switching times and TLB miss times.","PeriodicalId":225796,"journal":{"name":"Proceedings of the Eighth International Workshop on Object-Oriented Real-Time Dependable Systems, 2003. (WORDS 2003).","volume":" 18","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113948770","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}
{"title":"The Starfish system: providing intrusion detection and intrusion tolerance for middleware systems","authors":"K. Kihlstrom, P. Narasimhan","doi":"10.1109/WORDS.2003.1218083","DOIUrl":"https://doi.org/10.1109/WORDS.2003.1218083","url":null,"abstract":"We introduce the Starfish system, a new system that provides intrusion detection and intrusion tolerance for middleware applications operating in an asynchronous distributed system. The Starfish system contains a central, highly secure and tightly coupled core. This core is augmented by \"arms\" that are less tightly coupled and that have less stringent security guarantees, each of which can be removed from the core if a significant security breach occurs. New arms can be \"grown\" as needed. The Starfish system employs a number of techniques for providing intrusion detection and intrusion tolerance. The specific challenges that we address are infrastructural support for voting and end-to-end intrusion detection.","PeriodicalId":225796,"journal":{"name":"Proceedings of the Eighth International Workshop on Object-Oriented Real-Time Dependable Systems, 2003. (WORDS 2003).","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115390711","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}
{"title":"A special checkpointing object method based primary-passive TMO replication scheme and middleware support","authors":"K. Kim, Yuqing Li, Jeff Liu","doi":"10.1109/WORDS.2003.1218088","DOIUrl":"https://doi.org/10.1109/WORDS.2003.1218088","url":null,"abstract":"The PPTR (primary passive TMO replication) scheme is a passive real-time object replication scheme, which is based on the TMO (time-triggered message-triggered object) real-time object model. Compared to the active object replication schemes, the passive object replication schemes typically require fewer processor resources, but have longer fault recovery times. This paper describes a relatively simple and somewhat restrictive but still quite broadly applicable version of the PPTR scheme and its implementation into a real-time middleware architecture, ROAFTS. The PPTR scheme is compared against another existing active real-time object replication scheme supported by the ROAFTS middleware architecture.","PeriodicalId":225796,"journal":{"name":"Proceedings of the Eighth International Workshop on Object-Oriented Real-Time Dependable Systems, 2003. (WORDS 2003).","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122088562","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}
{"title":"A tool for automatic flow analysis of C-programs for WCET calculation","authors":"J. Gustafsson, B. Lisper, C. Sandberg, N. Bermudo","doi":"10.1109/WORDS.2003.1218072","DOIUrl":"https://doi.org/10.1109/WORDS.2003.1218072","url":null,"abstract":"Bounding the worst case execution time (WCET) of programs is essential for real-time systems. To be able to do WCET calculations, the iteration bounds for loops and recursion must be known. We describe a prototype tool that calculates these bounds automatically, thereby avoiding the need for manual annotations by the programmer. The analysis is based on an intermediate code representation, which means that compiler optimized code is analyzed. The choice of intermediate code also allows the analysis to support the number of programming languages. C programs are targeted. We also show an example of a program analysis using our method.","PeriodicalId":225796,"journal":{"name":"Proceedings of the Eighth International Workshop on Object-Oriented Real-Time Dependable Systems, 2003. (WORDS 2003).","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122796034","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}
{"title":"Modeling of a real-time distributed network management based on TMN and the TMO model","authors":"Moon-hae Kim, Sun-Hwa Lim, Jung-Guk Kim","doi":"10.1109/WORDS.2003.1218066","DOIUrl":"https://doi.org/10.1109/WORDS.2003.1218066","url":null,"abstract":"Many network events need to be handled in a timely fashion. However, current practices are not sufficient to support timely handling of network events mainly due to the lack of a real-time network management model and facilities. In this paper, we propose a network management system, named a real-time distributed network management (RTDNM), in which the telecommunication management network (TMN) model and the time-triggered message-triggered object (TMO) model are incorporated to support network management facilities and timely handling of network events. In order to realize RTDNM, temporal characteristics of managed objects in a network are modeled and CMIS/CMIP, a network management protocol used in TMN, is annotated whit real-time constraints so that timely handling of network events can be supported. A message scheduling scheme for network management is proposed to guarantee timeliness for critical network events. Finally, we present the design of our RTDNM and show current results with a prototype implementation. The scheme presented turned out to be effective for timely handling of network events.","PeriodicalId":225796,"journal":{"name":"Proceedings of the Eighth International Workshop on Object-Oriented Real-Time Dependable Systems, 2003. (WORDS 2003).","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114890357","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}