✦ LIBER ✦

Observations on optimal parallelizations of two-list algorithm

✍ Scribed by Carlos Alberto Alonso Sanches; Nei Yoshihiro Soma; Horacio Hideki Yanasse

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 129 KB
Volume: 36
Category: Article
ISSN: 0167-8191
DOI: 10.1016/j.parco.2009.09.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal parallelization of the two-li

An optimal parallelization of the two-list algorithm of cost

✍ Fouad B. Chedid 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 96 KB

On two-dimensional pattern matching by o

On two-dimensional pattern matching by optimal parallel algorithms

✍ Maxime Crochemore; Wojciech Rytter 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 781 KB

Dynamic optimal reactive power dispatch

Dynamic optimal reactive power dispatch based on parallel particle swarm optimization algorithm

✍ Ying Li; Yijia Cao; Zhaoyan Liu; Yi Liu; Quanyuan Jiang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 683 KB

In this paper, Message Passing Interface (MPI) based parallel computation and particle swarm optimization (PSO) algorithm are combined to form the parallel particle swarm optimization (PPSO) method for solving the dynamic optimal reactive power dispatch (DORPD) problem in power systems. In the propo

Optimization of job scheduling on parall

Optimization of job scheduling on parallel machines by simulated annealing algorithms

✍ Zhen-Ping Lo; B. Bavarian 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 536 KB

ln this paper, we consider the problem of scheduling a set of simultaneously available jobs on several parallel machines. Specifically, the minimization of the time to finish all the jobs assigned to all machines under job deadline constraints for n jobs, m machines problem is formulated in this pap

Mathematical modeling of a parallel glob

Mathematical modeling of a parallel global optimization algorithm

✍ Elizabeth Eskow; Robert B Schnabel 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 730 KB

Full configuration interaction algorithm

Full configuration interaction algorithm on a massively parallel architecture: Direct-list implementation

✍ Rossi, Elda; Bendazzoli, Gian Luigi; Evangelisti, Stefano 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 984 KB

A parallel full configuration interaction FCI code, implemented on a distributed memory MPP computer, has been modified in order to use a direct algorithm to compute the lists of mono-and biexcitations each time they are needed. We were able to perform FCI calculations on the ground state of the ace