GOTHIC: Gravitational oct-tree code accelerated by hierarchical time step controlling
نویسندگان
چکیده
منابع مشابه
Gravitational tree-code on graphics processing units: implementation in CUDA
We present a new very fast tree-code which runs on massively parallel Graphical Processing Units (GPU) with NVIDIA CUDA architecture. The tree-construction and calculation of multipole moments is carried out on the host CPU, while the force calculation which consists of tree walks and evaluation of interaction list is carried out on the GPU. In this way we achieve a sustained performance of abo...
متن کاملGothic Scholars Don’t Wear Black Gothic Studies and Gothic Subcultures
are hardly in touch with each other. This is something that should ideally change in the near future, since Gothic Studies and Gothic youth subcultures greatly overlap, at least as regards their common interest in Gothic literature, the iconography and the non-literary texts (films, comics, and so on) derived from it. The multiplicity of texts generated by Gothic, understood here as a narrative...
متن کاملDeciphering the Sox-Oct partner code by quantitative cooperativity measurements
Several Sox-Oct transcription factor (TF) combinations have been shown to cooperate on diverse enhancers to determine cell fates. Here, we developed a method to quantify biochemically the Sox-Oct cooperation and assessed the pairing of the high-mobility group (HMG) domains of 11 Sox TFs with Oct4 on a series of composite DNA elements. This way, we clustered Sox proteins according to their dimer...
متن کاملOPTIMUM GENERALIZED COMPOUND LINEAR PLAN FOR MULTIPLE-STEP STEP-STRESS ACCELERATED LIFE TESTS
In this paper, we consider an i.e., multiple step-stress accelerated life testing (ALT) experiment with unequal duration of time . It is assumed that the time to failure of a product follows Rayleigh distribution with a log-linear relationship between stress and lifetime and also we assume a generalized Khamis-Higgins model for the effect of changing stress levels. Taking into account that the...
متن کاملSOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM
In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: New Astronomy
سال: 2017
ISSN: 1384-1076
DOI: 10.1016/j.newast.2016.10.007