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

Exploiting web document structure to improve storage management in proxy caches 1

9th International Conference on High Performance computing. HiPC 2002

作者： Abhari, Abdolreza Dandamudi, Sivarama P. Majumdar, Shikharesh Center for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa Canada Deptartment of Systems and Computer Engineering Carleton University Ottawa Canada

ISBN: (数字)9783540362654

ISBN: (纸本)3540003037

Proxy caches are essential to improve the performance of World Wide Web and to enhance user perceived latency. In this paper, we propose a new Web object based policy to manage the storage system of a proxy cache. We propose two techniques to improve the storage system performance. The first technique is concerned with prefetching the related files belonging to a Web object, from the disk to main memory. This prefetching improves performance as most of the files can be provided from the main memory instead of proxy disk. The second technique stores the Web object members in contiguous disk blocks in order to reduce the disk access time. This in turn reduces the disk response time. We have used trace-driven simulations to study the performance improvements one can obtain with these two techniques. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Proxy caches

来源：评论

学校读者我要写书评

暂无评论

An adaptive space-sharing policy for heterogeneous parallel systems 9th

引用

9th International Conference on High-Performance computing.and Networking, HPCN Europe 2001

作者： Zhou, Zhengao Dandamudi, Sivarama P. Manugistics Canada Ottawa Canada Center for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa Canada

ISBN: (纸本)3540422935

As the distributed-memory parallel systems become heterogeneous in nature, it is important to devise scheduling policies that take node heterogeneity into account. Previous studies on this topic have focused on homogeneous systems. In this paper, we propose a new two-level space-sharing policy for heterogeneous systems. The proposed policy is an adaptive space-sharing policy that takes system load and user requirements into account. We compare the performance of the new policy with a previous policy. The results presented here show that the proposed policy provides substantial performance improvements. © Springer-Verlag Berlin Heidelberg 2001.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

A mobile agent prototype for distributed search 3

引用

3rd International Workshop on Mobile Agents for Telecommunication Applications, MATA 2001

作者： Velazquez, Elio Santoro, Nicola Nayak, Amiya Center for Parallel and Distributed Computing School of Computer Science Carleton University OttawaONK1S 5B6 Canada

ISBN: (纸本)3540424601

In this paper, we propose a mobile agent platform as an alternative to a message passing approach to solve a distributed search problem. The search problem is analyzed from two different perspectives, the single travelling agent case and the multiple travelling agents case. We conduct several experiments to measure the performance of the mobile agent solutions as well as the stationary agents for different network topologies and observe that the multiple agents approach performs better when the number of nodes in the network increases. The tree topology, in particular, gives the best overall performance among all topologies considered. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Mobile agents

来源：评论

学校读者我要写书评

暂无评论

A novel application development environment for large-scale scientific computations 00

A novel application development environment for large-scale ...

引用

Proceedings of the 14th international conference on Supercomputing

作者： X. Shen W. Liao A. Choudhary G. Memik M. Kandemir S. More G. Thiruvathukal A. Singh Center for Parallel and Distributed Computing Department of Electrical and Computer Engineering Northwestern University Evanston IL Department of Computer Science and Engineering The Pennsylvania State University University Park PA School of Computing Telecommunications and Information Sciences JHPC Laboratory Depaul University

Our results demonstrate that our novel application development environment provides both ease-of-use and high performance for large-scale, I/O-intensive scientific applications.

ISBN: (纸本)9781581132700

Our results demonstrate that our novel application development environment provides both ease-of-use and high performance for large-scale, I/O-intensive scientific applications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Buffer management in wormhole-routed torus multicomputer networks 7th

Buffer management in wormhole-routed torus multicomputer net...

引用

7th International Conference on High-Performance computing.and Networking, HPCN Europe 1999

作者： Kotapati, Kamala Dandamudi, Sivarama P. Newbridge Networks Kanata Canada Center for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa Canada

ISBN: (纸本)3540658211

This paper focuses on buffer management issues in wormhole-routed torus multicomputer networks. The commonly used buffer organizations are the centralized and dedicated buffer organizations. The results presented in this paper indicate that the dedicated buffer organization provides better performance than the centralized organization under uniform traffic. Under high hot-spot traffic, the centralized organization outperforms the dedicated. The hybrid buffer organization proposed in this paper inherits the merits of the centralized and distributed organizations. The results presented suggest that the hybrid buffer organization can be designed to configure dynamically from the dedicated to centralized depending on the traffic conditions. © Springer-Verlag Berlin Heidelberg 1999.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

Centralized architecture for parallel query processing on networks of workstations 7th

Centralized architecture for parallel query processing on ne...

引用

7th International Conference on High-Performance computing.and Networking, HPCN Europe 1999

作者： Zeng, Sijun Dandamudi, Sivarama P. CrossKeys System Corporation Kanata Canada Center for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa Canada

ISBN: (纸本)3540658211

Network of workstations (NOW) is a cost-effective alternative to a multiprocessor system. Here we propose a centralized architecture for parallel query processing on network of workstations. We describe a three-level processing strategy and evaluate its performance. The top two levels use a space-sharing technique to assign a partition to a query. The third-level uses a chunk-based load sharing policy to accommodate dynamic local load present on the workstations. To evaluate the performance of this three-level strategy, we have implemented it using PVM on a Pentium-based NOW. © Springer-Verlag Berlin Heidelberg 1999.

关键词： Cost effectiveness

来源：评论

学校读者我要写书评

暂无评论

Design decision support system for the engineering/re-engineering of complex naval systems

引用

NAVAL ENGINEERS JOURNAL 1997年第4期109卷 23-33页

作者： Graham, JH Ragade, RK Shea, J James H. Graham:is the Henry Vogt Professor of computer science and engineering at the University of Louisville. Previous professional employment includes positions at Rensselaer Polytechnic Institute and General Motors Corporation. He received his master's and doctoral degrees at Purdue University and his bachelor's degree at Rose-Hulman Institute of Ethnology. His research interests include artificial intelligence robotics and paraliel computing. Rammohan K. Ragade:is professor of engineering mathematics and computer science at the University of Louisville. He received his Ph.D. from the Indian Institute of Technology at Kampur in 1968. He has been a faculty member at the University of Waterloo and held an engineering position with Bell Northern Research. His research interests include human-computer interaction decision support systems object-oriented simulation and modeling distributed database systems and fuzzy logic. John G. Shea Jr.:served until 1995 as a project manager in the Phalanx Engineering Section of Naval Surface Warfare Center Crane Division Louisville Station. He received his bachelor's and master's degrees from the Speed Scientific School at the University of Louisville. He was a member of the American Society of Naval Engineers.

Hybrid simulation includes both functional computer software models and actual hardware subsystems operating as an integrated whole. A ''hot test bed'' or a ''hybrid simulator-emulator'' enables design engineers to evaluate conceptual models in a more realistic real-lime context, but places increased cognitive demands on the designer. This paper describes an architecture, and results from a prototype implementation, for a design decision support system to allow a designer to make more productive and cost effective use of a test bed system.

关键词： Decision support systems

来源：评论

学校读者我要写书评

暂无评论

ON RELIABILITY ANALYSIS OF CHORDAL RINGS

引用

Journal of Circuits, Systems and computers 1995年第2期5卷 199-213页

作者： AMIYA NAYAK NICOLA SANTORO Center for Parallel & Distributed Computing School of Computer Science Carleton University Ottawa Canada K1S 5B6 Canada

A common technique to improve the reliability of loop (or ring) networks is by introducing link redundancy; that is, by providing several alternative paths for communication between pairs of nodes. With alternate paths between nodes, the network can now sustain several node and link failures by bypassing the faulty components. However, faults occurring at strategic locations in a ring can prevent the computation by disrupting I/O operations, blocking the flow of information, or even segmenting the structure into pieces which can no longer be suitable for any practical purpose. An extensive characterization of fault-tolerance in ring topologies is given in this paper. This characterization augments the results known in the literature to date. The characterization has revealed several properties which describe the problem of constructing subrings and linear arrays in the presence of node failures in the original ring for a specified link configuration. Also in this paper, bounds are established on the degree of fault tolerance achievable in a redundant loop network, with a given degree of redundancy, when performing a computation that requires a minimal number of operational nodes. Also the bounds on the size of the problems guaranteed to be solved in the presence of a given number of faults in the network are derived.

关键词：

来源：评论

学校读者我要写书评

暂无评论

parallel fractional cascading on hypercube multiprocessors

引用

Computational Geometry: Theory and Applications 1992年第3期2卷 141-141页

作者： Dehne, F. Ferreira, A. Rau-Chaplin, A. Center for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa Canada K1S 5B6 CNRS-Laboratoire de l'Informatique du Parallelisme Ecole Normale Superieure de Lyon 69364 Lyon cedex 07 France

Dehne, F., A. Ferreira and A. Rau-Chaplin, parallel fractional cascading on hypercube multiprocessors, Computational Geometry: Theory and Applications 2 (1992) 141–167. In this paper we present a new data-structuring technique for parallel computational geometry on a hypercube multiprocessor. This technique, called hypercube cascading, is an efficient parallel implementation of fractional cascading for the hypercube multiprocessor. That is, it allows complex data structures with catalogs to be traversed efficiently in parallel by a large number of simultaneous queries. We show that for monotone graphs with n nodes, m multiple look-up queries with path length at most p (including catalog look-ups) can be executed independently, in parallel, in time O( p log N + t s ( N )) on a hypercube multiprocessor of size N = max n, itm . The term t s ( N ) denotes the time for sorting N elements on a hypercube of size N ; currently t s ( N ) = O(log N log log N ). Note that, the best known sequential time complexity for one multiple look-up query, as presented by Chazelle and Guibas, is O( p + log N ). Our solution allows an arbitrary number of search queries to access the same node and its catalog at the same time. We present two parallel computational geometry applications of this technique: multiple stabbing of a simple polygonal path and multiple slanted range search.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient construction of catastrophic patterns for VLSI reconfigurable arrays with bidirectional links 4

Efficient construction of catastrophic patterns for VLSI rec...

引用

4th International Conference on computing.and Information, ICCI 1992

作者： Nayak, Amiya Pagli, Linda Santoro, Nicola Center for Parallel and Distributed Computing School of Computer Science Carleton University OttawaKlS 5B6 Canada Dipartimento di Scienze dell'Informazione University of Pisa Corso Italia 40 Pisa56100 Italy

ISBN: (纸本)081862812X

Patterns of faults that are catastrophic for regular architectures, particularly the systolic arrays, have been studied. For a given link configuration, there are many fault patterns which are catastrophic. Among those, there is a particular fault pattern, called the reference fault pattern, which is crucial for the development of testing techniques;furthermore, the efficiency of any testing algorithm can be further improved in the presence of efficient algorithms for constructing the reference fault pattern. In this paper, we develop a new algorithm for the construction of the reference fault pattern for VLSI reconfigurable arrays in which the links are bidirectional. The complexity of the new algorithm is 0(kN) which is a significant improvement over the existing 0(N2) algorithm, where k is the number of bypass links, and N is the length of the largest bypass link. ©1992 IEEE.

关键词： Systolic arrays

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：