Talk:Bulk synchronous parallel

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

Computer science Low‑importance

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science

Low

This article has been rated as Low-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

possible mistake?

I just read Leslie Valiant's original paper "A Bridging Model For Parallel Computation" in it, in the section "The BSP Model" the author writes :

"A computation consists of a sequence of supersteps. In each superstep, each component is allocated a task consisting of some combination of local computation steps, message transmissions and (implicitly) message arrivals from other components. After each period of L time units, a global check is made to determine whether the superstep has been completed by all the components." Therefore, i think it is very clear that there are two phases and not three:

phase 1 (L time steps) local computations and message passing
phase 2 Barrier check

Vflouris (talk) 07:56, 14 March 2012 (UTC)vflouris[reply]

You're right. The supersteps have three components, but the computation & communication are not necessarily separated in time. Eijkhout (talk) 16:05, 20 August 2012 (UTC)[reply]

barriers

Global barriers are really a bad idea; have been for 20 years, and are becoming more so. I referenced a paper by myself showing work on methods that try to remove synchronization points from algorithms. If this is objectionably I can find other references. Eijkhout (talk) 16:26, 20 August 2012 (UTC)[reply]

mistake introducing g

The current text reads: "The ability of a communication network to deliver data is captured by a parameter g". But the rest of the text seems to suggest that the ability of the network to deliver data is more like 1/g rather than g. It seems like g is the time for the network to deliver a standard amount of data. But I think swapping out "g" for "1/g" in that sentence is probably a sufficient fix because later text goes in to more detail on "g". Jasonnet (talk) 23:24, 16 July 2020 (UTC)[reply]