The heat transfer problem of a zero-mean oscillatory flow of a Maxwell fluid between infinite parallel plates with boundary conditions of the third kind is considered. The local and global time-averaged entropy production are computed, and the consequences of convective cooling of the plates are also assessed. It is found that the global entropy production is a minimum for certain suitable comb...

MOTIVATION Phylogenies are increasingly used in all fields of medical and biological research. Because of the next generation sequencing revolution, datasets used for conducting phylogenetic analyses grow at an unprecedented pace. We present ExaML version 3, a dedicated production-level code for inferring phylogenies on whole-transcriptome and whole-genome alignments using supercomputers. RES...

A continuous flow parallel reactor system has been developed to provide a rapid and seamless transition from the discovery phase and production phase of chemical synthesis, particularly in low volume-high value pharmaceuticals production. Using a single fixed bed catalytic meso reactor, reactions can be screened on a small discovery scale over short time scales. The intensified process produces...

ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...

Parallel Kinetic Monte Carlo (KMC) is a potent tool to simulate stochastic particle systems efficiently. However, despite literature on quantifying domain decomposition errors of the particle system for this class of algorithms in the short and in the long time regime, no study yet explores and quantifies the loss of time-reversibility in Parallel KMC. Inspired by concepts from non-equilibrium ...

The \\attening" of nested data-parallelism reduces a very broad class of data-parallel expressions to parallel vector operations. The technique can be understood as the application of a small set of program transformations. In this paper, we explore several practical issues involved in the implementation of these transformations, with an emphasis on the production of optimized vector code.