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

ACM/IFIP/USENIX 6th International Middleware Conference, Middleware 2005

作者： Raman, Krishna Zhang, Yue Panahi, Mark Colmenares, Juan A. Klefstad, Raymond Harmon, Trevor Department of Electrical Engineering and Computer Science University of California Irvine CA 92697 United States Applied Computing Institute College of Engineering University of Zulia

ISBN: (纸本)3540303235

Distributed real-time and embedded (DRE) applications possess stringent quality of service (QoS) requirements, such as predictability, latency, and throughput constraints. Real-Time CORBA, an open middleware standard, allows DRE applications to allocate, schedule, and control resources to ensure predictable end-to-end QoS. The Real-Time Specification for Java (RTSJ) has been developed to provide extensions to Java so that it can be used for real-time systems, in order to bring Java's advantages, such as portability and ease of use, to real-time applications. In this paper, we describe RTZen, an implementation of a Real-Time CORBA Object Request Broker (ORB), designed to comply with the restrictions imposed by RTSJ. RTZen is designed to eliminate the un-predictability caused by garbage collection and improper support for thread scheduling through the use of appropriate data structures, threading models, and memory scopes. RTZen's architecture is also designed to hide the complexities of RTSJ related to distributed programming from the application developer. Empirical results show that RTZen is highly predictable and has acceptable performance. RTZen therefore demon-strates that Real-Time CORBA middleware implemented in real-time Java can meet stringent QoS requirements of DRE applications, while supporting safer, easier, cheaper, and faster development in real-time Java. © IFIP International Federation for Information processing 2005.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

Can get satisfactionAssociated Content

引用

Nature 2005年第7043期435卷 751-752页

作者： Carla P. Gomes Bart Selman Departments of Applied Economics and Management and of Computer Science Faculty of Computing and Information Science Department of Computer Science Cornell University Ithaca USA

来源：评论

学校读者我要写书评

暂无评论

A hybrid hardware/software approach to efficiently determine cache coherence bottlenecks 05

A hybrid hardware/software approach to efficiently determine...

引用

ICS05 - 19th ACM International Conference on Supercomputing

作者： Marathe, Jaydeep Mueller, Frank De Supinski, Bronis Department of Computer Science North Carolina State University Raleigh NC 27695-7534 Lawrence Livermore National Laboratory Center for Applied Scientific Computing L-561 Livermore CA 94551

ISBN: (纸本)9781595931672

High-end computing increasingly relies on shared-memory multiprocessors (SMPs), such as clusters of SMPs, nodes of chipmultiprocessors (CMP) or large-scale single-system image (SSI) SMPs. In such systems, performance is often affected by the sharing pattern of data within applications and its impact on cache coherence. Sharing patterns that result in frequent invalidations followed by subsequent coherence misses create cache coherence bottlenecks with significant performance penalties. Past work on identifying coherence bottlenecks based on tracing memory accesses incurs considerable runtime overhead and does not scale well with increasing problem sizes, which makes it infeasible to use with real-world programs. In this paper, we introduce a novel low-cost, hardware-assisted approach to determine coherence bottlenecks in shared-memory OpenMP applications. We assess the merits of our approach on a contemporary SMP platform. Specifically, we assess the feasibility of lossy tracing to pin-point coherence problems in applications. We evaluate the qualitative and quantitative trade-offs between tracing overhead and accuracy of the generated coherence traffic metrics, correlated to memory access points at the program source level. Our lossy tracing mechanism closely approximates the degree of accuracy of determining coherence misses in full traces for most of the benchmarks we study while reducing run-time execution overhead and trace sizes by one to two orders of magnitude. To the best of our knowledge, this novel method significantly outperforms any of the prior approaches and, for the first time, makes cache coherence analysis feasible for long-running applications. Copyright © 2005 ACM.

关键词： Buffer storage

来源：评论

学校读者我要写书评

暂无评论

Accelerated Warmup for Sampled Microarchitecture Simulation

引用

ACM Transactions on Architecture and Code Optimization 2005年第1期2卷 78-108页

作者： Haskins, John W. Skadron, Kevin Center for Computing Sciences 17100 Science Drive Bowie MD 20715-4300 United States Department of Computer Science School of Engineering and Applied Science University of Virginia Charlottesville 151 Engineer's Way PO Box 400740 VA 22904-4740. United States

To reduce the cost of cycle-accurate software simulation of microarchitectures, many researchers use statistical sampling: by simulating only a small, representative subset of the end-to-end dynamic instruction stream in cycle-accurate detail, simulation results complete in much less time than simulating the cycle-by-cycle progress of an entire benchmark. In order for sampled simulation results to accurately reflect the nature the full dynamic instruction stream, however, state in the simulated cache and branch predictor must match or closely approximate state as it would have appeared had cycle-accurate simulation been used for the entire simulation. Researchers typically address this issue by prefixing a period of warmup—in which cache and branch predictor state are modeled in addition to programmer-visible architected state—to each cluster of contiguous instructions in the sample. One conservative, but slow approach is to always simulate cache and branch predictor state, whether among the cycle-accurate clusters, or among the instructions preceding each cluster. To save time, warmup heuristics have been proposed, but there is no one-size-fits-all heuristic for any benchmark. More rigorous, analytical warmup approaches are necessary in order to balance the requirements of high accuracy and rapidity from sampled simulations. This paper explores this issue and in particular demonstrates the merits of memory reference reuse latency (MRRL). Relative to the IPC measured by modeling all precluster cache and branch predictor activity, MRRL generated an average error in IPC of less than 1% and simultaneously reduced simulation running times by an average of approximately 50% (or 95% of the maximum potential speedup). © 2005, ACM. All rights reserved.

关键词： Measurement Performance Reuse latency Sampled simulation Warmup

来源：评论

学校读者我要写书评

暂无评论

A closed-loop rate-based contention control for optical burst switched networks

A closed-loop rate-based contention control for optical burs...

引用

GLOBECOM'05: IEEE Global Telecommunications Conference, 2005

作者： Farahmand, Farid Zhang, Qiong Jue, Jason P. Department of Computer Electronics and Graphics Technology Central Connecticut State University New Britain CT 06050 Mathematical Sciences and Applied Computing Arizona State University West United States Department of Computer Science University of Texas at Dallas Richardson TX 75083

ISBN: (纸本)0780394143

In this paper we describe a rate-based OBS network architecture in which core switch nodes send explicit messages to edge nodes requesting them to reduce their transmission rate on congested links. Within this framework, we introduce a new contention avoidance mechanism called proportional control algorithm with explicit reduction request (PCwER). Through source rate control, PCwER proactively attempts to prevent the network from entering the congestion state. Basic building blocks and performance trade-offs of PCwER are the main focus of this paper. In addition, through a simple fluid model we analyze the characteristics of the algorithm. Our simulation results show that the proposed contention avoidance techniques improve the network utilization and reduce the packet loss probability.

关键词： Closed loop control systems

来源：评论

学校读者我要写书评

暂无评论

Automatic generation of data types for classification of deep web sources

Automatic generation of data types for classification of dee...

引用

Second International Workshop on Data Integration in the Life sciences, DILS 2005

作者： Ngu, Anne H.H. Buttler, David Critchlow, Terence Department of Computer Science Texas State University San Marcos TX 78666 United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory Livermore CA 94551 United States

ISBN: (纸本)3540279679

A Service Class Description (SCD) is an effective meta-data based approach for discovering Deep Web sources whose data exhibit some regular patterns. However, it is tedious and error prone to create an SCD description manually. Moreover, a manually created SCD is not adaptive to the frequent changes of Web sources. It requires its creator to identify all the possible input and output types of a service a priori. In many domains, it is impossible to exhaustively list all the possible input and output data types of a source in advance. In this paper, we describe machine learning approaches for automatic generation of the data types of an SCD. We propose two different approaches for learning data types of a class of Web sources. The Brute-Force Learner is able to generate data types that can achieve high recall, but with low precision. The Clustering-based Learner generates data types that have a high precision rate, but with a lower recall rate. We demonstrate the feasibility of these two learning-based solutions for automatic generation of data types for citation Web sources and presented a quantitative evaluation of these two solutions. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

Self-adapting Linear Algebra algorithms and software

Self-adapting Linear Algebra algorithms and software

引用

作者： Demmel, James Dongarra, Jack Eijkhout, Victor Fuentes, Erika Petitet, Antoine Vuduc, Richard Whaley, R.Clint Yelick, Katherine Computer Science Division Electrical Engineering and Computer Science Department University of California Berkeley CA 94720 United States Computer Science Department University of Tennessee Knoxville TN 37996 United States Computer Science and Mathematics Division Oak Ridge National Laboratory Oak Ridge TN 37831 United States Computer Science Department Rice University Houston TX United States Innovative Computing Laboratory University of Tennessee Knoxville TN 37996 United States Sun Microsystems Paris 75016 France Center for Applied Scientific Computing Lawrence Livermore National Laboratory Livermore CA 94551 United States Department of Computer Science Florida State University Tallahassee FL 32306-4530 United States Electrical Engineering and Computer Science Department University of California Berkeley CA 94720 United States

One of the main obstacles to the efficient solution of scientific problems is the problem of tuning software, both to the available architecture and to the user problem at hand. We describe approaches for obtaining tuned high-performance kernels and for automatically choosing suitable algorithms. Specifically, we describe the generation of dense and sparse Basic Linear Algebra Subprograms (BLAS) kernels, and the selection of linear solver algorithms. However, the ideas presented here extend beyond these areas, which can be considered proof of concept. © 2005 IEEE.

关键词： Linear algebra

来源：评论

学校读者我要写书评

暂无评论

Novel queueing model for multimedia over downlink in 3.5G wireless network

Novel queueing model for multimedia over downlink in 3.5G wi...

引用

12th Analytical and Stochastic Modelling Techniques and Application Conference, ASMTA 2005

作者： Al-Begain, Khalid Dudin, Alexander N. Mushko, Vilena V. Mobile Computing Communications and Networking RG School of Computing University of Glamorgan Pontypridd Cardiff CF-37 1DL United Kingdom Laboratory of Applied Probabilistic Analysis Department of Applied Mathematics and Computer Science Belarusian State University F. Skorina Ave. 4 Minsk-50 200050 Belarus

ISBN: (纸本)1842331167

In this paper, the model for multimedia transmission over downlink in 3.5G wireless network in terms of a queue with two priority classes, one of which has time priority while the another has space priority, is formulated. The input is described by the Batch Marked Markov Arrival Process (BMMAP). Service time distributions are of PH (phase) type dependent on the class of a customer. The buffer is finite, but the customers of a class having higher priority for taking into the service from a buffer (time priority) can occupy only a part of this buffer. Queueing system's behavior is described in terms of multi-dimensional continuous time skip-free to the left Markov chain. It allows to exploit an effective algorithm for calculation of the stationary distribution of the queueing system. Loss probability for customers of both classes is calculated. © ECMS 2005.

关键词： Wireless networks

来源：评论

学校读者我要写书评

暂无评论

A novel data mining algorithm based on ant colony system

A novel data mining algorithm based on ant colony system

引用

International Conference on Machine Learning and Cybernetics, ICMLC 2005

作者： Jiang, Wei-Jin Xu, Yu-Hui Xu, Yu-Sheng Department of Computer Zhuzhou Institute of Technology Zhuzhou 412008 China Department of Information and Computing Science Zhuzhou Institute of Technology Zhuzhou 412008 China College of Mechanical Engineering and Applied Electronics Beijing University of Technology Beijing 100022 China

ISBN: (纸本)078039092X

Data mining has become of great importance owing to ever-increasing amounts of data collected by large organizations. This paper propose an data mining algorithm called Ant-Miner(I),which is based on an improvement of Ant Colony System(ACS) algorithm. Experimental results show that Ant-Miner(I) has a higher predictive accuracy and much smaller rule list than the original Ant-Miner algorithm. © 2005 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

A new theory which is based on web service's mobile agent

A new theory which is based on web service's mobile agent

引用

International Conference on Machine Learning and Cybernetics, ICMLC 2005

作者： Jiang, Wei-Jin Xu, Yu-Hui Tang, Wen-Ping Department of Computer Zhuzhou Institute of Technology Zhuzhou 412008 China Department of Information and Computing Science Zhuzhou Institute of Technology Zhuzhou 412008 China College of Mechanical Engineering and Applied Electronics Beijing University of Technology Beijing 100022 China

ISBN: (纸本)078039092X

Mobile agent and web service are promising new technologies with bright future, and have wide application in aspect of scientific study as well as in engineering industry. Meanwhile they both have deficiencies. The paper first analyzes the similarities and differences between these two technologies by example, then engages in attempting to integrate these two technologies into a totally new technology, called agenice (agent and service), a kind of intelligence service. These are aspects' discussion: 1)VM and IL, translate the agent classes which are programmed by other languages such as Java to interface language for running on multi-OS and multi-platform;2) AML, the agenice description language based on semantics;3) mobility, the way to transfer agenices code and state. © 2005 IEEE.

关键词： Intelligent agents

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：