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

10th IEEE International Conference on Computer and Information Technology, CIT-2010, 7th IEEE International Conference on Embedded Software and Systems, ICESS-2010, 10th IEEE Int. Conf. Scalable computing and Communications, ScalCom-2010

作者： Li, Yusen Cai, Wentong Parallel and Distributed Computing Center School of Computer Engineering Nanyang Technological University Singapore 639798 Singapore

ISBN: (纸本)9780769541082

In distributed virtual environments (DVEs), maintaining a consistent view of the virtual world among all users is a primary task. Due to the resource limitations such as network capacity and computational power, the consistency of the virtual world cannot be guaranteed sometimes. In this paper, we try to address this problem in client-server-based DVEs by considering server side network capacity limitation. We look at the position update packets from client to server and show the impact of packet loss due to server side network capacity limitation on the consistency of the virtual world. We assume clients use Dead Reckoning (DR) models to control position updates. In order to adapt client updates with the server side network capacity to avoid update packet loss, two server assistant DR threshold tuning policies for different updating schemas are proposed in this paper. The proposed tuning polices are validated to have good performance by simulation results. © 2010 IEEE.

关键词： Packet loss

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel Algorithms for Pattern Recognition

引用

parallel Algorithms and Applications 1994年第1-2期2卷 81-98页

作者： Das, Sajal K Fisher, Paul S Zhang, Hua Center for Research in Parallel and Distributed Computing Department of Computer Science University of North Texas Denton TX 76203-6886 United States

Finitely inductive (F1) sequences are a class of sequences, finite or infinite, which are amenable to a certain mathematical representation which has direct significance to pattern recognition and string matching. Pattern recognition using the Fl technique first transforms known patterns into function table(s) by factoring, and then uses the function table(s) to match an input pattern by following. Factoring is done off line and only once for each pattern. The sequential time for matching two sequences depends only upon the length of the input sequence. In this paper, we propose cost-optimal (i.e., efficient) parallel algorithms for FI sequence processing. These algorithms include parallel factoring and following by bucket packing on an exclusive-read and exclusive-write (EREW), parallel random access machine (PRAM) model. The proposed algorithms also have implications lo parallel integer sorting. © 1994, Taylor & Francis Group, LLC. All rights reserved.

关键词： Finitely inductive sequences Integer sorting parallel algorithms Pattern recognition String matching

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

computing DIGITIZED VORONOI DIAGRAMS ON A SYSTOLIC SCREEN AND APPLICATIONS TO CLUSTERING 2nd

COMPUTING DIGITIZED VORONOI DIAGRAMS ON A SYSTOLIC SCREEN AN...

引用

2ND INTERNATIONAL SYMP ON OPTIMAL ALGORITHMS

作者： DEHNE, F Center for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa K1S 5B6 Canada

A systolic screen of size M is a √M × √M mesh-of-processors where each processing element Pij represents the pixel (i,j) of a digitized plane П of √M × √M pixels. In this paper we study the computation ... 详细信息

ISBN: (纸本)3540518592

A systolic screen of size M is a √M × √M mesh-of-processors where each processing element P_ij represents the pixel (i,j) of a digitized plane П of √M × √M pixels. In this paper we study the computation of the Voronoi diagram of a set of n planar objects represented by disjoint images contained in П. We present O(√M) time algorithms to compute the Voronoi diagram for a large class of object types (e.g., points, line segments, circles, ellipses, and polygons of constant size) and distance functions (e.g., all L_p metrices). Since the Voronoi diagram is used in many geometric applications, the above result has numerous consequences for the design of efficient image processing algorithms on a systolic screen. We obtain, e.g., an O(√M) time systolic screen algorithm for “optical clustering”;i.e., identifying those groups of objects in a digitized picture that are “close” in the sense of human perception. © Springer-Verlag Berlin Heidelberg 1989.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel algorithms on interval graphs 4th

Efficient parallel algorithms on interval graphs

引用

4th International parallel Architectures and Languages Europe Conference, PARLE 1992

作者： Das, Sajal K. Chen, Calvin C. -Y. Center for Research in Parallel and Distributed Computing Department of Computer Science University of North Texas DentonTX76203 United States

ISBN: (纸本)9783540555995

We design efficient parallel algorithms for solving several problems on interval graphs. The problems include finding a BFS-tree and DFS-tree, articulation points and bridges, and minimum coloring. Each of our algorithms requires O(log n) time employing O(n) processors on the EREW PRAM model, where n is the number of vertices. The proposed algorithms for computing articulation points and bridges have better performance in terms of the cost (i.e, processor-time product) than the existing algorithms in [RR90], yet having the same time complexity. Our novel approach to the construction of BFS tree is based on elegantly capturing the structure of a given collection of intervals. This structure reveals important properties of the corresponding interval graph, and is found to be instrumental in solving many other problems on such graphs. Although the time- and processor-complexities of the proposed DFS-tree construction or minimum-coloring is comparable with the best-known ones [KI89], our approach to these problems are new. For example, the approach to the construction of a DFS tree is based on reducing the problem into an all dominating neighbors (ADN) problem;while that to the minimum coloring is by transforming this problem into a linked list ranking problem. © Springer-Verlag Berlin Heidelberg 1992.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Managing a parallel heap efficiently 3rd

Managing a parallel heap efficiently

引用

3rd International Conference on parallel Architectures and Languages Europe, PARLE 1991

作者： Das, Sajal K. Horng, Wen-Bing Center for Research in Parallel and Distributed Computing Department of Computer Science University of North Texas DentonTX76203-3886 United States

ISBN: (纸本)9783540541516

We design a cost-optimal algorithm for managing a parallel heap on an exclusive-read and exclusive-write (EREW), parallel random access machine (PRAM) model. This is an improvement in space and time over the one recently proposed by Deo and Prasad [4]. Our approach efficiently employs p processors in the range 1 ≤ p ≤ n, where n is the maximum number of items in a parallel heap. It is assumed that a delete-think-insert cycle is repeatedly performed, and each processor requires an arbitrary but the same amount of time (called the think time) for processing an item which in turn generates at most α (a constant) new items. The time required for deleting p items of the highest priority from the parallel heap is O(l), while that for inserting at most αp new items is 0(logn). With or without incorporating the think time, the speedup of our algorithm is proved to be linear, i.e. 0(p). Using a global, working data structure for each level of the heap, it is shown that the additional memory space required for our parallel heap is much less than that for the existing one [4]. Furthermore, the proposed algorithm retains the strict priority ordering of a sequential heap. © Springer-Verlag Berlin Heidelberg 1991.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

Accurate data and context management in message-passing programs 12th

引用

12th International Workshop on Languages and Compilers for parallel computing, LCPC 1999

作者： Chakrabarti, Dhruva R. Banerjee, Prithviraj Center for Parallel and Distributed Computing ECE Dept Northwestern University 2145 Sheridan Road EvanstonIL60208-3118 United States

ISBN: (纸本)9783540678588

This paper presents a novel scheme for maintaining accurate information about distributed data in message-passing programs. The ability to maintain dynamically the data-to-processor mapping as well as the program contexts at which state changes occur enable a variety of sophisticated optimizations. The algorithms described in this paper are based on the static single assignment (SSA) form of message-passing programs which can be used for performing many of the classical compiler optimizations during automatic parallelization as well as for analyzing user-written message-passing programs. Reaching de_nition analysis is performed on SSA-structures for determining a suitable communication point. The scheme addresses possible optimizations and shows how appropriate representation of the data structures can substantially reduce the associated overheads. Our scheme uniformly handles arbitrary subscripts in array references and can handle general reducible control flow. Experimental results for a number of benchmarks on an IBM SP-2 show a conspicuous reduction in inter-processor communication as well as a marked improvement in the total run-times. We have observed up to around 10-25% reduction in total run-times in our SSA-based schemes compared to non-SSA-based schemes on 16 processors. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

Cost-optimal parallel algorithms for finitely inductive sequences 26

Cost-optimal parallel algorithms for finitely inductive sequ...

引用

26th Hawaii International Conference on System Sciences, HICSS 1993

作者： Das, S.K. Fisher, P.S. Zhang, H. Center for Research in Parallel and Distributed Computing Department of Computer Science University of North Texas DentonTX76203-3886 United States

ISBN: (纸本)0818632305

Finitely inductive (FI) sequences are a class of sequences, finite or infinite, which are amenable to a certain mathematical representation which has direct significance to pattern recognition and string matching. Pattern recognition using the FI technique first transforms known patterns into function table(s) by factoring, and then uses the function iable(s) to match an input pattern by following. Factoring is done off line and only once for each pattern. The sequential time for matching two sequences depends only upon the length of the input sequence. In this paper, we propose cost-optimal (i.e., efficient) parallel algorithms for FI sequence processing. These algorithms include parallel factoring and following by bucket packing and by hashing on an exclusive-read and exclusive-write (EREW), parallel random access machine (PRAM) model. © 1993 IEEE.

关键词： Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：