Scheduled Maintenance on March 25th, 2017:
Single article purchases and IEEE account management will be unavailable from 4:00 AM until 6:30 PM (ET). We apologize for the inconvenience.
By Topic

Proceedings.Seventh IEEE Symposium on Parallel and Distributed Processing

25-28 Oct. 1995

Filter Results

Displaying Results 1 - 25 of 98
  • Proceedings of Seventh IEEE Symposium on Parallel and Distributed Processing

    Publication Year: 1995
    Request permission for commercial reuse | PDF file iconPDF (469 KB)
    Freely Available from IEEE
  • Data parallel logic programming in &ACE

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

    &ACE is a high performance parallel Prolog system developed at the Laboratory for Logic, Databases, and Advanced Programming that exploits and-parallelism from Prolog programs. &ACE was developed to exploit MIMD parallelism. However, SPMD parallelism also arises naturally in many Prolog programs. In this paper we develop runtime techniques that allow systems that have primarily been designed to ex... View full abstract»

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

    Publication Year: 1995
    Request permission for commercial reuse | PDF file iconPDF (123 KB)
    Freely Available from IEEE
  • All-to-all broadcast in torus with wormhole-like routing

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

    This paper deals with collective communications on distributed-memory parallel machines. We are interested in the design of efficient all-to-all broadcast algorithms on square torus of processing nodes using wormhole-like routing mechanism. The execution time is influenced by three factors, namely, the number of steps, the transmission rate and the maximum distance to cross. We first compute the l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient algorithm for k-pairwise node disjoint path problem in hypercubes

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

    In this paper, we give an efficient algorithm for the following k-pairwise node disjoint path problem in n-dimensional hypercubes Hn: Given k=[n/2] pairs of 2k distinct nodes (s1, t1), ..., (sk, tk) in Hn, n⩾4, find k node disjoint paths si→ti, 1⩽i⩽k. Our algorithm finds the k node disjoint pat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimal, deadlock-free routing in hypercubic and arbitrary networks

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

    In this paper we consider the problem of creating minimal, deadlock-free routing algorithms, where a routing algorithm is said to be minimal if it uses only shortest paths. In particular we examine the possibility of creating scalable algorithms that use only a constant number of buffers per node. Minimal, scalable, deadlock-free routing algorithms are known for many important networks including m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel heap: A practical priority queue for fine-to-medium-grained applications on small multiprocessors

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

    We present an efficient implementation of the parallel heap data structure on a bus-based Silicon Graphics multiprocessor GTX/4D. Parallel heap is theoretically the first heap-based data structure to have implemented an optimally scalable parallel priority queue on an exclusive-read exclusive-write parallel random access machine. We compared it with Rao-and-Kumar's concurrent heap and with the con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient job scheduling in a mesh multicomputer without discrimination against large jobs

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

    Many innovative schemes for allocating jobs to parallel computing systems have been proposed in order to achieve highly utilized parallel computing systems. The schemes have tried to achieve good job response times with little system fragmentation of processing resources. Since most schemes have concentrated on approaches for processor allocation, the schemes have used First-Come-First-Serve (FCFS... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Edge-disjoint embedding of large full binary trees into hypercubes

    Publication Year: 1995, Page(s):669 - 672
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB)

    We present two embedding methods of the full binary tree into the hypercube when the tree has greater number of nodes than the hypercube. Both methods map the tree edges onto the edge-disjoint paths of the hypercube(each hypercube edge being considered as two anti-parallel directed edges), and distribute the same level tree nodes evenly to the hypercube nodes. One embedding method with the optimal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An adaptive global reduction algorithm for wormhole-routed 2D meshes

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

    This paper presents a global reduction algorithm for wormhole-routed 2D meshes. Well-known reduction algorithms that are optimized for short vectors have complexity O(M log N), where N=n×n is the number of nodes, and M the vector length. Algorithms suitable for long vectors have complexity O(√N+M). Previously known asymptotically optimal algorithms with complexity O(log N+M) incur inhe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resilient distributed objects: Basic results and application to shared tuple spaces

    Publication Year: 1995, Page(s):320 - 327
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    Given a shared, atomic read-modify-write register r with deterministic operations, Herlihy (1991) has defined an interference condition on the operations of r and shown that this condition must be satisfied for r to support wait-free consensus. We extend this interference condition to general linearizable shared objects with nondeterministic operations. The extension is applicable to the entire se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automated processor specification and task allocation for embedded multicomputer systems: The packing-based approaches

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

    This paper considers the coupled design problems of processor specification and task allocation for embedded multicomputer systems. A packing-based representation is proposed that allows the problems to be solved concurrently. An algorithm based on this representation is described that utilizes a new heuristic packing technique coupled with an incremental design advisor. This algorithm, named IDAT... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hop-congestion trade-offs for high-speed networks

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

    Message transmission in ATM networks is via virtual paths. Packets are routed along virtual paths by maintaining a routing field whose subfields determine the intermediary destinations of the packet. In such a network it is important to construct path layouts that minimize the hop number (i.e. the number of virtual paths used to travel between any two nodes) as a function of edge-congestion (i.e. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient software multicast in wormhole-routed unidirectional multistage networks

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

    A system-level multicast service, in which the same message is delivered from a source node to an arbitrary number of destination nodes, is fundamental in supporting collective communication primitives including the application-level broadcast, reduction, and barrier synchronization. This paper addresses how to efficiently implement multicast services in wormhole-routed unidirectional multistage i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Wait-free consensus in “in-phase” multiprocessor systems

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

    In the consensus problem in a system with n processes, each process starts with a private input value and has to choose irrevocably a decision value, which was the input value of some process of the system; moreover, all processes have to decide on the same value. This work deals with the problem of wait-free-fully resilient to processor crash and napping failures-consensus of n processes in an &l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tradeoffs in implementing primary-backup protocols

    Publication Year: 1995, Page(s):280 - 288
    Cited by:  Papers (4)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    One way to implement a fault-tolerant service is to replicate the state of the service across a primary server and a set of backup servers. Clients make requests to the primary, which then computes the response, informs the backups of the state change, and then replies to the client. If the primary subsequently fails, then a backup takes over as the new primary. Informally, a primary-backup protoc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bubble scheduling: A quasi dynamic algorithm for static allocation of tasks to parallel architectures

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

    We propose an algorithm for scheduling and allocation of parallel programs to message-passing architectures. The algorithm considers arbitrary computation and communication costs, arbitrary network topology, link contention and underlying communication routing strategy. While our technique is static, the algorithm is quasi dynamic because it is not specific to any particular system topology and th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving triangular linear systems in parallel using substitution

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

    Working within the LogP model, we present parallel triangular solvers which use forward/backward substitution and show that they are optimal. We begin by deriving several lower bounds on execution time for solving triangular linear systems. Specifically, we derive lower bounds in which it is assumed that the number of data items per processor is bounded, a general lower bound, and lower bounds for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and analysis of a systolic sorting architecture

    Publication Year: 1995, Page(s):652 - 659
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    We present a new parallel sorting algorithm that uses a fixed-size sorter iteratively to sort inputs of arbitrary size. A parallel sorting architecture based on this algorithm is proposed. This architecture consists of three components, linear arrays that support constant-time operations, a multilevel sorting network, and a termination detection tree, cell operating concurrently in systolic proces... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Perfectly secure message transmission in asynchronous networks

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

    We study the problem of perfectly secure communication in general asynchronous networks where processors and communication lines may be Byzantine faulty. To our knowledge, this is the first work that solves the secure message transmission (SMT) problem on asynchronous networks. The algorithms we develop do not rely on any complexity theoretic assumptions and simultaneously achieve the goals of per... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data streaming: very low overhead communication for fine-grained multicomputing

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

    Recent developments have greatly reduced network latencies in multiprocessor networks. Thus, software overhead is becoming the primary cost of multiprocessor communication. This paper proposes data streaming-a technique which places explicit send and receive instructions in the user code-as a means to cut software overhead to a minimum. Data streaming has the added benefit that it can tighten the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Designing a distributed queue

    Publication Year: 1995, Page(s):304 - 311
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    A common paradigm for distributed computing is the producer-consumer model. One set of processes produce objects (data, resources, or tasks) that are consumed by another set of processes. We present a simple algorithm for implementing a distributed queue. This algorithm has several parameters that need to be tuned, such as the number of probes to find an object, the amount of buffering, and the co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Matching micro-kernels to modern applications using fine-grained memory protection

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

    Scalable distributed systems, systems whose processing power remains proportional to the number of component processors, require a programming methodology where an application developer may take existing software modules and plug them together to form a new application. To allow mistrusting modules to interact, the underlying kernel support must offer protection barriers which do not impede perfor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incremental design of scalable interconnection networks using basic building blocks

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

    We present an incremental design of scalable interconnection networks using basic building blocks, including both network topologies and routing. We consider wormhole-routed small-scale 2D meshes as basic building blocks. The minimum requirement to expand these networks is a single building block. This implies that the network does not have to maintain the regular 2D mesh topology. We introduce so... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cache memories in dataflow architecture

    Publication Year: 1995, Page(s):182 - 189
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (820 KB)

    The recent advance in dataflow processing - to combine the dataflow paradigm with the control flow paradigm - has brought out many new challenging issues. This hybrid organization has made it possible to study familiar control flow concepts within the framework of the dataflow architecture. The concept of cache memory has proven its effectiveness in the von Neumann architecture due to the spatial ... View full abstract»

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