English
◆ Annual Review 2001

Distributed Parallel Processing Laboratory


N. N. Mirenkov
Professor

S. G. Sedukhin
Professor

E. V. Tetenov
Visiting Professor

Oleg Monakhov
Visiting Professor

Our general program is cyberinfrastructure and high-performance computing. We are also thinking about a peer-to-peer and grid computing, as well as about active knowledge being developed by humanity. We are undertaking research efforts in parallel and distributed algorithms/architectures, visual (multimedia) languages and tools.

We are studying the problem of parallel program portability, skeleton-based techniques and developing the supporting tools. Our theoretical work is related to effcient 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.

We have been working on the design and development of the system for interactive multi-resolution dynamic terrain rendering using OpenGL technology and advanced graphical 3D accelerators. The new continuous mathematical model for correct (crack- and popping-free) triangulation based on the view-dependent multi-resolution criteria was proposed andimplemented. Akey point of this model is a new precomputing function, which de??nes both subdivision criteria and connectivity condition. Based on parallel streaming data exchange, algorithms and data structures for real-time navigation over unlimited terrain data were developed. As an example, we have implemented a real-time ??ight simulation over Fukushima Prefecture terrain model (160km x 160km area, DEM80m resolution, satellite photo 50m resolution, database size is more than 350MB) and all Japan terrain model (2000km x 2500km area, DEM 50m resolution, synthesized texture 50m resolution, database size is more than 3GB). Our research project "The new paradigms for clustered computing" has been focused on modeling, developing software packages, investigating fault-tolerance and performance analysis for the clustered computing and Web servers.

We have proposed a new parallel processor architecture for the future VLSI technology. This processor (code name Trident) is able to support the scalar, vector, and matrix instructions and based on local communications not only within but also between processing elements. We have shown that proposed architecture can be effectively used for many scienti??c, engineering, and multimedia applications since they are drastically based on mixing of scalar, vector, and matrix parts.

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 speci??cation 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 di??erent 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 dependson this knowledge. Themore accurate and relevant views are used, the greater adequacy is reached.

A computationalmethod ??lm is a series of stills displayingone ormoreparameterized sets of nodes and/or moving objects inmulti-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.

Referred Journal Papers
[nikmir-001:2001]R. Yoshioka and N. Mirenkov. Visual Computing within Environment of Self-explanatory Components. Soft Computing Journal, 7(1):20-32, 2002.
A visual language and amultimedia environment supporting the language are considered. The language is explained through describing a visual program for solving partial differential equationsbyamultigrid method. Theenvironment is based on a database of self-explanatory components in a film format and a film management system for searching, editing, composing and other manipulations with components. The visual program presented is only one view of a self-explanatory component. In fact, it can also be watched in dynamics and from other points of view for better understanding the method features. The goal of the visual program example is to show that visual programs can be physically much smaller than the text they replace and much easier for understanding and modifying.
[nikmir-002:2001]R. Yoshioka and N. Mirenkov. A Multimedia System to Render and Edit Self-explanatory Components. Journal of Internet Technology, 3(1), 2002.
multimedia system to render and edit computational algorithms represented in a format of self-explanatory components is presented. Self-explanatory components constitute a framework for visual representation and specification of objects/processes, based on the idea of multiple views and algorithmic skeletons. In this framework, computational algorithms become components that are accessed and manipulated through a number of views related to its dynamic, static, and hierarchical features. This paper presents a system of two visual languages, a film languageandan icon language, to specify and represent algorithms as self-explanatory components. The two languages support different levels of abstraction and multiple paradigms of representation and in this way try to provide self-explanatory understanding and operations. The system is aimed as a tool for visual creation and debugging of computational algorithms for scientific computing, including educational purposes, such as online or distance learning. Using this system, specification of algorithms is reduced to retrieving components acquired in a database and using it as it is or by editing and modifying it. Three examples of matrix multiplication algorithms are presented to describe the system and constituting visual languages.
[nikmir-003:2001]A. Vazhenin, N. Mirenkov, and D. Vazhenin. Multimedia Representation of Matrix Computations and Data. International Journal of Information Sciences, 141:97-122, 2002.
Distance learning, virtual universities, as well as knowledge discovery from the Internet are emerging to effect the worldwide transformation of educational systems and the establishment of knowledge-based societies. In this paper, we present an idea of smart pieces of data/knowledge to be used for new types of the educational environment. As an example, we consider our approach for the multimedia representation of matrix computations. The approach is based on filmification of methods and data, and related to special-purpose pictures and animations rendering results of computation and schemes of corresponding computational methods. To create these pictures and animations, as well as to manipulate films, special techniques and subsystems are considered. Film stills of three well-known methods are also provided.
[nikmir-004:2001]R. Roxas and N. Mirenkov. Input/Output Specifications within Self-explanatory Components. Journal of Three Dimensional Images, 16(1):129-134, 2002.
This paper focuses on an approach of developing multiple view components. Such components are self-explanatory instances. One view of a component is represented by micro- icons visualizing static features of the component. Another view is shown by animations that help the user to understand dynamic features of the component. There are also other views. In general, a film format is used to represent such views. A film is a series of stills (colored stills) that signify somework being done to accomplish some tasks. Each still is a view (of another hierarchical level), too. A series of stills is a multiple view. Stills are selected to support easy understanding of the component meaning. The different views are presented by special multimedia interfaces. Aspecial focus of this research is on developing micro-icons and corresponding film stills to specify and represent input/output and inter-connection operations of our multimedia components. The specifications include the definition of the nature of data source, structures of data concerned, possible methods of extracting data from or storing into a certain structure, conditions/constraints imposed upon different operations, etc. In other words, a visual language to define component interfaces is presented.
[nikmir-005:2001]N. Mirenkov. Self-explanatory components: a new way to enhance user's ability. Journal of Shanghai University (English Edition), 5, Suppl.:115-123, 2001.
The self-explanatory component concept is an approach to represent data/knowledge in amultiple view format. This format is considered as a film where stills show different views of objects/processes and, in this way, explain a variety of objects/process features. Self-explanatory adequacy depends on this features. The more accurate and relevant views are used, the greater adequacy is reached. In this paper an overview of the concept is provided and some experience of the self-explanatory component development is presented. The experience is related to filmification of computational methods and multimedia words, sentences, and messages. The relation of the self-explanatory component concept and ideas of universal usability is also considered.
[nikmir-006:2001]A. Vazhenin, N. Mirenkov, and D. Vazhenin. Representation of Large Numerical Information Arrays via Multimedia Objects. Journal of Internet Technology, 2(4):263-274, 2001.
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.
[nikmir-007:2001]N. Mirenkov, A. Vazhenin, R. Yoshioka, T. Ebihara, T. Hirotomi, and T. Mirenkova. Self-explanatory components: a new programming paradigm. International Journal of Software Engineering and Knowledge Engineering, 11(1):5-36, 2001.
Anewmultimedia programmingparadigm is presented. It is based on a system of micro- and macro-icons (composite pictures) 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 amultiple 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 away 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.
[nikmir-008:2001]A. Vazhenin and N. Mirenkov. Visual Programming System VIM. Programming and Computer Software, 27(4):217-231, 2001.
Visualization of methodsand representation of computational schemes in a film format are considered. Examples of the film frames related to a linear algebra problem is discussed.
[sedukhin-001:2001]M. Soliman and S. Sedukhin. Solving Division-free Linear System on the Pentium III Processor. Journal of Shanghai University (English Edition), 5(1):5-9, 2001.
We implement the division-free algorithm for solving large systems of linear equations using Pentium III Streaming SIMD Extensions (SSE). Two implementations (non-SSE and SSE) of the division-free algorithm are compared. In the non-SSE implementation, each instruction operates on a pair of single-precision froating point numbers. However, in the SSE implementation, the Pentium III SSE instructions can operate in parallel on four pairs. Moreover, these instructions allow fast approximationto calculate the reciprocal. Byusing these fetures of the Pentium III processor, the SSE version exibits a speedup more than four compared with non-SSE implementation for large linear systems.
[sedukhin-002:2001]T. Takigahira and S. Sedukhin. Cluster of Web Servers using IP Multicast. Journal of Three Dimensional Images, 16(1):135-140, 2002.
Multicast based cluster of Web Servers is proposed in this paper. This cluster is based on highly distributed processing with no bottlenecks and no critical points of failure. All incoming requests from Web clients are received by all servers in the cluster as multicust messages and only one server replies to each request. Each server always cooperates with others tomanagethe cluster. Each server works by self-control based on common rules. The heartbeat is used to support a fault tolerance.
[sedukhin-003:2001]M. Soliman and S. Sedukhin. Trident: Scalar, Vector, and Matrix ISAs Microprocessor. Journal of Three Dimensional Images, 16(1):153-159, 2002.
To harness the increasable huge budget of transistors, this paper proposes a multiple ISAs microprocessor. Since the fundamental data structures for a wide variety of applications are scalar, vector, and matrix, weproposeTrident microprocessor, which has three ISAs supporting these data structures. The Trident microprocessor consists of a set of parallel vector-pipelines (VPs) combined with a fast in order scalar core. The parallel VPs can access both of vector and matrix register files to perform vector, matrix, and matrix-vector operations.
Referred Proceeding Papers
[nikmir-009:2001]R. Yoshioka, N. Mirenkov, Y. Tsuchida, and Y. Watanobe. Visual Notation of Film Language System. In Proc., 2002 International Conference on Distributed Multimedia Systems (DMS-2002), pages 648-655, San Francisco, 2002.
The Film language system is a software framework to specify, present and explain computational algorithms through their multiple views collected in a 'film' format. This system includes a film database and a film management system to support the acquiring, rendering, editing and creating of films. The film format is a generalization of a conventional movie concept that introducesnewtypes of framesanda non-linearon-demand access to frames. This paper presents an overview of notations used in the film language to represent frames, scenes, and films.
[nikmir-010:2001]R. Roxas and N. Mirenkov. Visualizing Input/Output Specification. In Proc., 2002 International Conference on Distributed Multimedia Systems (DMS-2002), pages 660-663, San Francisco, 2002.
A brief overview of our approach to visualizing computational algorithms and an example of input operation speci??cation for inter-component communication are provided. A visual language of micro-icons for specifying I/O operations and a panel supporting this speci??cation are considered.
[nikmir-011:2001]M. Saber and N. Mirenkov. Visualizing cellular image processing algorithms. In Proc., 2002 International Conference on Distributed Multimedia Systems (DMS-2002), pages 656-659, San Francisco, 2002.
The paper enlightens the idea of using cellularautomatain imageprocessing, presents anew visual representation for cellular image processing algorithms as one of the implementations of self-explanatory component technology, where self-explanatory features are reached by special collections of component views.
[nikmir-012:2001]T. Hirotomi and N. Mirenkov. Multiple interface communication system. In Proc., 2002 International Conference on Distributed Multimedia Systems (DMS-2002), pages 606-611, San Francisco, 2002.
A multimedia communication environment for people with different levels of disorders is presented. A brief explanation of multimedia messages, sentences and words is provided and the system architecture and multiple interfaces are described.
[nikmir-013:2001]N. Mirenkov, O. Monakhov, and R. Yoshioka. Self-explanatory components: visualization of graph algorithms. In Proc., 2002 International Conference on Distributed Multimedia Systems (DMS-2002), pages 562-567, San Francisco, 2002.
A novel approach for using the self-explanatory component concept in the graph algorithm representation is considered. It is based on a film format, where a series of multimedia frames represents a set of algorithm features. A brief description of the film format is provided, and an observation of graph algorithm features is presented. An example related to Prims algorithm is used to explain the basic ideas of theapproach.Twoversions of the algorithm visualization, as well as film frames and an icon language of the frames are demonstrated.
[nikmir-014:2001]N. Mirenkov, O. Monakhov, and R. Yoshioka. Visualization of graph algorithms and programming in pictures. In Proc. of the 6th IASTED Con. on Software Engineering and Applications, pages 391-397, Cambridge, USA, 2002.
A new approach for using pictures, icons and animation to specify, present, explain, and programming algorithms is considered. The consideration is based on a number of examples related to Prim and Dijkstra algorithms. Several versions of these algorithm visualization, as well as corresponding pictures, icons and animation, are demonstrated and/or explained.
[nikmir-015:2001]T. Ebihara, R.Yoshioka, and N. Mirenkov. Program generation from film specifications. InProc. of the 6th IASTEDCon. on Software Engineering and Applications, pages 403-410, Cambridge, USA, 2002.
An approach to program generation from the film specification is presented. An example of template programs supporting the approach is also provided.
[nikmir-016:2001]T. Hirotomi and N. Mirenkov. Multimedia Communication Environment for Children, Handicapped, and ElderlyPeople. InProceedings of the 22nd International Conference on Distributed Computing Systems, Workshops, pages 122-127, Vienna, 2002.
Self-explanatory components for the communication of people with special needs and an overview of two interfaces of the corresponding system are presented.
[nikmir-017:2001]R. Roxas and N. Mirenkov. Visualizing External Inter-Component Interfaces. In Proceedings of the 22nd International Conference on Distributed Computing Systems, Workshops, pages 290-295, Vienna, 2002.
Despite the advances in software technology, there are still problems that need to be solved. They are related to understanding components, modifying them and their interfaces, etc., as well as to the practical use of Component-Based Development (CBD) for large-scale applications. Our approach is based on developing multiple view components of multimedia types. These multiple views can be divided into a few groups to represent different features of acomponent: (1) computational schemesof a corresponding component algorithm, (2) variables and formulas used in the algorithm, and (3) input/output (I/O) operations of the component. Such approach simplifies the understanding and manipulation of components. This paper discusses examples of visualizing I/O specifications which include the definition of data source and the corresponding target, scanning schemes applied to structures, conditions imposed upon different operations, etc .In other words, a visual language to define external intercomponent interfaces is presented.
[nikmir-018:2001]M. Saber and N. Mirenkov. Visual cellular programming based on self-explanatory component technology. In Proceedings of the 6th Joint Conference on Information Sciences, pages 931{935, North Carolina, 2002.
A set of micro-icons for creating and editing software components in a film format, and examples of cellular computations prepared in this format are considered. The design and implementation of visual environment to be used for specifying and implementing cellular algorithms are also explained.
[nikmir-019:2001]R. Yoshioka and N.Mirenkov. Representation and Manipulation with Self-explanatory Software Components. In Proceedings of the Seventh International Conference on Distributed Multimedia Systems (DMS 2001), pages 179-187, Taipei, 2001.
A new framework for data/knowledge representation and acquisition based on the idea of self-explanatory components is explained. Self-explanatory components are reusable software units that employ images and animations to encode (mainly in visual format) data/knowledge. Each component is a series of stills representing a multiple view of an object and/or process. A multiple view is to show how an object/process can be understood in terms of its relevant constituent factors. The components are acquired in an open database to be used for studying and editing some data/knowledge, and for creating new components. The components are designed to highly support self-explanatory operations and a seamless workflow from finding and editing to executing the components. To be executed, each component is supported by a set of template programs.It is possible to say, that acomponent is based on user-oriented and computer-oriented pieces of data/knowledge. This paper describes the principle concepts and design of the user-oriented part of self-explanatory components and corresponding framework, and practical solutions for the application field of computational science algorithms. The solutions include, visual languages to specify single stills and series of stills, and the component management system to showcomponents and perform editing and composing operations with them. Technical details of the implementation within Active Knowledge Studio project are also provided.
[nikmir-020:2001]N. Mirenkov and T. Hirotomi. Self-explanatory components: a new communication environment. In Proceedings of the Seventh International Conference on Distributed Multimedia Systems (DMS 2001), pages 188-196, Taipei, 2001.
Anapproachforusingthe self-explanatory component concept in multimedia message representation is considered. It is based on film "formats of multimedia symbols (multimedia words) and multimedia sentences (multimedia hieroglyphs). Corresponding films are multiple views of objects, processes, etc. They are pieces of knowledge." These pieces are acquired in a film database. The user should not study them in advance. A film management system (including self-explanatory interface panels) provides effective access to the database items. In this paper, the concept of self-explanatory components, formats to represent multimedia sentences and words, as well as a brief explanation of the film (component) management system and some implementation results are provided.
[sedukhin-004:2001]M. Soliman and S. Sedukhin. Trident: A Scalable Architecture for Scalar, Vector and Matrix Operations. In F.Lai and Editors J.Morris, editors, Proceedings of the Seventh Asia-Pacific Computer System Architecture Conference, pages 91-99. Monash University, Australian Computer Society Inc., Feb. 2002.
Within few years, a billion transistor chip will be possible to integrated. To harness the increasable huge budget of transistors, this paper proposes a multiple ISAs microprocessor. Scienti??c, engineering, multimedia, and many other applications, which are based on vector, matrix, or mixing among scalar, vector, and matrix operations, can be speeded up on the Trident microprocessor.
[sedukhin-005:2001]V. Savchenko and S. Sedukhin. Pattern Dependent Reconstruction of Raster Digital Elevation Models from Contour Maps,. In Editor J. Villanueva, editor, Proceedings of the IASTED International Conference Visualization, Imaging, and Image Processing, pages 237-244. IASTED, IASTED Press, Sep. 2001.
An implementation of 2-D sample-based interpolation for approximation of raster digital elevation data is considered. The approach couples the minimization of a terrain roughness speci??ed by a lim-ited number of contour maps and the supplement of fractal-based surface erosion to mimic appearance of natural terrain surfaces.
[sedukhin-006:2001]T.Takigahira and S. Sedukhin. Multicast Based Cluster Web Server. In Proceedings of the International Conference on Advances in Infrastructure for Electronic Business, Science, and Education on the Internet, pages 74-79. SSGRR, SSGRR Press, Aug. 2001.
A cluster of Web servers which is running under the Linux OS is proposed in this paper. The prototype implementation and performance evaluation of proposed cluster are discussed.
Chapters in Book
[sedukhin-007:2001]. Sedukhin and S. Peng. Architectural Design of Array Processors for Multi-dimensional Discrete Fourier Transform, page 27. Number 5 in Highly Parallel Computations: Algorithms and Applications. WIT Press, Southampton, UK, 2001.
Grants
[nikmir-021:2001]Nikolay Mirenkov. Research and development of multimedia interface and a system to support the aged and disabled for the Internet communication, Cooperative Research with F-COM Co., 2001.
[nikmir-022:2001]Nikolay Mirenkov. Grant-in-Aid for the Advancement of Scientific Research from Fukushima Foundation, 2001.
Academic Activities
Nikolay Mirenkov, Sep. 2001. Member, the Program Committee of the PaCT2001, Russia
[nikmir-024:2001]Nikolay Mirenkov, 2001. Member, the IFIP Working Group 10.3 (Concurrent Systems)
[nikmir-025:2001]Nikolay Mirenkov, 2001. Associate Editor, the Tamkang Journal of Science and Engineering, International Journal
[nikmir-026:2001]
Nikolay Mirenkov, 2001. Member, ACM and IEEE
[nikmir-027:2001]Nikolay Mirenkov, 2001. Referee
[nikmir-028:2001]Nikolay Mirenkov, 2001. Invited lecturer, International Lecture Series, Tamkang University
[sedukhin-008:2001]Stanislav Sedukhin, Apr. 2000. Member, Editorial Board, International Journal `Neural, Parallel & Scientific Computations'
[sedukhin-009:2001]Stanislav Sedukhin, Apr. 1991. Member, Editorial Board, International Journal `Parallel Processing Letters'
[sedukhin-010:2001]Stanislav Sedukhin, 2001. Member, IEEE CS
[sedukhin-011:2001]Stanislav Sedukhin, 2001. Member, ACM
[sedukhin-012:2001]Stanislav Sedukhin, 2001. Member, Technical Committee on Parallel Processing, IASTED
[sedukhin-013:2001]Stanislav Sedukhin, Feb. 2002. Program Committee Member, The 20th IASTED International Multi-Conference Applied Informatics (AI 2002), Innsbruck, Austria
[sedukhin-014:2001]Stanislav Sedukhin, Feb. 2002. Program Committee Member, Asia-Pacific Computer Systems Architecture Conference (ACSAC'2002), Melbourne, Asutralia
[sedukhin-015:2001]Stanislav Sedukhin, Sept. 2001. Program Committee Member, 2001 International Conference on Parallel Processing (ICPP-01): Workshop on Optical Networks, Valencia, Spain
[sedukhin-016:2001]Stanislav Sedukhin, July 2001. Program Committee Member, The Second International Conference on Parallel and Distributed Computing, Applications and Techniques (PDCAT'2001), Taipei, Taiwan
[sedukhin-017:2001]Stanislav Sedukhin, Jan.- Feb. 2001. Program Committee Member, Australian Computer Systems Architecture Conference (ACSAC-2001), Gold Coast, Australia
Patents
[nikmir-029:2001]N. Mirenkov, T. Hirotomi, and Y. Watanabe. Communication schemes based on multimedia words, hieroglyphs, and messages, (submitted, 2001-278575), Sep. 2001.
Ph.D and Other Thesis
[nikmir-030:2001]CHISATO WATANABE. Graduation Thesis: An Interface and Picture Analysis Techniques for an Observation System, University of Aizu, 2001.
Thesis Advisor: Nikolay Mirenkov
[nikmir-031:2001]HIROFUMI SAIKAWA. Graduation Thesis: A Communicator for Blind People based on Sound Button Interface, University of Aizu, 2001.
Thesis Advisor: Nikolay Mirenkov
[nikmir-032:2001]YUTAKA WATANOBE. Graduation Thesis: Hierarchical Views for Self-explanatory Components, University of Aizu, 2001.
Thesis Advisor: Nikolay Mirenkov
[nikmir-033:2001]Michie Okawa. Graduation Thesis: Supporting Disabled People with F-Talk Communication System, University of Aizu, 2001.
Thesis Advisor: Nikolay Mirenkov
[nikmir-034:2001]Yuho Tsuchida. Graduation Thesis: Editor for Self-explanatory Components, University of Aizu, 2001.
Thesis Advisor: Nikolay Mirenkov
[sedukhin-018:2001]Kazuaki Niitsuma. Graduation Thesis: Streaming SIMD implementation of matrix inversion by division-free algorithm, University of Aizu, 2001.
Thesis Advisor: Stanislav Sedukhin.
[sedukhin-019:2001]Yuji Ishimatsu. Graduation Thesis: Graphical user interface for Convoy cluster, University of Aizu, 2001.
Thesis Advisor: Stanislav Sedukhin.
[sedukhin-020:2001]Yuichi Hasegawa. Graduation Thesis: Parallel implementation of 4x4 matrix inversion on PentiumIII processor, University of Aizu, 2001.
Thesis Advisor: Stanislav Sedukhin.