2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops最新文献

On the Requirements for Quality Composability Modeling and Analysis 论质量可组合性建模与分析的要求

2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops Pub Date : 2010-05-04 DOI: 10.1109/ISORCW.2010.27

Javier Fernández Briones, M. Miguel, Juan Pedro Silva, A. Alonso

{"title":"On the Requirements for Quality Composability Modeling and Analysis","authors":"Javier Fernández Briones, M. Miguel, Juan Pedro Silva, A. Alonso","doi":"10.1109/ISORCW.2010.27","DOIUrl":"https://doi.org/10.1109/ISORCW.2010.27","url":null,"abstract":"Real-time, embedded and safety-critical systems have to meet some quality criteria in order to provide certain reliance on its operation. The quality of a system depends on the complex composition of the quality of its subsystems. Quality composability depends on matchmaking the provided and required quality specifications. To allow for flexibility during the system design, we study composability as a configuration problem. We allow options of quality specifications to represent design choices, deployment choices, operation modes or component adaptability. This kind of assessments of system architectures is very important e.g., for COTS development. The contributions of this paper are: to study the modeling requirements to model composability analysis, to compare two modeling approaches, and to show how a model-driven environment can leverage composability assessments. The two modeling approaches, QoS-FT + OCL and MARTE + VSL, are used to attach quality specifications to system models. However, our ultimate goal is to evaluate these specifications, and we have implemented tool-support to evaluate composability using constraint satisfaction techniques.","PeriodicalId":174806,"journal":{"name":"2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114816145","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}

引用次数: 5

Towards a Model-Based Refinement Process for Contractual State Machines 契约状态机的基于模型的细化过程

2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops Pub Date : 2010-05-04 DOI: 10.1109/ISORCW.2010.25

L. Harbird, A. Galloway, R. Paige

引用次数: 5

Locality-Aware Extension of pi-Calculus to Model Self-Organizing Behavior in Massively Distributed Embedded Systems 大规模分布式嵌入式系统自组织行为的pi-微积分的位置感知扩展

2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops Pub Date : 2010-05-04 DOI: 10.1109/ISORCW.2010.16

D. Orfanus, P. Janacik, F. Wagner

{"title":"Locality-Aware Extension of pi-Calculus to Model Self-Organizing Behavior in Massively Distributed Embedded Systems","authors":"D. Orfanus, P. Janacik, F. Wagner","doi":"10.1109/ISORCW.2010.16","DOIUrl":"https://doi.org/10.1109/ISORCW.2010.16","url":null,"abstract":"Massively Distributed Embedded Systems (MDES) such as Wireless Sensor Networks (WSN) are gaining increasing attention, since they enable a broad range of novel applications starting from monitoring oceans to exploring distant planets. WSNs consist of hundreds of nodes that have typically very limited recourses (computational, memory, energy, etc.) and are deployed in a dynamic environment, where they have to continuously adapt to new conditions. Due to the small-size requirement of the nodes, they are highly resource-constrained. Because of that, the amount of functionality that may be present in each node is limited. Therefore, cooperation between nodes is needed in order to accomplish complex tasks. These facts turn the design of applications for WSNs into a challenge. A promising approach how to deal with it is to use the emergent self-organization metaphor. In this paper a new process algebra (PA) called ``Locality-aware extension of $pi$-Calculus'' is presented. The algebra is one of several techniques included in a new design methodology for the design of self-organizing behavior in MDES. The method is based on $pi$-Calculus and allows a high-level description of interactions among processes. As the most important characteristic of self-organization is the restriction of interactions to neighboring elements (localized interactions), we extend the $pi$-Calculus with emph{locality awareness}, a necessary abstraction to allow the modeling of self-organization in MDES. To get full locality awareness in $pi$-Calculus, we extended it with concepts for modeling spatiality, probability and time. Moreover, new types of channels are included to cover various types of communication such as distribution, broadcast and aggregation. In order to validate this new PA, we successfully model a self-organizing clustering algorithm for WSNs.","PeriodicalId":174806,"journal":{"name":"2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132800426","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}

引用次数: 0

Optimisation of Energy Consumption of Soft Real-Time Applications by Workload Prediction 基于工作负载预测的软实时应用能耗优化

2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops Pub Date : 2010-05-04 DOI: 10.1109/ISORCW.2010.15

Florian Kluge, S. Uhrig, Jörg Mische, B. Satzger, T. Ungerer

引用次数: 7

Designing a Graphical Domain-Specific Modelling Language Targeting a Filter-Based Data Analysis Framework 面向基于过滤器的数据分析框架的图形化领域特定建模语言设计

2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops Pub Date : 2010-05-04 DOI: 10.1109/ISORCW.2010.33

C. Köllner, Georg Dummer, A. Rentschler, K. Müller-Glaser

{"title":"Designing a Graphical Domain-Specific Modelling Language Targeting a Filter-Based Data Analysis Framework","authors":"C. Köllner, Georg Dummer, A. Rentschler, K. Müller-Glaser","doi":"10.1109/ISORCW.2010.33","DOIUrl":"https://doi.org/10.1109/ISORCW.2010.33","url":null,"abstract":"We demonstrate the application of a Model-Driven Software Development (MDSD) methodology using the example of an analysis framework designed for a data logging device in the field of vehicle testing. This mobile device is capable of recording the data traffic of automotive-specific bus systems like Controller Area Network (CAN), Local Interconnect Network (LIN), FlexRay and Media Orientied Systems Transport (MOST) in real-time. In order to accelerate the subsequent analysis of the tremendous amount of data, it is advisable to pre-filter the recorded log data on device, during the test-drive. To enable the test engineer of creating data analyses we built a component-based library on top of the languages System{C}/C++. Problematic with this approach is that still substantial programming knowledge is required for implementing filter algorithms, which is usually not the domain of a vehicle test engineer. In a next step we developed a graphical modelling language on top of our library and a graphical editor. The editor is able of verifying a model as well as of generating source code which eliminates the need of manually implementing a filter algorithm. In our contribution we show the design of the graphical language and the editor using the Eclipse platform and the Graphical Modelling Framework (GMF). We describe the automatic extraction of meta-information, such as available components, their interfaces and categorization annotations by parsing the library's C++ implementation with the help of Xtext. The editor will use that information to build a dedicated tool palette providing components that the designer can instantiate and interconnect using drag-and-drop.","PeriodicalId":174806,"journal":{"name":"2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121034880","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}

引用次数: 3

Structuring of an Adaptive Multi-channel Audio-Play System Based on the TMO Scheme 基于TMO方案的自适应多声道音频播放系统的构建

2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops Pub Date : 2010-05-04 DOI: 10.1109/ISORCW.2010.35

K. H. Kim, Tianran Zhou, Kyu-Sik Park, Seok-Pil Lee, Tae-Beom Lim, Kyoungro Yoon, Doohyun Kim

{"title":"Structuring of an Adaptive Multi-channel Audio-Play System Based on the TMO Scheme","authors":"K. H. Kim, Tianran Zhou, Kyu-Sik Park, Seok-Pil Lee, Tae-Beom Lim, Kyoungro Yoon, Doohyun Kim","doi":"10.1109/ISORCW.2010.35","DOIUrl":"https://doi.org/10.1109/ISORCW.2010.35","url":null,"abstract":"This paper presents a modular and easily analyzable design of a flexible sound rendering system called the Adaptive Multi-channel Audio-play System (AMAS). This case-study is a follow-on of the earlier study on the effectiveness of the TMO scheme as an approach for easily analyzable efficient design of a major class of real-time distributed multimedia computing applications. AMAS is an extension of the earlier developed distributed sound system. In AMAS a set of player nodes which are single-board computers equipped with speakers and micro-phones are connected via Ethernet to a controller node equipped with audio file storage and user interfaces. Multi-channel music is played in manners adaptive to the locations of the speakers and the listener. In addition, AMAS possesses the mechanisms for creating the effects of specified sound-generator objects (SGOs), e.g., musical instruments, positioned differently from the positioning that existed at the time of original recording. The TMO-based design and implementation approaches effective for realization of high-quality AMAS are presented. Some experimental evaluation results are also presented.","PeriodicalId":174806,"journal":{"name":"2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122638955","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}

引用次数: 0

Advanced Protected Services - A Concept Paper on Survivable Service-Oriented Systems 高级受保护服务——可生存的面向服务系统的概念论文

2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops Pub Date : 2010-05-04 DOI: 10.1109/ISORCW.2010.20

P. Pal, M. Atighetchi, J. Loyall, A. Gronosky, C. Payne, R. Hillman

引用次数: 5

A Self-Organizing Distributed Reinforcement Learning Algorithm to Achieve Fair Bandwidth Allocation for Priority-Based Bus Communication 基于优先级的总线通信中实现带宽公平分配的自组织分布式强化学习算法

2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops Pub Date : 2010-05-04 DOI: 10.1109/ISORCW.2010.18

Tobias Ziermann, Nina Mühleis, S. Wildermann, J. Teich

{"title":"A Self-Organizing Distributed Reinforcement Learning Algorithm to Achieve Fair Bandwidth Allocation for Priority-Based Bus Communication","authors":"Tobias Ziermann, Nina Mühleis, S. Wildermann, J. Teich","doi":"10.1109/ISORCW.2010.18","DOIUrl":"https://doi.org/10.1109/ISORCW.2010.18","url":null,"abstract":"Due to the raising complexity in distributed embedded systems, a single designer will not be able to plan and organize the communication for such systems. Therefore, it will get more and more important to relieve the designer in that task. Our idea is a communication system that is capable to organize itself to satisfy predefined properties. In this paper, we want to solve the problem of establishing fair bandwidth sharing on priority-based buses by using simple local rules on the distributed system to avoid a single point of failure and cope with online system changes. Based on a game theoretical analysis, a multi-agent reinforcement learning algorithm is proposed that establishes fair bandwidth distribution. The main idea is to penalize nodes that claim too much bandwidth by the other nodes. We experimentally evaluated the algorithm with different parameter settings. The algorithm showed to converge to a fair solution in any experiment. This means the system is able to completely self-organize without global information for our assumptions. In addition, we could figure out that we can configure a trade-off between convergence speed and computation effort. We hope this is a small first step towards totally self-organizing real-time systems.","PeriodicalId":174806,"journal":{"name":"2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133221223","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}

引用次数: 3

Managing Variable and Cooperative Time Behavior 管理可变和合作时间行为

2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops Pub Date : 2010-05-04 DOI: 10.1109/ISORCW.2010.12

K. Bellman, C. Landauer, Phyllis R. Nelson

{"title":"Managing Variable and Cooperative Time Behavior","authors":"K. Bellman, C. Landauer, Phyllis R. Nelson","doi":"10.1109/ISORCW.2010.12","DOIUrl":"https://doi.org/10.1109/ISORCW.2010.12","url":null,"abstract":"This paper is about the requirements and architectural considerations that provide a SORT system with processes for observing, modeling, simulating, predicting, deciding, and acting in an external environment. For our purposes, ``real time'' (RT) means coordinated with an external source of time or with sequences of events over which the system has no direct control. It is this unpredictability in the timing of responses that is the hardest constraint on a real-time system design, especially when it is known a priori that the system cannot keep up with all important events, and that ``as fast as possible'' is not appropriate for some external interactions. We will describe a testbed that we are developing as a student team project at California State Polytechnic University, Pomona (Cal Poly Pomona) to experiment with SORT strategies, and a set of games that we will use to benchmark performance. Then we will describe some useful technical background from several areas: reasoning and representation processes, situation theory, levels of meaningfulness in knowledge, and activity loops. Finally, we show how these concepts apply to SORT agent knowledge and coordination. Our contribution here is to outline a set of problems (in the form of cooperative games) that we hope others in the community will adopt as one method for benchmarking models, methods, strategies, and other processes used in SORT systems.","PeriodicalId":174806,"journal":{"name":"2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129330037","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}

引用次数: 25

Fault Tolerant Scheduling on Controller Area Network (CAN) 控制器局域网(CAN)容错调度

2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops Pub Date : 2010-05-04 DOI: 10.1109/ISORCW.2010.32

Hüseyin Aysan, R. Dobrin, S. Punnekkat

{"title":"Fault Tolerant Scheduling on Controller Area Network (CAN)","authors":"Hüseyin Aysan, R. Dobrin, S. Punnekkat","doi":"10.1109/ISORCW.2010.32","DOIUrl":"https://doi.org/10.1109/ISORCW.2010.32","url":null,"abstract":"Dependable communications is becoming a critical factor due to the pervasive usage of networked embedded systems that increasingly interact with human lives in one way or the other in many real-time applications. Though many smaller systems are providing dependable services employing uniprocesssor solutions, stringent fault containment strategies etc., these practices are fast becoming inadequate due to the prominence of COTS in hardware and component based development (CBD) in software as well as the increased focus on building 'system of systems'. Hence the repertoire of design paradigms, methods and tools available to the developers of distributed real-time systems needs to be enhanced in multiple directions and dimensions. In future scenarios, potentially a network needs to cater to messages of multiple criticality levels (and hence varied redundancy requirements) and scheduling them in a fault-tolerant manner becomes an important research issue. We address this problem in the context of Controller Area Network (CAN), which is widely used in automotive and automation domains, and describe a methodology which enables the provision of appropriate scheduling guarantees. The proposed approach involves definition of fault-tolerant windows of execution for critical messages and the derivation of message priorities based on earliest deadline first (EDF).","PeriodicalId":174806,"journal":{"name":"2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126054871","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}

引用次数: 26