By Topic

Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing

19-21 April 1995

Go

Filter Results

Displaying Results 1 - 25 of 72
  • Benchmarking parallel simulation algorithms

    Publication Year: 1995, Page(s):611 - 620 vol.2
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (654 KB)

    Parallel simulation has been an active research area for more than a decade. The parallel simulation community needs a common benchmark suite for performance evaluation of parallel simulation environments. Performance evaluation of a parallel simulation environment is harder than evaluating a parallel processing system, since the underlying system is nor only composed of architecture and operating... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Memory design for row/column/diagonal access

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (36 KB)

    Summary form only given. Vectorizing involves parallel access to data elements from a random access memory (RAM). However, a single memory module of conventional design can access no more than one word during each cycle of the memory clock. One common solution is to partition the memory into multiple modules or memory banks with address interleaving, leading to a number of disadvantages and restri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation of an optimal parallel algorithm for arithmetic expression parsing

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (76 KB)

    Development of efficient algorithms for parallel computer architectures is an on-going research area and in the recent past a great volume of theoretical work has been carried out for the search of suitable algorithms in concurrent processing environment. In this paper, the results obtained in the implementation of an Optimal Parallel Algorithm developed by Deng and Iyengar (1992) in the esoteric ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new design methodology for optical hypercube interconnection network

    Publication Year: 1995, Page(s):920 - 922 vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB)

    An efficient design methodology for the construction of an optical space invariant hypercube interconnection network is presented. This network connects a two-dimensional array of input nodes to a two-dimensional array of output nodes. The basis of the design is a 2 6 node hypercube from which hypercubes of higher dimensions can be built. The requirements for the optical implementation ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multicast switching network for B-ISDN

    Publication Year: 1995, Page(s):916 - 919 vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB)

    To support broadband integrated services digital networks (B-ISDN), switching networks must have the ability to provide both multipoint connections (multicasting) and point-to-point connections (unicasting). This paper proposes a multicast switching network based on a recently proposed routing network which consists of two banyan networks with links at every stage to allow cell transfer to and fro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing photon event recognition algorithms on a 3D-flow system

    Publication Year: 1995, Page(s):761 - 769 vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (532 KB)

    This report describes an implementation on the 3D-flow system developed at the Superconducting Super Collider Lab. of the algorithms and equipment to recognize valid photon events using a morphological analysis of the signals of an intensified CCD in the photon counting mode. The analysis consists of calculating the coordinates of a matrix corresponding to the exact position of each incident photo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Vectoring the N-body problem on the CM-5

    Publication Year: 1995, Page(s):863 - 866 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    We develop an optimized program for the N-body problem on the CM-5 with vector units. The work is intended to make full use of the power of the vector pipelines provided by the CM-5 equipped with vector units to improve the computation performance. Some development issues using the vector units are discussed. The code is written in CDPEAC, an assembly-like language which can be called from C. Perf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of shared buffer multistage networks with hot spot

    Publication Year: 1995, Page(s):799 - 808 vol.2
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    Multistage interconnection networks based on shared buffering are known to have better performance and buffer utilization than input or output buffered switches. Shared buffer switches do not suffer from head of line blocking which is a common problem in simple input buffering. Shared buffer switches have previously been studied under uniform and unbalanced traffic patterns. However, due to the co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel coding of moving images using fractals

    Publication Year: 1995, Page(s):913 - 915 vol.2
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    A parallel fractal-based algorithm for predictive coding of a sequence of images is presented. The first frame in the sequence is fractal coded and transmitted. Each next frame is obtained as a motion compensated prediction by geometrically transforming the previous frame. The difference between the actual new frame and its prediction is fractal coded and transmitted to the receiver, in order to b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extensible, flexible and secure services in Angel, a single address space operating system

    Publication Year: 1995, Page(s):755 - 758 vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    The modern operating system is caught between the rapid evolution of application requirements and the equally rapid evolution of hardware platforms. The ability for the system to adapt to meet these demands is increasingly paramount, yet the mechanisms provided, by most commercial systems, to achieve these goals are either too restrictive or too slow to be viable. Recent research work has concentr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • HPSF: a horizontally-divided parallel signature file method

    Publication Year: 1995, Page(s):559 - 562 vol.2
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB)

    In order to achieve good performance, the signature file approach has been required to support parallel database processing. Therefore, in this paper we propose a horizontally-divided parallel signature file method (HPSF) using extendible hashing and frame-slicing techniques. In addition, we propose a heuristic processor allocation methods so that we may assign signatures into a given number of pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A slicing-floorplan algorithm implementation for VLSI design

    Publication Year: 1995, Page(s):859 - 862 vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB)

    This paper describes a floorplan design approach that combines both a heuristic graph bipartitioning procedure and a slicing tree representation in the physical design of VLSI systems. The description of the circuit to be floorplanned contains a set of functional modules each having a number of possible dimensions and a net-list containing the connectivity information. The slicing tree representat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Properties of communication modes in distributed systems

    Publication Year: 1995, Page(s):501 - 504 vol.2
    Cited by:  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB)

    This paper studies properties of messages communication modes in distributed systems. It establishes a simple, hierarchical and homogeneous characterization of logically instantaneous, causally ordered and first-in-first-out communications. It is shown that a distributed computation obeys one of the previous communication modes iff a communication graph of messages does not include a cycle. This c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards a choice of region algorithms for the evaluation of parallel vision architectures

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (52 KB)

    The research presented here focuses on the general problem of finding tools and methods for parallel machine evaluation. “Benchmarks” are the most popular tools for machines speed comparison, unfortunately, they do not give any information on the most convenient hardware structures for implementation of a given vision problem. This paper tries to overcome this problem, and proposes a c... View full abstract»

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

    Publication Year: 1995, Page(s):792 - 795 vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB)

    Early experiments with parallel multigrid used square domains and uniform grids. More recently, several authors have considered problems with more complicated domains (see for example McCormick's AFAC method (1989) and Baden et al. (1994)). However, these methods still use structured grids. In this paper we present a program which is based upon unstructured grids. By allowing unstructured grids we... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel processing algorithms and architecture for multimedia on-demand servers

    Publication Year: 1995, Page(s):905 - 912 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB)

    Advances in networking and storage technologies have made it possible to-build multimedia on-demand servers that provide service similar to those of neighborhood videotape rental stores. In this work, we propose a specialized high-performance programmable multiprocessor. Architecture which allows continuous playback of media-streams to large number of clients, a critical factor in multimedia serve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerant orthogonal fat-trees as interconnection networks

    Publication Year: 1995, Page(s):749 - 754 vol.2
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    Orthogonal fat-trees are a type of interconnection network with several desirable characteristics: short distance between processors, constant degree of the switching elements, uniform traffic load, symmetry, and recursive scalability. We first show how to build two-level orthogonal fat-trees, where each node has a fixed degree and there is a maximum distance of two between any two leaves. We then... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic load sharing within workstation clusters

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (76 KB)

    Workstation clusters, in which user processes run on one specified machine, cause the potential for a load imbalance. An analysis is conducted to determine how various system resources interact with one another in terms of job throughput and user interaction time. Quantitative and qualitative analyses of theoretical load sharing methods are used in the development of a well engineering system whic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • VPEcons: a visual constructor for parallel programming

    Publication Year: 1995, Page(s):565 - 574 vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    The performance and cost-performance benefits of parallel systems make them attractive platforms for many applications. But, these are unfortunately offset by the difficulties of programming parallel computers. Therefore, programming tools are the key to achieve greater success in developing applications for parallel architectures. This paper describes a new tool, VPEcons, for parallel programming... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PVM implementation of quadtree building algorithms on SIMD hypercube system

    Publication Year: 1995, Page(s):855 - 858 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (204 KB)

    Representation of data using hierarchical data structures is commonly used in applications such as computer graphics, digital image processing, computer vision and techniques are being evolved for efficient representation of these data. Transforming bilevel images to linear quadtrees is a way of representing the high-volume data. In this paper, the preliminary investigation and results thus obtain... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multithreaded self-scheduling: application of multithreading on loop scheduling for distributed shared memory multiprocessor

    Publication Year: 1995, Page(s):680 - 689 vol.2
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    A new loop scheduling scheme called multithreaded self-scheduling (MSS) for distributed shared memory multiprocessor is proposed. Based on the principles of multithreading, MSS attempts to hide the remote memory access latencies by switching between multiple contexts of threads. Consequently, loops scheduled by using MSS can obtain better performance comparing to the single-thread approaches. In t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reduced reachability graphs with parallel actions and dynamic replacement

    Publication Year: 1995, Page(s):493 - 500 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB)

    Analysis of communication protocols by the conventional state exploration is a well known technique. It is actually implemented in several tools of validation. The major problem of this technique is its restricted applicability and depends on the available memory. The number of reachable states is often large and sometimes infinite. In this paper we discuss a reduction technique to build small gra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A feedback neural network for signal processing and event recognition

    Publication Year: 1995, Page(s):788 - 791 vol.2
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB)

    Recent years have witnessed a growing interest in the study of neural networks. A lot of work has been on understanding how various computational problems can be solved adopting these models. This paper describes an asynchronous feedback neural network, the photon event identification problem in an astrophysics experiment, and shows some promising results View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SIMD hypercube algorithm for complete Euclidean distance transform

    Publication Year: 1995, Page(s):874 - 877 vol.2
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB)

    The Euclidean distance transform (EDT) converts a binary image into one where each pixel has a value equal to its Euclidean distance to the nearest foreground pixel. A parallel EDT algorithm on SIMD hypercube computer is presented here. For an n×n image, the algorithm has a time complexity of O(n) on an n2 nodes machine. With modifications to minimize dependency among partitions, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A software instrumentation technique for performance tuning of message-passing programs

    Publication Year: 1995, Page(s):595 - 598 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB)

    A major problem with collecting trace data for performance monitoring is its intrusiveness to the program being monitored. It sometimes distorts the run-time behaviour of the program so that the collected data become irrelevant to its original program. We proposed a new technique, called the postponing technique, to maintain the original program behaviour in order to collect accurate performance d... View full abstract»

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