Scheduled System Maintenance
On Tuesday, September 26, IEEE Xplore will undergo scheduled maintenance from 1:00-4:00 PM ET.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

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
  • A journey into multicomputer routing algorithms

    Publication Year: 1995, Page(s):19 - 27
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (828 KB)

    We survey various aspects of packet routing, namely (partial) permutation, h-relation routing, routing to random destinations, dynamic routing, isotonic routing, fault tolerant routing, and related sorting results. We present theoretical results for general graphs and the hypercube topology, assuming both SIMD and MIMD communication models 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.
  • 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.
  • 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.
  • 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.
  • Cohesion: an efficient distributed shared memory system supporting multiple memory consistency models

    Publication Year: 1995, Page(s):146 - 152
    Cited by:  Papers (6)  |  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.
  • GRAPE project for a dedicated tera-flops computer

    Publication Year: 1995, Page(s):38 - 44
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB)

    We are constructing a one tera-flops machine dedicated to astronomical many-body problems. It consists of parallelized GRAPE machines connected to a host workstation. The GRAPE machines only calculate forces between particles in the system by pipeline architecture. We designed and fabricated LSI chips for it, and about 2000 chips are being connected in parallel. The machine will be in operation by... 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • Logical timing (global synchronization of asynchronous arrays)

    Publication Year: 1995, Page(s):130 - 138
    Cited by:  Papers (11)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    The problem of global synchronization is solved for asynchronous processor arrays and multiprocessor systems with an arbitrary interconnection graph. Global synchronization of asynchronous systems is treated as a homomorphic mapping of an asynchronous system behavior in logical time onto the behavior of the corresponding synchronous system with a common clock functioning in physical time. The solu... 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.