发布求助
文献互助 智能选刊 最新文献

Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)最新文献

筛选
英文 中文
The Chameleon infrastructure for adaptive, software implemented fault tolerance 变色龙基础设施的自适应，软件实现容错
Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281) Pub Date : 1998-10-20 DOI: 10.1109/RELDIS.1998.740508
S. Bagchi, K. Whisnant, Z. Kalbarczyk, R. Iyer
{"title":"The Chameleon infrastructure for adaptive, software implemented fault tolerance","authors":"S. Bagchi, K. Whisnant, Z. Kalbarczyk, R. Iyer","doi":"10.1109/RELDIS.1998.740508","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740508","url":null,"abstract":"This paper presents Chameleon, an adaptive software infrastructure for supporting different levels of availability requirements in a heterogeneous networked environment. Chameleon provides dependability through the use of ARMORs-Adaptive, Reconfigurable, and Mobile Objects for Reliability. Three broad classes of ARMORs are defined: Managers, Daemons, and Common ARMORs. Key concepts that support adaptive fault tolerance include the construction of fault tolerance execution strategies from a comprehensive set of ARMORs, the creation of ARMORs from a library of reusable basic building blocks, the dynamic adaptation to changing fault tolerance requirements, and the ability to detect and recover from errors in applications and in ARMORs.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125205446","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}
引用次数: 18
Local area detection of incoming war dial activity 局部区域探测进入战争拨号活动
Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281) Pub Date : 1998-10-20 DOI: 10.1109/RELDIS.1998.740545
E. Amoroso, E. Kogan, Brenda McAnderson, D. Powell, B. Rexroad, S. Schuster, Anthony Stramaglia
{"title":"Local area detection of incoming war dial activity","authors":"E. Amoroso, E. Kogan, Brenda McAnderson, D. Powell, B. Rexroad, S. Schuster, Anthony Stramaglia","doi":"10.1109/RELDIS.1998.740545","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740545","url":null,"abstract":"Two techniques for functional detection of local area incoming war dial are described. One technique employs a dedicated workstation looking for evidence of incoming war dial. We describe our experimental implementation of this technique, including alarm generation to a Cisco NetRanger(R) intrusion detection system. The second technique involves simple parsing of private branch exchange (PBX) call records for characteristic patterns of war dial. Baseline heuristics driving our algorithms are discussed. The non-terminated call detection limitations of this parsing technique for our Lucent Definity G3 PBX are discussed.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116855972","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
High throughput networks for petaflops computing 用于千万亿次计算的高吞吐量网络
Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281) Pub Date : 1998-10-20 DOI: 10.1109/RELDIS.1998.740515
L. Wittie, G. Sazaklis, Yaping Zhou, D. Zinoviev
{"title":"High throughput networks for petaflops computing","authors":"L. Wittie, G. Sazaklis, Yaping Zhou, D. Zinoviev","doi":"10.1109/RELDIS.1998.740515","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740515","url":null,"abstract":"The smallest networks that can connect eight thousand processing elements and memory interfaces in a petaflops cryocomputer contain hundreds of thousands of 2/spl times/2 switching nodes. We have determined circuit costs, maximal throughput and average latency for feasible multistage banyan and multidimensional pruned ring mesh networks. Each can deliver 20000 single-word packets every 30 picoseconds, more than eight million gigabytes per second. Switching delays one-way through each network total 1 to 2 nanoseconds. Banyans have 2/3 the switching delays of the smallest meshes. However, banyan signal propagation delays are larger. The only candidate network needing less than 100 square meters in four connection layers is a pruned mesh of shape 18/spl times/18/spl times/55/spl times/55 with nearly one million nodes. The smallest banyan has one quarter as many nodes, but needs nearly twice the wiring area.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121872904","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
Resource-usage prediction for demand-based network-computing 基于需求的网络计算资源使用预测
Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281) Pub Date : 1998-10-20 DOI: 10.1109/RELDIS.1998.740526
N. Kapadia, C. Brodley, J. Fortes, Mark S. Lundstrom
{"title":"Resource-usage prediction for demand-based network-computing","authors":"N. Kapadia, C. Brodley, J. Fortes, Mark S. Lundstrom","doi":"10.1109/RELDIS.1998.740526","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740526","url":null,"abstract":"This paper reports on an application of artificial intelligence to achieve demand-based scheduling within the context of a network-computing infrastructure. The described AI system uses tool-specific, run-time input to predict the resource-usage characteristics of runs. Instance-based learning with locally weighted polynomial regression is employed because of the need to simultaneously learn multiple polynomial concepts and the fact that knowledge is acquired incrementally in this domain. An innovative use of a two-level knowledge base allows the system to account for short-term variations in compute-server and network performance and exploit temporal and spatial locality of runs. Instance editing allows the approach to be tolerant to noise and computationally feasible for extended use. The learning system was tested on three tools during normal use of the Purdue University Network Computing Hubs. Results indicate that the described instance-based learning technique using locally weighted regression with a locally linear model works well for this domain.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129250329","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}
引用次数: 10
An efficient algorithm for causal message logging 一种有效的因果消息记录算法
Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281) Pub Date : 1998-10-20 DOI: 10.1109/RELDIS.1998.740470
Byoungjoo Lee, T. Park, H. Yeom, Yookun Cho
{"title":"An efficient algorithm for causal message logging","authors":"Byoungjoo Lee, T. Park, H. Yeom, Yookun Cho","doi":"10.1109/RELDIS.1998.740470","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740470","url":null,"abstract":"Causal message logging has many good properties such as nonblocking message logging and no rollback propagation. However, it requires a large amount of information to be piggybacked on each message, which may incur severe performance degradation. This paper presents an efficient causal logging algorithm based on the new message log structure, LogOn, which represents the causal interprocess dependency relation with much smaller overhead compared to the existing algorithms. The proposed algorithm is efficient in the sense that it requires no additional information other than LogOn to be carried in each message, while the other algorithms require extra information other than the message log, to eliminate the duplicates in log entries. Moreover, in those algorithms, as more extra information is added into the message, more duplicates can be detected. However, the proposed algorithm achieves the same degree of efficiency using only the message log carried in each message, without any extra information.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133168660","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}
引用次数: 15
Evolving distributed software engineering environments 不断发展的分布式软件工程环境
Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281) Pub Date : 1998-10-20 DOI: 10.1109/RELDIS.1998.740486
G. S. Cowan, R. Reynolds
{"title":"Evolving distributed software engineering environments","authors":"G. S. Cowan, R. Reynolds","doi":"10.1109/RELDIS.1998.740486","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740486","url":null,"abstract":"For a software engineering environment to be useful for the development process, it must provide a complete set of tools to assist the software development tasks. The tools focus on separate issues of a highly integrated problem and, in general, must be capable of assisting one another in the midst of intelligently pursuing their own goals for improving the software products. These tools must address the truly significant portion of the software-engineering task: evolution of existing software. The requirements of the tool set change as we learn more about the development process; therefore, the tools need the ability to be added, removed, substituted, and modified. More than that, the tools' requirements evolve as the software products that they operate on evolve. We meet these needs by providing the tool set as a distributed community of autonomous learning agents. The SWEEP system is part of the ongoing Software Service Bay project at the Artificial Intelligence Laboratory of Wayne State University that addresses these issues.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131348238","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
Two branch predictor schemes for reduction of misprediction rate in conditions of frequent context switches 两种分支预测器方案用于减少频繁上下文切换条件下的错误预测率
Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281) Pub Date : 1998-10-20 DOI: 10.1109/RELDIS.1998.740523
M. Petrovic, I. Tartalja, V. Milutinovic
{"title":"Two branch predictor schemes for reduction of misprediction rate in conditions of frequent context switches","authors":"M. Petrovic, I. Tartalja, V. Milutinovic","doi":"10.1109/RELDIS.1998.740523","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740523","url":null,"abstract":"Branch misprediction is one of the important causes of performance degradation in superpipelined and superscalar processors. Most of the existing branch predictors, based on the exploiting of branch history, suffer from prediction accuracy decrease caused by frequent context switches. The goal of this research is to reduce misprediction rate (MPR) when the context switches are frequent, and not to increase the MPR when the context switches are relatively rare. We propose two independent, but closely related modifications of global adaptive prediction mechanisms: first, to flush only the branch history register (BHR) at context switch, instead of reinitialization of the whole predictor, and second, to use two separated BHRs, one for user and one for kernel branches, instead of one global history register. We have evaluated the ideas by measurements on real traces from IBS (Instruction Benchmark Set), and have shown that both modifications reduce MPR at negligible hardware cost.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131800802","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
Design and verification of a secure electronic auction protocol 安全电子拍卖协议的设计与验证
Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281) Pub Date : 1998-10-20 DOI: 10.1109/RELDIS.1998.740497
S. Subramanian
{"title":"Design and verification of a secure electronic auction protocol","authors":"S. Subramanian","doi":"10.1109/RELDIS.1998.740497","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740497","url":null,"abstract":"Auctions are an important and common form of commerce today. A difficult aspect of auctions is that the bidder must be present at the site of the auction. This reduces the appeal of auction and restricts the number of people who would otherwise participate in it. An auction over an electronic network is therefore an attractive way of conducting business. The author proposes a protocol for electronic auctions. This protocol ensures: (a) anonymity of the customer, (b) security from passive attacks, active attacks, message corruption, and loss of messages, (c) customer privacy, and (d) atomicity (i.e., under all circumstances, the transaction is either completed or aborted). A logic is developed based on the semantics of BAN-style logic (M. Burrows et al., 1990). Using this logic, the properties of anonymity, security, privacy, and atomicity are proved for the proposed protocol.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134074509","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}
引用次数: 37
Dependability analysis of a cache-based RAID system via fast distributed simulation 基于高速缓存的RAID系统可靠性分析
Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281) Pub Date : 1998-10-20 DOI: 10.1109/RELDIS.1998.740507
Yiqing Huang, Z. Kalbarczyk, R. Iyer
{"title":"Dependability analysis of a cache-based RAID system via fast distributed simulation","authors":"Yiqing Huang, Z. Kalbarczyk, R. Iyer","doi":"10.1109/RELDIS.1998.740507","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740507","url":null,"abstract":"We propose a new speculation-based, distributed simulation method for dependability analysis of complex systems in which a detailed functional simulation of a system component is essential to obtain an accurate overall result. Our target example is a networked cluster with compute nodes and a single I/O node. Accurate system dependability characterization is achieved via a combination of detailed simulation of the I/O subsystem behavior in the presence of faults and more abstract simulation of the compute nodes and the switching network. Dependability measures like error coverage, error detection latency and performance measures such as delivery time in the presence of faults are obtained. The approach is implemented on a network of workstations, and experimental results show significant improvements over a Time Warp simulator for the same model.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130376620","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
A distributed version of the SequenceL language SequenceL语言的分布式版本
Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281) Pub Date : 1998-10-20 DOI: 10.1109/RELDIS.1998.740512
D. Cooke, V. Kreinovich, J. E. Urban
{"title":"A distributed version of the SequenceL language","authors":"D. Cooke, V. Kreinovich, J. E. Urban","doi":"10.1109/RELDIS.1998.740512","DOIUrl":"https://doi.org/10.1109/RELDIS.1998.740512","url":null,"abstract":"This paper introduces a new computational model for SequenceL. The model is extended through the addition of a notion of the VRAM model. The computational model introduced together with the SequenceL language provides for a good expression of distributed behaviour.","PeriodicalId":376253,"journal":{"name":"Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114511765","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信