Lubachevsky–Stillinger algorithm: Difference between revisions

Revision as of 00:17, 4 May 2011

Revision as of 21:39, 4 May 2011

Line 44:

can be simulated: with or without a full restitution,

with or without tangential friction, and so on.

Differences in particles' masses of the particles can be taken
into account.

It is also easy and sometimes proves useful to

un-"jam" or "fluidize" the configuration,

Line 79 ⟶ 80:

==Implementation (how the calculations are performed)==

The state of particle jamming is achieved via simulating

a [[granular flow]].

The flow is rendered as a

[[discrete event simulation]],

Line 176 ⟶ 177:

Techniques to avoid the failure have

been proposed.

== Examples of use ==

== History ==

The LSA was a by-product of an attempt to find

a fair measure of [[speedup]] in [[parallel simulations]].

[[Time Warp]] parallel simulation algorithm

Line 195:

P. Hontales, B. Beckman, et al., Performnce of the colliding pucks simulation of the Time Warp operating systems, Proc. 1989 SCS Multiconference, Simulation Series, SCS, Vol. 21, No. 2, pp. 3-7.

</ref>

offered the samesimilar simulation tasktasks with spacial pairwise interactions

but

clear of the details that are non-essential for

Line 210:

the fastest way to perform the task

on such a machine.

The LSA was created in an

attempt to produce a faster [[uniprocessor]] simulation

and hence to have a more fair assessment of the

Line 216:

Later on, a parallel simulation algorithm

was also proposed, that, when run on a [[uniprocessor]],

reduces to the LSA.

<ref>

B.D. Lubachevsky, Simulating Billiards: Serially and in Parallel, Int.J. in Computer Simulation, Vol. 2 (1992), pp. 373-411.