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
  • 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
  • Real-time sonar beamforming on a MasPar architecture

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

    This paper presents a novel approach for performing real-time sonar beamforming on linear sensor arrays using the MasPar SIMD architecture. The beamforming problem is defined as a three dimensional solution space by generating a cube structure with sonar array elements as one dimension, the required beams in another dimension, and the time samples in the third dimension. The given approach maps th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load-balancing in sparse matrix-vector multiplication

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

    We consider the load-balanced multiplication of a large sparse matrix with a large sequence of vectors, on parallel computers. Due to the associated computational and inter-node communication challenges, we propose a method that combines fast load-balanced work allocation with efficient message passing implementations. The performance of the proposed method was evaluated on benchmark matrices as w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending functional languages with stateful computations

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

    A new approach in which stateful computations can be performed within the framework of a functional programming language is presented. In most functional programming languages, programmers are unable to easily manipulate state-based computations which are not supported by functional languages. To solve this problem, the authors propose to extend the Sisal language with special user declared variab... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Almost two-state self-stabilizing algorithm for token rings

    Publication Year: 1996, Page(s):52 - 59
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 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.
  • 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.
  • Optimistic parallel computation: an example from computational chemistry

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

    Performance penalties due to synchronization are a common concern in parallel programming. Traditional approaches enforce the correct ordering of write operations using locks, but this can be time-consuming and drastically reduce the benefits of using a parallel machine. Instead, for certain classes or programs we propose using an optimistic approach where the solution is calculated without any lo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new fixed degree regular network for parallel processing

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

    We propose a family of regular Cayley network graphs of degree three based an permutation groups for design of massively parallel systems. These graphs are shown to be based on the shuffle exchange operations, to have logarithmic diameter in the number of vertices, and to be maximally fault tolerant. We investigate different algebraic properties of these networks (including fault tolerance) and pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient parallel scheduling algorithm

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

    Most static scheduling algorithms that schedule parallel programs represented by directed acyclic graphs (DAGs) are sequential. This paper discusses the essential issues on parallelization of static scheduling algorithms. An efficient parallel scheduling algorithm, the HPMCP algorithm, is proposed. It produces high-quality scheduling and is much faster than existing algorithms View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A bulk-synchronous parallel library implementation for the BBN butterfly GP1000

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

    One of the fundamental goals of parallel computing is to develop a framework that will support portable and efficient application programs. The Bulk-Synchronous Parallel (BSP) model was proposed to help achieve this goal. The BSP model is intended to be a “unifying model”-it addresses both software and hardware issues by allowing theoretical analysis to coexist with practical physical ... 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.
  • A foundation for designing deadlock-free routing algorithms in wormhole networks

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

    This paper provides necessary and sufficient conditions for deadlock-free unicast and multicast routing with the path-based routing model in interconnection networks which use the wormhole switching technique. The theory is developed around three central concepts: channel waiting, false resource cycles, and valid destination sets. The first two concepts are suitable extensions to those developed f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient file transmission algorithm for distributed computing systems

    Publication Year: 1996, Page(s):48 - 51
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    In a distributed system, executing a program often requires the access of remote data files. An efficient data transmission strategy is thus important for real-time applications. Since data files may be replicated and their locations are transparent to the executed program, it becomes the system's responsibility to select a proper file server such that data can be transmitted in an effective way. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concatenated parallelism: a technique for efficient parallel divide and conquer

    Publication Year: 1996, Page(s):488 - 495
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB)

    Efficient divide and conquer algorithms can be mapped to a parallel computer using either task parallelism or data parallelism. The former involves significant data movement and the latter can lead to severe load imbalances. A new strategy is proposed, which the authors call concatenated parallelism, for efficient parallel solution of problems resulting in divide and conquer trees. Their strategy ... 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.
  • 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.
  • 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 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.
  • Integrating task and data parallelism in an irregular application: a case study

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

    Recently, there has been growing interest in simultaneous exploitation of task and data parallelism in scientific applications and in compiler and runtime support of this combined form of parallelism. In this paper we report on the integration of task and data parallelism on an important irregular application from the VLSI computer-aided design field, namely VLSI layout verification. We report on ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal and efficient parallel algorithms for summing and prefix summing

    Publication Year: 1996, Page(s):504 - 511
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    The author considers the problem of designing efficient parallel algorithms for summing and prefix summing. The author presents optimal algorithms for summing on a latency-dependent distributed-memory model and shows that any optimal summing algorithm must have an inherent structure. Moreover, the author presents optimal or near-optimal algorithms for prefix summing for both non-commutative and co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Average distance and routing algorithms in the star-connected cycles interconnection network

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

    The star-connected cycles (SCC) graph was recently proposed as an attractive interconnection network for parallel processing, using a star graph to connect cycles of nodes. The paper presents an analytical solution for the problem of the average distance of the SCC graph. They divide the cost of a route in the SCC graph into three components, and show that one of such components is affected by the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Almost complete address translation (ACATS) disk array declustering

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

    We present a novel declustering scheme (ACATS) for reliability stripes in an orthogonal disk array. Our scheme is deterministic, run-time efficient and provides frequently the best possible and always an almost best possible distribution of failure-induced incremental rebuild workloads. Our scheme provides protection against single disk as well as single string failures within the disk array. Our ... View full abstract»

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