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 (4)
    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.
  • 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 (74 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 characterizat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improvement to dynamic stream handling in dataflow computers

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

    This paper presents a new method of implementing dynamic streams of streams using token relabelling which reduces the complexity and drawbacks of the previously proposed method due to Gaudiot. Consider a sequence of tokens, Vi/sub [ui]/, which will appear in sequence on the stream-carrying arc. Two tokens Va/sub [ux]/ and Vb/sub [uy]/, will be considered belonging to the same stream if they have t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimising FFT BAFFS on the Fujitsu VPP500

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

    Under the auspices of the mathematical software development contract with Fujitsu, a Fast Fourier transform library for the Fujitsu VPP500 has been implemented at the Australian National University. The software is written in modular form, using a library of Basic Fast Fourier Transform Subroutines (BAFFS) which derive from the splitting formula for a Fourier transform. Here, the expected performa... 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.
  • 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.
  • Performance modelling for a distributed ISDN protocol test system

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

    Conformance testing of communication protocols has recently become a major issue in the context of OSI-based standardization of protocols. The aim of conformance testing is to assure that a protocol fulfils an OSI specification. A performance study is presented for a distributed protocol test system that has been installed for conformance testing of the ISDN D-channel signalling protocol. Using a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using parallel semi-join reduction to minimize distributed query response time

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

    A one-shot semi-join reduction approach was recently proposed to execute all semi-joins on the same relation simultaneously such that the relation only needs to be scanned once. The one-shot semi-join reduction approach was applied to reducing distributed query response time under the assumption that one copy of each referenced relation has been chosen prior to the production of an execution plan.... 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.
  • Fault-tolerant orthogonal fat-trees as interconnection networks

    Publication Year: 1995, Page(s):749 - 754 vol.2
    Cited by:  Papers (7)
    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.
  • A parallel-computation model for nonlinear electromagnetic field analysis by harmonic balance finite element method

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

    This paper presents a parallel computation model for the time-periodic nonlinear electromagnetic field analysis in the frequency domain using harmonic balance finite element method (HBFEM). The proposed model, different from the traditional HBFEM technique that requires large memory and long CPU time, divides the global system matrix into a number of matrices in the frequency domain. Each computat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance comparison of buffering schemes for multistage switches

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

    Multistage Interconnection Networks (MIN) are used to connect processors and memories in large scale scalable multiprocessor systems. MINs have also been proposed as switching fabrics in ATM networks in the future Broadband ISDN networks. A MIN consists of several stages of small crossbar switching elements (SE). Buffers are used in the SEs to increase the throughput of the MIN and prevent interna... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrating memory consistency models and communication systems

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

    The shared memory paradigm offers a well known programming model for parallel systems. But it lacks from its bad performance in conventional implementations if it is used in large grain or page based systems. The main problems are (1) the transparent view on the system level, (2) the false sharing caused by locating several consistency units into the same transportation unit, and that (3) high lev... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Packet multiplexing: an efficient router implementation for adaptive mesh networks

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

    The performance of an interconnection network with adaptive routing is strongly related to the deadlock avoidance method it applies. Virtual channels are normally used for this purpose in mesh and torus networks. This work compares true architectural alternatives in the router design: mapping each virtual channel onto a different physical link and multiplexing the set of virtual channels onto the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Object-oriented expert systems parallel knowledge processing in a CORBA-based architecture

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

    Knowledge based systems (KBS) of first generation are characterized by the separation of domain specific knowledge and general problem solving strategies. Such systems lack of the following important abilities: knowledge acquisition according different paradigms of representation and processing, definition of deep knowledge caused by physiological processes of reasoning, and management of differen... 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.
  • Transactional paradigm: applications to distributed programming

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

    A transactional paradigm is suggested for computer-assisted parallelization of programs and register-cache scheduling. It can serve as a building tool for pipelining, data parallellism, or generic parallellism in a variety of architectures and the cost of execution can be estimated realistically View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimal lower bound on the maximum speedup in multiprocessors with clusters

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

    We consider an ideal multiprocessor system with q processors and a centralized scheduler without overhead that selects processes from one common pool, permitting dynamic relocation of processes. A parallel program P consisting of n processes is executed on this system and terminates when all processes are completed. Due to synchronizations, processes may be blocked while waiting for events in othe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A formal study on the fault tolerance of parallel and distributed systems

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

    This paper analyzes the ability of several bounded degree networks that are commonly used for parallel computation to tolerate faults. Among other things it is shown that an N-node butterfly containing N1-ε worst-case faults (for any constant ε>0) can emulate a fault-free butterfly of the same size with only constant slowdown. Similar results are proven for the shuffle-exch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithmic aspects and computing trends in computational electromagnetics using massively parallel architectures

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

    Accurate and rapid evaluation of radar signature for alternative aircraft/store configurations would be of substantial benefit in the evolution of integrated designs that meet radar cross section requirements across the threat spectrum. Finite-volume time domain methods offer the possibility of modeling the whole aircraft, including penetrable regions and stores, at longer wavelengths on today's s... 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 (3)
    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.
  • Accurate analysis of multistage interconnection networks using finite output-buffered switching elements

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

    Many of the existing analytical models for output buffered switching elements (SE) assume uniform traffic and infinite buffers at each output port of an SE. Moreover, because of simplifying assumptions, the results are not accurate. It is important to develop an accurate analytical model to tailor the design of the network parameters and optimize the network performance by proper dimensioning of t... 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.