/ N. N. Mirenkov / Professor
/ S. G. Sedukhin / Professor
/ Oleg Monakhov / Visiting Professor
/ Evgueny V. Tetenov / Visiting Professor
Our general program is high-performance computing and advanced information infrastructure. We are also thinking about a planetary machine and active knowledge being developed by humanity. We are undertaking research efforts in parallel and distributed algorithms/architectures, visual (multimedia) languages and tools. The research project ``The new paradigms for clustered computing" is focused on modeling, developing software packages, investigating fault-tolerance and performance analysis for the clustered computing and Web servers.
We are studying the problem of parallel program portability, skeleton-based techniques and developing the supporting tools. Our theoretical work is related to efficient algorithms for highly-parallel numerical computation including linear algebra, Fourier transformation, and image processing. Information about our activities can be found in: http://www.u-aizu.ac.jp/labs/sw-dpp/, which contains links to the experimental laboratory WWW servers. These servers hold the High-Performance Computing and Communication topics, on-line CD-ROM Digital Library and serve as mirror sites of, for instance, the ``Computational Science Educational Project". Web server with clustered architecture was also installed to support students activity in the area of high-performance clusters (http://typhoon.u-aizu.ac.jp).
We are working on the design and development of the system for interactive multi-resolution dynamic terrain rendering using OpenGL technology and advanced graphical 3D accelerators. Based on parallel streaming data exchange, algorithms and data structures for real-time navigation over unlimited terrain data were developed. The system was tested on the available data sets of Fukushima Prefecture.
As one of our results we would like to mention the S4CAD system. S4CAD (System of Systolic Structures Synthesis) is a high level interactive software tool for designing, analysis and modeling of systolic VLSI-oriented array processors. Starting with a localized data dependence graph of the algorithm S4CAD automatically produces all permissible array processors, among which the designer may chose the optimal one. Web page of the S4CAD is available at http://www-dpp.u-aizu.ac.jp/HPCC/S4CAD/.
The important question of our research is parallel program transparency and accessibility of massively parallel computers to large user populations. We are developing a multimedia technology for the interactive specification of application algorithms. This technology is based on self-explanatory components in a film format. A film is a series of color stills supported, if necessary, by text and voice/sound. Each still is to represent a view (some features) of objects or processes. Each film is to represent a multiple view (an extended set of dynamic and/or static features) of objects or processes. Different views can be related to different moments of time, positions in space, levels of hierarchy, values of data attached to space points, etc. Different media can be used for different views. A self-explanatory film means that the associated stills are organized and presented in such a way that the semantic richness is clearly brought out. The investment of meaning in the film is reduced to developing a series of views watching (and hearing) in non-linear order. Usually, a still is self-evident and a film is a result of special gathering of clues or hints. This result is a piece of knowledge. So, self-explanatory adequacy depends on this knowledge. The more accurate and relevant views are used, the greater adequacy is reached.
A computational method film is a series of stills displaying one or more parameterized sets of nodes and/or moving objects in multi-dimensional space-time. Each still highlights a subset of these nodes and/or moving objects. Each film defines a partial order of scanning of the nodes or objects.
As a rule, computation specified on different nodes (objects) of a still is considered to be performed in parallel. Computation specified in different stills is performed sequentially. So, it is possible to say: the shorter film the better.
The user defines the specification by creating his new film. The corresponding program (sequential or parallel) is generated automatically. In fact, we are developing film machines where data, knowledge and algorithms (as well as results) are specified by films (self-explanatory components).
We lead two projects related to filmification of methods and data: Active Knowledge Studio and F-mail System for children, elderly and handicapped people. (http://dpp6.u-aizu.ac.jp/).
Refereed Journal Papers
A new multimedia programming paradigm is presented. It is ba sed on a system of micro- and macro-icons representing self-explanatory software components in a film format. A film is a series of color stills supported, if necessary, by text and sound. Each still is to represent a view of objects or processes. Each film is to represent a multiple view (an extended set of dynamic and/or static features) of objects or processes. A self-explanatory film means that the associated stills are organized and presented in such a way that the semantic richness of a computational scheme is clearly brought out. Icons and films are acquired in a net-accessible database. The user should not study them in advance. The film management system provides simple access to database items and modes to manipulate films. In this paper we explain where the database items are taken from and how the self-explanatory features of items are reached. We also describe how these items can be used for multimedia representation of methods and data and for programming users' algorithmic ideas. In addition, some technical details related to the film management system, rendering engines used for displaying various features of the software components, and the icon language are presented. A special attention is paid to how computational formulas can be attached to a film.
A new type of multimedia programming environment based on filmification of methods is considered. The environment is based on libraries of self-explanatory software components, multiple-view films, and a management system for them. In this paper, we consider self-explanatory features by showing examples of multiple-view films related to computation on pyramids. Implementation techniques of a 3-D graphics engine to show 3-D graphics objects and film stills are also presented.
Features and implementation techniques of a specialized rend ering engine to display self-explanatory software components are presented. These self-explanatory components employ images and animations to assist the programmer in understanding, modifying and specifying behavior of components. All behavior and functions of a component, including methods to modify and specify its various properties, should be intuitively understandable by just browsing. To reach this extent of self-explanatory level, a film format is used to construct the component's interface. We have implemented a rendering engine specialized in rendering 2-D contents of our components. It is can render static and animated images on to any part of the screen, scaled to any size. A single rendering engine can be used to render a tiled view of several stills on to a panel. In addition, the structure of a special data format used to specify what to render to the engine is described.
This research is a step into developing a new visual user-oriented programming system to support more understandable user interface and more reusable software components. This system should be used for specifying and programming cellular automation-like algorithms and computation on 2-D grids including image processing. In this paper we present a modified sets of micro-icons to be used for creating and editing software components in a film format. Also, examples of cellular computations prepared in this format are explained. We pay special attention to the structure and functions of template programs supporting the generation of executable codes.
In this paper, we propose array processors for computing the 2-D and 3-D DCTs. We first introduce a new method, called dimensional splitting method, for the design of array processors for multi-dimensional image transforms. The method can be applied to any multi-dimensional image transforms with separable kernels such as DFT and DCT. Then, we propose a new coding scheme for the 1-D DCT in which the need for generating the kernel matrix in advance is eliminated. Finally, we show array processors for computing r-DCT (r>=2) which are scalable, regular, locally-connected, and fully-pipelined.
Refereed Proceeding Papers
We describe techniques for a multimedia representation of matrix computations based on filmification of application methods and data. The multimedia representation is related to special-purpose pictures and animations rendering intermediate/final results of computation and schemes of corresponding computational methods. To support rendering data, a multimedia interface and matrix filtration and matrix scaling techniques are used. To support rendering computational schemes, a film technology is used. Within the framework of this technology, self-explained series of frames, an interface for formula attachment, a program management subsystem as well as tools for data manipulating are discussed.
A new approach for the preparation of educational materials is considered. It is based on self-explanatory components being created in a film format. The components provide and support well- and intuitively-defined interpretive procedures for multimedia representation of methods and data. A few levels of visual (multimedia) expression compaction are used to keep materials rather small and easily learnable. In this paper we describe our idea of self-explanatory components for the representation of computational methods and data. Three rendering engines used for displaying various features of the components are also considered.
A new multimedia programming paradigm is considered. It is based on a system of micro- and macro-icons (composite pictures) representing self-explanatory software components in a film format. Icons and films are collected in a special database. The user should not study them in advance. In this paper we explain where the database items are taken from and how the self-explanatory features of items are reached.
We have made an experiment to measure the performance of clustered Web server. Our Web server is formed by Convoy cluster software and Microsoft Internet Information Server 4.0. The performance is measured by Web Bench 3.0. The purpose of our experiments is to investigate the scalability of our clustered system and performance characteristics for downloading different size files. The result of experiment shows the good scalability of Convoy cluster Web server for downloading at least 50 KB size files. For less than 50 KB file, Convoy cluster Web server does not have good performance scalability because the overhead for load balancing inside clustering system is bigger than the performance improvement by clustering.
In this chapter, the design of systolic array processors (SAPs) for computing multi-dimensional discrete Fourier transform ($r$-D DFT) is considered. We introduce two approaches of design: one uses the data dependency graph and a systematic method; the other uses a dimensional splitting method. For the first approach, we investigated three different computational schemes for designing SAPs for 2-D DFT. The systematic method guarantees to find optimal SAPs from a large solution space in terms of the number of processing elements and I/O channels, the processing time, topology, pipeline period, etc. This approach is difficult to extend to the 3-D case since the 6-D data dependency graph for the 3-D DFT cannot be reduced easily. Therefore, for the 3-D DFT we propose another approach: the dimensional splitting method. Using this method, computing of the $r$-D DFT with $r\geq 2$ is done iteratively with each iteration handling the 1-D DFTs of different dimensions. Finally, an application of the proposed SAPs to the prime-factor DFT is presented.
Academic Activities