Parallel Generation of Partitioned

نویسندگان

  • D C Hodgson
  • P K Jimack
چکیده

In this paper we introduce a method for generating unstructured meshes in parallel which are partitioned in a \good" way. When solving a partial dierential equation on a parallel distributed memory machine, the mesh should be decomposed so that the communication requirement of the numerical solver is minimised and also the amount of work to be performed on each processor is approximately equal. Most previous work in this area has concentrated on partitioning a mesh that has already been generated. We introduce a method which actually generates the partitioned mesh in parallel whilst producing a good quality decomposition and compare this method with other approaches.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Generation of t-ary Trees

A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...

متن کامل

Parallel Mesh Generation in GeoFEM

We propose large-scale parallel mesh generation method for GeoFEM. Figure 1 shows the flow diagram, which is composed of four processes. First process is a mesh generation. In the process two applications is used. Second process is attachment of boundary conditions using GUI application: GPPView[1]. Third process is partitioning to generate GeoFEM parallel FE meshes. Final process is relocation...

متن کامل

Efficient Parallel Generation of Partitioned , Unstructured Meshes

In this paper we introduce a method for generating unstructured meshes in parallel which are partitioned in a \good" way. When solving a partial dierential equation on a parallel distributed memory machine, the mesh should be decomposed so that the communication requirement of the numerical solver is minimised and also the amount of work to be performed on each processor is approximately equal....

متن کامل

Parallel Programming Environment for Mesh Generation

This paper presents a parallel programming environment for mesh generation. Our approach is based on overdecomposition. The programming environment supports: low-latency one-sided communication, global address space in the context of data/object mobility, automatic message forwarding and dynamic load balancing. These are the minimum requirements for developing efficient adaptive parallel mesh g...

متن کامل

An Efficient Algorithm for Workspace Generation of Delta Robot

Dimensional synthesis of a parallel robot may be the initial stage of its design process, which is usually carried out based on a required workspace. Since optimization of the links lengths of the robot for the workspace is usually done, the workspace computation process must be run numerous times. Hence, importance of the efficiency of the algorithm and the CPU time of the workspace computatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994