By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 1 • Jan 1998

Filter Results

Displaying Results 1 - 7 of 7
  • Optimal scheduling algorithm for distributed-memory machines

    Publication Year: 1998, Page(s):87 - 95
    Cited by:  Papers (98)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB)

    Task Scheduling is one of the key elements in any distributed-memory machine (DMM), and an efficient algorithm can help reduce the interprocessor communication time. As optimal scheduling of tasks to DMMs is a strong NP-hard problem, many heuristic algorithms have been introduced in the literature. This paper presents a Task Duplication based Scheduling (TDS) algorithm which can schedule directed ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Abstractions for portable, scalable parallel programming

    Publication Year: 1998, Page(s):71 - 86
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB)

    In parallel programming, the need to manage communication, load imbalance, and irregularities in the computation puts substantial demands on the programmer. Key properties of the architecture, such as the number of processors and the cost of communication, must be exploited to achieve good performance, but coding these properties directly into a program compromises the portability and flexibility ... View full abstract»

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

    Publication Year: 1998, Page(s):50 - 56
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB)

    Compaction relocates active subcubes in a fragmented hypercube so as to produce a contiguous free region and eliminate the adverse impact of fragmentation on performance. The overhead of compaction is often contributed primarily by task migration, which makes use of disjoint paths for transmitting migrated data. Since task migration usually involves transmitting a large amount of data, the time re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Job scheduling in mesh multicomputers

    Publication Year: 1998, Page(s):57 - 70
    Cited by:  Papers (15)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    A new approach for dynamic job scheduling in mesh-connected multiprocessor systems, which supports a multiuser environment, is proposed in this paper. Our approach combines a submesh reservation policy with a priority-based scheduling policy to obtain high performance in terms of high throughput, high utilization, and low turn-around times for jobs. This high performance is achieved at the expense... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the automatic parallelization of the Perfect Benchmarks(R)

    Publication Year: 1998, Page(s):5 - 23
    Cited by:  Papers (28)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB)

    This paper presents the results of the Cedar Hand-Parallelization Experiment conducted from 1989 through 1992, within the Center for Supercomputing Research and Development (CSRD) at the University of Illinois. In this experiment, we manually transformed the Perfect Benchmarks(R) into parallel program versions. In doing so, we used techniques that may be automated in an optimizing compiler. We the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Circuit retiming applied to decomposed software pipelining

    Publication Year: 1998, Page(s):24 - 35
    Cited by:  Papers (13)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    This paper elaborates on a new view on software pipelining, called decomposed software pipelining. The approach is to decouple the problem into resource constraints and dependence constraints. Resource constraints management amounts to scheduling an acyclic graph subject to resource constraints for which an efficiency bound is known, resulting in a bound for loop scheduling. The acyclic graph is o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The CLAM approach to multithreaded communication on shared-memory multiprocessors: design and experiments

    Publication Year: 1998, Page(s):36 - 49
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    We present results on the experimental design and development of a Connectionless, Lightweight, and Multiway (CLAM) communications environment. The system provides efficient and scalable multiprotocol support for distributed applications that use multimodal data. We present motivation behind design decisions for the CLAM system, and describe two simple, but effective scheduling algorithms for the ... 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