✦ LIBER ✦

Parallel ‘go with the winners’ algorithms in distributed memory models

✍ Scribed by Marcus Peinado; Thomas Lengauer

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 290 KB
Volume: 63
Category: Article
ISSN: 0743-7315
DOI: 10.1016/s0743-7315(03)00109-6

No coin nor oath required. For personal study only.

✦ Synopsis

We parallelize the 'go with the winners' algorithm of Aldous and Vazirani (in: Proceedings of the 35th IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press, Silver Spring., MD, 1994, pp. 492-501) and analyze the resulting parallel algorithm in the LogP-model (in: Proceedings of the Fourth ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, 1993, pp. 1-12). The main issues in the analysis are load imbalances and communication delays. The result of the analysis is a practical algorithm which, under reasonable assumptions, achieves linear speedup. Finally, we analyze our algorithm for a concrete application: generating models of amorphous chemical structures.

📜 SIMILAR VOLUMES

Parallel Fock matrix construction with d

Parallel Fock matrix construction with distributed shared memory model for the FMO-MO method

✍ Hiroaki Umeda; Yuichi Inadomi; Toshio Watanabe; Toru Yagi; Takayoshi Ishimoto; T 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 706 KB

## Abstract A parallel Fock matrix construction program for FMO‐MO method has been developed with the distributed shared memory model. To construct a large‐sized Fock matrix during FMO‐MO calculations, a distributed parallel algorithm was designed to make full use of local memory to reduce communic

An application of reactive tabu search f

An application of reactive tabu search for service restoration in distribution systems and its comparison with the genetic algorithm and parallel simulated annealing

✍ Hiroyuki Fudo; Sakae Toune; Takamu Genji; Yoshikazu Fukuyama; Yosuke Nakanishi 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB 👁 2 views