Building responsive TMR-based servers in presence of timing constraints

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":null,"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.0000,"publicationDate":"2002-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/571825.571843","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 9

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/

查看原文本刊更多论文

在存在时间限制的情况下构建响应性的基于tmr的服务器

本文研究的是在一个应用环境中，一个容错和响应的服务器子系统的构建，该子系统通过异步网络被大量客户端访问。服务器通过三模冗余(triple modular redundancy, TMR)技术实现容错:至少两个服务器进程的行为是正确的，而第三个进程的行为可能是任意的。流程复制的一个基本要求是，客户端输入以相同的顺序交付给服务器副本进行处理。此外，为了应对进程的内存需求，施加了时间约束:客户端输入不能在服务器进程的本地内存中停留超过/spl Sigma/单位时间。在已知技术的基础上，做了两个假设:(1)网络在已知的有限时间(D)内将给定的客户端输入传递给任意两个服务器进程;(2)在TMR系统的基础上建立了一个具有时效性a的有序定时原子广播协议。第一种是提供有序客户端输入流的协议，这样每个客户端输入只向每个正确的服务器传递一次，从而消除了冗余验证。它在/spl Sigma/>D+/spl Delta/的假设下工作。第二种是不可能结果，即当/spl Sigma/

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

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

自引率

0.00%

发文量

京公网安备 11010802042870号

Book学术文献互助群
群号：481959085