By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 2 • Date Feb 2003

Filter Results

Displaying Results 1 - 8 of 8
  • Accountable Web-computing

    Publication Year: 2003, Page(s):97 - 106
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (321 KB) | HTML iconHTML

    Web-based computing (WBC) is a modality of collaborative computing wherein "volunteers" register at a Web site, receiving one (usually compute-intensive) task to compute at each visit and returning the results from that task at the subsequent visit. The security of a WBC project is enhanced if the owner of the Web site can easily keep track of which "volunteer" computed which tasks, thereby endowi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonblocking k-fold multicast networks

    Publication Year: 2003, Page(s):131 - 141
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (574 KB) | HTML iconHTML

    Multicast communication involves transmitting information from a single source to multiple destinations and is a requirement in high-performance networks. Current trends in networking applications indicate an increasing demand in future networks for multicast capability. Many multicast applications require not only multicast capability, but also predictable communication performance such as guaran... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analytic evaluation of shared-memory architectures

    Publication Year: 2003, Page(s):166 - 180
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2792 KB) | HTML iconHTML

    This paper develops and validates an efficient analytical model for evaluating the performance of shared memory architectures with ILP processors. First, we instrument the SimOS simulator to measure the parameters for such a model and we find a surprisingly high degree of processor memory request heterogeneity in the workloads. Examining the model parameters provides insight into application behav... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithms for supporting compiled communication

    Publication Year: 2003, Page(s):107 - 118
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (537 KB) | HTML iconHTML

    We investigate the compiler algorithms to support compiled communication in multiprocessor environments and study the benefits of compiled communication, assuming that the underlying network is an all-optical time-division-multiplexing (TDM) network. We present an experimental compiler, E-SUIF, that supports compiled communication for High Performance Fortran (HPF) like programs on all-optical TDM... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparison of three artificial life techniques for reporting cell planning in mobile computing

    Publication Year: 2003, Page(s):142 - 153
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1948 KB) | HTML iconHTML

    Location management is a very important and complex problem in today's mobile computing environments. There is a need to develop algorithms that could capture this complexity yet can be easily implemented and used to solve a wide range of location management scenarios. Artificial life techniques have been used to solve a wide range of complex problems in recent times. The power of these techniques... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • When the herd is smart: Aggregate behavior in the selection of job request

    Publication Year: 2003, Page(s):181 - 192
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1258 KB) | HTML iconHTML

    In most parallel supercomputers, submitting a job for execution involves specifying how many processors are to be allocated to the job. When the job is moldable (i.e., there is a choice on how many processors the job uses), an application scheduler called SA can significantly improve job performance by automatically selecting how many processors to use. Since most jobs are moldable, this result ha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A pipeline-based approach for scheduling video processing algorithms on NOW

    Publication Year: 2003, Page(s):119 - 130
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3261 KB) | HTML iconHTML

    Network Of Workstations (NOW) platforms put together with off-the-shelf workstations and networking hardware have become a cost effective, scalable, and flexible platform for video processing applications. Still, one has to manually schedule an algorithm to the available processors of the NOW to make efficient use of the resources. However, this approach is time-consuming and impractical for a vid... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Symbolic performance modeling of parallel systems

    Publication Year: 2003, Page(s):154 - 165
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (386 KB) | HTML iconHTML

    Performance prediction is an important engineering tool that provides valuable feedback on design choices in program synthesis and machine architecture development. We present an analytic performance modeling approach aimed to minimize prediction cost, while providing a prediction accuracy that is sufficient to enable major code and data mapping decisions. Our approach is based on a performance si... 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