Demands are increasing for consolidating multiple OSes on a single multi-core CPU rather than using multiple sets of an OS and a CPU. A VMM enables multiple guest OSes to run concurrently on one CPU while providing separate security domains. We have developed Gandalf a lightweight VMM targeting embedded systems with multi-core CPUs. This paper focuses on the shadow paging mechanism of Gandalf which enables physical memory isolation among guest OSes by separating guest page tables from CPUs, because shadow paging significantly affects VMM overheads and is a key to make a VMM lightweight. We designed and implemented two models of shadow paging, single shadow model and multiple shadow model. The measurement results show that they are realized lightweight.
{"title":"Lightweight Shadow Paging for Efficient Memory Isolation in Gandalf VMM","authors":"Megumi Ito, S. Oikawa","doi":"10.1109/ISORC.2008.60","DOIUrl":"https://doi.org/10.1109/ISORC.2008.60","url":null,"abstract":"Demands are increasing for consolidating multiple OSes on a single multi-core CPU rather than using multiple sets of an OS and a CPU. A VMM enables multiple guest OSes to run concurrently on one CPU while providing separate security domains. We have developed Gandalf a lightweight VMM targeting embedded systems with multi-core CPUs. This paper focuses on the shadow paging mechanism of Gandalf which enables physical memory isolation among guest OSes by separating guest page tables from CPUs, because shadow paging significantly affects VMM overheads and is a key to make a VMM lightweight. We designed and implemented two models of shadow paging, single shadow model and multiple shadow model. The measurement results show that they are realized lightweight.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130854305","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}
Building middleware for distributed applications is a complex task, mixing antagonistic concerns: heterogeneity, performance, reliability, quality of services. Optimization and fine-tuning of middleware for a particular application is even a harder task, usually done manually or through complex design patterns. The advent of "schizophrenic" middleware which separates concerns between distribution model, communication protocols, and their implementation by refining the definition and role of "personalities" brought some elements to solve this problem by enabling full tailoring of the middleware by the developer. In this paper we extend this approach to full automation by generating middleware from an architectural model of the system expressed in a modeling language. This enables precise tuning and configuration of the middleware by generating exactly the required code, prior to runtime. We finally show how this approach fits the requirements of high-integrity or real-time distributed systems.
{"title":"Towards Automatic Middleware Generation","authors":"Bechir Zalila, L. Pautet, J. Hugues","doi":"10.1109/ISORC.2008.27","DOIUrl":"https://doi.org/10.1109/ISORC.2008.27","url":null,"abstract":"Building middleware for distributed applications is a complex task, mixing antagonistic concerns: heterogeneity, performance, reliability, quality of services. Optimization and fine-tuning of middleware for a particular application is even a harder task, usually done manually or through complex design patterns. The advent of \"schizophrenic\" middleware which separates concerns between distribution model, communication protocols, and their implementation by refining the definition and role of \"personalities\" brought some elements to solve this problem by enabling full tailoring of the middleware by the developer. In this paper we extend this approach to full automation by generating middleware from an architectural model of the system expressed in a modeling language. This enables precise tuning and configuration of the middleware by generating exactly the required code, prior to runtime. We finally show how this approach fits the requirements of high-integrity or real-time distributed systems.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130975060","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}
A coordination procedure is proposed for a multi-robot rescue system that performs real-time exploration over disaster areas. Real-time exploration means that every robot exploring the area always has a communication path to human operators standing by a monitor station and that the communication path is configured by ad hoc wireless networking. The proposed system procedure consists of the autonomous classification of robots into search and relay types and behavior algorithms for each class of robot. Search robots explore the areas and relay robots act as relay terminals between search robots and monitor station. The rule of the classification and the behavior algorithm refer to the forwarding table of each robot constructed for ad hoc networking. Computer simulations are executed with the decision-theoretic approach as the exploration strategy of search robots.
{"title":"Coordination of Rescue Robots for Real-Time Exploration Over Disaster Areas","authors":"Hisayoshi Sugiyama, T. Tsujioka, M. Murata","doi":"10.1109/ISORC.2008.38","DOIUrl":"https://doi.org/10.1109/ISORC.2008.38","url":null,"abstract":"A coordination procedure is proposed for a multi-robot rescue system that performs real-time exploration over disaster areas. Real-time exploration means that every robot exploring the area always has a communication path to human operators standing by a monitor station and that the communication path is configured by ad hoc wireless networking. The proposed system procedure consists of the autonomous classification of robots into search and relay types and behavior algorithms for each class of robot. Search robots explore the areas and relay robots act as relay terminals between search robots and monitor station. The rule of the classification and the behavior algorithm refer to the forwarding table of each robot constructed for ad hoc networking. Computer simulations are executed with the decision-theoretic approach as the exploration strategy of search robots.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132686832","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}
Alexander von Renteln, U. Brinkschulte, Michael Weiss
This article represents our concept of an artificial hormone system for realizing a completely decentralized self-organizing task allocation using self-X properties. We present new evaluation results from our latest research: we introduce a tool to easily create test files and even whole test series, and show several test series that illustrate interesting behaviors of hormone interaction with different levels of hormones.
{"title":"Examinating Task Distribution by an Artificial Hormone System Based Middleware","authors":"Alexander von Renteln, U. Brinkschulte, Michael Weiss","doi":"10.1109/ISORC.2008.53","DOIUrl":"https://doi.org/10.1109/ISORC.2008.53","url":null,"abstract":"This article represents our concept of an artificial hormone system for realizing a completely decentralized self-organizing task allocation using self-X properties. We present new evaluation results from our latest research: we introduce a tool to easily create test files and even whole test series, and show several test series that illustrate interesting behaviors of hormone interaction with different levels of hormones.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"192 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131863593","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}
Scaling in hardware integration process results in IC-process geometry reductions, lower operating voltages and increased clock speeds. This paper first surveys the reliability obstacles these developments give rise to and then points out that computing systems can no longer be safely assumed to fail only by crashing. Yet this assumption is at the core of primary-backup replication which the literature presents as the appropriate, and hence the most widely used, strategy for time-critical fault-tolerant applications. The paper then observes that building computing nodes with announced crash failure mode is a promising way forward to deal with the emerging reliability challenges. Work carried out to assure such a failure mode has also been briefly surveyed.
{"title":"Responsive Fault-Tolerant Computing in the Era of Terascale Integration State of Art Report","authors":"P. Ezhilchelvan","doi":"10.1109/ISORC.2008.42","DOIUrl":"https://doi.org/10.1109/ISORC.2008.42","url":null,"abstract":"Scaling in hardware integration process results in IC-process geometry reductions, lower operating voltages and increased clock speeds. This paper first surveys the reliability obstacles these developments give rise to and then points out that computing systems can no longer be safely assumed to fail only by crashing. Yet this assumption is at the core of primary-backup replication which the literature presents as the appropriate, and hence the most widely used, strategy for time-critical fault-tolerant applications. The paper then observes that building computing nodes with announced crash failure mode is a promising way forward to deal with the emerging reliability challenges. Work carried out to assure such a failure mode has also been briefly surveyed.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129297876","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}
M. A. Wehrmeister, E. P. Freitas, C. Pereira, F. Rammig
Model-driven design (MDD) can be perceived in the recent literature as an option to deal with the increasing complexity of the design of distributed embedded real-time systems (DERTS). This paper reports some results of a research project aiming to support a MDD approach, which applies concepts of the aspect-oriented (AO) paradigm in order to improve the treatment of non-functional requirements (NFR) in the design of DERTS. A tool named GenERTiCA, which generates source code from UML diagrams and also weaves aspect adaptations, has been developed to support such MDD/AO approach. This paper presents results regarding the use of GenERTiCA to generate code and implement aspects (from a high-level framework of aspect) for the RT-FemtoJava platform, a RTSJ-based and optimized Java platform for DERTS.
{"title":"GenERTiCA: A Tool for Code Generation and Aspects Weaving","authors":"M. A. Wehrmeister, E. P. Freitas, C. Pereira, F. Rammig","doi":"10.1109/ISORC.2008.67","DOIUrl":"https://doi.org/10.1109/ISORC.2008.67","url":null,"abstract":"Model-driven design (MDD) can be perceived in the recent literature as an option to deal with the increasing complexity of the design of distributed embedded real-time systems (DERTS). This paper reports some results of a research project aiming to support a MDD approach, which applies concepts of the aspect-oriented (AO) paradigm in order to improve the treatment of non-functional requirements (NFR) in the design of DERTS. A tool named GenERTiCA, which generates source code from UML diagrams and also weaves aspect adaptations, has been developed to support such MDD/AO approach. This paper presents results regarding the use of GenERTiCA to generate code and implement aspects (from a high-level framework of aspect) for the RT-FemtoJava platform, a RTSJ-based and optimized Java platform for DERTS.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114698627","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}
Conditional real-time task models, which are generalizations of periodic, sporadic, and multi-frame tasks, represent real world applications more accurately. These models can be classified based on a tradeoff in two dimensions - expressivity and hardness of schedulability analysis. In this work, we introduce a class of conditional task models and derive efficient schedulability analysis techniques for them. These models are more expressive than existing models for which efficient analysis techniques are known. In this work, we also lay the groundwork for schedulability analysis of hierarchical scheduling frameworks with conditional task models. We propose techniques that abstract timing requirements of conditional task models, and support compositional analysis using these abstractions.
{"title":"Compositional Feasibility Analysis of Conditional Real-Time Task Models","authors":"M. Anand, A. Easwaran, S. Fischmeister, Insup Lee","doi":"10.1109/ISORC.2008.47","DOIUrl":"https://doi.org/10.1109/ISORC.2008.47","url":null,"abstract":"Conditional real-time task models, which are generalizations of periodic, sporadic, and multi-frame tasks, represent real world applications more accurately. These models can be classified based on a tradeoff in two dimensions - expressivity and hardness of schedulability analysis. In this work, we introduce a class of conditional task models and derive efficient schedulability analysis techniques for them. These models are more expressive than existing models for which efficient analysis techniques are known. In this work, we also lay the groundwork for schedulability analysis of hierarchical scheduling frameworks with conditional task models. We propose techniques that abstract timing requirements of conditional task models, and support compositional analysis using these abstractions.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114709768","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}
In this paper, a role-based access control (KBAC) model is applied and extended to a multimedia version called multi-role based access control (MRBAC), which can fully support the comprehensive and multilevel security control requirements of the distributed multimedia applications. The object-oriented concept is adopted in MRBAC to perform the hybrid role hierarchy management and security roles and rules administration. In summary, MRBAC can: 1) support the multi-level security protection for multimedia data; 2) provide access control by checking both the time constrains and IP addresses; and 3) decentralize the administration functions to make the access control management more efficient.
{"title":"MRBAC: Hierarchical Role Management and Security Access Control for Distributed Multimedia Systems","authors":"Na Zhao, Min Chen, Shu‐Ching Chen, M. Shyu","doi":"10.1109/ISORC.2008.41","DOIUrl":"https://doi.org/10.1109/ISORC.2008.41","url":null,"abstract":"In this paper, a role-based access control (KBAC) model is applied and extended to a multimedia version called multi-role based access control (MRBAC), which can fully support the comprehensive and multilevel security control requirements of the distributed multimedia applications. The object-oriented concept is adopted in MRBAC to perform the hybrid role hierarchy management and security roles and rules administration. In summary, MRBAC can: 1) support the multi-level security protection for multimedia data; 2) provide access control by checking both the time constrains and IP addresses; and 3) decentralize the administration functions to make the access control management more efficient.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124305973","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}
For cost-effective realization of sizable realtime distributed computing application systems, significant advances in resource allocation are in critical needs. An advanced practical scheme for high-level programming of real-time distributed computing software such as the TMO (Time-triggered Message-triggered Object) scheme introduces the potential for realizing new improved resource allocation approaches. The main reason is because it provides information-rich intuitively appealing timing specifications. However, to properly exploit the potential, a number of issues need to be resolved via extensive research involving both analytical and experimental efforts. A hierarchical resource allocation scheme that becomes enabled by use of the TMO programming model is discussed along with the remaining research issues.
{"title":"A Hierarchical Resource Management Scheme Enabled by the TMO Programming Scheme","authors":"K. Kim, Yuqing Li, K. Rim, E. Shokri","doi":"10.1109/ISORC.2008.86","DOIUrl":"https://doi.org/10.1109/ISORC.2008.86","url":null,"abstract":"For cost-effective realization of sizable realtime distributed computing application systems, significant advances in resource allocation are in critical needs. An advanced practical scheme for high-level programming of real-time distributed computing software such as the TMO (Time-triggered Message-triggered Object) scheme introduces the potential for realizing new improved resource allocation approaches. The main reason is because it provides information-rich intuitively appealing timing specifications. However, to properly exploit the potential, a number of issues need to be resolved via extensive research involving both analytical and experimental efforts. A hierarchical resource allocation scheme that becomes enabled by use of the TMO programming model is discussed along with the remaining research issues.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133774873","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}
In this paper, we describe a XML based profile for modeling the semantics of real time systems. We aim to use Real Time Markup Language (RTML) to provide a comprehensive description of temporal properties for the use in distributed systems communication. RTML is derived from a number of specifications including OMG UML Profile in Schedulability, Performance, and Time. In this paper, we discuss the technique that was used to develop RTML semantic model and the important concepts in RTML.
{"title":"XML Profile for Distributed Real Time Systems","authors":"P. Poon, T. Dillon, E. Chang, Ling Feng","doi":"10.1109/ISORC.2008.62","DOIUrl":"https://doi.org/10.1109/ISORC.2008.62","url":null,"abstract":"In this paper, we describe a XML based profile for modeling the semantics of real time systems. We aim to use Real Time Markup Language (RTML) to provide a comprehensive description of temporal properties for the use in distributed systems communication. RTML is derived from a number of specifications including OMG UML Profile in Schedulability, Performance, and Time. In this paper, we discuss the technique that was used to develop RTML semantic model and the important concepts in RTML.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115118784","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
扫码关注我们
求助内容：
应助结果提醒方式：