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

Annual Hawaii International Conference on System sciences (HICSS)

作者： L.R. Welch A.D. Stoyenko S. Chen Real-Time Computing Laboratory Departmentof Computer and Information Science New Jersey Institute of Technology Newark NJ USA

The authors apply random neural networks to the problem of assigning abstract data type modules (ADTs) to the processing elements of parallel computers. Although assignment of tasks has been discussed extensively in the literature, the automatic assignment of ADTs is a relatively new problem, and therefore they describe the problem in detail. This is followed by an introduction to the random neural network model and a presentation of the neural network solution to the assignment problem. Experimental results are presented comparing the solution to those obtained with random assignment and with a greedy heuristic. The random neural network is found to give significantly better results than the other two approaches in virtually every case.< >

关键词： Neural networks Data structures Parallel processing computer networks Costs Concurrent computing Distributed computing Recurrent neural networks Laboratories information science

来源：评论

学校读者我要写书评

暂无评论

Intelligent disruption recovery for decentralized manufacturing systems

Intelligent disruption recovery for decentralized manufactur...

引用

IEEE International Conference on Robotics and Automation (ICRA)

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

The problems of intelligent response to disruptions in a decentralized manufacturing system are considered. In the absence of intelligent coordination, the response to a disruption of one part of the system may cause a disruption in another part of the system. A model for the problem of recovering from this kind of disruption is given. A solution approach based on the idea of negotiation from the field of distributed artificial intelligence is presented. The model and solution approach are evaluated in the domain of job shop rescheduling.< >

关键词： Manufacturing systems computer aided manufacturing Distributed computing Job shop scheduling Cellular manufacturing Artificial intelligence Control systems real time systems Laboratories Power system modeling

来源：评论

学校读者我要写书评

暂无评论

Software fault injection and its application in distributed systems

Software fault injection and its application in distributed ...

引用

International Symposium on Fault-Tolerant computing (FTCS)

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

The authors describe a software fault injector (SFI) developed to facilitate the validation of dependability mechanisms on an experimental distributed real-time system called HARTS. SFI introduces a number of extensions to previous work done on fault injection tools. In particular, it allows combinations of fault types to be injected in the nodes of a distributed system. It also allows control of all timing parameters of the injection at each node. A description is given of the features and implementation of SFI. As a demonstration of the utility of SFI, the results of some sample experiments are presented.

关键词： Application software Hardware Aerodynamics Fault tolerance System testing Fault tolerant systems Acceleration Laboratories real time systems Timing

来源：评论

学校读者我要写书评

暂无评论

Adaptive Deadlock-Free Routing in Multicomputers Using Only One Extra Virtual Channel

Adaptive Deadlock-Free Routing in Multicomputers Using Only ...

引用

International Conference on Parallel Processing (ICPP)

作者： Chien-Chun Su Kang G. Shin Real-Time computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

We present three protocols defin ing the relationship between messages and the chan nel resources requested: request-then-hold, requestthen wait, and request-then-relinquish. Based on the three protocols, we develop an adaptive deadlockfree routing algorithm called the SP routing. The SP routing uses shortest paths and is fully-adaptive, so messages can be routed via any of the shortest paths from the source to the destination. Since it is a minimal or shortest routing, the SP routing guar antees the freedom of livelocks. The SP routing is not limited to a specific network topology. The main requirement for an applicable network topology is that there exists a deterministic, minimal, deadlock-free routing algorithm. Most ex isting network topologies are equipped with such an algorithm. In this paper, we present an adaptive deadlock-free routing agorithm for n-dimensional meshes by using the SP routing. The hardware re quired by the SP routing uses only one extra virtual channel as compared to the deterministic routing.

关键词： System recovery Network topology Parallel processing Routing protocols Hardware Delay Throughput Hypercubes Concurrent computing Laboratories

来源：评论

学校读者我要写书评

暂无评论

Incorporation of optimal timeouts into distributed real-time load sharing

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

引用

Annual Hawaii International Conference on System sciences (HICSS)

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

The authors address 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. They formulate the problem of determining the best timeout period T/sub out//sup / 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. They outline the LS algorithm and the proposed timeout mechanism and establish a theoretical basis for the calculation of optimal T/sub out//sup /. The simulation results show that the LS algorithm, which combines online parameter estimation, the timeout mechanism, and a few extra, timely broadcasts, can significantly reduce the probability of missing task deadlines.< >

关键词： Broadcasting real time systems Distributed computing Chaotic communication time sharing computer systems Laboratories Testing Fault detection Bayesian methods Parameter estimation

来源：评论

学校读者我要写书评

暂无评论

Determination of an optimal retry time in multiple-module computing systems

Determination of an optimal retry time in multiple-module co...

引用

International Symposium on Uncertainty Modeling and Analysis (ISUMA)

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

The optimal amount of time used for retrying an instruction on detection of an error in a computing system is usually determined under the assumption that the system is composed of a single module, within which all fault activities are confined until some module-replacement action is taken. The authors consider fault activities in multiple-module systems. They first relax the single-module assumption and model the fault activities in a multiple-module system as a Markov process. The randomization approach is applied to decompose the Markov process into a discrete-time Markov chain subordinated to a Poisson process. Using this decomposition, several interesting measures can be derived such as the conditional probability of successful retry given a retry period and the fact that a non-permanent fault has occurred, and the mean time until which all modules in the system enter a fault-free state. All the measures derived are used to determine, along with the parameters characterizing fault activities and costs of recovery techniques, whether or not retry should be used as a first-step recovery means on detection of an error; and the best retry period subject to a specific probability of successful retry.< >

关键词： computer aided instruction Markov processes Chaos real time systems Laboratories computer science Electrical fault detection computer errors Position measurement time measurement

来源：评论

学校读者我要写书评

暂无评论

Transmission of compressed motion video over computer networks

Transmission of compressed motion video over computer networ...

引用

IEEE Compcon

作者： Q. Zheng K.G. Shin E. Abram-Profeta Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

The authors present an enhanced version of the real-time channel protocol for the transmission of compressed digital motion video over computer networks. This protocol can guarantee the timely delivery of video frames without wasting network bandwidth. Extensive simulation results have shown the protocol's superiority over the ordinary circuit/packet switching protocols.< >

关键词： Video compression computer networks Bandwidth Circuits Packet switching Protocols Delay Laboratories Electronic mail Costs

来源：评论

学校读者我要写书评

暂无评论

A real-time EXPERT SYSTEM FOR PROCESS MANAGEMENT—THE DESIGN AND DEVELOPMENT OF ExPro

引用

International Journal on Artificial Intelligence Tools 1993年第4期2卷 541-556页

作者： F. GOLSHANI M.N. KOZICKI P. RASTOGI Arizona State University Tempe AZ 85287 USA Intelligent Information Systems Laboratory Department of Computer Science and Engineering. Center for Solid State Electronics Research. Now at Real Time Simulations San Francisco California.

We present ExPro—a real-time knowledge based system for process management. This system is designed to provide process setup, monitoring, and supervisory control capabilities for a real-time semiconductor manufacturing environment. The specific process selected for development and demonstration purposes is rapid thermal oxidation (RTO), a technique used in the controlled formation of thin silicon dioxide layers for silicon integrated circuits. This is an ideal application domain for process management system development since we can readily obtain direct process variable feedback in real-time from the equipment. ExPro demonstrates several novelties, not the least of which is a modular design. It includes an integrated analytical simulator whose primary responsibilities are to predict process parameters a priori and to provide the necessary information on the growth of the oxide during the process. The knowledge base, in cooperation with the simulator, achieves a high degree of accuracy for control of the thickness of the wafer.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DERIVATION AND APPLICATION OF HARD DEADLINES FOR real-time CONTROL-SYSTEMS

引用

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS 1992年第6期22卷 1403-1413页

作者： SHIN, KG KIM, HB Real Time Computing Laboratory the Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

The computation-time delay in the feedback controller of a real-time control system may cause failure to update the control input during one or more sampling periods. If this delay exceeds a certain limit called a hard deadline, either the necessary conditions for system stability are violated or the system leaves the allowed state-space. In such a case a dynamic failure is said to occur to the system. A method for calculating the hard deadlines in linear time-invariant control systems by considering system stability and the allowed state-space is presented. To derive necessary conditions for (asymptotic) system stability, the state difference equation is modified based on an assumed maximum delay and the probability distribution of delays whose magnitudes are less than, or equal to, the assumed maximum delay. Moreover, the allowed state-space-which is derived from given input and state constraints-is used to calculate the hard deadline as a function of time and the system state. A one-shot delay model in which a single event causes a dynamic failure is also considered. The knowledge of hard deadline is then applied to the design of error recovery in a triple modular redundant (TMR) controller computer.

关键词： real time systems Control systems Delay effects Stability Feedback Sampling methods Difference equations computer errors Error correction Process control

来源：评论

学校读者我要写书评

暂无评论

MINIMUM-time COLLISION-FREE TRAJECTORY PLANNING FOR DUAL-ROBOT SYSTEMS

引用

IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION 1992年第5期8卷 641-644页

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

Collision-free multirobot motion planning can be achieved in two steps: path planning and trajectory planning. Path planning finds for the robots geometric paths to avoid collision with static obstacles and trajectory planning determines how fast each robot must move along its geometric path to avoid collision with other moving robots. For a dual-robot system, a simple trajectory planning strategy is to let each robot move along its path as fast as possible and delay one robot at its initial position to avoid collision with the other robot. We derive in this paper a sufficient condition under which this simple (thus easy to implement) strategy for dual-robot systems can achieve time optimality as well as collision avoidance, i.e., the two robots reach their final positions without colliding with each other in the minimum amount of time. A demonstrative example is presented, showing how this strategy can be used for loading and unloading applications.

关键词： COLLISION AVOIDANCE COLLISION REGION MINIMUM-time TRAJECTORY PLANNING MULTIROBOT SYSTEMS

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：