MOVIE-BASED MULTIMEDIA MATRIX LIBRARY

The paper describes a library supporting effective programming and design of matrix algorithms and programs. The important feature of proposed library is the visual algorithm representation using a movie-based approach. The user has a deal with special multimedia objects, each of which can generate an executable code as well as produce animation frames. These objects build an algorithmic skeleton representing the steps of computation. In this paper, we show the main features of movie-based programming as well as describe the movie-based matrix library. Examples of the library usage are also presented

Movie-based Templates for Linear Algebra Problems

The paper discusses program design approaches supporting effective and convenient programming. The first approach is based on movie-based representation of algorithms and programs. The user has a deal with special multimedia objects, each of which can generate an executable code as well as produce animation frames. These objects build an algorithmic skeleton representing the steps of computation. The other direction is the template metaprogramming technique in which templates are used by a compiler to generate temporary source code. The presented work is in combining both approaches in the software design. The key point is in using an application-oriented moviebased templates library. The important feature of this library is that it is open for addition new templates, and all components can be prepared by means of the movie-based environment. The other peculiarities are the presence of two types of components: functional modules and multimedia macros that can be easily embedded into the user’s algorithmic skeleton. In this paper, we show the main features of movie-based programming as well as describe the movie-based template library for linear algebra problems. Examples of the library usage are also presented. Key words

Shape-based computations on regular processor networks

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