Spatial structures are particularly suited to the definition of parallel programs, due to their homogeneity The Movie-based Programming Framework allows specification of computations on regular networks of processors, and the visualization of the computation progress as processors are activated. Computations over spatial structures are specified by composing independent views on propagation of control flows and formulae defining local computations. A shape pattern indicates which processors have to be active during a specific phase of the computation. A visit pattern defines the law, of propagation for actual processor activation. By combining these types of patterns, we achieve sophisticated forms of specification. In particular one specifies visitors implementing collective communication schemas widely used in parallel programming. broadcast, gather, scatter and reduction. As a result, automatic generation of visit algorithms adapted to different network configurations is made possible, thus facilitating experimentation. with different laws and their visualization.
Shape-based computations on regular processor networks / Bottoni, Paolo Gaspare; Dmitry, Vazhenin; Alexander, Vazhenin; Nikolay, Mirenkov. - STAMPA. - (2009), pp. 165-169. (Intervento presentato al convegno IEEE Symposium on Visual Languages and Human-Centric Computing tenutosi a Corvallis, OR nel SEP 20-24, 2009) [10.1109/vlhcc.2009.5295271].
Shape-based computations on regular processor networks
BOTTONI, Paolo Gaspare;
2009
Abstract
Spatial structures are particularly suited to the definition of parallel programs, due to their homogeneity The Movie-based Programming Framework allows specification of computations on regular networks of processors, and the visualization of the computation progress as processors are activated. Computations over spatial structures are specified by composing independent views on propagation of control flows and formulae defining local computations. A shape pattern indicates which processors have to be active during a specific phase of the computation. A visit pattern defines the law, of propagation for actual processor activation. By combining these types of patterns, we achieve sophisticated forms of specification. In particular one specifies visitors implementing collective communication schemas widely used in parallel programming. broadcast, gather, scatter and reduction. As a result, automatic generation of visit algorithms adapted to different network configurations is made possible, thus facilitating experimentation. with different laws and their visualization.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
