Shared-memory parallelization of a local correlation multi-reference CI program
نویسندگان
چکیده
منابع مشابه
Shared-memory parallelization of a local correlation multi-reference CI program
Wepresent a shared-memory parallelization of our open-source, local correlationmulti-reference framework, TigerCI. Benchmarks of the total parallel speedup show a reasonable scaling for typical modern computing system setups. The efficient use of available computing resources will extend simulations on this high level of theory into a new size regime. We demonstrate our framework using local-co...
متن کاملShared Memory Parallelization of Data
With the availability of large datasets in application areas like bioinformatics, medical informatics, scientific data analysis, financial analysis, telecommunications, retailing, and marketing, it is becoming increasingly important to execute data mining tasks in parallel. At the same time, technological advances have made shared memory parallel machines commonly available to organizations and...
متن کاملComparison of Parallelization Frameworks for Shared Memory Multi-Core Architectures
The development of standard multi-core processors changed in the last years moving from bigger, more complex, and faster cores to putting several more simple cores onto one chip. This changed also the way programs are written in order to leverage the processing power of multiple cores of the same processor. In the beginning, programmers had to divide and distribute the work by hand to the avail...
متن کاملFiberSCIP - A Shared Memory Parallelization of SCIP
Recently, parallel computing environments have become significantly popular. In order to obtain the benefit of using parallel computing environments, we have to deploy our programs for these effectively. This paper focuses on a parallelization of SCIP (Solving Constraint Integer Programs), which is a MIP solver and constraint integer programming framework available in source code. There is a pa...
متن کاملShared-Memory Parallelization of MTTKRP for Dense
e matricized-tensor times Khatri-Rao product (MTTKRP) is the computational boleneck for algorithms computing CP decompositions of tensors. In this paper, we develop shared-memory parallel algorithms for MTTKRP involving dense tensors. e algorithms cast nearly all of the computation as matrix operations in order to use optimized BLAS subroutines, and they avoid reordering tensor entries in me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Physics Communications
سال: 2014
ISSN: 0010-4655
DOI: 10.1016/j.cpc.2014.08.016