.png){kind=icon}
.png){kind=icon}
Return
On stalling in LogP
.png){kind=icon}
OA
AI
DOI：10.1016/j.jpdc.2004.10.002.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We investigate the issue of stalling in the LogP model. In particular, we introduce a novel quantitative characterization of stalling, referred to as delta-stalling, which intuitively captures the realistic assumption that once the network's capacity constraint is violated, it takes some time (at most delta) for this information to propagate to the processors involved. We prove a lower bound that shows that LogP under delta-stalling is strictly more powerful than the stall-free version of the model where only strictly stall-free computations are permitted. On the other hand, we show that delta-stalling LogP with delta = L can be simulated with at most logarithmic slowdown by a BSP machine with similar bandwidth and latency values, thus extending the equivalence (up to logarithmic factors) between stall-free LogP and BSP argued in Bilardi et al. (Algorithmica 24 (1999) 405) and Ramachandran et al. (J. Parallel Distributed Comput. 63 (2003) 1175) to the more powerful L-stalling LogP. (c) 2004 Elsevier Inc. All rights reserved.
Keywords:
BSP
LogP
parallel computation
bridging models
stalling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
No organization information available