✦ LIBER ✦

Parallel LAN/WAN heuristics for optimization

✍ Scribed by E Alba; G Luque; J.M Troya

Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 286 KB
Volume: 30
Category: Article
ISSN: 0167-8191
DOI: 10.1016/j.parco.2003.12.007

No coin nor oath required. For personal study only.

✦ Synopsis

We present in this work a wide spectrum of results on analyzing the behavior of parallel heuristics (both pure and hybrid) for solving optimization problems. We focus on several evolutionary algorithms as well as on simulated annealing. Our goal is to offer a first study on the possible changes in the search mechanics that the algorithms suffer when shifting from a LAN network to a WAN environment. We will address six optimization tasks of considerable complexity. The results show that, despite their expected slower execution time, the WAN versions of our algorithms consistently solve the problems. We report also some interesting results in which WAN algorithms outperform LAN ones. Those results are further extended to analyze the behavior of the heuristics in WAN with a larger number of processors and different connectivities.

📜 SIMILAR VOLUMES

Efficient parallel LAN/WAN algorithms fo

Efficient parallel LAN/WAN algorithms for optimization. The mallba project

✍ E. Alba; F. Almeida; M. Blesa; C. Cotta; M. Díaz; I. Dorta; J. Gabarró; C. León; 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 421 KB

The MALLBA project tackles the resolution of combinatorial optimization problems using generic algorithmic skeletons implemented in C++. A skeleton in the MALLBA library implements an optimization method in one of the three families of generic optimization techniques offered: exact, heuristic and hy

Security and data integrity for LANS and

Security and data integrity for LANS and WANs

✍ Helen Collinson 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 126 KB

Heuristics for scheduling unrelated para

Heuristics for scheduling unrelated parallel machines

✍ A.M.A. Hariri; C.N. Potts 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 961 KB

Parallel Heuristics for Improved, Balanc

Parallel Heuristics for Improved, Balanced Graph Colorings

✍ Robert K. Gjertsen; Jr.; Mark T. Jones; Paul E. Plassmann 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 399 KB

The computation of good, balanced graph colorings is an essential part of many algorithms required in scientific and engineering applications. Motivated by an effective sequential heuristic, we introduce a new parallel heuristic, PLF, and show that this heuristic has the same expected runtime under

Heuristics for syntactical optimization

Heuristics for syntactical optimization of relational queries

✍ Robert Demolombe; Arantza Illarramendi 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 338 KB

Heuristics for minimizing mean tardiness

Heuristics for minimizing mean tardiness for m parallel machines

✍ Johnny C. Ho; Yih-Long Chang 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 791 KB

The concept of parallel operations has been widely used in manufacturing and data processing. However, not many efficient methods have been proposed to reduce job tardiness. This article proposes an efficient heuristic to minimize the mean tardiness of a set of tasks with known processing times and