By Topic

Parallel Processing Symposium, 1995. Proceedings., 9th International

Date 25-28 April 1995

Filter Results

Displaying Results 1 - 25 of 122
  • Performance measurements of a concurrent production system architecture without global synchronization

    Publication Year: 1995, Page(s):790 - 797
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    The use of the serializability criterion of correctness allows the elimination of global synchronization in production system machines. We present an extensive performance evaluation of a concurrent production system architecture that is based on serializability and takes advantage of modern associative memory devices to allow parallel production firing, concurrent matching, and overlap among matc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Divide-and-conquer programming on MIMD computers

    Publication Year: 1995, Page(s):734 - 741
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    We have developed a programming template to implement divide and conquer algorithms on MIMD computers. The template is based on the parallel divide and conquer function of Z.G. Mou and P. Hudak (1988). We explore the programmability and performance of this approach by solving some well known numerical problems on a shared memory multiprocessor and a multicomputer. A byproduct of this work is a new... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • &ACE: a high-performance parallel Prolog system

    Publication Year: 1995, Page(s):564 - 571
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (833 KB)

    In recent years a lot of research has been invested in parallel processing of numerical applications. However, parallel processing of Symbolic and AI applications has received less attention. This paper presents a system for parallel symbolic computing, named ACE, based on the logic programming paradigm. ACE is a computational model for the full Prolog language, capable of exploiting Or-parallelis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proceedings of 9th International Parallel Processing Symposium

    Publication Year: 1995
    Request permission for commercial reuse | PDF file iconPDF (40 KB)
    Freely Available from IEEE
  • Characterizing parallel file-access patterns on a large-scale multiprocessor

    Publication Year: 1995, Page(s):165 - 172
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (759 KB)

    High-performance parallel file systems are needed to satisfy tremendous I/O requirements of parallel scientific applications. The design of such high-performance parallel file systems depends on a comprehensive understanding of the expected workload, but so far there have been very few usage studies of multiprocessor file systems. This paper is part of the CHARISMA project, which intends to fill t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast distributed optimal routing algorithm for multicommodity large data networks

    Publication Year: 1995, Page(s):551 - 555
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    A a new distributed algorithm is investigated for optimal routing problems of large data network with multicommodities. The existing algorithms for general network topology have parallel time complexity of at least O(MΦ2) using all the nodes of the network as processors. Our algorithm takes O(mΦ2) time units using the same number of processors if some mild network con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient communication using total-exchange

    Publication Year: 1995, Page(s):544 - 550
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    A central question in parallel computing is to determine the extent to which one can write parallel programs using a high-level, general-purpose, and architecture-independent programming language and have them executed on a variety of parallel and distributed architectures without sacrificing efficiency. A large body of research suggests that, at least in theory, general-purpose parallel computing... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DISHA: a deadlock recovery scheme for fully adaptive routing

    Publication Year: 1995, Page(s):537 - 543
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    This paper presents a simple method of implementing an efficient and cost effective routing scheme. The strategy considers deadlock recovery as opposed to prevention to optimize performance in the absence of deadlocks. Cycles are broken by re-routing a blocked packet through a deadlock-free lane which is implemented as a central “floating” buffer. The proposed scheme is extremely simpl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SYNAPSE-1: a high-speed general purpose parallel neurocomputer system

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

    The paper describes the general purpose neurocomputer SYNAPSE-1 which has been developed in cooperation between Siemens Munich and the University of Mannheim. This system contains one of the most powerful processors available for neural algorithms, the neuro signal processor MA16. The prototype system executes a test algorithm 8000 times as fast as a Sparc-2 workstation. This processing speed has ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient scheme for complete exchange in 2D tori

    Publication Year: 1995, Page(s):532 - 536
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB)

    All-to-all personalized communication, or complete exchange, is at the heart of numerous applications in parallel computing. An efficient complete exchange algorithm is proposed for square 2n×2 n wormhole-routed tori. Previous work has only considered complete exchange algorithms for mesh networks. The proposed algorithm effectively uses the bisection bandwidth of a tor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Geometric mesh partitioning: implementation and experiments

    Publication Year: 1995, Page(s):418 - 427
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (896 KB)

    We investigate a method of dividing an irregular mesh into equal-sized pieces with few interconnecting edges. The method's novel feature is that it exploits the geometric coordinates of the mesh vertices. It is based on theoretical work of Miller, Teng, Thurston, and Vavasis, who showed that certain classes of “well-shaped” finite element meshes have good separators. The geometric meth... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance comparison of fast distributed mutual exclusion algorithms

    Publication Year: 1995, Page(s):258 - 264
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    Several fast and low-overhead distributed mutual exclusion algorithms have been proposed. Each of these algorithms required O(log n) messages per critical section entry and O(log n) bits of storage per processor. In this paper, we make a comparative performance study of four distributed mutual exclusion algorithms. Since the algorithms we study are the basis for distributed synchronization, distri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel algorithms for maximum matching in interval graphs

    Publication Year: 1995, Page(s):84 - 92
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (820 KB)

    Given a set of n intervals representing an interval graph, the problem of finding a maximum matching between pairs of disjoint (nonintersecting) intervals has been considered in the sequential model. We present parallel algorithms for computing maximum cardinality matchings among pairs of disjoint intervals in interval graphs an the EREW PRAM and hypercube models. For the general case of the probl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • NERV: a parallel processor for standard genetic algorithms

    Publication Year: 1995, Page(s):782 - 789
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    The paper describes the implementation of a standard genetic algorithm (GA) on the MIMD multiprocessor system NERV. It discusses the special features of the NERV hardware which can be utilized for an efficient implementation of a GA without changing the structure of the algorithm. The NERV multiprocessor is a system which has been originally designed for the efficient simulation of neural networks View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A rugged scalable parallel system

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

    Tremendous strides are being made in the development of applications for scalable, parallel, high performance computing systems. One of the factors limiting further applications has been the lack of small, rugged, embeddable systems to support embedded airborne, shipboard, and landbased installations operating in severe environments. Litton Guidance and Control Systems, together with MasPar Comput... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Experience with active messages on the Meiko CS-2

    Publication Year: 1995, Page(s):140 - 149
    Cited by:  Papers (16)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (940 KB)

    Active messages provide a low latency communication architecture which on modern parallel machines achieves more than an order of magnitude performance improvement over more traditional communication libraries. This paper discusses the experience we gained while implementing active messages on the Meiko CS-2, and discusses implementations for similar architectures. During our work we have identifi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel deadlock-free routing technique for a class of de Bruijn graph based networks

    Publication Year: 1995, Page(s):524 - 531
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    This paper introduces a new deadlock-free routing algorithm with fewer virtual channels than the known algorithm for a generalized de Bruijn digraph of m virtual channels, where m is the maximum message path length and r is a radix. Our new algorithm requires maximum m-[m-1/r] virtual channels per physical channel. Extension to this algorithm for a generalized de Bruijn graph... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A unified theory for a traffic analysis in product networks

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

    Instead of providing separate solutions for each individual network, a unified theory is desirable to cover the study of a class of networks. Cartesian product graphs provide a common framework to investigate the performance of several individual networks. This paper addresses communication capabilities of product networks. It presents a unified theory to evaluate the traffic intensity and the sat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On generalized fat trees

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

    We introduce and analyze a new family of multiprocesser interconnection networks, called generalized fat trees, which include as special cases the fat trees used for the connection machine architecture CM-5, pruned butterflies, and various other fat trees proposed in the literature. The generalized fat trees provide a formal unifying concept to design and analyse a fat tree based architecture. The... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The emulation problem on trees

    Publication Year: 1995, Page(s):251 - 255
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    In this paper, an optimal emulation for trees is proposed. Besides, as an extension of the proposed emulation for trees, optimal emulations for X-trees, m-ary trees, and pyramids are also proposed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel algorithms for space-time adaptive processing

    Publication Year: 1995, Page(s):77 - 81
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    We examine the signal processing problem of space-time adaptive processing (STAP) from a computational point of view. Specifically, we implement an STAP algorithm on the IBM PowerParallel SP1 computer. The two main challenges are solving multiple least squares problems simultaneously and finding an efficient way of implementing multiple computational steps that demand different optimal data distri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SPI: an instrumentation development environment for parallel/distributed systems

    Publication Year: 1995, Page(s):494 - 501
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    This paper presents an overview of the Scalable Parallel Instrumentation (SPI) tool being developed at Honeywell. SPI provides a complete development and execution environment for developing real-time instrumentation functions for heterogeneous parallel/distributed systems. This includes: C-extensions and development tools for the event-action programming model, run-time support for transparent ev... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PCODE: an efficient and reliable collective communication protocol for unreliable broadcast domain

    Publication Year: 1995, Page(s):130 - 139
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (932 KB)

    Existing programming environments for clusters are typically built on top of a point-to-point communication layer (send and receive) over local area networks (LANs) and, as a result, suffer from poor performance in the collective communication part. For example, a broadcast that is implemented using a TCP/IP protocol (which is a point-to-point protocol) over a LAN is obviously an efficient as it i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transformable computers & hardware object technology

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

    We define transformable computing systems as those machines that use the reconfigurable aspects of field programmable gate arrays (FPGA) to implement an algorithm. Researchers throughout the world have shown that computationally intensive software algorithms can be transposed directly into hardware design for extreme performance gain. The on-the-fly use of digital designs in a reconfigurable compu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Access order to avoid inter-vector-conflicts in complex memory systems

    Publication Year: 1995, Page(s):404 - 410
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    The performance of a vector processor accessing vectors is strongly dependent on the conflicts produced in the memory subsystem. The concurrent memory access of several vector streams causes inter-conflicts between the references of different vectors. In a complex memory system (several memory modules are mapped in every bus) the number of conflicts increases because the bus must be shared by the ... View full abstract»

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