By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 6 • Date Jun 1993

Filter Results

Displaying Results 1 - 13 of 13
  • An implementation of F-channels

    Publication Year: 1993, Page(s):658 - 667
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (972 KB)

    An F-channel can permit as much concurrency as a non-first-in-first-out (FIFO) communication channel and yet retain the properties of a FIFO channel that lead to simplicity of reasoning in design and proofs of the correctness of distributed algorithms. The author presents an implementation of an F-channel on top of a non-FIFO channel that derives its non-FIFO nature from a message taking any of th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Prediction-based dynamic load-sharing heuristics

    Publication Year: 1993, Page(s):638 - 648
    Cited by:  Papers (37)  |  Patents (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (916 KB)

    Presents dynamic load-sharing heuristics that use predicted resource requirements of processes to manage workloads in a distributed system. A previously developed statistical pattern-recognition method is employed for resource prediction. While nonprediction-based heuristics depend on a rapidly changing system status, the new heuristics depend on slowly changing program resource usage patterns. Fu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of the time-stamp ordering algorithm in a distributed database

    Publication Year: 1993, Page(s):668 - 676
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (532 KB)

    Time-stamp ordering is one of the consistency preserving algorithms that is used in distributed databases. F. Baccelli (1987) has introduced a queueing model that incorporates the fork-join and resequencing synchronization constraints to analyze the algorithm's performance. The power of interpolation approximation technique is illustrated by obtaining extremely good approximations for this rather ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithms and bounds for shortest paths and diameter in faulty hypercubes

    Publication Year: 1993, Page(s):713 - 718
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    In an n-dimensional hypercube Qn, with the fault set |F|<2n-2, assuming S and D are not isolated, it is shown that there exists a path of length equal to at most their Hamming distance plus 4. An algorithm with complexity O (|F|logn) is given to find such a path. A bound for the diameter of the faulty hypercube ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the granularity and clustering of directed acyclic task graphs

    Publication Year: 1993, Page(s):686 - 701
    Cited by:  Papers (131)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1216 KB)

    The authors consider the impact of the granularity on scheduling task graphs. Scheduling consists of two parts, the processors assignment of tasks, also called clustering, and the ordering of tasks for execution in each processor. The authors introduce two types of clusterings: nonlinear and linear clusterings. A clustering is nonlinear if two parallel tasks are mapped in the same cluster otherwis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A network flow model for load balancing in circuit-switched multicomputers

    Publication Year: 1993, Page(s):649 - 657
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    In multicomputers that utilize circuit switching or wormhole routing, communication overhead depends largely on link contention-the variation due to distance between nodes is negligible. This has a major impact on the load balancing problem. In this case there are some nodes with an excess load (sources) and other with a deficit load (sinks). A matching of sources to sinks is required to avoid con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Declustering: a new multiprocessor scheduling technique

    Publication Year: 1993, Page(s):625 - 637
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1220 KB)

    The authors present a new compile-time scheduling heuristic called declustering, which schedules acyclic precedence graphs that fit the synchronous data flow (SDF) model onto multiprocessor architectures. This technique accounts for interprocessor communication (IPC) overheads and considers interconnection constraints in the architecture so that shared resource contention can be avoided. The algor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cost and time-cost effectiveness of multiprocessing

    Publication Year: 1993, Page(s):704 - 712
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    Speedup and efficiency, two measures for performance of pipelined computers, are now used to evaluate performance of parallel algorithms for multiprocessor systems. However, these measures consider only the computation time and number of processors used and do not include the number of the communication links in the system. The author defines two new measures, cost effectiveness and time-cost effe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic synchrony among atomic actions

    Publication Year: 1993, Page(s):677 - 685
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (840 KB)

    Synchrony continues to be an important concern in concurrent programming. Existing languages and models have introduced a great diversity of constructs for expressing and managing synchronization among sequential processes or atomic actions. The authors put forth a model in which synchrony is viewed as a relation among atomic actions, a relation which may evolve with time. The model is shown to be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Clarifications and corrections to `performance analysis of a generalized class of m-level hierarchical multiprocessor systems' (Mar 1992 129-138)

    Publication Year: 1993, Page(s):719 - 720
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (92 KB)

    Several items in the above-titled work (ibid., vol.3, no.2, pp.129-138, Mar. 1992) are clarified and corrected View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A unified formalization of four shared-memory models

    Publication Year: 1993, Page(s):613 - 624
    Cited by:  Papers (36)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1212 KB)

    The authors present a data-race-free-1, shared-memory model that unifies four earlier models: weak ordering, release consistency (with sequentially consistent special operations), the VAX memory model, and data-race-free-0. Data-race-free-1 unifies the models of weak ordering, release consistency, the VAX, and data-race-free-0 by formalizing the intuition that if programs synchronize explicitly an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized measures of fault tolerance in n-cube networks

    Publication Year: 1993, Page(s):702 - 703
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (204 KB)

    It is shown that for a given p (1<pn ), the n-cube network can tolerate up to p2(n-p)-1 processor failures and remains connected provided that at most p neighbors of any nonfaulty processor are allowed to fail. This generalizes the result for p=n-1, obtained by A.-M Esfahanian (1989). It is also shown that the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A sliding memory plane array processor

    Publication Year: 1993, Page(s):601 - 612
    Cited by:  Papers (16)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1108 KB)

    A mesh-connected single-input multiple-data (SIMD) architecture called a sliding memory plane (SliM) array processor is proposed. Differing from existing mesh-connected SIMD architectures, SliM has several salient features such as a sliding memory plane that provides inter-PE communication during computation. Two I/O planes provide an I/O overlapping capability. Thus, inter-PE communication and I/... View full abstract»

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

Aims & Scope

IEEE Transactions on Parallel and Distributed Systems (TPDS) is published monthly. It publishes a range of papers, comments on previously published papers, and survey articles that deal with the parallel and distributed systems research areas of current importance to our readers. Particular areas of interest include, but are not limited to:

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
David Bader
College of Computing
Georgia Institute of Technology