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

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 examines the problem of schedule revision in a distributed job shop where the object is to minimize the global makespan. Schedules of work cells may interact through precedence constraints, and a work cell's response to a local schedule disruption may affect schedules of other cells. Complete knowledge about how local schedule changes affect the global schedule may require global knowledge about the schedule. Here, we show that knowledge of only local constraints may be almost as useful as global knowledge for the revision of one cell's schedule. We present simulation results from a general distributed job shop model.

关键词： Job shop scheduling Processor scheduling Manufacturing systems Electrical capacitance tomography Distributed computing Laboratories Computational modeling computer integrated manufacturing Problem-solving Flexible manufacturing systems

来源：评论

学校读者我要写书评

暂无评论

QoS negotiation in real-time systems and its application to automated flight control

QoS negotiation in real-time systems and its application to ...

引用

real-time Technology and Applications Symposium

作者： T.F. Abdelzaher E.M. Atkins K.G. Shin Department of Electrical Engineering and Computer Science Real-time Computing Laboratory University of Michigan Ann Arbor MI USA

We propose a model for quality-of-service (QoS) negotiation in building real-time services to meet both predictability and graceful degradation requirements. QoS negotiation is shown to (i) outperform conventional "binary" admission control schemes (either guaranteeing the required QoS or rejecting the service request), and (ii) achieve higher application-perceived system utility. We incorporated the proposed QoS-negotiation model into an example real-time middleware service, called RTPOOL, which manages a distributed pool of shared computing resources (processors) to guarantee timeliness QoS for real-time applications. The efficacy and power of QoS negotiation are demonstrated for an automated flight control system implemented on a network of PCs running RT-POOL. This system is used to fly an F-16 fighter aircraft modeled using the Aerial Combat (ACM) F-16 Flight Simulator. Experimental results indicate that QoS negotiation, while maintaining real-time guarantees, enables graceful QoS degradation under conditions in which traditional schedulability analysis and admission control schemes fail.

关键词： real time systems Degradation Admission control Power system modeling Predictive models Quality of service Middleware Resource management Power system management Distributed computing

来源：评论

学校读者我要写书评

暂无评论

The use of industrial-strength formal methods

The use of industrial-strength formal methods

引用

IEEE Annual International computer Software and Applications Conference (COMPSAC)

作者： J.P. Bowen M.G. Hinchey Department of Computer Science University of Reading Reading UK New Jersey Institute of Technology Real-Time Computing Laboratory Newark NJ USA

Formal methods are used in a surprisingly wide variety of applications and ways throughout the world. While they may still be considered a niche market, there is growing evidence that they can be used successfully in industry if applied judiciously. The paper discusses same of the issues concerning the successful application of formal methods and surveys a number of examples of industrial usage, with a large bibliography for further reading on the state of the art in this area.

关键词： Books Storms Surge protection Automatic control Floods computer science Application software Technology transfer Laboratories Computational Intelligence Society

来源：评论

学校读者我要写书评

暂无评论

Deadline assignment in distributed hard real-time systems with relaxed locality constraints

Deadline assignment in distributed hard real-time systems wi...

引用

International Conference on Distributed computing Systems

作者： J. Jonsson K.G. Shin Department of Computer Engineering Chalmers University of Technology Goteborg Sweden Real-Time Computing Laboratory Department of Elec. Engr. and Computer Science University of Michigan Ann Arbor MI USA

In a real time system, tasks are constrained by global end to end deadlines. In order to cater for high task schedulability, these deadlines must be distributed over component subtasks in an intelligent way. Existing methods for automatic distribution of end to end deadlines are all based on the assumption that task assignments are entirely known beforehand. This assumption is not necessarily valid for large real time systems. Furthermore, most task assignment strategies require information on deadlines in order to make good assignments, thus forming a circular dependency between deadline distribution and task assignment. We present a heuristic approach that performs deadline distribution prior to task assignment. The deadline distribution problem is presented in the context of large distributed hard real time systems with relaxed locality constraints, where schedulability analysis must be performed offline, and only a subset of the tasks are constrained by predetermined assignments to specific processors. Using experimental results we identify drawbacks of previously proposed techniques, and then show that our solution provides significantly better performance for a large variety of system configurations.

关键词： real time systems Processor scheduling computer science Software maintenance Performance analysis Distributed computing Application software Software reusability Parallel processing Sensor systems

来源：评论

学校读者我要写书评

暂无评论

Scalable hardware earliest-deadline-first scheduler for ATM switching networks

Scalable hardware earliest-deadline-first scheduler for ATM ...

引用

real-time Systems Symposium (RTSS)

作者： Byung Kook Kim K.G. Shin Department of Electrical Engineering Korea Advanced Institute of Science and Technology Taejon South Korea Real Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

A fast, scalable hardware earliest deadline first (EDF) link scheduler for ATM switching network is developed. This EDF scheduler is a fast hardware solution suitable for real time scheduler on nodes in ATM switching networks up to 2.5 Gbps switching speed (scheduling within 0.17 /spl mu/s), capable of performing simultaneous input and output operations within two clock cycles (mostly in one clock cycle). The designed hardware is efficient since the architecture employs the minimum size EDF priority queue, combined with variable size FIFO queues for channels implemented with a two port memory buffer. Early traffic can be simply checked and delayed. Also, it is scalable with respect to the number of channels C and the total number of buffers N. Moreover, deadline folding technique eliminates the need to extend the deadline resolution. Simulation studies and layout design demonstrate the efficiency and utility of the proposed architecture.

关键词： Hardware Asynchronous transfer mode Communication switching Delay Traffic control Switches Bandwidth Processor scheduling Clocks Telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

A language support environment for complex distributed real-time applications

A language support environment for complex distributed real-...

引用

IEEE International Conference on Engineering of Complex computer Systems

作者： A.D. Stoyen T.J. Marlowe M. Younis P. Petrov Real-Time Computing Laboratory Department of Computer and Information Science New Jersey Institute of Technology Newark NJ USA Department of Mathematics and Computer Science Seton Hall University South Orange NJ USA Allied Signal Aerospace Microelectronics and Technology Center Columbia MD USA

Engineering of complex distributed real-time applications is one of the hardest tasks faced by the software profession today. All aspects of the process, from design to implementation, are made more difficult by the interaction of behavioral and platform constraints. Providing tools for this task is likewise not without major challenges. In this paper, we discuss a tool suite at New Jersey Institute of Technology's real-time computing Lab which supports the development of complex distributed real-time applications in a suitable high-level language (CRL). The suite's component tools include a compiler, a transformer-optimizer, an allocator-migrator, schedulability analyzers, a debugger-monitor, a kernel, and a (simulated) network manager. The overall engineering approach supported by the suite is to provide as simple and natural an integrated development paradigm as possible. The suite tools address complexity due to distribution, scheduling, allocation and other sources in an integrated manner (largely) transparent to the developer. To reflect the needs of propagation of functional and non-functional requirements throughout the development process, a number of robust code transformation and communication mechanisms have been incorporated into the suite. To facilitate practical use of the suite, the developed programs compile-transform to a safe subset of C++ with appropriate libraries and runtime support.

关键词： Application software Process design Distributed computing High level languages Processor scheduling Kernel Computational modeling Analytical models computer network management Robustness

来源：评论

学校读者我要写书评

暂无评论

Scalable hardware priority queue architectures for high-speed packet switches

Scalable hardware priority queue architectures for high-spee...

引用

real-time Technology and Applications Symposium

作者： S.-W. Moon K.G. Shin J. Rexford Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA Network Mathematics Research Networking and Distributed Systems AT and T Research Laboratories Murray Hill NJ USA

In packet-switched networks, queueing of packets at the switches can result when multiple connections share the same physical link. To accommodate a large number of connections, a switch can employ link-scheduling algorithms to prioritize the transmission of the queued packets. Due to the high-speed links and small packet sizes, a hardware solution is needed for the priority queue in order to make the link schedulers effective. But for good performance, the switch should also support a large number of priority levels (P) and be able to buffer a large number of packets (N). So a hardware priority queue design must be both fast and scalable (with respect to N and P) in order to be implemented effectively. In this paper we first compare four existing hardware priority queue architectures, and identify scalability limitations on implementing these existing architectures for large N and P. Based on our findings, we propose two new priority queue architectures, and evaluate them using simulation results from Verilog HDL and Epoch implementations.

关键词： Packet switching Switches Traffic control Scheduling algorithm Asynchronous transfer mode Hardware design languages Communication system traffic control computer architecture Moon real time systems

来源：评论

学校读者我要写书评

暂无评论

Preface

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 1997年 1212卷 I-IV页

作者： Bowen, Jonathan P. Hinchey, Michael G. Till, David The University of Reading Department of Computer Science Whiteknights PO Box 225 Reading Berks United Kingdom New Jersey Institute of Technology Real-Time Computing Laboratory University Heights NewarkNJ United States University of Limerick Dept. of Computer Science and Information Systems National Technological Park Castletroy Limerick Ireland City University Department of Computer Science Northampton Square London United Kingdom

来源：评论

学校读者我要写书评

暂无评论

PRIAM: Polite rescheduler for intelligent automated manufacturing

引用

IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION 1996年第2期12卷 235-245页

作者： Tsukada, TK Shin, KG Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

This paper considers the problem of rescheduling in a decentralized manufacturing system, Flexible manufacturing systems must be able to respond to unexpected disruptions, including schedule disruptions, However, when a cell controller in a decentralized system responds to a disruption, it may disrupt some other cell, because the actions taken at one cell may have some consequence at another cell, In the approach we propose, a controller at a disrupted cell tries to respond in a way which is likely to be least disruptive to other cells, through negotiation with controllers at other cells, This approach, which we call ''polite replanning,'' has the advantage of retaining much of any original distributed plan, while avoiding wide propagation of the disruption through the rest of the system, We apply this concept to the domain of distributed factory rescheduling, and describe PRIAM (polite rescheduler for intelligent automated manufacturing), a ''polite'' rescheduling architecture which is currently under development, Simulation results show that the use of negotiation in ''polite'' rescheduling prevents the wide propagation of disruption from an initial local disruption.

关键词： Manufacturing automation Job shop scheduling Manufacturing systems Control systems Production facilities Flexible manufacturing systems Pulp manufacturing Automatic control computer architecture Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Centralized wireless MAC protocols using slotted ALOHA and dynamic TDD transmission

引用

PERFORMANCE EVALUATION 1996年 27-8卷 331-346页

作者： Choi, SY Shin, KG Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science The University of Michigan Ann Arbor MI 48109-2122 USA

ALOHA scheme with dynamic time Division Duplexed (TDD) transmission is designed and analyzed. A centralized (i.e., star) network is adopted as the topology of a cell which consists of a base station and a number of mobile clients. In dynamic TDD transmission mode, a channel is time-shared for downlink and uplink transmissions under the dynamic access control of the base station. We first propose two MAC protocols (called TDD1 and TDD2) depending on how downlink and uplink transmissions are multiplexed. We then analyze throughput and average delay of TDD1 and an alternative ALOHA scheme using Frequency Division Duplexed (FDD) transmission. Finally, we evaluate the performance of these schemes, and compare TDD1 (calculations), TDD2 (simulations), and FDD (calculations). TDD schemes are found to always work as good as, or better than, FDD. TDD2 is observed to outperform TDD1 with respect to the downlink delay in the presence of light uplink and heavy downlink traffic loads while they work almost the same in other cases.

关键词： wireless LANs and MAC protocol star topology slotted ALOHA dynamic time Division Duplexing (TDD)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：