Parallel and Distributed Processing, 1996., Eighth IEEE Symposium on

23-26 Oct. 1996

Filter Results

Displaying Results 1 - 25 of 83
  • Eighth IEEE Symposium On Parallel And Distributed Processing

    Publication Year: 1996, Page(s):iii - xi
    Request permission for commercial reuse | PDF file iconPDF (585 KB)
    Freely Available from IEEE
  • Almost two-state self-stabilizing algorithm for token rings

    Publication Year: 1996, Page(s):52 - 59
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (726 KB)

    A self-stabilizing distributed system is a network of processors, which, regardless of its initial global state, will achieve the desired state in a finite number of steps. There are two main performance issues in the design of a self-stabilizing system: the stabilization time and memory requirements (the number of states required by each process). We first show that the probabilistic two-state al... View full abstract»

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

    Publication Year: 1996, Page(s):538 - 541
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    The authors present a new optimization for or-parallel logic programming (Prolog) systems, called last alternative optimization (LAO). The LAO follows from the flattening principle and the principle of duality of or-parallelism and and-parallelism. Originally LAO was conceived as the dual of last parallel call optimization, an optimization developed for and-parallel systems. LAO enables Prolog pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proceedings of International Conference on Computer Aided Design

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (349 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1996, Page(s):616 - 618
    Request permission for commercial reuse | PDF file iconPDF (153 KB)
    Freely Available from IEEE
  • The “express channel” concept in hypermeshes and k-ary n-cubes

    Publication Year: 1996, Page(s):566 - 569
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB)

    Low-dimensional k-ary n-cubes have been popular in recent multicomputers. However these networks suffer from high switching delays due to their high message distance. To overcome this problem, Dally (1990) has proposed express k-ary n-cubes with express channels, that allow non-local messages to partially bypass clusters of nodes within a dimension. The paper argues that hypergraph topologies, tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving the parallelism and concurrency in decoupled architectures

    Publication Year: 1996, Page(s):130 - 137
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    Concurrency between access and execution has been exploited by queues in many decoupled access-execute architectures, but data dependent control dependencies often prohibit prefetching of data to queues. This paper investigates a technique to facilitate anticipatory loading to queues even in presence of data dependent control dependencies. The proposed method consists of fetching along one or both... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Virtual embeddings on regular topology networks

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

    The paper considers distributed processing over a switch-based LAN and addresses loss-free routing of non-reserved, bursty data traffic. The approach is based on embedding multiple virtual rings onto the underlying network topology with the following two constraints: (i) each virtual ring is Hamiltonian (i.e., includes each node exactly once), and (ii) rings are mutually edge disjoint. New techniq... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparison of two storage models in data-driven multithreaded architectures

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

    Multithreaded execution models attempt to combine some aspects of dataflow-like execution with von Neumann model execution, with the objective of masking the latency of inter-processor communications and remote memory accesses in multiprocessors. An important issue in the analysis and evaluation of multithreaded execution is the design and performance of the storage hierarchy. Because of the seque... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mapping and parallel implementation of Bayesian belief networks

    Publication Year: 1996, Page(s):608 - 611
    Cited by:  Papers (2)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB)

    Presents an efficient technique for mapping arbitrarily large Bayesian belief networks on hypercubes with deadlock-free implementation. We show that the speedup does not vary with the number of nodes in the Bayesian network and is limited by the height of the Peot-Shachter tree which is obtained by hanging the Bayesian polytree by a pivot node. We also found that the overhead in implementing Bayes... View full abstract»

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

    Publication Year: 1996, Page(s):376 - 383
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    Indexing multidimensional data is inherently complex leading to slow query processing. This behavior becomes more pronounced with the increase in database size and/or number of dimensions. In this paper we address this issue by processing an index structure in parallel. First, we study different ways of partitioning an index structure. We then propose efficient algorithms for processing each query... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Palindrome network for fault-tolerant interconnection

    Publication Year: 1996, Page(s):556 - 561
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    A new interconnection network composed of 3×3 switching elements is proposed. This new network is called Palindrome interconnection network (PIN) with hardware complexity identical to its counterparts. Compared with its counterparts, the proposed network is fault-tolerant, as totally disjoint paths exist in the network between any source/destination pair. In addition, for a given routing tag... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recovering scalable spin locks

    Publication Year: 1996, Page(s):314 - 322
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    We present a mechanism for making a scalable spin lock protocol, the MCS lock recoverable, thereby ensuring that a lock never becomes permanently unavailable, even if one or more processes using the lock die. This is achieved by modifying the original protocol to write additional information to shared memory and introducing a cleanup process which returns locks to a usable state in case of process... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Prolog on the multithreaded Datarol-II machine based on the logicflow execution model

    Publication Year: 1996, Page(s):112 - 121
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    The paper shows how a massively parallel Prolog implementation can be achieved on the multithreaded Datarol-II machine. First the main features of the parallel Logicflow Model are summarized. It was developed for implementing Prolog on massively parallel computers. Prolog programs are transformed into a dataflow-like graph called the Logicflow Graph in which nodes are macro dataflow nodes and toke... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient algorithms for block-cyclic redistribution of arrays

    Publication Year: 1996, Page(s):74 - 83
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (984 KB)

    We present new algorithmic techniques for a classical research problem, runtime redistribution of an array from one block-cyclic layout to another. Our methodology for reducing communication overheads is based on a generalized circulant matrix formalism. Using this formalism, we derive direct, indirect, and hybrid communication schedules for the cyclic redistribution problem when the block size ch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Embedding of k-ary complete trees into hypercubes with optimal load

    Publication Year: 1996, Page(s):600 - 607
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    The main result of the paper is an algorithm for embedding k-ary complete trees into hypercubes with optimal load and asymptotically optimal dilation. The algorithm is fully scalable, the dimension of the hypercube can be chosen independently of the arity and height of the complete tree. The basic property of the embedded tree is that both all the tree nodes at a given level and all the tree nodes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A load balancing algorithm for bus-oriented systems

    Publication Year: 1996, Page(s):370 - 374
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB)

    We report the results of a study of the performance of a load balancing algorithm for bus-oriented systems based on graph coloring. In this algorithm the processors use local knowledge for the purpose of load balancing. Node coloring concept is used to group the processors. This avoids the selection/rejection operations encountered in many load balancing algorithms proposed in the literature. Also... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Guaranteed intrusion removal from monitored distributed applications

    Publication Year: 1996, Page(s):422 - 425
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    This paper presents on-line perturbation tracking and intrusion removal techniques which are designed to accommodate delays which occur due to monitoring activities. These accommodations eliminate the effect of monitoring intrusion on the execution behavior and the scheduling of the monitored computation. By maintaining an adjusted time view, the intrusion removal system preserves the execution or... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On optimal placements of processors in tori networks

    Publication Year: 1996, Page(s):552 - 555
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (364 KB)

    Two and three dimensional k-tori are among the most used topologies in the designs of new parallel computers. Traditionally (with the exception of the Tera parallel computer), these networks have been used as fully-populated networks, in the sense that every routing node in the topology is subjected to message injection. However, fully populated tori and meshes exhibit a theoretical throughput whi... View full abstract»

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

    Publication Year: 1996, Page(s):306 - 313
    Cited by:  Papers (7)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    Typical communication networks for parallel processing are based on sending data from one processor to one, or all, of the other processors. Using such a network, many simple operations that require information from every processor requires many point-to-point or broadcast communications. These aggregate operations can be as simple as a barrier synchronization or as complex as an arithmetic reduct... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A hierarchical processor scheduling policy for multiprocessor systems

    Publication Year: 1996, Page(s):100 - 109
    Cited by:  Papers (5)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (916 KB)

    Processor scheduling policies can be broadly divided into space-sharing and time-sharing policies. Space-sharing policies partition system processors and each partition is allocated exclusively to a job. In time-sharing policies, processors are temporally shared by jobs (e.g., in a round robin fashion). Equipartition is a dynamic space-sharing policy that has been proposed and studied extensively.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A framework for modeling applications as distributed active objects

    Publication Year: 1996, Page(s):68 - 72
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    This paper identifies a framework for modeling applications as distributed active objects, which can either be used to design a new active distributed multidatabase architecture or can be applied to an existing multidatabase architectural design to make it active. A system whose design follows a model such as the one proposed in this paper is referred to as an active multidatabase system, for it i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A hardware multicast routing algorithm for two-dimensional meshes

    Publication Year: 1996, Page(s):198 - 205
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (780 KB)

    Multicast communication is a significant operation an multicomputer systems and can be used to support several other collective communication operations. Hardware implementation is a viable solution to develop a low latency multicast algorithm. In this paper, we present a new multicast routing algorithm for two-dimensional meshes. The algorithm uses wormhole routing mechanism and can send messages... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A deterministic model of time for distributed systems

    Publication Year: 1996, Page(s):593 - 598
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB)

    The paper proposes a linear, deterministic, logical time model for distributed systems. The authors give an account of causality within distributed systems which undergirds the time model. They discuss some advantages for the application programmer in using the time model View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The direct dimension exchange method for load balancing in k-ary n-cubes

    Publication Year: 1996, Page(s):366 - 369
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB)

    The dimension exchange method (DEM) was initially proposed as a load-balancing algorithm for the hypercube structure. It has been generalized to k-ary n-cubes. However the k-ary n-cube algorithm must take many iterations to converge to a balanced state. In this paper we propose a direct method to modify DEM. The new algorithm Direct Dimension Exchange (DDE) method, takes load average in every dime... View full abstract»

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