By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 11 • Date Nov 1993

Filter Results

Displaying Results 1 - 8 of 8
  • Distributed concurrency control based on limited wait-depth

    Publication Year: 1993, Page(s):1246 - 1264
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1652 KB)

    The performance of high-volume transaction processing systems for business applications is determined by the degree of contention for hardware resources as well as for data. Hardware resource requirements may be met cost-effectively with a data-partitioned or shared-nothing architecture. However, the two-phase locking (2PL) concurrency control method may restrict the performance of a shared-nothin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient mapping algorithms for a class of hierarchical systems

    Publication Year: 1993, Page(s):1230 - 1245
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1316 KB)

    Proposes techniques for mapping application algorithms onto a class of hierarchically structured parallel computing systems. Multiprocessors of this type are capable of efficiently solving a variety of scientific problems because they can efficiently implement both local and global operations for data in a two-dimensional array format. Among the set of candidate application domains, low-level and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of client-server systems

    Publication Year: 1993, Page(s):1217 - 1229
    Cited by:  Papers (23)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1060 KB)

    A client-server system is a distributed system where a server station receives requests from its client stations, processes the requests and returns replies to the requesting stations. The authors consider client-server systems in which a set of workstations access a file server over a local area network. The systems are modelled by a class of stochastic Petri nets. The mean response time, the thr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Prediction of performance and processor requirements in real-time data flow architectures

    Publication Year: 1993, Page(s):1205 - 1216
    Cited by:  Papers (7)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1024 KB)

    Presents a new data flow graph model for describing the real-time execution of iterative control and signal processing algorithms on multiprocessor data flow architectures. Identified by the acronym ATAMM, for Algorithm to Architecture Mapping Model, the model is important because it specifies criteria for a multiprocessor operating system to achieve predictable and reliable performance. Algorithm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Replication algorithms in a remote caching architecture

    Publication Year: 1993, Page(s):1185 - 1204
    Cited by:  Papers (47)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1976 KB)

    Studies the cache performance in a remote caching architecture. The authors develop a set of distributed object replication policies that are designed to implement different optimization goals. Each site is responsible for local cache decisions, and modifies cache contents in response to decisions made by other sites. The authors use the optimal and greedy policies as upper and lower bounds, respe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The direction vector I test

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

    The GCD and Banerjee tests are the standard data dependence tests used to determine whether a loop may be parallelized/vectorized. In an earlier work, (1991) the authors presented a new data dependence test, the I test, which extends the accuracy of the GCD and the Banerjee tests. In the original presentation, only the case of general dependence was considered, i.e., the case of dependence with a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Control versus data flow in parallel database machines

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

    The execution of a query in a parallel database machine can be controlled in either a control flow way, or in a data flow way. In the former case a single system node controls the entire query execution. In the latter case the processes that execute the query, although possibly running on different nodes of the system, trigger each other. Lately, many database research projects focus on data flow ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image shrinking and expanding on a pyramid

    Publication Year: 1993, Page(s):1291 - 1296
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    Develops two algorithms to perform the q step shrinking and expanding of an N×N binary image on a pyramid computer with an N×N base. The time complexity of both algorithms is O(√q). However, one uses O(√q) space per processor, while the per-processor space requirement of the other is O(1) 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