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

International Phoenix Conference on computers 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

来源：评论

学校读者我要写书评

暂无评论

On reconfiguration latency in fault-tolerant system

On reconfiguration latency in fault-tolerant system

引用

IEEE Conference on Aerospace Applications

作者： Hagbae Kim K.G. Shin C. Roark Real-Time Computing Laboratory Department of Elec. Engineering and Comput. Science University of Michigan Ann Arbor MI USA Defense Systems & Electronics Group Texas Instruments Inc. Dallas MS USA

Digital computers embedded in critical applications such as flight controls should be equipped with appropriate fault-tolerance schemes to ensure their reliable and safe operation in the presence of component failures. System reconfiguration, which enhances reliability by dynamically using spatial redundancy, is generally the most time-consuming fault-/error- handling stage. The reconfiguration latency, defined as the time taken for reconfiguring a system upon failure detection or mode change, depends on many parameters, including the size of application programs and data, the CPU and memory speed, built-in testing capabilities, the type of spares to use, the system architecture, and the reconfiguration strategy used. In this paper, we classify the reconfiguration techniques into four types: reconfigurable duplication, reconfigurable N-modular redundancy (NMR), backup sparing, and graceful degradation. For each type of reconfiguration, we evaluate the reconfiguration latency by using several parameters accounting for the aforementioned parameters, and determine if this type of reconfiguration can meet the application required latency.< >

关键词： Delay Fault tolerant systems Redundancy Embedded computing Application software Aerospace control Fault tolerance computer errors Central Processing Unit System testing

来源：评论

学校读者我要写书评

暂无评论

UltraSAN version 3 overview

UltraSAN version 3 overview

引用

International Workshop on Petri Nets and Performance Models (PNPM)

作者： D.D. Deavours W.D. Obal M.A. Qureshi W.H. Sanders A.P.A. van Moorsel Center for Reliable and High-Performance Computing Coordinated Science Laboratory University of Illinois Urbana-Champaign Urbana IL USA Department of Electrical and Computer Engineering University of Arizona Tucson Tucson AZ USA

UltraSAN is a software package for model-based evaluation of systems represented as stochastic activity networks. The software has been implemented in a modular fashion, with clearly delineated interfaces between model specification, construction, and solution. UltraSAN offers an X Windows-based user interface and both analytical and simulation solution modules for transient and steady-state performance, dependability, and performability measures. Furthermore, the tool facilitates graphical representation of the obtained results by its report generator. This paper gives a very brief overview and pointers to more detailed descriptions of the software.

关键词： Steady-state Storage area networks Modular construction User interfaces Automatic control Joining processes Libraries Markov processes Probability density function Web sites

来源：评论

学校读者我要写书评

暂无评论

Modeling recycle: a case study in the industrial use of measurement and modeling

Modeling recycle: a case study in the industrial use of meas...

引用

International computer Performance and Dependability Symposium

作者： L.M. Malhis S.C. West L.A. Kant W.H. Sanders Storage Systems Division IBM Corporation Tucson AZ USA Department of Electrical and Computer Engineering University of Arizona Tucson Tucson AZ USA Department of Electrical and Computer Engineering University of Arizona Tucson Tustin AZ USA Center for Reliable and High-Performance Computing Coordinated Science Laboratory University of Illinois Urbana IL USA

Large-scale data storage systems rely on magnetic tape cartridges to store millions of data objects. As these tapes age, the resident data objects become invalid; consequently, less and less of the tape potential capacity is effectively utilized. To address this problem, data storage systems have a facility, called "recycle" in this paper, that transfers valid data objects from sparsely populated tapes onto new tapes, thus creating empty tapes for reuse. A high performance recycle process is needed to keep the number of tape cartridges to a minimum, and to maintain a continuous supply of empty tapes for storing newly created data objects. The performance of such processes is not easy to determine, and depends strongly on the data stored on the tapes, the speed and characteristics of the computer on which recycle is executed, and the nature of the algorithms themselves. This paper documents an extensive effort to evaluate a proposed recycle algorithm, using held workload data, laboratory measurements, and modeling. The results of the study were used to improve the recycle process, and were later verified through field trials. In addition yielding the results themselves, the effort illustrated that modeling and measurement, in an industrial setting, can indeed be used successfully in the design process.< >

关键词： Recycling computer aided software engineering Large-scale systems Data storage systems Laboratories Magnetic field measurement Process design Coordinate measuring machines Electric variables measurement Area measurement

来源：评论

学校读者我要写书评

暂无评论

PARALLEL AND DISTRIBUTED TLM COMPUTATION WITH SIGNAL-PROCESSING FOR ELECTROMAGNETIC-FIELD MODELING

引用

INTERNATIONAL JOURNAL OF NUMERICAL MODELLING-ELECTRONIC NETWORKS DEVICES AND FIELDS 1995年第3-4期8卷 169-185页

作者： SO, PPM ESWARAPPA, C HOEFER, WJR NSERC/MPR Teltech Research Chair in RF Engineering Department of Electrical and Computer Engineering University of Victoria Victoria British Columbia V8W 3P6 Canada Poman So received his B.Sc. degree in computer science and physics from the University of Toronto Toronto Onatario Canada in 1985. He obtained his B.A. Sc. and M.A.Sc. degrees in electrical engineering (summa cum laude) from the University of Ottawa Ottawa Ontario Canada in 1987 and 1989 respectively. Mr So was a research engineer in the University of Ottawa from January 1989 to October 1991 his research interests included CAD techniques of microwave circuits and numerical methods for electromagnetic wave modelling. He specialized in the development of electromagnetic engineering CAD software and successfully implemented a number of electromagnetic wave simulators based on the two-dimensional and three-dimensional transmission-line matrix methods. From August 1990 to February 1991 he accompanied Professor W. J. R. Hoefer to Rome Italy and Sophia Antiopolas France. During that time he implemented a parallel version of the 3D-TLM simulator for the CM-2 Connection Machine using C-Star and X Windows Library. He is a research engineer and a Ph.D. student at the University of Victoria Victoria British Columbia Canada. He ported the 2D- and 3D-TLM simulators to DECmpp 1200 massively parallel computer using MPL C and C++. He also combined OSA90/hope a commercially available microwave CAD program with a 2D-TLM simulation module for geometry optimization using the Datapipe technique of OSA90/hope. Recently he has developed a distributed client-server computing technique for the TLM method this technique could accelerate the TLM simulation by more than an order of magnitude. Channabasappa Eswarappa received the M.Tech. degree in electrical engineering from the Indian Institute of Technology Kanpur India in 1983 and Ph. D. degree from the University of Ottawa Canada in 1990. He worked as an Assistant Executive Engineer and later as

This paper describes the implementation of transmission-line matrix (TLM) method algorithms on a massively parallel computer (DECmpp 12000), the technique of distributed computing in the UNIX environment, and the combination of TLM analysis with Prony's method as well as with autoregressive moving average (ARMA) digital signal processing for electromagnetic field modelling. By combining these advanced computation techniques, typical electromagnetic field modelling of microwave structures by TLM analysis can be accelerated by a few orders of magnitude.

关键词： Mathematical models

来源：评论

学校读者我要写书评

暂无评论

Preface

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 1995年 967卷 V-VI页

作者： Bowen, Jonathan Hincbey, Mike Oxford University Computing Laboratory Wolfson Building Parks Road Oxford United Kingdom Real-Time Computing Laboratory New Jersey Institute of Technology University Heights NewarkNJ United States Department of Computer Science and Information Systems University of Limerick Plassey Technological Park Castletroy Limerick Ireland

来源：评论

学校读者我要写书评

暂无评论

Steady‐state security evaluation of electrical power systems by means of artificial neural network

引用

European Transactions on electrical Power 1995年第2期5卷 91-97页

作者： Chiodo, E. Menniti, D. Testa, A. Picardi, C. Elio Chiodo (1959) received the degree in Electronics Engineering in 1985 and the Ph.D. degree in Computational Statistics both from the University of Naplefltaly. He is a Researcher at the Department of Electrical Engineering of the University of Naples and a member of the Italian Statistical Society. His areas of interest include probabilistic methods applied to electric power systems analysis. (University of Naples Fedrrico 11. Electrical Engineering Dept.via Claudio 21 1-80125 Naplefltaly T +3981/7683226 Fax+3981/2396897) Daniele Menniti (1958) received the degree in Electrical Engineering from the University of Calabria. Cosenzataly and the Ph.D. degree in Electrical Engineering from the University of NapleslItaly in 1984 and 1989 respectively. He is a researcher at the Electronic. Computer and Systems Science Department of the University of Calabria. Italy. Hiscurrent research interests concern electric power system analysis real-time control and automation. (University of Calabria Electronic Computer and Systems Science Dep. Arcavacataji Rende (CS). 1-87036 CosenzdItaly T +39984/494707. Fax +39984/4947 13) Alfredo Testa (1950) received the degree in Electrical Engineering from the University of Naples/Italy in 1975. He is an Associate Professor in Electrical Power Systems at the Department of Electrical Engineering of the University of Naples. He is engaged in researches on electrical power systems reliability and harmonic analysis. (University of Naples Federico 11. Electrical Engineering Dep. via Claudio '2 1 1-80 I25 NapleslItaly T + 39 8 I/7 68 3'2 11. Fax+3981/2396897) Ciro Picardi (1949) received the degree in Electronics Engineering from the University of Naples/Italy in 1975. He is currently Associate Professor in Process Control at the Department of Electronic Computer and System Science of the University of Calabria. Italy. His current research interests are in the area of electrical drives robotics neural networks and fuzzy control. (University of Calabria Electronic. Compu

An artificial‐neural‐network (ANN) application for steady‐state security evaluation of electrical power systems is presented. Such application is based upon a combined use of a multilayer back‐propagation neural network and of an opportune electrical system model, previously proposed by some of the authors. In the paper, the definition of steady‐state security and the problems arising from its on‐line evaluation are briefly recalled. Then, the ANN utilized is described with particular reference to the solutions adopted by the authors. Afterwards, some remarks on the system model utilized are reported. Finally, numerical applications on the AEP‐14 bus system are presented and the results obtained with different ANN configurations are analyzed. Copyright © 1995 John Wiley & Sons, Ltd.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DESIGN AND EVALUATION OF EFFECTIVE LOAD SHARING IN DISTRIBUTED real-time SYSTEMS

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1994年第7期5卷 704-719页

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

In a distributed real-time system, uneven task arrivals temporarily overload some nodes and leave others idle or underloaded. Consequently, some tasks may miss their deadlines even if the overall system has the capacity to meet the deadlines of all tasks. An effective load-sharing (LS) scheme is proposed as a solution to this problem. Upon arrival of a task at a node, the node determines whether the node can complete the task in time under the minimum-laxity first-served policy. If the task cannot be guaranteed, or if guarantees of some other tasks are to be violated as a result of the addition of this task to the existing schedule, the node looks up the list of loss-minimizing decisions and determines the best node among a set of nodes in its physical proximity, called its buddy set, to which the task(s) may be transferred. This list of decisions is periodically updated using Bayesian decision analysis and prior/posterior state distributions. These probability distributions are derived from the information collected via time-stamped state-region change broadcasts within each buddy set. By characterizing the inconsistency between a node's ''observed'' state and the corresponding true state with prior and posterior distributions, the node can first estimate the states of other nodes, and then use them to reduce the probability of transferring a task to an ''incapable'' node. Moreover, the use of prior and posterior distributions and Bayesian analysis has made the proposed scheme robust to the variation of design parameters that usually require fine-tuning for adaptive LS. The performance of the proposed scheme is evaluated via simulation, along with five other schemes: no LS, LS with state probing, LS with random selection, LS with focused addressing, and perfect LS. The proposed scheme is shown to outperform all but perfect 1,S scheme in meeting task deadlines and tolerating the delays in state collection and task transfer. The impact of statistical fluctuations in

关键词： DEADLINES real-time SYSTEMS LOAD SHARING LOCATION AND TRANSFER POLICIES BAYESIAN DECISION THEORY PERFORMANCE EVALUATION

来源：评论

学校读者我要写书评

暂无评论

FAULT-TOLERANT CLOCK SYNCHRONIZATION IN LARGE MULTIcomputer SYSTEMS

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1994年第9期5卷 912-923页

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

The cost of synchronizing a multicomputer increases with system size. For large multicomputers, the time and resources spent to enable each node to estimate the clock value of every other node in the system can be prohibitive. We show how to reduce the cost of synchronization by assigning each node to one or more groups, then having each node estimate the clock values of only those nodes with which it shares a group. Since each node estimates the clock value of only a subset of the nodes, the cost of synchronization can be significantly reduced. We also provide a method for computing the maximum skew between any two nodes in the multicomputer, and a method for computing the maximum time between synchronizations. We also show how the fault tolerance of the synchronization algorithm may be determined.

关键词： CLOCK SYNCHRONIZATION CLOCK SKEW CLOCK DRIFT FAULT TOLERANCE MULTIcomputer SYSTEMS

来源：评论

学校读者我要写书评

暂无评论

FAULT-TOLERANT ROUTING IN MESH ARCHITECTURES

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1994年第11期5卷 1225-1232页

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

It is important for a distributed computing system to be able to route messages around whatever faulty links or nodes may be present. We present a fault-tolerant routing algorithm that assures the delivery of every message as long as there is a path between its source and destination;The algorithm works on many common mesh architectures such as the torus and hexagonal mesh. The proposed scheme can also detect the nonexistence bf path between a pair of nodes in a finite amount of time. Moreover, the scheme requires each node in the system to know only the state (faulty or not) of each of its own links. The performance of the routing scheme is simulated for both square and hexagonal meshes while varying the physical distribution of faulty components. It is shown that a shortest path between the source and destination of each message is taken with a high probability, and, if a path exists, it is usually found very quickly.

关键词： HEXAGONAL MESH DISTRIBUTED SYSTEMS ROUTING FAULTY LINKS CYCLES INCISIONS

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：