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

International Conference on Distributed computing Systems

作者： Haining Wang K.G. Shin Department of Electrical Engineering and Computer ScienceReal-Time Computing Laboratory University of Michigan Ann Arbor MI USA

ISBN: (纸本)0769510779

Presents a new robust TCP (Transmission Control Protocol) congestion recovery scheme to (1) handle bursty packet losses while preserving the self-clocking capability; (2) detect a TCP connection's new equilibrium during congestion recovery, thus improving both link utilization and effective throughput; and (3) make the TCP behavior during congestion recovery very close to that during congestion avoidance, thus "extending" the performance model for congestion avoidance to that for TCP loss recovery. Furthermore, the new recovery scheme requires only a slight modification to the sender side of TCP implementation, thus making it widely deployable. The performance of the proposed scheme is evaluated for scenarios with many TCP flows under the drop-tail and RED (random early detection) gateways in the presence of bursty packet losses. The evaluation results show that the new scheme achieves at least as great a performance improvement as TCP SACK (Selective ACKnowledgments) and consistently outperforms TCP New-Reno. Moreover, its steady-state TCP behavior is close to the ideal TCP congestion behavior. Since the proposed scheme does not require selective acknowledgments nor receiver modifications, its implementation is much simpler than TCP SACK.

关键词： Robustness Performance loss IP networks Internet Protocols Large-scale systems Laboratories Throughput Electronic mail World Wide Web

来源：评论

学校读者我要写书评

暂无评论

Model-based control for reconfigurable manufacturing systems

Model-based control for reconfigurable manufacturing systems

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： K. Ohashi K.G. Shin Industrial Electronics & Systems Laboratory Mitsubishi Electric Corporation Limited Amagasaki Hyogo Japan Real-Time Computing Laboratory Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

ISBN: (纸本)0780365763

The manufacturing industry cannot stay competitive and survive in today's market without agile adaptation to rapidly changing customers' demands. This in turn requires manufacturing systems to be reconfigurable for timely introduction of new products in the market. Unfortunately, at present, the system designers cannot systematically and completely manage their design data, because manufacturing systems have gradually become too large and too complicated to manage. In order to reconfigure and reuse H/W and S/W components in manufacturing systems, and improve the engineering environment of system control design, we propose a model-based control design using state transition diagrams and a general graph description, while taking reconfiguration and reuse of design data into account. We demonstrate the utility of the proposed approach using a real application.

关键词： Manufacturing systems Control design Laboratories Industrial electronics computer aided manufacturing computer science Manufacturing industries Agile manufacturing Data engineering Design engineering

来源：评论

学校读者我要写书评

暂无评论

Implementation and evaluation of a best-effort scheduling algorithm in an embedded real-time system

Implementation and evaluation of a best-effort scheduling al...

引用

IEEE International Symposium on Performance Analysis of Systems and Software

作者： Peng Li B. Ravindran T. Hegazy Real Time Systems Laboratory The Bradley Department of Electrical and Computer Engineering Virginia Polytechnic Institute and State University Blacksburg VA USA

ISBN: (纸本)0780372301

This paper describes an implementation and the performance evaluation of the DASA/ND best-effort scheduling algorithm [4] in the μClinux/μCsimm micro-controller system. Experimental results under synthetic workload show that in some cases, the DASA/ND scheduler outperforms both the EDF (Earliest Deadline First) and the RMS (Rate Monotonic Scheduling) schedulers [7]. Meanwhile, the system performance gracefully degrades as the aggregate CPU load increases. However, the scheduling overhead, in general, is not negligible, which may lead to poorer performance than non best-effort scheduling algorithms. It is found that the scheduling overhead strongly depends on the task set properties. Using the Regression Analysis technique, we developed a statistical model accounting for the scheduling overhead. We show that this model, combined with a simulation tool can well predict the system performance.

关键词： Scheduling algorithm real time systems Neodymium Predictive models System performance Degradation Aggregates Regression analysis Analytical models Operating systems

来源：评论

学校读者我要写书评

暂无评论

EDF scheduling using two-mode voltage-clock-scaling for hard real-time systems 2

EDF scheduling using two-mode voltage-clock-scaling for hard...

引用

2nd International Conference on Compilers, Architecture, and Synthesis for Embedded Systems, CASES 2001

作者： Lee, Yann-Hang Doh, Yoonmee Krishna, C.M. Dept. of Computer Science and Engineering Arizona State University TempeAZ85287-5406 United States Real-Time Systems Research Lab. CISE Department Univ. of Florida GainesvilleFL32611-6120 United States Electrical and Computer Eng. University of Massachusetts AmherstMA01003 United States

ISBN: (纸本)1581133995

Scaling down power supply voltage yields a quadratic reduction in dynamic power dissipation and also requires a reduction in clock frequency. In order to meet task deadlines in hard real-time systems, the delay penalty in voltage scaling needs to be carefully considered to achieve low power consumption. In this paper, we focus on dynamic reclaiming of early released resources in Earliest Deadline First (EDF) scheduling using voltage scaling. In addition to a static voltage assignment, we propose a new dynamic-mode assignment, which has a flexible voltage mode setting at run-time enabling much larger energy savings. Using simulation results and exploiting the interplay between power supply voltage, frequency, and circuit delay in CMOS technology, we find the optimal twolevel voltage settings that minimize energy consumption. Copyright 2001 ACM.

关键词： real time systems

来源：评论

学校读者我要写书评

暂无评论

Geometric scheduling of 2-D uniform dependence loops

Geometric scheduling of 2-D uniform dependence loops

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： I. Drositis T. Andronikos A. Kokorogiannis G. Papakonstantinou N. Koziris Computing Systems Laboratory Computer Science Division Department of Electrical and Computer Engineering National and Technical University of Athens Athens Greece

ISBN: (纸本)0769511538

One of the primary tasks in the area of uniform dependence loops, is predicting the execution propagation, as well as finding an optimal time schedule. In this work, the problem of scheduling using wavefront prediction is presented. The geometric concepts of time instance subspaces and execution pattern are introduced. A quite simple and low complexity scheduling algorithm is presented. The index space is split into geometric subspaces and any point can be located in them. Each point is then scheduled according to the subspace where it belongs.

关键词： Processor scheduling Delay effects Shape Terminology Laboratories computer science Polynomials Costs

来源：评论

学校读者我要写书评

暂无评论

On developing and verifying design abstractions for reliable concurrent programming in Ada 00

On developing and verifying design abstractions for reliable...

引用

Proceedings of the 10th international workshop on real-time Ada workshop

作者： A. Burns A. J. Wellings A. M. Koelmans M. Koutny A. Romanovsky A. Yakovlev Real-Time Systems Research Group Department of Computer Science University of York U.K. Asynchronous Systems Laboratory Department of Computing Science University of Newcastle upon Tyne U.K.

ISBN: (纸本)9781450373272

Ada 95 is an expressive concurrent programming language, which allows building large multi-tasking applications. Much of the complexity of these applications stems from the interactions between the tasks. Design abstractions (such as atomic actions, conversations etc.) have been proposed to deal with such complexity. This paper argues that Petri nets offer a promising, tool-supported, technique for checking the logical correctness of abstractions. The paper illustrates the effectiveness of this approach by showing the correctness of an Ada implementation of the atomic action protocol using a variety of Petri net tools.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Exploiting Locality in Single Assignment Data Structures Updated Through Split-Phase Transactions

引用

Cluster computing 2001年第4期4卷 281-293页

作者： Amaral, José Nelson Lin, Wen-Yen Gaudiot, Jean-Luc Gao, Guang R. Department of Computing Science University of Alberta Edmonton Canada Tia Mobile Inc. Pasadena USA Department of Electrical Engineering University of Southern California Los Angeles USA Computer Architecture and Parallel Systems Laboratory Department of Electrical and Computer Engineering University of Delaware Newark USA

We present the design, implementation, and evaluation of single assignment data structures and of a software controlled cache in an existing multi-threaded architecture platform – the Efficient Architecture for Running Threads (EARTH). The I-Structure Software-Controlled Cache (ISSC) exploits temporal and spatial locality of EARTH split-phased memory transactions for single-assignment memory references. Our experimental evaluation indicates that the caching mechanism for single-assignment storage makes the EARTH memory system more robust to variations in the latency of memory operations. As a consequence the system can be ported to a wider range of machine platforms and deliver speedup for both regular and irregular application.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Reducing OS overhead for real-time industrial controllers with adjustable timer resolution

Reducing OS overhead for real-time industrial controllers wi...

引用

IEEE International Symposium on Industrial Electronics (ISIE)

作者： Tae Rim Park Jae Hyun Park Wook Hyun Kwon Control Information Systems Laboratory School of Electrical Engineering and Computer Science Seoul National University Seoul South Korea Real-time Embedded Systems Laboratory School of Information and Communication Engineering Inha University Incheon South Korea

ISBN: (纸本)0780370902

In this paper, a new method, named adjustable timer resolution (ATR) is proposed to control tasks in a timely manner, with enhanced performance on real-time operating systems. It prevents useless execution of the timer interrupt service routine (ISR). Features of the proposed method are compared with the conventional method, and the schedulability is analyzed to estimate the performance. As an implementation model, uC/OS-II is modified and ported to a power PC processor system. The metrics and results of the model are presented and discussed.

关键词： Industrial control real time systems Control systems Operating systems Communication system control Performance analysis Embedded system Processor scheduling Power system modeling time factors

来源：评论

学校读者我要写书评

暂无评论

Discovery of parallel scheduling algorithms in cellular automata - based systems 15

Discovery of parallel scheduling algorithms in cellular auto...

引用

15th International Parallel and Distributed Processing Symposium, IPDPS 2001

作者： Seredyński, F. Świȩcicka, A. Zomaya, A.Y. Polish -Japanese Institute of Information Technologies Koszykowa 86 Warsaw02-008 Poland Institute of Computer Science Polish Academy of Sciences Ordona 21 Warsaw01-237 Poland Department of Computer Science Bialystok University of Technology Wiejska 45A Bialystok15-351 Poland Parallel Computing Research Laboratory Department of Electrical and Electronic Engineering University of Western Australia Nedlands PerthWA6907 Australia

ISBN: (纸本)0769509908

In this paper we report new results concerning developing parallel multiprocessor scheduling algorithms working in cellular automata (CAs) - based scheduler. We consider the simplest case when a multiprocessor system is limited to two processors, but we not imply any limitations on a size and parameters of parallel programs. We use an approach called a selected neighborhood to design a nonlinear structure of CAs for a given program graph. We propose to use coevolutionary genetic algorithm (GA) to discover rules of parallel CAs, suitable for solving the scheduling problem. We compare sequential and parallel scheduling algorithms discovered in the context of CAs - based scheduling system. © 2001 IEEE.

关键词： Cellular automata

来源：评论

学校读者我要写书评

暂无评论

Discovery of parallel scheduling algorithms in cellular automata - based systems

Discovery of parallel scheduling algorithms in cellular auto...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： F. Seredynski A. Swiecicka A.Y. Zomaya Polish Japanese Institute of Information Technology Warsaw Poland Institute of Computer Science Polish Academy of Sciences Warsaw Poland Department of Computer Science Bialystok University of Technology Bialystok Poland Parallel Computing Research Laboratory Department of Electrical and Electronic Engineering University of Western Australia Australia

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：