By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 12 • Date Dec 1995

Filter Results

Displaying Results 1 - 9 of 9
  • Dynamic task allocation models for large distributed computing systems

    Publication Year: 1995, Page(s):1301 - 1315
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1900 KB)

    Dynamic task allocation for distributed computing systems (DCS) is an important goal to be achieved for engineering applications. The purpose of dynamic task allocation is to increase the system throughput in a dynamic environment, which can be done by balancing the utilization of computing resources and minimizing communication between processors during run time. In this paper, we propose two dyn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resource-constrained software pipelining

    Publication Year: 1995, Page(s):1248 - 1270
    Cited by:  Papers (25)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2480 KB)

    This paper presents a software pipelining algorithm for the automatic extraction of fine-grain parallelism in general loops. The algorithm accounts for machine resource constraints in a way that smoothly integrates the management of resource constraints with software pipelining. Furthermore, generality in the software pipelining algorithm is not sacrificed to handle resource constraints, and sched... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Processor mapping techniques toward efficient data redistribution

    Publication Year: 1995, Page(s):1234 - 1247
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1520 KB)

    Run-time data redistribution can enhance algorithm performance in distributed-memory machines. Explicit redistribution of data can be performed between algorithm phases when a different data decomposition is expected to deliver increased performance for a subsequent phase of computation. Redistribution, however, represents increased program overhead as algorithm computation is discontinued while d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparative modeling and evaluation of CC-NUMA and COMA on hierarchical ring architectures

    Publication Year: 1995, Page(s):1316 - 1331
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1448 KB)

    Parallel computing performance on scalable shared-memory architectures is affected by the structure of the interconnection networks linking processors to memory modules and on the efficiency of the memory/cache management systems. Cache Coherence Nonuniform Memory Access (CC-NUMA) and Cache Only Memory Access (COMA) are two effective memory systems, and the hierarchical ring structure is an effici... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sorting n2 numbers on n×n meshes

    Publication Year: 1995, Page(s):1221 - 1225
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    We show that by folding data from an n×n mesh onto an n×(n/k) submesh, sorting on the submesh, and finally unfolding back onto the entire n×n mesh it is possible to sort on bidirectional and strict unidirectional meshes using a number of routing steps that is very close to the distance lower bound for these architectures View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel simulated annealing algorithm with low communication overhead

    Publication Year: 1995, Page(s):1226 - 1233
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (796 KB)

    In this paper, we propose a parallel simulated annealing algorithm based on the technique presented by Witte et al. (1991) but with low communication overhead. The performance of our proposed algorithm is significantly better than the method presented by Witte et al., particularly for optimization problems where the time required to communicate the solution is comparable to the evaluation time. Th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fault-tolerant algorithm for replicated data management

    Publication Year: 1995, Page(s):1271 - 1282
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1392 KB)

    We examine the tradeoff between message overhead and data availability that arises in the design of fault-tolerant algorithms for replicated data management in distributed systems. We propose a property called asymptotically high resiliency which is useful for evaluating the fault-tolerance of replica control algorithms and distributed mutual exclusion algorithms. We present a new algorithm for re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized algorithms for systematic synthesis of Branch-and-Combine clock networks for meshes, tori, and hypercubes

    Publication Year: 1995, Page(s):1283 - 1300
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1460 KB)

    Branch-and-Combine (BaC) clock distribution has recently been introduced. The most interesting aspect of the new scheme is its ability to bound skew by a constant irrespective of network size. In this paper, we introduce algorithms for systematic synthesis of BaC networks for clocking meshes, tori, and hypercubes of different dimensionalities. For meshes our approach relies on filing techniques. W... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synchronous bandwidth allocation in FDDI networks

    Publication Year: 1995, Page(s):1332 - 1338
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    It is well known that an FDDI token ring network provides a guaranteed throughput for synchronous messages and a bounded medium access delay for each node/station. However, this fact alone cannot effectively support many real-time applications that require the timely delivery of each critical message. The reason for this is that the FDDI guarantees a medium access delay bound to nodes, but not to ... 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