Pith. sign in

REVIEW

Adaptive Distributed Resampling Algorithm with Non-Proportional Allocation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1310.4624 v3 pith:UQZPOPPI submitted 2013-10-17 stat.CO

classification stat.CO
keywords algorithmarnaadaptiveallocationdistributedimprovesoriginalparticle
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The distributed resampling algorithm with proportional allocation (RNA) is key to implementing particle filtering applications on parallel computer systems. We extend the original work by Bolic et al. by introducing an adaptive RNA (ARNA) algorithm, improving RNA by dynamically adjusting the particle-exchange ratio and randomizing the process ring topology. This improves the runtime performance of ARNA by about 9% over RNA with 10% particle exchange. ARNA also significantly improves the speed at which information is shared between processing elements, leading to about 20-fold faster convergence. The ARNA algorithm requires only a few modifications to the original RNA, and is hence easy to implement.

Discussion (0). Sign in to comment.

Pith tools