By Topic

Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis

15-17 March 1995

Filter Results

Displaying Results 1 - 25 of 43
  • Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis

    Publication Year: 1995
    Request permission for commercial reuse | PDF file iconPDF (29 KB)
    Freely Available from IEEE
  • Visualization and sonification of methods

    Publication Year: 1995, Page(s):63 - 71
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    An approach supporting a new programming philosophy and a way of developing the corresponding technology are presented. The idea behind the approach is making use of animation films as communication units for computer-human dialog. These films have their own sets of figures, sounds, colors and their own “shape” of the movement. Users recognize the units due to a combination of all thes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Methods and tools for the efficient use of parallel computer architectures

    Publication Year: 1995, Page(s):74 - 77
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB)

    This article covers research at Technische Universitat Munchen on distributed and parallel architectures and applications. First, an overview on the parallel processing research organization is given. The second main topic covers an integrated hierarchical programming environment TOPSYS for parallel and distributed systems developed as part of the research grant View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient scalable mesh algorithms for merging, sorting and selection

    Publication Year: 1995, Page(s):280 - 286
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    Efficient scalable algorithms are developed for a mesh with fixed buses. The problems considered are merging, sorting and selection. The size of the input is fixed at n, and the mesh size is varied from √n×√n to n×n. The merging algorithm is optimal for all the mesh sizes, whereas the sorting and selection algorithms are within factors of i/(1-ε) and log4/3 ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A scalable performance analysis tool for PowerPC based MPP systems

    Publication Year: 1995, Page(s):78 - 84
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    This paper introduces a tool for optimizing programs on massively parallel computing systems. The tool has been implemented for a PowerPC based parallel computing platform. It is scalable with respect to its implementation and an the way it presents performance data. A major feature contributing to the scalable representation of performance data is the ability to focus measurements on points of in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallelizing a PDE solver: experiences with PISCES-MP

    Publication Year: 1995, Page(s):287 - 293
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    The paper presents a methodology for adapting dusty deck PDE solvers for parallel execution. Our approach minimizes changes to existing code and data structures, thereby preserving the value captured within dusty decks. This scheme uses the single program multiple data programming paradigm on message passing distributed memory architectures. To demonstrate the viability of our methodology the comm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Task scheduling with locality consideration for a clustered parallel FL reduction system

    Publication Year: 1995, Page(s):234 - 240
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    Multiprocessor systems provide us with high performance surpassing sequential computers. When constructing a multiprocessor system, task scheduling is one of the crucial issues affecting the system performance. The paper studies task scheduling for a clustered parallel reduction system of the functional language FL. We construct a shared memory multiprocessor system to realize parallel graph reduc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Software engineering techniques and tools for high performance parallel systems

    Publication Year: 1995, Page(s):85 - 91
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    This paper considers the current state of software engineering for parallel systems. A review of existing approaches and techniques identifies inadequacies. Recent work on design, verification and automated support is outlined. The next generation of embedded and distributed technologies will compound the problems through increased demand and diversity. This paper discusses the implications for th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel algorithms for maximal acyclic sets

    Publication Year: 1995, Page(s):169 - 175
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    Given a graph G=(V, E), the classical spanning forest problem of G can be viewed as the problem of finding a maximal subset F of E inducing an acyclic subgraph. Although it is well known that this problem has efficient NC algorithms, its vertex counterpart, i.e., the problem of finding a maximal subset U of V inducing an acyclic subgraph, has not been shown to be in NC (or even in RNC) and is not ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A framework for visual parallel programming

    Publication Year: 1995, Page(s):294 - 300
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB)

    One of the difficulties of parallel programming is the gap between the desire of programmers to describe computations with manageable abstractions and the detailed description of parallelism, communication and synchronization required by most parallel programming languages. Since in a parallel program, activities are distributed across both space and time, pictures are much more meaningful than te... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On finding optimal clusterings of task graphs

    Publication Year: 1995, Page(s):241 - 247
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    Currently, many parallel algorithms are defined for shared memory architectures. The preferred machine model is the PRAM, but this model does not take into account properties of existing architectures that have a distributed memory and an asynchronous execution model. A transformation of PRAM programs into distributed, asynchronous ones is known. In order to produce not only correct but also effic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Functionality in ASSY system and language of functional programming

    Publication Year: 1995, Page(s):92 - 97
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    The main features of an integrated system to support the technology of application problem parallelization, development (assembly) of parallel programs, and tuning to available resources of specific multiprocessor system in the course of their execution are presented. Also the notion of functionality is discussed. Contrary to partitioning, the assembly approach supports synthesis (in a broad sense... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel algorithms for extracting ridges and ravines

    Publication Year: 1995, Page(s):121 - 127
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    This paper proposes two parallel algorithms called an even region parallel algorithm (ERPA) and an even strip parallel algorithm (ESPA) respectively for extracting ridge and ravine geometric features of a surface. The parallel programs were implemented on a GCcl-1/64 T805 transputer based parallel machine with maximum 64 transputers. The performance of these two algorithms are reported and analyze... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault tolerance on star graphs

    Publication Year: 1995, Page(s):176 - 182
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    Fault tolerance capability is one of the advantages of multiprocessor systems. We prove that the fault tolerance of star graphs is 2n-5 with restriction to the forbidden faulty set. We propose an algorithm for examining the connectivity of star graphs when 2n-4 faults exist. The algorithm requires O(n3 logn) time. We also improve the fault-tolerant routing algorithm proposed by Bagherza... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing higher-order Gamma on MasPar: a case study

    Publication Year: 1995, Page(s):301 - 307
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    Gamma is a kernel programming language with an elegant chemical reaction metaphor in which programs are described in terms of multiset rewriting. The Gamma formalism allows one to describe an algorithm without introducing artificial sequentiality and leads to the derivation of a parallel solution to a given problem naturally. However, the difficulty of incorporating control strategies makes Gamma ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards Petri net calculi based on synchronization via places

    Publication Year: 1995, Page(s):264 - 270
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB)

    The paper addresses the problem of designing Petri net based calculi. It is pointed out that almost all existing problem oriented Petri net calculi have been developed in an ad hoc fashion, and the need for a basic formal tool which will help their design is stressed. We introduce a series of place synchronization operations ranging from primitive place synchronization to the general synchronizati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Program transformations and skeletons: formal derivation of parallel programs

    Publication Year: 1995, Page(s):250 - 256
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB)

    The paper describes-from a software engineering perspective-a framework for the formal development of parallel algorithms on arbitrary architectures. The algorithms are synthesised in a transformational way, i.e. by applying correctness preserving rewrite rules to a formal specification. The architectures are modelled by skeletons-higher order functions that represent elementary computations on a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel algorithm for solving systems of linear equations with dynamically changed length of operands

    Publication Year: 1995, Page(s):100 - 106
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    Peculiarity of the most direct algorithms for solving system of linear equations is the use of divisions for the elimination of unknowns. Division requires great time for its execution, when the multiprecision arithmetic is used because in this case it is realized by special programs. In this paper a parallel algorithm is described implementing the elimination procedure without divisions. Some res... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modified mesh-connected computers for image processing applications

    Publication Year: 1995, Page(s):139 - 145
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    The paper proposes a new architecture, which has the potential to support low-level image processing as well as intermediate and high-level vision analysis efficiently. The integrated architecture consists of a mesh of processors enhanced with an efficient recursive network. Low-level image processing is performed on the mesh processor, while intermediate and high-level vision analysis is performe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Aspects of a distributed solution of the Brusselator equation

    Publication Year: 1995, Page(s):114 - 120
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB)

    The spatial discretization of nonlinear partial differential equations (PDEs) results in large systems of nonlinear ordinary differential equations (ODEs). The discretization of the Brusselator equation is a characteristic example. For the parallel numerical solution of the Brusselator equation we use an iterated Runge-Kutta method. We propose modifications of the original method that exploit the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel polygon rendering on the graphics computer VC-1

    Publication Year: 1995, Page(s):2 - 9
    Cited by:  Papers (1)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    This paper describes a parallel polygon rendering method on the graphics computer VC-1. The architecture of the VC-1 is a loosely-coupled array of general-purpose processors, each of which is equipped with a local frame buffer. The contents of the local frame buffers are merged into one in real time considering the visibility control based on screen depth. In our polygon rendering method, polygons... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Massively parallel processing project of the Japanese Ministry of Education

    Publication Year: 1995, Page(s):30 - 37
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB)

    The Massively Parallel Processing Project started in 1992 as a priority area of research for the Ministry of Education in Japan. The objective of this research project is to establish the basic technology of massively parallel processing which is expected to be the fundamental tool to develop the high-level technologies of the 21st century. The main goal of this project is to build up a system pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hamiltonicity, vertex symmetry, and broadcasting of uni-directional hypercubes

    Publication Year: 1995, Page(s):183 - 189
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB)

    We show that the two uni-directional n-cubes, namely UHC1n and UHC2n proposed by Chou and Du (1990) as interconnection schemes are Hamiltonian. In addition, we show that (1) if n is even, both architectures are vertex symmetric; and (2) if n is odd, both architectures have exactly two vertex-symmetric components. By studying symmetry, we further prove that the maximum delay ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Investigation of some hardware accelerators for relational algebra operations

    Publication Year: 1995, Page(s):308 - 314
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB)

    This paper is devoted to the application of specialized processors for speeding-up the realization of relational algebra operations on fine-grain SIMD computers. A short description of two processors is presented. By means of a special high level language STAR, the algorithms of implementation of relational algebra operations are described in a STARAN-like computer model, and then in the same mode... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Aizu supercomputer: a massively parallel system for virtual reality problems

    Publication Year: 1995, Page(s):54 - 62
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB)

    The Aizu supercomputer is a massively parallel system suited to the solution of virtual reality problems and the support of multimedia applications. It employs a highly parallel MIMD architecture using a conflict-free internetwork system. The scalable communication system consists of two networks: a pyramid network and a reconfigurable network using optical links. The Aizu Supercomputer has a clus... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.