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

Workshop on Parallel and Distributed Real-time Systems

作者： J. Rexford J. Dolter Kang Shin Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

Real-time communication typically consists of guaranteed packets that must satisfy their delivery deadlines and best-effort packets that can tolerate occasional deadline misses for improved average latency. This paper presents hardware techniques for supporting the coexistence of these two traffic classes in real-time point-to-point networks. A careful selection of routing and switching techniques, coupled with fine-grain arbitration between traffic classes, can allow network adapters to support the diverse performance requirements of best-effort and guaranteed communication. Cycle-level simulations of SPIDER (Scalable Point-to-point Interface DrivER), a network adapter for point-to-point distributed systems, demonstrate the utility of supporting multiple low-level communication policies for different classes of traffic.< >

关键词： Hardware Communication system control Routing Communication system traffic control Real time systems Communication switching Delay Parallel machines Telecommunication traffic Control systems

来源：评论

学校读者我要写书评

暂无评论

Modeling of externally-induced/common-cause faults in fault-tolerant systems

Modeling of externally-induced/common-cause faults in fault-...

引用

Conference on Digital Avionics Systems (DASC)

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

Modeling fault behaviors such as fault occurrences and active/benign durations is an essential step to the design and evaluation of fault-tolerant controller computers. We use a beta-binomial distribution to model fault occurrences both in the presence and in the absence of environmentally-induced (thus common-cause) faults. A multinomial distribution is used to model fault active durations. The proposed model is validated by testing it against the data generated by a simulation program that mimics a common-cause fault environment. The model is then applied to the determination of an optimal time-redundancy recovery method for EMI-induced failures in an N-modular redundant controller computer, demonstrating its utility and power.< >

关键词： Fault tolerant systems Fault tolerance Nuclear magnetic resonance Electromagnetic interference Real time systems Power system modeling Hardware Redundancy Temperature Electromagnetic radiation

来源：评论

学校读者我要写书评

暂无评论

MDARTS: A real-time database for the control and monitoring of manufacturing systems

MDARTS: A real-time database for the control and monitoring ...

引用

American Control Conference (ACC)

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

In this paper, we describe an object-oriented memory-based real-time database system called MDARTS (Multiprocessor Database Architecture for Real-time Systems). MDARTS is specifically designed to support high-speed real-time applications such as next-generation manufacturing system controllers. MDARTS allows applications to specify their real-time requirements in application code, and during object initialization it attempts to guarantee that these requirements will be met. We have implemented MDARTS on Sun workstations and VME-based multiprocessors and have used our prototype to control an actual manufacturing machine. Our MDARTS prototype can guarantee transaction response times of about 100 microseconds for typical memory-based transactions on VME multiprocessors using 68030 processors.

关键词： Real time systems Control systems Monitoring Manufacturing systems Object oriented databases Prototypes Database systems Sun Workstations Delay

来源：评论

学校读者我要写书评

暂无评论

SPIDER: flexible and efficient communication support for point-to-point distributed systems

SPIDER: flexible and efficient communication support for poi...

引用

International Conference on Distributed computing Systems

作者： J. Dolter S. Daniel A. Mehra J. Rexford Wu-Chang Feng Kang Shin Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

SPIDER is a network adapter that provides scalable communication support for point-to-point distributed systems. The device exports an efficient interface to the host processor, provides transparent support for dependable, time-constrained communication, and handles packet routing and switching. The communication support provided by SPIDER exploits concurrency between the independent data channels feeding the point-to-point network, and offers flexible and transparent hardware mechanisms. SPIDER allows the host to exercise fine-grain control over its operation, enabling the latter to monitor and influence data transmission and reception efficiently. In the current implementation, SPIDER interfaces to the Ironics IV-3207, a VMEbus-based 68040 card and will be controlled by x-kernel, a communication executive allowing the flexible composition of communication protocols.< >

关键词： Distributed computing Application software computer networks Concurrent computing Parallel processing Real time systems Packet switching Communication switching Hardware Communication system control

来源：评论

学校读者我要写书评

暂无评论

Meeting the strict real-time requirements of distributed continuous multimedia applications

Meeting the strict real-time requirements of distributed con...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： W.A. Halang P.A. Laplante A.D. Stoyenko Faculty of Electrical Engineering FernUniversität Hagen Hagen Germany Department of Mathematics and Computer Science Fairleigh Dickinson University Madison NJ USA Real Time Computing Laboratory Department of Computer and Information Sciences New Jersey Institute of Technology Newark NJ USA

In this paper we discuss synchronization techniques-and specifically their implementation at the hardware, operating system and high-level language levels-that can be used to achieve deadline satisfaction. In particular, it is shown that by endowing process control computers with fully parallel input and output mechanisms making use of exact time specifications, synchronization and deadline satisfaction can be achieved at the same time without any jitter. Continuous multimedia applications require accurate synchronization of the clocks in different processors. The available solutions have considerable accuracy or applicability. Local clock synchronization by radio transmitted time information turns out to be the only general purpose and high accuracy technique that is applicable with reasonable effort.< >

关键词： Application software Synchronization Multimedia computing Virtual reality Colored noise Hardware Operating systems TV Clocks Multimedia systems

来源：评论

学校读者我要写书评

暂无评论

ANALYTIC MODELS OF ADAPTIVE LOAD SHARING SCHEMES IN DISTRIBUTED REAL-time SYSTEMS

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1993年第7期4卷 740-761页

作者： SHIN, KG HOU, CJ Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

In a distributed real-time system, nonuniform task arrivals may temporarily overload some nodes while leaving some other nodes idle. As a result, some of the tasks on an overloaded node may miss their deadlines even if the overall system has the capacity to meet the deadlines of all tasks. In a companion paper [1], we proposed, without any modeling analysis, a decentralized, dynamic load sharing (LS) scheme as a solution to this problem. In this paper, we develop analytic queueing models to comparatively evaluate the proposed LS scheme as well as three other schemes: no LS, LS with random selection of a receiver node, and LS with perfect information. The evolution of a node's load state is modeled as a continuous-time semi-Markov process, where cumulative execution time (CET), rather than the commonly-used queue length (QL), is employed to describe the workload of a node. Not only fundamental differences among the different LS schemes are addressed in the analytic models, but also implementation overheads are taken into account Several metrics relevant to real-time performance are derived from these models: in particular, we evaluate the probability of a task missing its deadline, called the probability of dynamic failure. The proposed scheme is compared against other LS schemes using these performance metrics. The validity of analytic models is checked with simulations. Both analytic and simulation results indicate that by using judicious exchange/use of state information and Bayesian decision mechanism, the proposed scheme makes a significant improvement over other existing LS schemes in minimizing the probability of dynamic failure.

关键词： BAYESIAN ANALYSIS CONTINUOUS-time MARKOV CHAINS DEADLINES DISTRIBUTED REAL-time SYSTEMS LOAD SHARING LOCATION AND TRANSFER POLICIES PERFORMANCE EVALUATION RANDOM PROBING AND SELECTION

来源：评论

学校读者我要写书评

暂无评论

A SIMPLE DISTRIBUTED LOOP-FREE ROUTING STRATEGY FOR computer-COMMUNICATION NETWORKS

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1993年第12期4卷 1308-1319页

作者： SHIN, KG CHOU, CC Real-Time Computing Laboratory Computer Science and Engineering Division Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

The loops resulting from either component failures or Load changes in a computer communication network degrade the performance and the adaptability of conventional distributed adaptive routing strategies, such as ARPANET's previous routing strategy (APRS). In this paper, we develop a distributed loop-free routing strategy by adding only one additional piece of information-the total number of minimum-delay paths-to the commonly used routing messages and tables. Most conventional approaches to the looping problem suffer high overheads in time and space because each message must either include the first several nodes of its path or trace the entire path to detect a loop. By contrast, the proposed routing strategy requires only easily obtainable information, yet removes loops completely. It is far more efficient in both time and space than its conventional counterparts, especiallyTable Ifor sparse computer networks. The correctness of the proposed strategy is proved, and several illustrative e?xamples are given. The performance of this strategy is shown to be always better than, or at least as good as, that of APRS and any multiorder routing strategies, where the order of a routing strategy is determined by the amount of routing information carried in each routing message.

关键词： ARPANET computer COMMUNICATION NETWORKS DISTRIBUTED ADAPTIVE ROUTING LOOP-FREE OR FAULT-TOLERANT ROUTING NETWORK DELAY TABLES STRATEGY ROUTING MESSAGES

来源：评论

学校读者我要写书评

暂无评论

MIXED time-CONSTRAINED AND NON-time-CONSTRAINED COMMUNICATIONS IN LOCAL-AREA NETWORKS

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1993年第11期41卷 1668-1676页

作者： SHIN, KG ZHENG, Q Department of Electrical Engineering and Computer Science Real-Time Computing Laboratory University of Michigan Ann Arbor MI USA Mitsubishi Electric Research Laboratories Inc. Cambridge MA USA

It is well known that some time-token medium access protocols for local area networks (LANs) like the IEEE 802.4 token bus and the FDDI token ring can guarantee the medium access delay for time-constrained packets. However, a problem which has been largely overlooked is how these protocols can be made to provide a maximum throughput for nontime-constrained packets while guaranteeing the delay bound of time-constrained packets. We first show how the parameters of the IEEE 802.4 token bus and the FDDI token ring can be set to solve the above problem. Then, we design a new timer mechanism for the timed-token protocols which provides the highest guaranteed throughput of nontime-constrained packets among a set of medium access protocols called the token passing protocol, to which most of the existing non-contention LAN protocols belong. We present numerical examples to compare different protocols, all of which have shown the superiority of the proposed protocol to the others.

关键词： MIXING time Packet token bus Local Area Networks Token ring fiber distributed data interface (FDDI) Media Access Protocol

来源：评论

学校读者我要写书评

暂无评论

Evaluation of load sharing in HARTS while considering message routing and broadcasting 93

Evaluation of load sharing in HARTS while considering messag...

引用

1993 ACM SIGMETRICS Conference on Measurement and Modeling of computer Systems, SIGMETRICS 1993

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

In this paper, we apply the load sharing (LS) mechanism proposed in [1, 2] to HARTS, an experimental distributed realtime system [3] currently being built at the Real-time computing laboratory of the University of Mic... 详细信息

ISBN: (纸本)0897915801

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Incorporation of optimal timeouts into distributed real-time load sharing 26

Incorporation of optimal timeouts into distributed real-time...

引用

26th Hawaii International Conference on System Sciences, HICSS 1993

作者： Hou, C.-J. Shin, K.G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann ArborMI48109-2122 United States

ISBN: (纸本)0818632305

This paper addresses the problem of designing and incorporating a timeout mechanism into load sharing (LS) with state-region change broadcasts in the presence of node failures in a distributed real-time system. Failure of a node is diagnosed by the other nodes through communication timeouts, and the timeout period used to diagnose whether a node is faulty or not depends on the dynamic changes in system load, the task attributes at the node, and the state the node was initially in. We formulate the problem of determining the 'best' timeout period Tiout for node i as a hypothesis testing problem, and maximize the probability of detecting node failures subject to a prespecified probability of falsely diagnosing a healthy node as faulty. The parameters needed for the calculation of Tiout are estimated on-line by node i using the Bayesian technique and are piggybacked in its region-change broadcasts. The broadcast information is then used to determine Tiout. If node n has not heard from node t for T Tiout since its receipt of node i's broadcast, it will consider node i failed. On the other hand, each node n also determines its own timeout period Tnout, and broadcasts its state not only at the time of state-region changes but also when it has remained within a broadcast-threshold interval throughout Tnout. Our simulation results show that the LS algorithm which combines the on-line parameter estimation, the timeout mechanism, and a few extra, timely broadcasts can significantly reduce the probability of missing task deadlines. © 1993 IEEE.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：