𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Performance evaluation of parallel iterative deepening A* on clusters of workstations

✍ Scribed by Abdel-Elah Al-Ayyoub

Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
477 KB
Volume
60
Category
Article
ISSN
0166-5316

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Performance evaluation of parallel fast
Performance evaluation of parallel fast fourier transform on a multiprocessor workstation
✍ Susumu Horiguchi; Takeo Nakada πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 634 KB

The fast Fourier transform (FFT) is very frequently used in various fields such as computer tomography, speech recognition, and image processing. As the area of computer applications has broadened, the quantity of data to be transformed has greatly increased. A parallel FFT is one way of achieving a

Parallel Labeling of Three-Dimensional C
Parallel Labeling of Three-Dimensional Clusters on Networks of Workstations
✍ Felipe Knop; Vernon Rego πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 323 KB

Cluster algorithms have application in diverse areas, including statistical mechanics of polymer solutions, spin models in physics, and the study of ecological systems. Most parallel cluster labeling algorithms are designed for SIMD and MIMD multiprocessors and based on relaxation methods. We presen