tdma总线局域网系统中处理器组成员的最小延迟分散维护

K. Kim, E. Shokri
{"title":"tdma总线局域网系统中处理器组成员的最小延迟分散维护","authors":"K. Kim, E. Shokri","doi":"10.1109/ICDCS.1993.287684","DOIUrl":null,"url":null,"abstract":"Decentralized approaches to processor-group maintenance (GMM) are aimed at facilitating every active node in a real-time LAN system to maintain timely and consistent knowledge about the health status of all cooperating nodes and to recognize newly joining nodes. A practical scheme for this decentralized GMM (DGMM) in TDMA (time division multiple access) bus based real-time LAN systems, called here the periodic reception history broadcast (PRHB) scheme, was initially formulated by H. Kopetz et al. (1989) for application environments where the fault frequency is relatively low such that no more than one node fails in any interval of two TDMA cycle duration. The authors develop a major extension of the scheme, PRHB with multiple fault detection (PRHB/MD), which is applicable to environments where the fault frequency is much higher-to be more specific, where up to a half of the nodes map experience faults within any interval of three TDMA cycle duration. The scheme does not impose any limit on the number of transient faults of links that any one node may experience. The scheme yields the minimal detection delay for all major fault types and the delay does not exceed two TDMA cycles for the worst fault type. This detection delay characteristic is a significant improvement over those of previously developed DGMM schemes.<<ETX>>","PeriodicalId":249060,"journal":{"name":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Minimal-delay decentralized maintenance of processor-group membership in TDMA-bus LAN systems\",\"authors\":\"K. Kim, E. Shokri\",\"doi\":\"10.1109/ICDCS.1993.287684\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Decentralized approaches to processor-group maintenance (GMM) are aimed at facilitating every active node in a real-time LAN system to maintain timely and consistent knowledge about the health status of all cooperating nodes and to recognize newly joining nodes. A practical scheme for this decentralized GMM (DGMM) in TDMA (time division multiple access) bus based real-time LAN systems, called here the periodic reception history broadcast (PRHB) scheme, was initially formulated by H. Kopetz et al. (1989) for application environments where the fault frequency is relatively low such that no more than one node fails in any interval of two TDMA cycle duration. The authors develop a major extension of the scheme, PRHB with multiple fault detection (PRHB/MD), which is applicable to environments where the fault frequency is much higher-to be more specific, where up to a half of the nodes map experience faults within any interval of three TDMA cycle duration. The scheme does not impose any limit on the number of transient faults of links that any one node may experience. The scheme yields the minimal detection delay for all major fault types and the delay does not exceed two TDMA cycles for the worst fault type. This detection delay characteristic is a significant improvement over those of previously developed DGMM schemes.<<ETX>>\",\"PeriodicalId\":249060,\"journal\":{\"name\":\"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-05-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDCS.1993.287684\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993] Proceedings. The 13th International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.1993.287684","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

处理器群维护(GMM)的分散式方法旨在促进实时局域网系统中的每个活动节点对所有合作节点的健康状态保持及时和一致的了解,并识别新加入的节点。在基于TDMA(时分多址)总线的实时局域网系统中,这种分散GMM (DGMM)的一种实用方案,在这里称为周期性接收历史广播(PRHB)方案,最初是由H. Kopetz等人(1989)为故障频率相对较低的应用环境制定的,在两个TDMA周期持续时间的任何间隔内,不超过一个节点故障。作者开发了该方案的主要扩展,PRHB与多故障检测(PRHB/MD),它适用于故障频率高得多的环境-更具体地说,在三个TDMA周期持续时间的任意间隔内,多达一半的节点映射经历故障。该方案不限制任何一个节点可能经历的链路瞬态故障的数量。该方案对所有主要故障类型产生最小的检测延迟,对于最严重的故障类型延迟不超过两个TDMA周期。这种检测延迟特性比以前开发的DGMM方案有了显著的改进
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Minimal-delay decentralized maintenance of processor-group membership in TDMA-bus LAN systems
Decentralized approaches to processor-group maintenance (GMM) are aimed at facilitating every active node in a real-time LAN system to maintain timely and consistent knowledge about the health status of all cooperating nodes and to recognize newly joining nodes. A practical scheme for this decentralized GMM (DGMM) in TDMA (time division multiple access) bus based real-time LAN systems, called here the periodic reception history broadcast (PRHB) scheme, was initially formulated by H. Kopetz et al. (1989) for application environments where the fault frequency is relatively low such that no more than one node fails in any interval of two TDMA cycle duration. The authors develop a major extension of the scheme, PRHB with multiple fault detection (PRHB/MD), which is applicable to environments where the fault frequency is much higher-to be more specific, where up to a half of the nodes map experience faults within any interval of three TDMA cycle duration. The scheme does not impose any limit on the number of transient faults of links that any one node may experience. The scheme yields the minimal detection delay for all major fault types and the delay does not exceed two TDMA cycles for the worst fault type. This detection delay characteristic is a significant improvement over those of previously developed DGMM schemes.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Uniform reliable multicast in a virtually synchronous environment Sharing complex objects in a distributed PEER environment Performance of co-scheduling on a network of workstations Evaluating caching schemes for the X.500 directory Structuring distributed shared memory with the pi architecture
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1