Cellular Automata, a computational science branch used for the modeling and simulation of complex systems, are parallel computing models which are continuously gaining attention from the Scientific Community for their potentiality and efficiency. This work presents the application of libAuToti, an open-source parallel library for implementing models based on the Cellular Automata approach, on t...

The deterministic quantum transfer-matrix (QTM) technique and its mathematical background are presented. This important tool in computational physics can be applied to a class of the real physical low-dimensional magnetic systems described by the Heisenberg hamiltonian which includes the macroscopic molecularbased spin chains, small size magnetic clusters embedded in some supramolecules and oth...

KineticMonte Carlo (KMC) simulations are used to study long-time dynamics of awide variety of systems. Unfortunately, the conventional KMC algorithm is not scalable to larger systems, since its time scale is inversely proportional to the simulated system size. A promising approach to resolving this issue is the synchronous parallel KMC (SPKMC) algorithm, which makes the time scale size-independ...

the paper presents the results of an investigation on the acoustic performance of vertical profile parallel barriers with quadratic residue diffuser tops and faces. a 2d boundary element method (bem) was used to predict the barrier insertion loss. the results of rigid and with absorptive coverage were also calculated for comparisons. using qrd on the top surface and faces of all vertical profil...

In recent years, transaction level modeling (TLM) has enabled designers to simulate complex embedded systems and SoCs, orders of magnitude faster than simulation at the RTL. The increasing complexity of the systems on one hand, and availability of low cost parallel processing resources on the other hand have motivated the development of parallel simulation environments for TLMs. The existing si...

Polyhedral homotopy continuation is a promising approach to solving large-scale polynomial systems. However, the method faces a computational bottleneck in constructing the homotopy functions because we need to find all mixed cells for polynomial systems. The search for mixed cells can be formulated as a vertex enumeration problem for polyhedra. Among the search methods for solving the problem ...

Metaheuristics are gaining increased attention as efficient solvers for hard global optimization problems arising in bioinformatics and computational systems biology. Scatter Search (SS) is one of the recent outstanding algorithms in that class. However, its application to very hard problems, like those considering parameter estimation in dynamic models of systems biology, still results in exce...

The paper presents an approach to improve the efficiency of some two-level optimization algorithms by their implementation in parallel MIMD multiprocessor systems. Diagonal decomposition dynamic programming and parametric optimization methods are considered, and some concepts of their parallelization are discussed. Results regarding the implementation of computations in a parallel multitransput...

Coding a highly parallel application to run on a heterogeneous suite of processors (both metacomputers and mixed-mode computers) with high efficiency, ease of implementation, and portability is a significant challenge. This paper first surveys recently proposed and existing parallel languages from the perspective of programming complex, heterogeneous systems. We then propose two essential featu...