The BSP model can be extended with a zero cost synchronization mechanism, which can be used when the number of messages due to receive is known. This mechanism, usually known as “oblivious synchronization” implies that different processors can be in different supersteps at the same time. An unwanted consequence of these software improvements is a loss of prediction accuracy. This paper proposes an extension of the BSP complexity model to deal with oblivious barriers and shows its accuracy.
KeywordsUnwanted Consequence Communication Time Synchronization Point Barrier Synchronization Software Improvement
Unable to display preview. Download preview PDF.
- 1.Bonorden O. Juurlink B. von Otte I. Rieping I. The Paderborn University BSP (PUB) Library-Design Implementation and Performance. Technical Report TR-RSFB-98-063. Heinz Nixdorf Institute. Paderborn University. 1998.Google Scholar
- 2.Gonzalez J.A., Leon C, Piccoli F., Printista M., Roda J.L., Rodriguez C, Sande F. Oblivious BSP. Internal Report, http://nereida.deioc.ull.es/html/obsp.ps.gz
- 4.Valiant L.G. A Bridging Model for Parallel Computation. Communications of the ACM. 33(8). pp. 103–111. 1990.Google Scholar