In multiprocessor systems, iterative algorithms can be implemented synchronously or asynchronously. Unfortunately, few guidelines exist to make a choice. In this paper, we compare the execution times of an asynchronous iterative algorithm and of its synchronous counterpart. Synchronization overhead
Evaluation of the asynchronous iterative algorithms in the context of distant heterogeneous clusters
✍ Scribed by Jacques M. Bahi; Sylvain Contassot-Vivier; Raphaël Couturier
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 203 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
By using a kernel function, data that are not easily separable in the original space can be clustered into homogeneous groups in the implicitly transformed high-dimensional feature space. Kernel k-means algorithms have recently been shown to perform better than conventional k-means algorithms in uns
## Abstract A complete sample of 18 X‐ray selected clusters of galaxies belonging to the __ROSAT__ North Ecliptic Pole (NEP) survey has been observed with the Very Large Array at 1.4 GHz. These are the most distant clusters in the X‐ray survey with redshift in the range 0.3 < __z__ < 0.8. 79 radio
Observations of childhood 'cancer clusters' in small communities in central California prompted us to examine the distribution of childhood cancer in communities throughout the region to see if the overall cancer rate or the distribution of 'cancer clusters' was unusual for agricultural towns where