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

proceedings of the advances in parallel and distributed computing

作者： Sangyoon Lee Chan-Ik Park Chan-Mo Park Department of Computer Science and Engineering PRL POSTECH Pohang South Korea

ISBN: (纸本)0818678763

Delaunay triangulation has been much used in such applications as volume rendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulation is large computation time required to obtain the triangulation on an input points set. This time can be reduced by using more than one processor, and several parallel algorithms for Delaunay triangulation have been proposed. In this paper, we propose an improved parallel algorithm for Delaunay triangulation, which partitions the bounding convex region of the input points set into a number of regions by using Delaunay edges and generates Delaunay triangles in each region by applying an incremental construction approach. Partitioning by Delaunay edges makes it possible to eliminate merging step required for integrating subresults. It is shown from the experiments that the proposed algorithm has good load balance and is more efficient than Cignoni et al.'s algorithm (1993) and our previous algorithm (1996).

关键词： parallel algorithms Concurrent computing distributed computing Partitioning algorithms parallel processing Shape Merging Solid modeling Computer science Rain

来源：评论

学校读者我要写书评

暂无评论

Large-scale structural analysis using domain decomposition method on distributed parallel computing environment

Proceedings of the Conference on High Performance Computing ...

引用

proceedings of the conference on High Performance computing on the Information Superhighway, HPC Asia'97 1997年 573-578页

作者： Kim, Seung Jo Kim, Jeong Ho Seoul Natl Univ Seoul Korea Republic of

distributed parallel computing, which uses general-purpose workstations connected by a network as a large parallel computing resource, is one of the most promising trends in parallel computing. By this technique, the existing computing resources can be utilized effectively and the super-computing power can be achieved through the networked workstations without additional expenditures to buy the expensive supercomputers. In this work, parallel finite element method using domain decomposition technique has been adapted to the distributed parallel environment of networked workstations. Using the developed code, several model problems have been solved and the parallel performances have been tested on the network of eight IBM RS/6000 230 workstations. Finally, very large size of structural analysis problem over 368,000 DOFs has been solved using 36 IBM RS/6000 380 workstations connected by a network.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

PLAPA CK: parallel linear algebra package design overview 97

PLAPA CK: Parallel linear algebra package design overview

引用

1997 ACM/IEEE conference on Supercomputing, SC 1997

作者： Alpatov, Philip Baker, Greg Edwards, Carter Gunnels, John Morrow, Greg Overfelt, James Van De Geijn, Robert Wu, Yuan-Jye J. University of Texas Austin TX 78712 United States Argonne National Laboratory Argonne IL 60439 United States

ISBN: (纸本)0897919858

Over the past twenty years, dense linear algebra libraries have gone through three generations of public domain general purpose packages. In the seventies, the first generation of packages were EISPACK and LINPACK, which implemented a broad spectrum of algorithms for solving dense linear eigenproblems and dense linear systems. In the late eigh ties, the second generation package called LAPACK was developed. This package attains high performance in a portable fashion while also improving upon the functionality and robustness of LINPACK and EISPACK. Finally, since the early nineties, a third generation package which ports LAPACK to distributed memory networks of computers has been underway as part of the ScaLAPACK project. PLAPACKis a maturing fourth generation package which uses a more application-centric view of vector and matrix distribution, Physically Based Matrix Distribut ion. It also uses an \MPI-like" programming interface that hides distribution and indexing details in opaque objects, provides a natural layering in the library, and provides a straight-forward application interface. In this paper, we give an overview of the design of PLAPACK. © 1997 ACM.

关键词： Linear systems

来源：评论

学校读者我要写书评

暂无评论

Fast parallel algorithm for finding the kth longest path in a tree

Fast parallel algorithm for finding the kth longest path in ...

引用

proceedings of the advances in parallel and distributed computing

作者： Hong Shen School of Computing and Information Technology Griffith University QLD Australia

ISBN: (纸本)0818678763

We present a fast parallel algorithm running in O(log/sup 2/n) time on a CREW PRAM with O(n) processors for finding the kth longest path in a given tree of n vertices (with /spl Theta/(n/sup 2/) intervertex distances). Our algorithm is obtained by efficient parallelization of a sequential algorithm which is a variant of both N. Megiddo et al.'s algorithm and G.N. Fredrickson et al.'s algorithm based on centroid decomposition of tree and succinct representation of the set of intervertex distances. With the same time and space bound as the best known result, our sequential algorithm maintains a shorter length of the decomposition tree.

关键词： parallel algorithms Phase change random access memory Sorting Merging Concurrent computing Information technology Network address translation Matrix decomposition Computer science Data structures

来源：评论

学校读者我要写书评

暂无评论

parallel replacement mechanism for multithread

Parallel replacement mechanism for multithread

引用

proceedings of the advances in parallel and distributed computing

作者： Guangzuo Cui Mingzeng Hu Xiaoming Li Harbin Institute of Technology Northeast Parallel Architecture Center USA

ISBN: (纸本)0818678763

This paper presents a new rapid thread replacement mechanism which is important in multithread technology. Analysis to the memory system indicates that the memory utilization decreases with the increase of cache hit ratio. The parallelism between thread computation and thread replacement is found by analyzing their working processes. Based on these, we advance a rapid multithread replacement mechanism which overlaps the thread replacement with thread computation. More especially, with finite hardware contexts, this mechanism can play the same role of infinite contexts by tolerating the replacement overhead. By modifying the general thread switching model, we build the thread replacement model and evaluate this mechanism in theory and experiment methods. At last, we discuss the hardware implementation and put forward the problems to be resolved in the future.

关键词： Yarn Switches Hardware parallel processing Registers Concurrent computing Multiprocessor interconnection networks Electronic mail parallel architectures

来源：评论

学校读者我要写书评

暂无评论

A simulation research on multiprocessor interconnection networks with wormhole routing

A simulation research on multiprocessor interconnection netw...

引用

proceedings of the advances in parallel and distributed computing

作者： Yueming Hu Department of Computer Science and Engineering Shanghai Jiaotong University Shanghai China

ISBN: (纸本)0818678763

To design a parallel computer system, selecting an appropriate network is an important issue. This paper presents the simulation results on the performance of message passing interconnection networks used commonly in multiprocessor systems. Comparisons have been made on the performance of various interconnection networks like crossbar, mesh, hypercube, tree and hypertree with wormhole routing. The performance factors compared include the throughput of these networks and message delay. To make a more general model for tree structured network, this paper present the definition of m-fold n-ary tree, which is the extension of the hypertree network.

关键词： Multiprocessor interconnection networks Routing Computational modeling Concurrent computing Throughput Computer networks Bandwidth Costs Network topology Tree data structures

来源：评论

学校读者我要写书评

暂无评论

parallel database processing on a 100 node PC cluster: Cases for decision support query processing and data mining 97

Parallel database processing on a 100 node PC cluster: Cases...

引用

1997 ACM/IEEE conference on Supercomputing, SC 1997

作者： Tamura, Takayuki Oguchi, Masato Kitsuregawa, Masaru Institute of Industrial Science University of Tokyo 7-22-1 Roppongi Minato-ku Tokyo 106 Japan

ISBN: (纸本)0897919858

We developed a PC cluster system consists of 100 PCs. Each PC employs the 200MHz Pentium Pro CPU and is connected with others through an ATM switch. We picked up two kinds of data intensive applications. One is decision support query processing. And the other is data mining, specifically, association rule mining. As a high speed network, ATM technology has recently come to be a de facto standard. While other high performance network standards are also available, ATM networks are widely used from local area to widely distributed environments. One of the problems of the ATM networks is its high latencies, in contrast to their higher bandwidths. This is usually considered a serious flaw of ATM in composing high performance massively parallel processors. However, applications such as large scale database analyses are insensitive to the communication latency, requiring only the bandwidth. On the other hand, the performance of personal computers is increasing rapidly these days while the prices of PCs continue to fall at a much faster rate than workstations'. The 200MHz Pentium Pro CPU is competitive in integer performance to the processor chips found in workstations. Although it is still weak at floating point operations, they are not frequently used in database applications. Thus, by combining PCs and ATM switches we can construct a large scale parallel platform very easily and very inexpensively. In this paper, we examine how such a system can help the data warehouse processing, which currently runs on expensive high-end mainframes and/or workstation servers. In our first experiment, we used the most complex query of the standard benchmark, TPC-D, on a 100 GB database to evaluate the system compared with commercial parallel systems. Our PC cluster exhibited much higher performance compared with those in current TPC benchmark reports. Second, we parallelized association rule mining and ran large scale data mining on the PC cluster. Sufficiently high linearity was obtain

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

The study of parallel simulation processing based on MPP technology

The study of parallel simulation processing based on MPP tec...

引用

proceedings of the advances in parallel and distributed computing

作者： Yang Shi Chenxi Zhang Chunyuan Zhang School of computer science National University of Defense Technology Changsha Hunan China

ISBN: (纸本)0818678763

Computer numerical simulation is widely applied in engineering and social fields. It has shown great value in these fields. Small scale simulation applications can be processed on the traditional simulation computer, but with the size of problem increasing, sequential processing cannot meet the requirements. Dynamic real-time simulation and super real-time simulation require high performance simulation computers. In this paper we first analyse the structure of a classical simulation computer AD-100 which was developed by ADI Inc., then a novel structure for a simulation computer which adopts the MPP technology is proposed. At the end of this paper an experimental result is given to test the feasibility of parallel simulation processing.

关键词： Computational modeling Computer simulation Analytical models Numerical simulation Application software High performance computing Testing

来源：评论

学校读者我要写书评

暂无评论

New life in dusty decks: Results of porting a CM fortran based aeroacoustic model to high performance fortran 97

New life in dusty decks: Results of porting a CM fortran bas...

引用

1997 ACM/IEEE conference on Supercomputing, SC 1997

作者： Nucciarone, Jeffrey J. Özyörük, Yusuf Long, Lyle N. Center for Academic Computing Penn Numerically Intensive Computing Group State University University Park PA 16802 United States Dept. of Aerospace Engineering Penn State University University Park PA 16802 United States

ISBN: (纸本)0897919858

The High Performance Fortran language is a 'standard by consensus', developed by individuals and vendors in the high performance computing industry, to provide a low barrier entry to parallel computing. It promises to be an easier to use development environment for distributed memory computing platforms compared to the programming complexity required by message passing libraries such as PVM and MPI. HPF promises much and is still in its infancy. Since HPF was developed in part based on experiences gained with early parallel Fortran compilers such as Thinking Machines CM Fortran, we decided to test the effectiveness of HPF with today's generation of HPF compilers by porting a complex existing model code originally developed using CM Fortran. The model code that we selected is a hybrid computational aeroacoustics code that solves the 3D, time-dependent Euler equations in the near flow field and uses a moving surface Kirchhoff's formula to predict the far field sound radiating from turbofan engine inlets. The original CM Fortran model code was developed on a Thinking Machines CM5. The extensive production research use of this model, using varying grid sizes, provides excellent benchmarks with which to compare the HPF port. Two HPF compilers were selected in the porting effort - The Portland Group's (PGI) pghpf and the xlhpf compiler from IBM. IBM's xlhpf does not implement some elements of the HPF subset while PGI's offering provides several full-HPF extensions. porting efforts using each compiler exposed the strengths and weaknesses of each. Porting this complex code exposed many of the growing pains associated with the current generation of compilers. Critical sections of the code will be explained and these critical areas of the conversion effort will be discussed. Where necessary we will demonstrate how different porting strategies affected the performance of the code. Finally we will present how the ported code ran, using a varying number of processors, on an IBM

关键词： Turbofan engines

来源：评论

学校读者我要写书评

暂无评论

Post modern distributed systems [keynote address]

Post modern distributed systems [keynote address]

引用

International conference on parallel and distributed Systems (ICPADS)

作者： Norio Shiratori

Summary form only given, as follows. With the increasing speed of computers and communication linlts, and the successful convergence of both fields, computers connected by high speed links now represent an enormously large distributed computing system. However, current information distributed system architectures are too rigid to cope with heterogeneity, inaccuracy and inflexibility of the real world requirements. In order to overcome such limitations, in this talk, we present Post Modem distributed System based on Flexible Network using the concept of Flexible computing proposed by the authors. We first give the outline of the Flexible computing and the basic architecture of Flexible Network based on multi-agent systems. Then the characteristics of Modem distributed Systems based on Flexible Network will be discussed. As application examples, we will show a virtual office and flexible video conference system.

关键词： distributed computing Computer architecture Modems Computer networks Convergence Multiagent systems Teleworking Videoconference

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：