By Topic

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
  • Dual of a complete graph as an interconnection network

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

    A new class of interconnection networks, called hypernetworks, was proposed recently. Hypernetworks are characterized by hypergraphs. Compared with point-to-point networks, they allow for increased resource-sharing and communication bandwidth utilization, and they are especially suitable for optical interconnects. The authors propose a scheme for deriving new hypernetworks using hypergraph duals. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The APHID parallel αβ search algorithm

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

    The paper introduces the APHID (Asynchronous Parallel Hierarchical Iterative Deepening) game-tree search algorithm. APHID represents a departure from the approaches used in practice. Instead of parallelism based on the minimal search tree, APHID uses a truncated game-tree and all of the leaves of that tree are searched in parallel. APHID has been programmed as an easy to implement, game-independen... 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.
  • 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.
  • A compiler address transformation for conflict-free access of memories and networks

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

    A method for mapping arrays into parallel memories to minimize serialization and network conflicts for lock-step systems is presented. Each array is associated an arbitrary number of data access patterns that can be identified following compiler data-dependence analysis. Conditions for conflict-free access of parallel memories and network are derived for arbitrary power-of-2 data patterns and arbi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The active-ray approach to rendering on distributed memory multiprocessors

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

    Object dataflow is a popular approach used in parallel rendering. The data representing the 3D scene is statically distributed among processors and objects are fetched and cached only on demand. Most previous object dataflow methods were implemented on shared memory architectures and exploited spatial coherency to reduce hardware cache misses. We propose an efficient model for object dataflow para... 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.
  • Generalized parallel selection in sorted matrices

    Publication Year: 1996, Page(s):281 - 285
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (428 KB)

    This paper presents a parallel algorithm running in time O(log m log* m(log log m+log(n/m))) time on an EREW PRAM with O(m/(log m log* m)) processors for the problem of selection in an m×n matrix with sorted rows and columns, m⩽n. Our algorithm generalizes the result of Sarnath and He (1992) for selection in a sorted matrix of equal dimensions, and thus answers the open question they pos... 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 (4)  |  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.
  • 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.
  • On staggered checkpointing

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

    A consistent checkpointing algorithm serves a consistent view of a distributed application's state on stable storage. The traditional consistent checkpointing algorithms require different processes to save their state at about the same time. This causes contention for the stable storage, potentially resulting in large overheads. Staggering the checkpoints taken by various processes can reduce chec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed list coloring: how to dynamically allocate frequencies to mobile base stations

    Publication Year: 1996, Page(s):18 - 25
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    To avoid signal interference in mobile communication it is necessary that the channels used by base stations for broadcast communication within their cells are chosen so that the same channel is never concurrently used by two neighboring stations. We model this channel allocation problem as a generalized list coloring problem and we provide two distributed solutions which are also able to cope wit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compile-time inter-query dependence analysis

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

    Most parallel databases exploit two types of parallelism: intra-query parallelism and inter-transaction concurrency. Between these two cases lies another type of parallelism: inter-query parallelism within a transaction or application. Exploiting inter-query parallelism requires either compiler support to automatically parallelize the existing embedded query programs; or programming support to wri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of parallel algorithms for a fingerprint image comparison system

    Publication Year: 1996, Page(s):410 - 413
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    This paper addresses the problem of analyzing the performance of parallel algorithms for the training procedure of a neural network based fingerprint image comparison (FIC) system. The target architecture is assumed to be a coarse-grain distributed memory parallel architecture. Two types of parallelism: node parallelism and training set parallelism (TSP) are investigated. These algorithms are impl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed, low contention task allocation

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

    Designing a good task allocation algorithm faces the challenge of allowing high levels of throughput, so that tasks are executed fast and processor parallelism is exploited, while still guaranteeing a low level of memory contention, so that performance does not suffer because of limitations on processor-to-memory bandwidth. In this paper, we present a comparative study of throughput and contention... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast deterministic sorting on large parallel machines

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

    Many sorting algorithms that perform well on uniformly distributed data suffer significant performance degradation on non-random data. Unfortunately many real-world applications require sorting on data that is not uniformly distributed. In this paper we consider distributions of varying entropies. We describe A-Ranksort, a new sorting algorithm for parallel machines, whose behavior on input distri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel algorithms for fast computation of normalized edit distances

    Publication Year: 1996, Page(s):496 - 503
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    The authors give work-optimal and polylogarithmic time parallel algorithms for solving the normalized edit distance problem. The normalized edit distance between two strings X and Y with lengths n⩾m is the minimum quotient of the sum of the costs of edit operations transforming X into Y by the length of the edit path corresponding to those edit operations. Marzal and Vidal (1993) proposed a se... 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.
  • A framework for automatic dynamic data mapping

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

    Physically-distributed memory multiprocessors are becoming popular and data distribution and loop parallelization are aspects that a parallelizing compiler has to consider in order to get efficiency from the system. The cost of accessing local and remote data can be one or several orders of magnitude different, and this can dramatically affect the performance of the system. It would be desirable t... 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.