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

SUPRA-RPC - SUBPROGRAM PARAMETERS IN REMOTE PROCEDURE CALLS

SOFTWARE-PRACTICE & EXPERIENCE 1994年第1期24卷 27-49页

作者： STOYENKO, AD Real-Time Computing Laboratory Department of Computer and Information Science New Jersey Institute of Technology University Heights Newark New Jersey 07102 U.S.A.

Remote-procedure calls (RPCs) allow distributed, high-level language programs to communicate and synchronize in the usual manner via subprogram calls. One of the great challenges in RPC research is to preserve the traditional call semantics despite the distribution and heterogeneity of the new environment. The main contribution of SUPRA-RPC is in addressing the passing of subprograms as RPC parameters. In doing so, SUPRA overcomes a number of technical difficulties, stemming from scoping, side-effects and other sources. Since supporting subprogram RPC parameters is harder than supporting nonsubprogram RPC parameters, the three (of six) components of the SUPRA architecture extend in novel ways the traditional functionality found in their counterparts in other RPC systems. The SUPRA stub generator extracts information not only from remote entry interfaces, but from any scope potentially referenced by a subprogram passed as an RPC parameter. In addition to the usual call- and accept-stubs and the marshaling and unmarshaling routines, the generator constructs out-of-scope access stubs, callback' and callback-handling-stubs, and modified parameter subprograms and others. The SUPRA run-time support manages a run-time symbol table to keep track of referencing environments and out-of-scope objects. When an out-of-scope object is unavailable for access or execution on the server, the object is reached by a synchronous, 'under-the-covers' callback. The SUPRA process management supports servers with independent threads of control, manages (possibly nested) callbacks and pools of callback handler threads, and maintains correct identification of thread-initiated calls or callbacks. A SUPRA prototype has been implemented on Sun Unix workstations. The prototype supports C, C++ and CommonLisp programs. A prototype graphical demonstration has been implemented as well, that represents RPC concepts in terms of common life objects and situations.

关键词： REMOTE PROCEDURE CALLS PASSING SUBPROGRAMS AS PARAMETERS PRESERVING HIGH-LEVEL LANGUAGE SEMANTICS DISTRIBUTED PROGRAMS STUB GENERATION CALLBACKS

来源：评论

学校读者我要写书评

暂无评论

Support for multiple classes of traffic in multicomputer routers 1st

引用

1st International Workshop on Parallel computer Routing and Communication, PCRCW 1994

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

ISBN: (纸本)9783540584292

Emerging parallel real-time and multimedia applications broaden the range of performance requirements imposed on the interconnection network. This communication typically consists of a mixture of different traffic classes, where guaranteed packets require bounds on latency or throughput while good average performance suffices for the best-effort traffic. This paper investigates how multicomputer routers can capitalize on low-latency routing and switching techniques for best-effort traffic while still supporting guaranteed communication. Through simulation experiments, we show that certain architectural features are best-suited to particular performance requirements. Based on these results, the paper proposes and evaluates a router architecture that tailors low-level routing, switching, and flow-control policies to the unique needs of best-effort and guaranteed traffic. Careful selection of these policies, coupled with fine-grain arbitration between the classes, allows the guaranteed and best-effort packets to share network bandwidth without sacrificing the performance of either class. © 1994, Springer Verlag. All Rights Reserved.

关键词： Routers

来源：评论

学校读者我要写书评

暂无评论

AUTOMATED-ANALYSIS OF SPONTANEOUSLY OCCURRING ARRHYTHMIAS BY IMPLANTABLE DEVICES - LIMITATIONS OF USING RATE AND TIMING FEATURES ALONE

引用

JOURNAL OF ELECTROCARDIOLOGY 1994年第Sup1期27卷 151-156页

作者： CASWELL, SA DICARLO, LA CHIANG, CMJ JENKINS, JM From the Medical Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor Michigan. USA

real-time automated systems for arrhythmia analysis by implantable antitachycardia devices have been designed to incorporate two-channel rate criteria with intracavitary atrial and ventricular electrogram morphology. Because the power requirements for morphologic analysis substantially limit antitachycardia device longevity, the authors sought to develop an alternative algorithm that relies solely on rate and three newly developed timing features: onset (median ventricular rate filtering to detect abrupt onset), loss of atrioventricular (AV) sequency (premature ventricular depolarizations), and regularity-multiplicity (minimal median cycle length variation concurrent with integral [n:1] AV periodicity). This system was assessed using spontaneously occurring arrhythmias in patients undergoing electrophysiology studies. Electrograms were captured on FM tape (1-500 Hz) using bipolar catheters in the high right atrium and the left ventricular apex. In 11 patients, 25 distinct arrhythmias were analyzed, which included sinus tachycardia (ST) (1 passage), supraventricular tachycardia (SVT) (6 passages), ventricular tachycardia (VT) with concurrent sinus rhythm (16 passages), VT with concurrent atrial flutter (VT/AF1) (2 passages), and ventricular fibrillation (VF) (I passage). The algorithm correctly diagnosed 1 of 1 episode of ST, 4 of 6 episodes of SVT, 15 of 16 episodes of VT with concurrent sinus rhythm, 0 of 2 episodes of VT/AF1, and 1 of 1 episode of VF. Ventricular tachycardia episodes were misdiagnosed as SVT because of absence of loss of AV sequency in VT onset (1 episode), presence of multiplicity between VT and AF1 (1 episode), and absence of VT regularity during AF1 (1 episode). Algorithms that are confined to rate and timing features alone are capable of correctly diagnosing most spontaneously occurring tachyarrhythmias. Misdiagnosis of VT may occur, however, despite the integration of multiple timing features.

关键词： ANTITACHYCARDIA DEVICES VENTRICULAR TACHYCARDIA ATRIOVENTRICULAR SEQUENCY ELECTROPHYSIOLOGY STUDIES RATE ANALYSIS TIMING FEATURES

来源：评论

学校读者我要写书评

暂无评论

Requirements for a real-time image processing language

引用

Annual Review in Automatic Programming 1994年第C期18卷 175-180页

作者： Laplante, P Marlowe, T Stoyenko, A Department of Mathematics and Computer Science Fairleigh Dickinson University Madison NJ 07940 United States also research faculty of the Real-Time Computing Laboratory (CIS NJIT) United States Department of Mathematics and Computer Science Seton Hall University South Orange NJ 07079 United States also research faculty of the Real-Time Computing Laboratory (CIS NJIT) United States Real-Time Computing Laboratory Department of Computer and Information Science New Jersey Institute of Technology Newark NJ 07102 United States

In this paper we discuss issues in real-time image processing, including applications, approaches and hardware. In particular, we discuss the failure of existing programming languages to support these considerations a... 详细信息

关键词： image processing multimedia programming languages real-time virtual reality

来源：评论

学校读者我要写书评

暂无评论

DOCTOR: An Integrate Software Fault Injection environrnent - An Extended Abstract 3

DOCTOR: An Integrate Software Fault Injection environrnent -...

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：