Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'05)最新文献

筛选

英文中文

On software platforms, their modeling with UML 2, and platform-independent design 在软件平台上，他们使用UML 2建模，并且进行平台无关的设计

Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'05) Pub Date : 2005-05-18 DOI: 10.1109/ISORC.2005.40

B. Selić

引用次数: 28

Multipath disjoint routing algorithm for ad hoc wireless sensor networks 自组织无线传感器网络的多路径不相交路由算法

Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'05) Pub Date : 2005-05-18 DOI: 10.1109/ISORC.2005.36

Xiuli Ren, Haibin Yu

引用次数: 7

Building responsive TMR-based servers in presence of timing constraints 在存在时间限制的情况下构建响应性的基于tmr的服务器

Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'05) Pub Date : 2002-07-21 DOI: 10.1145/571825.571843

P. Ezhilchelvan, J. Hélary, M. Raynal

{"title":"Building responsive TMR-based servers in presence of timing constraints","authors":"P. Ezhilchelvan, J. Hélary, M. Raynal","doi":"10.1145/571825.571843","DOIUrl":"https://doi.org/10.1145/571825.571843","url":null,"abstract":"This paper is on the construction of a fault-tolerant and responsive server subsystem in an application context where the subsystem is accessed through an asynchronous network by a large number of clients. The server is made fault-tolerant by the triple modular redundancy (TMR) technique: at least two server processes behave correctly, while the third one can behave arbitrarily. An essential requirement for process replication is that the client inputs be delivered to server replicas for processing in an identical order. Moreover, in order to cope with process' memory requirement, a time bound constraint is imposed: no client input can stay in the local memory of server process more than /spl Sigma/ units of time. Based on known technologies, two assumptions are made: (1) the network delivers a given client input to any two server processes within a known bounded time (D), and (2), there is an Ordered Timed Atomic Broadcast protocol built on top of the TMR system with timeliness A. The paper presents two results. The first is a protocol that delivers an ordered stream of client inputs, such that every client input is delivered exactly once to each correct server, thus eliminating redundant verification. It works under the assumption /spl Sigma/>D+/spl Delta/. The second is an impossibility result, namely there can be no ordering protocol when /spl Sigma/<D+/spl Delta/_, where /spl Delta/_ is the minimum timeliness of any reliable broadcast protocol that can be implemented on top of the TMR server (/spl Delta/_ < /spl Delta/).","PeriodicalId":377002,"journal":{"name":"Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'05)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125002637","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}

引用次数: 9

首页上一页