检索结果-内蒙古大学图书馆

PROBING AND FAULT INJECTION OF DEPENDABLE DISTRIBUTED PROTOCOLS

comput.R JOURNAL 1995年第4期38卷 286-300页

作者： DAWSON, S JAHANIAN, F Real-Time Computing Laboratory Electrical Engineering and Computer Science Department University of Michigan Ann Arbor MI 48109-2122 United States

Ensuring that a distributed system with strict dependability constraints meets its prescribed specification is a growing challenge that confronts software developers and system engineers. This paper presents a technique for probing and fault injection of fault-tolerant distributed protocols. The proposed technique, called script-driven probing and fault injection, can be used for studying the behaviour of distributed systems and for detecting design and implementation errors of fault-tolerant protocols. The focus of this work is on fault injection techniques that can be used to demonstrate three aspects of a target protocol: detection of design or implementation errors;identification of violations of protocol specifications;and insight into design decisions made by the implementers. The emphasis of our approach is on experimental techniques intended to identify specific ''problems'' in a protocol or its implementation rather than the evaluation of system dependability through statistical metrics such as fault coverage. To demonstrate the capabilities of this technique, the paper describes a probing and fault injection toot, called the PFI tool (probe/fault injection tool), and a summary of several extensive experiments that studied the behaviour of two protocols: the Transmission Control Protocol (TCP) and a group membership protocol (GMP).

关键词：

来源：评论

学校读者我要写书评

暂无评论

Deterministic fault injection of distributed systems

引用

International Workshop on Theory and Practice in Distributed Systems

作者： Dawson, S Jahanian, F Real-Time Computing Laboratory Electrical Engineering and Computer Science Department University of Michigan Ann Arbor 48109-2122 MI United States

ISBN: (纸本)3540600426

Ensuring that a system meets its prescribed specification is a growing challenge that confronts software developers and system engineers. Meeting this challenge is particularly important for distributed systems with strict dependability and timeliness constraints. This paper presents a technique, called script-driven probing and fault injection, for the evaluation and validation of dependable protocols. The proposed approach can be used to demonstrate three aspects of a target protocol: i) detection of design or implementation errors, ii) identification of violations of protocol specifications, and iii) insight into design decisions made by the implementers. To demonstrate the capabilities of this technique, the paper briefly describes a probing and fault injection tool called the PFI tool, and several experiments on two protocols: the Transmission Control Protocol (TCP) [4, 24] and the Group Membership Protocol (GMP) [19]. The tool can be used to delay, drop, reorder, duplicate, and modify messages. It can also introduce new messages into the system to probe participants. In the case of TCP, we used the PFI tool to duplicate the experiments reported in [7] on several TCP implementations without access to the vendors' TCP source code in a very short time. We also ran several new experiments that are difficult to perform using past approaches based on packet monitoring and filtering. In the case of GMP, we used the tool to test the fault-tolerance capabilities of an implementation under various failure models including daemon/link crash, send/receive omissions, and timing failures. Furthermore, by selective reordering of messages and spontaneous transmission of new messages, we were able to guide a distributed comput.tion into hard to reach global states without instrumenting the protocol implementation.

关键词： Transmission control protocol

来源：评论

学校读者我要写书评

暂无评论

PP-MESS-SIM: A simulator for evaluating multicomput.r interconnection networks 28

PP-MESS-SIM: A simulator for evaluating multicomputer interc...

引用

28th Annual Simulation Symposium, ANSS 1995

作者： Rexford, Jennifer Dolter, James Feng, Wu-chang Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann ArborMI48109-2122 United States

ISBN: (纸本)0818670916

This paper presents pp-mess-sim, an object-oriented discrete-event simulation environment for evaluating multicomput.r networks. The simulator provides a toolboz of various network topologies, communication workloads, routing-switching algorithms, and router models. These router models can vary from high-level architectures to low-level specification of actual devices. By decoupling individual parts of the code, pp-mess-sim enables independent code development and creates a flexible and extensible environment for evaluating different aspects of network design. Sample simulation experiments capitalize on this flezibility to compare routing-switching schemes under various application workloads. © 1995 IEEE

关键词： Discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

QoS-Sensitive protocol processing in shared-memory multiprocessor multimedia servers 3

QoS-Sensitive protocol processing in shared-memory multiproc...

引用

3rd IEEE Workshop on the Architecture and Implementation of High Performance Communication Subsystems, HPCS 1995

作者： Mehra, A. Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann ArborMI48109-2122 United States

来源：评论

学校读者我要写书评

暂无评论

Non-preemptive scheduling of messages on controller area network for real-time control applications

Non-preemptive scheduling of messages on controller area net...

引用

1995 real-time Technology and Applications Symposium, RTAS 1995

作者： Zuberi, Khawar M. Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI 48109-2122 United States

Scheduling messages on the controller area network (CAN) corresponds to assigning identifiers (IDs) to messages according to their priorities. If fixed priority scheduling such as deadline monotonic (DM) is used to calculate these priorities, then in general, it will result in low schedulability. Dynamic scheduling schemes such as earliest deadline (ED) can give greater schedulability, but they are not practical for CAN because if the ID is to reflect message deadlines then a long ID must be used. This increases the length of each message to the point that ED is no better than DM. Our solution to this problem is the mixed traffic scheduler (MTS), which is a cross between ED and DM, and provides high schedulability without needing long IDs. Through simulations, we compare the performance of MTS with that of DM and ED* (an imaginary scheduler which works like ED, except it needs only short IDs). We use a realistic workload in our simulations based on messages typically found in comput.r integrated manufacturing. Our simulations show that MTS performs much better than DM and at the same level as ED, except under high loads and tight deadlines, when ED* is superior. © 1995 IEEE.

关键词： real time control

来源：评论

学校读者我要写书评

暂无评论

On slot allocation for time-constrained messages in DQDB networks

On slot allocation for time-constrained messages in DQDB net...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE comput.r and Communications Societies

作者： Ching-Chih Han Chao-Ju Hou K.G. Shin Real-Time Computing Laboratory Department of Electrical Engineering and Comput. Science University of Michigan Ann Arbor MI USA Computer Engineering Division Department of Electrical and Comput. Engineering University of Wisconsin Madison Madison WI USA

The paper addresses the issue of guaranteeing the timely delivery of isochronous messages with hard deadlines in a distributed queue dual bus (DQDB) network. The authors propose a slot allocation scheme which can allocate bandwidth for a set of isochronous message streams and provide deterministic deadline guarantees. The allocation scheme is guaranteed to find a feasible slot allocation (in the sense that all messages can be transmitted in a timely manner) as long as the total message density is less than or equal to a certain threshold, where the total message density is defined as the summation (over all message streams) of the ratio of maximum message size to message deadline. The implementation of this scheme is simple and does not require any change of the current DQDB standard.

关键词： Intelligent networks Traffic control Bandwidth Videoconference Access protocols Media Access Protocol Communication system traffic control Chaotic communication Laboratories Communication standards

来源：评论

学校读者我要写书评

暂无评论

On non-existence of optimal local synchronous bandwidth allocation schemes for the timed-token MAC protocol

On non-existence of optimal local synchronous bandwidth allo...

引用

International Phoenix Conference on comput.rs and Communications (IPCCC)

作者： Ching-Chih Han K.G. Shin Chao-Ju Hou Department of Elec. Engineering and Comput. Science Real-Time Computing Laboratory University슠of슠Michigan Ann Arbor MI USA Computer Engineering Division Department of Elec. and Comput. Engineering University of Wisconsin Madison WI USA

Numerous methods have been proposed to integrate real-time and non-real-time services of the timed-token medium access control (MAC) protocol. One of the key issues in tailoring the timed-token protocol for real-time applications is the synchronous bandwidth allocation (SBA) problem whose objective is to meet both the protocol and deadline constraints. Several non-optimal local SBA schemes and two optimal global schemes have been proposed. Local SBA schemes use only information available locally to each node, and are thus preferred to global schemes because of their lower network-management overhead. However, we formally prove, using the technique of adversary argument, that there does not exist any optimal local SBA scheme. During the preparation for this proof, we also derive a timing property that generalizes the previous findings about the cycle-time properties of the timed-token protocol.< >

关键词： Channel allocation Access protocols Media Access Protocol Timing Bandwidth Laboratories real time systems Multimedia systems Production facilities Communication industry

来源：评论

学校读者我要写书评

暂无评论

A distributed table-driven route selection scheme for establishing real-time video channels

A distributed table-driven route selection scheme for establ...

引用

International Conference on Distributed computing Systems

作者： Chih-Che Chou K.G. Shin Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

To guarantee the delivery of real-time messages before their deadline, a real-time connection or channel must be established before the transmission of any real-time messages. During this channel-establishment phase, one must first select a route between the source and destination of this channel and then reserve sufficient resources along this route so that the worst-case end-to-end delay over the selected route may not exceed the user-specified delay bound. We propose a table-driven distributed route-selection scheme that is guaranteed to find a "qualified" route, if any, that meets the performance requirement of the requested channel without compromising any of the existing guarantees. The proposed scheme uses the Bellman-Ford shortest path algorithm to build real-time delay tables, and hence, can solve the route-selection problem by a simple table look-up. Several examples are presented to demonstrate the effectiveness of the proposed distributed route-selection scheme.

关键词： Delay

来源：评论

学校读者我要写书评

暂无评论

Mapping concurrently-communicating modules onto mesh multicomput.rs equipped with virtual channels

Mapping concurrently-communicating modules onto mesh multico...

引用

International Conference on Distributed computing Systems

作者： Bing-Rung Tsai K.G. Shin Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

It is difficult to define and evaluate a meaningful performance metric when many packets are generated and exchanged concurrently in mesh-connected multicomput.rs equipped with wormhole switching and virtual channels. Thus, an approximate metric/cost function must be chosen so that when, task modules are mapped by optimizing this function, the actual performance of the mapping is also optimized. Several low-complexity cost functions are evaluated using the simulated annealing optimization process. The mappings found by optimizing these cost functions are then fed into a flit-level simulator to evaluate their actual performance. One particular cost function is found to be very effective.

关键词： Cost function Measurement Packet switching Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Localized multicast routing

Localized multicast routing

引用

IEEE Conference and Exhibition on Global Telecommunications (GLOBECOM)

作者： A. Shaikh S. Lu K. Shin Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

Multicast is a fundamental issue in distributed computing and networking, especially for applications such as audio and video transmission. The minimal cost route selection problem for multicasting is an NP-complete problem even for regular network topologies such as meshes and hypercubes. We therefore present a simple heuristic algorithm for multicast route selection in arbitrarily-connected point-to-point communication networks. Several other heuristics have been presented for finding the minimal multicast route, but most of them are global in the sense that the source uses global cost information to construct a multicast tree. Our algorithm does not require the use of global cost information; it uses cost information only from neighboring nodes as it proceeds which makes it more practical from an implementation paint of view. The performance of the algorithm is analyzed through empirical comparisons and is shown to perform as well against algorithms which use global information.

关键词： Routing Costs Multicast algorithms Distributed computing NP-complete problem Network topology Hypercubes Heuristic algorithms Communication networks Paints

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：