Dendro
5.01
Dendro in Greek language means tree. The Dendro library is a large scale (262K cores on ORNL's Titan) distributed memory adaptive octree framework. The main goal of Dendro is to perform large scale multiphysics simulations efficeiently in mordern supercomputers. Dendro consists of efficient parallel data structures and algorithms to perform variational ( finite element) methods and finite difference mthods on 2:1 balanced arbitary adaptive octrees which enables the users to perform simulations raning from black holes (binary black hole mergers) to blood flow in human body, where applications ranging from relativity, astrophysics to biomedical engineering.
|
A set of sequential utilities. More...
#include <vector>
#include "seqUtils.tcc"
Go to the source code of this file.
Namespaces | |
seq | |
Collection of Generic Sequential Functions. | |
Functions | |
template<typename T > | |
void | seq::flashsort (T *a, int n, int m, int *ctr) |
Flash sort algo to sort an array in O(n). More... | |
template<typename T > | |
bool | seq::BinarySearch (const T *arr, unsigned int nelem, const T &key, unsigned int *idx) |
A binary search implementation. More... | |
template<typename T > | |
int | seq::UpperBound (unsigned int nelem, const T *arr, unsigned int startIdx, const T &key) |
Finds the index of the smallest upper bound of the search key in the array. More... | |
template<typename T > | |
bool | seq::maxLowerBound (const std::vector< T > &arr, const T &key, unsigned int &retIdx, unsigned int *leftIdx, unsigned int *rightIdx) |
Finds the index of the greatest lower bound of the search key in the array. The implementation uses a simple modification of the binary search algorithm. More... | |
A set of sequential utilities.