Fastsg: A Fast Routines Library for Sparse Grids
نویسندگان
چکیده
In a complex processor landscape dominated by multiand many-core processors, simplifying programming plays a crucial role in enhancing developers’ productivity. One way is to use highly tuned library functions. In this paper we present fastsg, an optimized library for the sparse grid technique with support for dimensional truncation. With optimizations for best cache use and vectorization, we improve the performance on one processor core up to a factor of 10. Parallelization using OpenMP scales almost linearly on a 12-core system.
منابع مشابه
New Approaches for Particle Tracing on Sparse Grids
Flow visualization tools based on particle methods continue to be an important utility of ow simulation. Additionally, sparse grids are of increasing interest in numerical simulations. In 13] we presented the advantages of particle tracing on uniform sparse grids. Here we present and compare two diierent approaches to accelerate particle tracing on sparse grids. Furthermore, a new approach is p...
متن کاملA communication library for the parallelization of air quality models on structured grids
PAQMSG is an MPI-based, Fortran 90 communication library for the parallelization of air quality models (AQMs) on structured grids. It consists of distribution, gathering and repartitioning routines for different domain decompositions implementing a master–worker strategy. The library is architecture and application independent and includes optimization strategies for different architectures. Th...
متن کاملParallel Sparse Matrix Computations Using the PINEAPL Library: A Performance Study
The Numerical Algorithms Group Ltd is currently partic ipating in the European HPCN Fourth Framework project on Parallel Industrial NumErical Applications and Portable Libraries PINEAPL One of the main goals of the project is to increase the suitability of the existing NAG Parallel Library for dealing with computationally in tensive industrial applications by appropriately extending the range o...
متن کاملSubdivision Surface Evaluation as Sparse Matrix-Vector Multiplication
We present an interpretation of subdivision surface evaluation in the language of linear algebra. Specifically, the vector of surface points can be computed by left-multiplying the vector of control points by a sparse subdivision matrix. This “matrix-driven” interpretation applies to any level of subdivision, holds for many common subdivision schemes (including Catmull-Clark and Loop), supports...
متن کاملPOLY : A new polynomial data structure for Maple.
We demonstrate how a new data structure for sparse distributed polynomials in the Maple kernel significantly accelerates several key Maple library routines. The POLY data structure and its associated kernel operations (degree, coeff, subs, has, diff, eval, ...) are programmed for high scalability with very low overhead. This enables polynomial to have tens of millions of terms, increases parall...
متن کامل