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

3rd Conference on Hypercube Concurrent computers and Applications, C3P 1988

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

ISBN: (纸本)0897912780

This paper describes an embedding of Triple Modular redundancy (TMR) into a binary hypercube. The goal is to improve fault tolerance by masking any single-point faults. Each module of an application task is triplicated and executed in parallel on three nodes of a 2-dimensional subcube (Q2) of the hypercube. Each of these nodes also executes a voter process. The remaining node is used for message passing only. All outputs from the triplicated modules are voted on, and the voting results are transmitted to the appropriate destination. Thus, all interunit messages are also triplicated. We propose an embedding of TMR into a hypercube which can be implemented in a manner transparent to the application program. Subcubes are allocated so that the address space for the TMR units is also a hypercube. Hence, the subcube allocation and intermodule communication schemes are defined to be analogous to the schemes used in the nonre-dundant system. The embedded system is proven to mask all single-point faults.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Message routing in an injured hypercube 3

Message routing in an injured hypercube

引用

3rd Conference on Hypercube Concurrent computers and Applications, C3P 1988

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

ISBN: (纸本)0897912780

A connected hypercube containing faulty components (nodes or links) is called an injured hypercube. To enable non-faulty nodes to communicate with each other in an injured hypercube, the information of component failures must be made available to those non-faulty nodes for them to route messages around the faulty components. We develop a fault-tolerant routing scheme which requires each node to know only the information on the failure of its own links. Performance of this scheme is rigorously analyzed. This scheme is not only shown to be capable of routing messages successfully in injured hypercubes when the number of component failures is less than n, but also proved to be able to choose a shortest path with a very high probability.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Design and scheduling of mesh array of hardware unifiers for large-scale unification 1st

引用

1st International Conference on Supercomputing, 1987

作者： Shih, Yifong Irani, Keki B. Computing Research Laboratory Department of Electrical Engineering and Computer Science The University of Michigan Ann ArborMI48109 United States

ISBN: (纸本)9783540189916

We propose a hardware unification array consisting of k × n fourconnected unification units to be used to speed up the process of finding suitable bindings for common variables among the predicates in a logic program. Four different algorithms (SIMPLEX, PCC, PwFLP and CP) to perform unification in the array are presented and their performances compared. The final level of unification in scheduling multiple arrays is found to be the most expensive, deserving the highest degree of hardware support. © 1988, Springer-Verlag.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

CHARACTERISTICS OF STRAINED IN0.65GA0.35AS/IN0.52AL0.48AS HEMT WITH OPTIMIZED TRANSPORT PARAMETERS

IEEE ELECTRON DEVICE LETTERS

引用

IEEE ELECTRON DEVICE LETTERS 1988年第9期9卷 439-441页

作者： NG, GI HONG, WP PAVLIDIS, D TUTT, M BHATTACHARYA, PK Center for High Frequency Microelectronics Solid State Electronics Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA Bell Communications Research Inc. Red Bank NJ USA

The DC and microwave performance of a strained In/sub 0/./sub 65/Ga/sub 0/./sub 35/As/In/sub 0/./sub 52/A1/sub 0/./sub 48/As HEMT (high-electron-mobility transistors) is reported. Its design is based on theoretical and experimental studies including low- and high-field transport characterization of heterostructures with different strains. The intrinsic DC transconductance and cutoff frequence of 1.4- mu m-long gate HEMTs are 574 mS/mm and 38.6 GHz, respectively. The increased indium (In) composition in the channel enhances the drift velocity from 1.35*10/sup 7/ to 1.55*10/sup 7/ cm/s at 300 K.< >

关键词： HEMTs Pulse measurements Indium gallium arsenide Current measurement Electrons Carrier confinement Frequency Microelectronics Solid state circuits Laboratories

来源：评论

学校读者我要写书评

暂无评论

Checkpointing and rollback recovery in a distributed system using common time base

Checkpointing and rollback recovery in a distributed system ...

引用

Reliable Distributed Systems

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

An approach to checkpointing and rollback recovery in a distributed computing system using a common time base is proposed. First, a common time base is established in the system using a hardware clock synchronization algorithm. This common time base is coupled with a pseudorecovery block approach to develop a checkpointing algorithm that has the following advantages: (i) maximum process autonomy, (ii) no wait for commitment for establishing recovery lines, (iii) fewer messages to be exchanged, and (iv) less memory requirement.< >

关键词： Checkpointing Testing Real time systems Clocks Synchronization Broadcasting Laboratories Distributed computing Hardware Fault tolerant systems

来源：评论

学校读者我要写书评

暂无评论

Evaluation of the probability of dynamic failure and processor utilization for real-time systems

Evaluation of the probability of dynamic failure and process...

引用

Real-time Systems Symposium (RTSS)

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

It is shown how to determine closed-form expressions for task scheduling delay and active task time distributions for any real-time system application, given a scheduling policy and task execution time distributions. The active task time denotes the total time a task is executing or waiting to be executed, including scheduling delays and resource contention delays. The distributions are used to determine the probability of dynamic failure and processor utilization, where the probability of dynamic failure is the probability that any task will not complete before its deadline. The opposing effects of decreasing the probability of dynamic failure and increasing utilization are also addressed. The analysis first addresses workloads where all tasks are periodic, i.e., they are repetitively triggered at constant frequencies. It is then extended to include the arrival of asynchronously triggered tasks. The effects of asynchronous tasks on the probability of dynamic failure and utilization are addressed.< >

关键词： Real time systems Job shop scheduling Processor scheduling Optimal scheduling Application software Dynamic scheduling Delay effects Cost function Distributed computing Performance analysis

来源：评论

学校读者我要写书评

暂无评论

Effects of computing time Delay on Real-time Control Systems

Effects of Computing Time Delay on Real-Time Control Systems

引用

American Control Conference (ACC)

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

The reliability of a real-time digital control system depends not only on the reliability of the hardware and software used, but also on the speed in executing control algorithms. The latter is due to the negative effects of computing time delay on control system performance. For a given sampling interval, the effects of computing time delay are classified into the delay problem and the loss problem. Analysis of these two problems is presented as a means of evaluating real-time control systems. As an example, both the self-tuning predicted (STP) control and Proportional-Integral-Derivative (PID) control are applied to the problem of tracking robot trajectories, and their respective effects of computing time delay on control performance are comparatively evaluated. For this exmple, the STP (PID) controller is shown to outperform the PID (STP) controller in coping with the delay (loss) problem.

关键词： Delay effects Real time systems Control systems Pi control Proportional control Three-term control Digital control Hardware Software algorithms System performance

来源：评论

学校读者我要写书评

暂无评论

Fault-tolerant BIBD networks

Fault-tolerant BIBD networks

引用

International Symposium on Fault-Tolerant computing (FTCS)

作者： B.E. Aupperle J.F. Meyer Computing Research Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

The use of multiple buses can improve both the fault tolerance and performance of local area computer networks. Existing schemes either depend on active components for full connectivity or can experience decreased performance as many hosts attempt to access one bus. An architecture class based on balanced incomplete block designs (BIBDs) is proposed to address these problems. A BIBD architecture uses redundant communication channels and exhibits degradable performance as faults occur. The performability of such networks is evaluated, where evaluation is based on stochastic activity network models. The results obtained are provided for comparison of BIBD network performability with that of conventional multibus networks.< >

关键词： Fault tolerance computer networks redundancy computer architecture Geometry Laboratories Communication channels Degradation Performance evaluation Stochastic processes

来源：评论

学校读者我要写书评

暂无评论

Analysis of workload influence on dependability

Analysis of workload influence on dependability

引用

International Symposium on Fault-Tolerant computing (FTCS)

作者： J.F. Meyer L. Wei Computing Research Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

The authors consider a general, analytic approach to the study of workload effects on computer system dependability, where the faults considered are transient and the dependability measure in question is the time to failure, T/sub f/. Under these conditions, workload plays two roles with opposing effects: it can help detect/correct a correctable fault, or it can cause the system to fail by activating an uncorrectable fault. As a consequence, the overall influence of workload on T/sub f/ is difficult to evaluate intuitively. To examine this in more formal terms, the authors establish a Markov renewal process model that represents the interaction among workload and fault accumulation ins systems for which fault tolerance can be characterized by fault margins. Using this model, they consider some specific examples and show how the probabilistic nature of T/sub f/ can be formulated directly in terms of parameters regarding workload, fault arrivals, and fault margins.< >

关键词： Fault tolerant systems Fault tolerance Fault detection Error correction Laboratories Failure analysis Transient analysis Electric variables measurement Computational modeling Terminology

来源：评论

学校读者我要写书评

暂无评论

Comparison of data compression schemes for Medical images

Comparison of data compression schemes for Medical images

引用

Application of Optical Instrumentation in Medicine XIV and Picture Archiving and Communication Systems (PACS IV) for Medical Applications 1986

作者： Noh, Ki H. Jenkins, Janice M. Medical Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann ArborMI48109 United States

Medical images acquired and stored digitally continue to pose a major problem in the area of picture archiving and transmission. The need for accurate reproduction of such images, which constitute patient medical records, and the medico-legal problems of possible loss of information has led us to examine the suitability of data compression schemes for several different medical image modalities. We have examined both reversible coding and irreversible coding as methods of image formatting and reproduction. In reversible coding we have tested run-length coding and arithmetic coding on image bit planes. In irreversible coding, we have studied transform coding, linear predictive coding, and block truncation coding and their effects on image quality versus compression ratio in several image modalities. In transform coding, we have applied discrete Fourier coding, discrete cosine coding, discrete sine transform, and Walsh-Hadamard transform to images in which a subset of the transformed coefficients were retained and quantized. In linear predictive coding, we used a fixed level quantizer. In the case of block truncation coding, the first and second moments were retained. Results of all types of irreversible coding for data compression were unsatisfactory in terms of reproduction of the original image. Run-length coding was useful on several bit planes of an image but not on others. Arithmetic coding was found to be completely reversible and resulted in up to 2 to 1 compression ratio. © 1986 SPIE. All rights reserved.

关键词： Medical imaging

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：