By Topic

Parallel Algorithms/Architecture Synthesis, 1995. Proceedings., First Aizu International Symposium on

Date 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
  • Improvement of duplication scheduling heuristic algorithm with nonstrict triggering of program graph nodes

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

    The problem of multiprocessor scheduling can be stated as finding a schedule for a general task graph to be executed on a multiprocessor system so that the schedule length can be minimised. This scheduling problem is known to be NP-hard, and heuristic algorithms have been proposed to obtain optimal and suboptimal solutions. Duplication scheduling heuristic algorithm solves the max-min problem of p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Promising data parallel environment-ADEPS, ADETRAN and ADENA

    Publication Year: 1995, Page(s):45 - 53
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    This paper compares some parallel computation schemes from view of simple usage, and proposes ADEPS as the most highly recommended. As shown, it produces simple programming language ADETRAN and also sophisticated machine architecture, called ADENA. Some established models of ADENAs are introduced as well as a new hopeful one as the next generation of supercomputers, called TFLOPS machines 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.
  • 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.
  • 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
    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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • Cohesion: an efficient distributed shared memory system supporting multiple memory consistency models

    Publication Year: 1995, Page(s):146 - 152
    Cited by:  Papers (6)  |  Patents (2)
    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.
  • Implementing a 3D multigrid algorithm on Fujitsu's vector parallel supercomputer

    Publication Year: 1995, Page(s):107 - 113
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB)

    Multigrid algorithms are well adopted by many engineering applications programs on the traditional sequential computers due to their good convergence behavior. In order to convert those existing resources to the field of parallel computing in a timely manner, an effective parallelization methodology should be set up to ease the conversion efforts and to take advantage of the power of parallel proc... 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • An experimental study of load balancing on Amoeba

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

    The paper presents the results of an experimental study of load balancing using job initiation and process migration, carried out on Amoeba (A.S. Tanenbaum et al., 1990). The results indicate the need for a load balancing facility in a distributed system to improve system performance, e.g., the average response time of processes. A number of load balancing algorithms, including the bidding and nei... 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:  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.