Parallel packing code for propellant microstructure analysis
نویسندگان
چکیده
منابع مشابه
Parallel Approximation Algorithms for Bin Packing
We study the parallel complexity of polynomial heuristics for the bin packing problem. We show that some well-known (and simple) methods like first-fit-decreasing are P-complete, and it is hence very unlikely that they can be efficiently parallelized. On the other hand, we exhibit an optimal NC algorithm that achieves the same performance bound as does FFD. Finally, we discuss parallelization o...
متن کاملParallel Support for Source Code Analysis and Modification
Tools that analyze and enhance large-scale software systems using symbolic reasoning are computationally expensive, and yet processors are cheap. We believe that enabling tools with parallel foundations will lead to qualitatively more useful tools. We have implemented a large-scale industrial-strength program transformation system, the DMS Software Reengineering Toolkit, entirely in PARLANSE, a...
متن کاملParallel TREE code for two-component ultracold plasma analysis
The TREE method has been widely used for long-range interaction N-body problems. We have developed a parallel TREE code for two-component classical plasmas with open boundary conditions and highly non-uniform charge distributions. The program efficiently handles millions of particles evolved over long relaxation times requiring millions of time steps. Appropriate domain decomposition and dynami...
متن کاملCode Instrumentation and Modeling for Parallel Performance Analysis Dagstuhl Seminar
From 20th to 24th August 2007, the Dagstuhl Seminar 07341 Code Instrumentation and Modeling for Parallel Performance Analysis was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as...
متن کاملInterprocedural Transformations for Parallel Code Generation Interprocedural Transformations for Parallel Code Generation
We present a new approach that enables compiler optimization of procedure calls and loop nests containing procedure calls. We introduce two inter-procedural transformations that move loops across procedure boundaries, exposing them to traditional optimizations on loop nests. These transformations are incorporated into a code generation algorithm for a shared-memory multiprocessor. The code gene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Aerospace Science and Technology
سال: 2015
ISSN: 1270-9638
DOI: 10.1016/j.ast.2015.08.012