ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Chichester : Wiley-Blackwell
    International Journal for Numerical Methods in Fluids 10 (1990), S. 889-905 
    ISSN: 0271-2091
    Keywords: Computational fluid dynamics ; Parallel computing ; Parallel processing ; Domain decomposition ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: A concurrent algorithm for the solution óf the Navier-Stokes equations expressed in curvilinear co-ordinates has been developed for execution on a distributed memory parallel computer. This algorithm offers the ultimate promise of near-supercomputer performance on relatively low-cost parallel computers. The new algorithm is based on an existing serial pressure-correction-based algorithm, and uses domain decomposition to partition the problem onto the processors. The algorithm is demonstrated on an Intel iPSC for a complicated two-dimensional laminar flow problem, for various grid sizes and numbers of processors. Initial results based on straightforward domain decomposition showed that the speed-up per iteration approached 100% parallel efficiency as the grid size was increased, but that the convergence rate of the algorithm deteriorated relative to the original serial algorithm as the number of processors was increased, limiting the speed-up achieved. This degradation in convergence rate was traced to a poorer solution of the pressure correction equation in the concurrent procedure. The addition of a global block correction procedure, implemented via efficient global communications routines, remedied this problem, making the convergence rate of the concurrent procedure equivalent to the serial algorithm. The maximum speed-up achieved with the revised concurrent algorithm was a factor of 12·3 with 16 processors, representing a parallel efficiency of 77%.
    Additional Material: 10 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Chichester : Wiley-Blackwell
    International Journal for Numerical Methods in Fluids 6 (1986), S. 861-882 
    ISSN: 0271-2091
    Keywords: Three Dimensional Flow ; Turbine Draft Tube ; Curvilinear Co-ordinates ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: The three-dimensional turbulent flow in a curved hydraulic turbine draft tube is studied numerically. The analysis is based on the steady Reynolds-averaged Navier-Stokes equations closed with the κ-ε model. The governing equations are discretized by a conservative finite volume formulation on a non-orthogonal body-fitted co-ordinate system. Two grid systems, one with 34 × 16 × 12 nodes and another with 50 × 30 × 22 nodes, have been used and the results from them are compared. In terms of computing effort, the number of iterations needed to yield the same degree of convergence is found to be proportional to the square root of the total number of nodes employed, which is consistent with an earlier study made for two-dimensional flows using the same algorithm. Calculations have been performed over a wide range of inlet swirl, using both the hybrid and second-order upwind schemes on coarse and fine grids. The addition of inlet swirl is found to eliminate the stalling characteristics in the downstream region and modify the behaviour of the flow markedly in the elbow region, thereby affecting the overall pressure recovery noticeably. The recovery factor increases up to a swirl ratio of about 0·75, and then drops off. Although the general trends obtained with both finite difference operators are in agreement, the quantitative values as well as some of the fine flow structures can differ. Many of the detailed features observed on the fine grid system are smeared out on the coarse grid system, pointing out the necessity of both a good finite difference operator and a good grid distribution for an accurate result.
    Additional Material: 21 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Chichester : Wiley-Blackwell
    International Journal for Numerical Methods in Fluids 12 (1991), S. 947-963 
    ISSN: 0271-2091
    Keywords: Computational fluid dynamics ; Parallel computing ; Parallel processing ; Domain decomposition ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: One of the main factors limiting the widespread use of computational fluid dynamics codes for engineering design is their very large requirements both in terms of computer memory and CPU time. Distributed memory parallel computers offer both the potential for a dramatic improvement in cost/performance over conventional supercomputers and the scalability to large numbers of processors that is required if performance beyond that of current supercomputers is to be achieved. As part of an evaluation to explore the potential of such machines for computational fluid mechanics applications, a concurrent algorithm for the solution of the Navier-Stokes equations has been developed and demonstrated on a hypercube parallel computer. The algorithm is based on a domain decomposition of a well-established serial pressure correction algorithm.The algorithm is demonstrated on both a 32-node scalar and eight-node vector Intel iPSC/2 for complicated two-dimensional laminar and turbulent flow problems with different grid sizes and numbers of processors. Speed-ups relative to a single processor of 12.9 with 16 processors and 20.2 with 32 processors are achieved on a scalar iPSC/2, demonstrating the parallel efficiency of the algorithm. Measured performance on a 32-node scalar iPSC/2 exceeds one-sixth that of a Cray X-MP running the original serial algorithm. The performance of the algorithm on an eight-node vector iPSC/2 exceeds that of the larger scalar hypercube and is about one-fifth that of the Cray X-MP. With cost/performance more than 10 times better than the Cray, these results dramatically show the cost effectiveness of vector hypercubes for this class of fluid mechanics algorithm.
    Additional Material: 15 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Publication Date: 1985-09-01
    Print ISSN: 0017-9310
    Electronic ISSN: 1879-2189
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Published by Elsevier
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...