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
  • 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.
  • 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.
  • 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.
  • 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.
  • Concurrent rollback for crash recovery in extended hypercube networks

    Publication Year: 1995, Page(s):206 - 212
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    Recovering from processor failures is an important problem in the design and development of reliable systems. We present a concurrent rollback algorithm in extended hypercube networks to recover from crash failures which involves small message and time complexities. The network of an extended hypercube is a hierarchical, low diameter, recursive structure. By appending only O(1) additional informat... 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
    Cited by:  Papers (1)
    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.
  • Fault tolerant routing in toroidal networks

    Publication Year: 1995, Page(s):162 - 168
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB)

    We give an O(r2) time algorithm for constructing a fault-free routing path of optimal length between any true non-fault nodes of an r-dimensional torus with 2r-1 faulty nodes. We show that the Rabin diameter of a r-dimensional torus is its diameter plus one. We also describe a cluster fault tolerant (CFT) routing model and give an efficient algorithm for node-to-node CFT routing View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non-blocking concurrency control in distributed database systems

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

    Concurrency control based on conventional techniques requires additional efforts for deadlock detection and elimination. The possibility of a deadlock is also connected to the introduction of delays, and repeated restarts of transactions in deadlock cycles. In the proposed approach, a technique for generation of data flow precedence graphs among transactions at data sites has been studied. The loc... 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.
  • 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.
  • Dynamic randomized simulation of hierarchical PRAMs on meshes

    Publication Year: 1995, Page(s):257 - 263
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    The Hierarchical PRAM (H-PRAM) (T. Heywood, S. Ranka, 1992) model is a dynamically partitionable PRAM, which charges for communication and synchronization, and allows parallel algorithms to abstractly represent general locality. We show that the H-PRAM can be implemented efficiently on a two dimensional mesh. We use the Peano indexing scheme to hierarchically partition the mesh. Multiple subPRAMs ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cohesion: an efficient distributed shared memory system supporting multiple memory consistency models

    Publication Year: 1995, Page(s):146 - 152
    Cited by:  Papers (8)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    This paper describes a prototype of DSM called Cohesion which supports two memory consistency models, namely Sequential consistency and Release consistency, within a single program to improve the performance and supports wide-variety of parallel programs for the system. Memory that is sequentially consistent is further divided into object-based and conventional (page-based) memory; where they are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 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.
  • Garbage collection in message passing distributed systems

    Publication Year: 1995, Page(s):213 - 218
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB)

    Distributed systems use optimistic message logging for recovery from transient process failures. Such a recovery is facilitated by asynchronous message logging and check-pointing. It is also supported by garbage collection which requires identifying messages in stable storage that are no longer needed for the process of recovery. For this purpose, it is necessary to keep track of message dependenc... 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.
  • 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.
  • 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.
  • Constructing parallel implementations with algebraic programming tools

    Publication Year: 1995, Page(s):271 - 277
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    An approach to declarative construction of parallel implementations (dynamical parallelizers) for a general class of sequential imperative programs by means of the algebraic programming system APS is considered. It gives advantages of rapid prototyping and evolutionary development of efficient parallelizers. An operational model of a dynamical parallelizer in the form of transition system is const... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of communication data: compression network

    Publication Year: 1995, Page(s):199 - 205
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    The paper reports the effect of compressed message delivery (a compression network) on a parallel processing system such as workstation clusters. Compression network is simulated on a massively parallel processor, the Thinking Machines CM-5, using the parallel language Split-C. To examine the benefit of data compression to the system, profiles, including message pattern, number of messages, and me... 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.
  • On the effect of spare positioning on the reconfigurability of two-dimensional processor arrays

    Publication Year: 1995, Page(s):153 - 159
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB)

    We investigated some reconfiguration and routing aspects of fault tolerant processing arrays. An interconnection topology with disjoint buses for the horizontal and vertical connections, called “double bus array”, was adopted. Reconfiguration of the array after diagnosis encompasses the allocation of spare units to replace the faulty processors, renaming of the processor elements and i... 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.
  • 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.
  • Supercompilers for massively parallel architectures

    Publication Year: 1995, Page(s):315 - 322
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB)

    We describe the design of a compilation system, which translates Fortran programs automatically into explicitly parallel programs for a massively parallel architecture. Such a compiler must automatically generate data distributions and derive program transformation strategies based on a combination of heuristics and analysis features. Programs are subjected to an iterative tuning process, involvin... View full abstract»

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