A NEW WAY TO DIVIDE AND CONQUER
Parallel Processing Letters · 2001-12 · 11 (04) · 409-422
DOI: 10.1142/s0129626401000695 ↗Kurz gefasst
Fachartikel in der Zeitschrift Parallel Processing Letters, online erschienen am 21.11.2011. Verfasst von ALEXANDRE TISKIN. Die Arbeit wurde bisher 11-mal zitiert (Crossref) und nennt 12 Literaturangaben.
Abstract (Originalsprache)
Valiant's model of bulk-synchronous parallel (BSP) computation does not allow the programmer to synchronize a subset, rather than the complete set of a parallel computer's processors. This is perceived by many to be an obstacle to expressing divide-and-conquer algorithms in the BSP model. We argue that the divide-and-conquer paradigm fits naturally into the BSP model, without any need for subset synchronization. The proposed method of divide-and-conquer BSP programming is fully compliant with the BSP computation model. The method is based on sequentially interleaved threads of BSP computation, called superthreads.
Zitieren
APA
TISKIN, A. (2001). A NEW WAY TO DIVIDE AND CONQUER. Parallel Processing Letters, 11(04), 409-422. https://doi.org/10.1142/s0129626401000695
Vancouver
TISKIN A. A NEW WAY TO DIVIDE AND CONQUER. Parallel Processing Letters. 2001;11(04):409-422. doi:10.1142/s0129626401000695
BibTeX
@article{TISKIN2001,
author = {TISKIN, ALEXANDRE},
title = {A NEW WAY TO DIVIDE AND CONQUER},
journal = {Parallel Processing Letters},
year = {2001},
volume = {11},
number = {04},
pages = {409--422},
doi = {10.1142/s0129626401000695}
}
EUVIMED