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.
  • A fault tolerant hierarchical interconnection network and its bandwidth analysis

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

    A number of hierarchical interconnection networks (HINs) has been proposed in the literature which can be used for building large cluster-based multiprocessors. It is very desirable that a HIN must be fault tolerant, because even a single fault in the network can completely disconnect a large number of processors and memory modules from the rest of the system. As a result, the performance of the s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fault tolerant load sharing replicated buffered banyan network

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

    We propose a fault tolerant multistage interconnection network (MIN) design that utilises load sharing amongst multiple buffered banyan switch planes, which provides excellent performance and good reliability allows on-line repair and easy maintenance, and offers an easy and effective way to implement priority traffic transmission. Our simulations clearly show that replicated load sharing shared b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generic recursive algorithm for fault-tolerant computing

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

    This paper presents a generic recursive algorithm for fault-tolerant computing. The algorithm uses recursive majority voting to achieve fault tolerance on a multiprocessor system. Both space and time redundancy are employed dynamically in the algorithm. By defining different parameters, the algorithm can be applied to different situations. The correctness and performance analysis of the algorithm ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The study of reducing branch penalty by hardware

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

    Pipeline technique is the major method to increase the performance of single processor, but when processing branch instructions, we must wait the result of branch to decide the next instruction; we call the waiting time “Branch Penalty”, which will influence the performance of pipeline processor. Branch target buffer is an important method to resolve the branch penalty, but branch pena... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A method of optimising data distribution on a loosely coupled multiprocessor system

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

    The maximum speedup of a multiprocessor system is limited by the sequential part of an algorithm and in loosely coupled processor systems, a large part of this sequentiality is caused by the communication between processors. As this communication is dependent on the distribution of data the data distribution must be optimised in order to achieve the maximum speedup. In this paper we present a new ... 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.
  • A global code scheduling technique using guarded PDG

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

    For instruction-level parallel machines, it is essential to extract parallelly executable instructions from a program by code scheduling. In this paper, we propose a new code scheduling technique using an extension of PDG. This technique parallelizes non-numerical programs, producing better machine codes than these created by percolation scheduling 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 (64 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[ui], which will appear in sequence on the stream-carrying arc. Two tokens Va[ux] and Vb[uy] , will be considered belonging to the same strea... 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.
  • 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.
  • Parallel program debugging using scalable visualization

    Publication Year: 1995, Page(s):699 - 708 vol.2
    Cited by:  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    The paper describes methods and tools for debugging parallel programs by visualization and animation of the execution behavior of the programs. Based on an evaluation and classification of existing visualization environments, the visualization and animation tool VISTOP (VISualization TOol for Parallel Systems) was developed as part of the integrated tool environment TOPSYS (TOols for Parallel SYSt... 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.
  • 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.
  • A comparison between the powers of the PARBS and the RMBM

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

    The Processor Array with Reconfigurable Bus System (PARBS) and the Reconfigurable Multiple Bus Machine (RMBM) are models of parallel computation based on reconfigurable bus and processor array. The PARBS is a processor array that consists of processors arranged to a 2-dimensional grid with a reconfigurable bus system. The RMBM is also made of processors and reconfigurable bus system, but the proce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A communication framework for heterogeneous distributed pattern analysis

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

    Unlike in traditional approaches to parallel or distributed processing where normally well structured problems are implemented completely in some programming environment we are faced with the problem of integrating existing heterogeneous software systems. Furthermore, pattern analysis stresses special aspects of communication capabilities. Therefore, we propose a new communication framework dedica... 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.
  • Performance analysis of median filtering on Meiko-a distributed multiprocessor system

    Publication Year: 1995, Page(s):631 - 639 vol.2
    Cited by:  Patents (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (572 KB)

    This paper presents the performance analysis of realizing median filtering on a distributed multiprocessor system. The results of the performance analysis give a good indication of the performance gain in using multi-processor for median filtering over uni-processor. Such performance gain is proportional to the problem size as shown by varying the size of the image. Furthermore, through the analys... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and performance measurements of an execution model for the parallel processing of Prolog programs

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

    This paper presents a hierarchical parallel execution model for Prolog programs, the execution model is based on Or-parallelism/And-parallelism as coarse-grain parallelism, and parallel unification as fine-grain parallelism. At the coarse-grain parallelism level we propose an extended And-Or tree. Consequently, the tree can exploit high degree of parallelism from Prolog programs. Exploiting parall... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asynchronous interaction in massively parallel computing

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

    From the standpoint of hardware experts, asynchronism is connected with the concept of physical time as an independent physical variable and is determined by the variations of transient process durations in hardware circuits, modules and blocks that are physical objects by their nature. Software and architecture experts treat asynchronism as a partial order on events that are logical objects, i.e.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Orchid: the design of a parallel and portable software platform for local area networks

    Publication Year: 1995
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (60 KB)

    Orchid is a portable software platform aiming to decouple the parallel software development from the underlying system. Having layered structure, Orchid can be easily ported to different architectures only by reconstructing its lowest level. It also provides advanced facilities not supported by most operating systems and software platforms 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.
  • An optimal parallel algorithm for the Euclidean distance maps of binary images

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

    The Euclidean distance map (EDM) of a black and white n×n binary image is the n×n map where each element has the Euclidean distance between the corresponding pixel and the nearest black pixel. The EDM plays an important role in machine vision, pattern recognition and robotics. Many algorithms have been proposed for computing the EDM. In recent years, O(n2) time sequential al... 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.