Simulating elastic light scattering using high performance computing methods

The Coupled Dipole method, as originally formulated byPurcell and Pennypacker, is a very powerful method tosimulate the Elastic Light Scattering from arbitraryparticles. This method, which is a particle simulationmodel for Computational Electromagnetics, has one majordrawback: if the size of the particles grows, or if scatteringfrom an ensemble of randomly oriented particles has to besimulated, the computational demands of the CoupledDipole method soon become too high. In this paper wepresent two computational techniques to resolve thisproblem. First we have implemented the Coupled Dipolemethod on a Massively Parallel Computer. The parallelefficiency can be very close to one, implying that attainedcomputational speed scales perfectly with the number ofprocessors. Secondly we propose to reduce thecomputational complexity of the Coupled Dipole methodby including ideas from the so-called fast multipolemethods (hierarchical algorithms) into the Coupled Dipolemodels. In this way the calculation time can be decreasedwith orders of magnitude

Symbolic Processing Of Poisson Series On A Hypercube Parallel Computer

In this report parallelization of a special-purpose computer algebra system, operating on Poisson series, is considered. The implementations dealing with parallelism on different levels have been performed on an nCUBE2 parallel computer. Application test problems in this work concern the computation of normal forms of ODEs. Algorithmical details and performance results (in terms of speed-up and efficiency) are presented. Keywords: computer algebra, formula manipulation, Poisson series, normal form of ODEs, parallel processing, hypercubes 1 Introduction Computer algebra algorithms often require a lot of computing time; it is therefore an important issue to try to parallelize such algorithms. We describe here the parallelization of a special purpose computer algebra system on an nCUBE2 parallel computer. The main purpose of this report is to show that parallelization can be implemented at the level of the elementary operations of the computer algebra system and more efficiently at the l..

Application of Time Warp to Parallel Simulations with Asynchronous Cellular Automata

A new asynchronous cellular automata model is described.The model provides an experimental and theoretical frame-work to investigate quantitatively realistic simulations.The parallel execution of such simulations introduces theneed of synchronisation of the asynchronous parallel processes. Time Warp is proposed as a synchronisation method for the parallel asynchronous cellular automata.We introduce two new extensions to the Time Warp method to make the method more effective for the application to parallel simulation of asynchronous cellular automata

A simulation methodology for the prediction of SPMD programs performance

A simulation methodology for predicting the performanceof data parallel (SPMD) programs on parallel and distributedplatforms is presented. The proposed methodology comprises a parameterised description of the applications as well as the target machines. An integrated simulation procedure estimates the time complexity of the SPMD application given a well defined hardware platform and predicts the execution behaviour

NAIC '92: Conferentie proceedings

Vijfde Nederlandstalige AI Conferentie (18, 19 en 20 november 1992) georganiseerd onder auspiciën van de Nederlandse Vereniging voor Kunstmatige Intelligentie (NVKI). Medeorganisator is de Technische Universiteit Delft. In opdracht van Erasmus Forum, Erasmus Universiteit Rotterdam

A spatial simulation model for the diffusion of a novel biofuel on the Austrian market

Kiesling E, Günther M, Stummer C, Vetschera R, Wakolbinger LM. A spatial simulation model for the diffusion of a novel biofuel on the Austrian market. In: Bargiela A, Azam-Ali S, Crowley D, Kerckhoffs EJH, eds. Proceedings of the 24th European Conference on Modelling and Simulation (ECMS 2010). 2010: 41-49