BSP/CGM Algorithms - USP

More documents

Recommendations

Info

The BSP Model 4/24 • The BSP (Bulk Synchronous Parallel) model was introduced by Valiant. • A BSP machine consists of p processors with local memory. • The processors communicate with each other through some interconnection scheme, managed by a router. • Also offers the capability of synchronizing the processors in regular intervals of L units of time.
The BSP Model 5/24 • BSP algorithm consists of a sequence of supersteps. • In each superstep each processor executes a combination of local computation, transmission and receiving of messages from other processors. • After each period of L units of time a barrier synchronization is carried out.
Page 1 and 2: Workshop Integrade 26 e 27 de Janei
Page 3: Realistic Models 3/24 At the end of
Page 7 and 8: The BSP Model 7/24 • Parâmetros:
Page 9 and 10: The CGM Model 9/24 Computation roun
Page 11 and 12: BSP: Sum Algorithm 11/24 BSP Sum Al
Page 13 and 14: CGM: Sum Algorithm 13/24 CGM Sum Al
Page 15 and 16: BSP/CGM: Prefix Sum Algorithm 15/24
Page 17 and 18: BSP/CGM: Prefix Sum Algorithm 17/24
Page 19 and 20: Prefix Sum - BSP // Passo 1. Inicil
Page 21 and 22: Prefix Sum - BSP 21/24 // Passo 7.
Page 23 and 24: Conclusions 23/24 • O BSP/CGM é

BSP/CGM Algorithms - USP

Create successful ePaper yourself

Delete template?

Save as template?