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

3rd IEEE International Workshop on Integrating Error Models with Fault Injection, WIEM 1994

作者： Han, Seungjae Rosenberg, H.A. Shin, Kang G. Red-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann ArborMI48109-2122 United States

来源：评论

学校读者我要写书评

暂无评论

Combining contracts and exemplar-based programming for class hiding and customization 94

Combining contracts and exemplar-based programming for class...

引用

Proceedings of the ninth annual conference on Object-oriented programming systems, language, and applications

作者： Victor B. Lortz Kang G. Shin Real- Time Computing Laboratory Department of Electrical Engineering and Computer Science The University of Michigan Ann Arbor Michigan Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science The University of Michigan Ann Arbor Michigan

ISBN: (纸本)9780897916882

For performance reasons, client applications often need to influence the implementation strategies of libraries whose services they use. If an object-oriented library contains multiple service classes customized for different usage patterns, applications can influence service implementations by instantiating the customized classes that match their needs. However, with many similar service classes, it can be difficult for applications to determine which classes to instantiate. Choosing the wrong class can result in very subtle errors since a customized class might use optimizations that work only over a restricted domain. In this paper, we show how client-side software contracts and exemplar-based class factories can be used to construct customized server objects. By expressing priorities and requirements in contracts, clients can delegate service class selection to the library and thereby avoid implicit dependencies on the library implementation. We have used this approach in the implementation of a real-time database system.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Least-space-time-first scheduling algorithm: A policy for complex real-time tasks in multiple processor systems

引用

Annual Review in Automatic Programming 1994年第C期18卷 33-38页

作者： Bo-Chao, Cheng Stoyenko, Alexander D Marlowe, Thomas J Real-Time Computing Laboratory Department of Computer Information Science New Jersey Institute of Technology Newark NJ 07102 United States Department of Mathematics Computer Science Seton Hall University South Orange NJ 07079 United States

Significant prior work exists on scheduling for the 'simple-tasks-single-processor', 'simple-tasks-multiple-processor', and 'complex-tasks-single-processor', but few researchers have yet considered the 'complex-tasks-multiple-processor' model. We propose a new algorithm, Least Space-time First (LSTF), to deal with the general 'complex-task-multiple-processor' model. We demonstrate that LSTF outperforms the Highest-Level-First, Earliest-Deadline-First and Least-Laxity-First scheduling disciplines in the sense of minimizing maximum tardiness of a set of tasks. LSTF can gracefully incorporate some realistic overhead assumptions, including context switch and communication. The Unit Precedence Graph and Soft-Precedence Edges significantly facilitate implementation of LSTF. © 1994.

关键词： LSTF MIMD Overhead Precedence Graph Scheduling Tardiness

来源：评论

学校读者我要写书评

暂无评论

Polite rescheduling: responding to local schedule disruptions in distributed manufacturing systems

Polite rescheduling: responding to local schedule disruption...

引用

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

This paper considers the problem of handling schedule disruptions in a distributed manufacturing system. When a cell controller reschedules a manufacturing cell in response to some disruption, it may disrupt the schedule at some other cell, because schedules at different cells may interact. In the approach we propose, a controller at a disrupted cell tries to reschedule in a way which is likely to be least disruptive to other cells' schedules, through negotiation with controllers at other cells. This approach, which we call "polite rescheduling", has the advantage of retaining much of the original schedule, while avoiding wide propagation of the disruption through the rest of the system. Simulation results show that a polite rescheduling algorithm helps isolate disruptions to a small subset of cells.< >

关键词： Job shop scheduling Manufacturing systems Processor scheduling real time systems computer aided manufacturing Distributed computing Laboratories Discrete event simulation Flexible manufacturing systems Intelligent manufacturing systems

来源：评论

学校读者我要写书评

暂无评论

Hardware support for controlled interaction of guaranteed and best-effort communication

Hardware support for controlled interaction of guaranteed an...

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Speculative execution in a real-time system 2

Speculative execution in a real-time system

引用

2nd IEEE Workshop real-time Applications, RTA 1994

作者： Younis, Mohamed F. Marlowe, Thomas J. Stoyenko, Alexander D. Real-Time Computing Laboratory Department of Computer and Information Science New Jersey Institute of Technology NewarkNJ07102 United States Department of Mathematics and Computer Science Seton Hall University South OrangeNJ07079 United States

ISBN: (纸本)0818663758

Compiler techniques can help enhance average case execution and extract parallelism opportunities in distributed real time systems. We show that there are situations in which speculative execution with rollback can improve the performance of a hard real time system, either by improving average performance while not affecting the worst-case, or by actually decreasing worst-case execution time. We also show how related strategies for partial or total precomputation can lead to improved performance. We briefly discuss possible practical compiler transformation tools to detect chances of profitable speculative execution in real-time applications. © 1994 IEEE.

关键词： real time systems

来源：评论

学校读者我要写书评

暂无评论

Compiler transformations for speculative execution in a real-time system

Compiler transformations for speculative execution in a real...

引用

15th IEEE real-time Systems Symposium, RTSS 1994

作者： Younis, Mohamed F. Marlowet, Thomas J. Stoyenko, Alexander D. Real-Time Computing Laboratory Department of Computer and Information Science New Jersey Institute of Technology Newark NJ 07102 United States Department of Mathematics and Computer Science Seton Hall University South Orange NJ 07079 United States

ISBN: (纸本)0818666005

Deterministic worst-case execution to satisfy hard real-time constraints, and speculative execution with rollback to improve average-case throughput, appear to lie on opposite ends of a spectrum of performance requirements and strategies. Nonetheless, we show there are situations in which speculative execution can probably improve the performance of a hard real-time system, either by improving average performance while not affecting the worst case, or by actually decreasing worst-case execution time. We also show how related strategies for partial or total precomputation can lead to improved performance. Finally, we discuss possible compiler transformations to detect chances of profitable speculative execution. © 1994 IEEE.

关键词： real time systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：