By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 11 • Date Nov. 2005

Filter Results

Displaying Results 1 - 12 of 12
  • [Front cover]

    Publication Year: 2005, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (143 KB)
    Freely Available from IEEE
  • [Inside front cover]

    Publication Year: 2005, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (75 KB)
    Freely Available from IEEE
  • Traffic scheduling solutions with QoS support for an input-buffered multimedia router

    Publication Year: 2005, Page(s):1009 - 1021
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB) | HTML iconHTML

    Quality of service (QoS) support in local and cluster area environments has become an issue of great interest in recent years. Most current high-performance interconnection solutions for these environments have been designed to enhance conventional best-effort traffic performance, but are not well-suited to the special requirements of the new multimedia applications. The multimedia router (MMR) ai... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An analytical approach to providing controllable differentiated quality of service in Web servers

    Publication Year: 2005, Page(s):1022 - 1033
    Cited by:  Papers (5)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB) | HTML iconHTML

    Provisioning quality of service (QoS) in Web servers has gained immense importance because Web servers are a major part of the Internet. To deliver the pledged QoS, Web service providers need control over the allocation of the resources in their Web servers. Control is also necessary for reaching the optimal resource allocation through proper service differentiation. In this paper, we propose and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A recursion-based broadcast paradigm in wormhole routed networks

    Publication Year: 2005, Page(s):1034 - 1052
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2600 KB) | HTML iconHTML

    A novel broadcast technique for wormhole-routed parallel computers based on recursion is presented in this paper. It works by partitioning the interconnection graph into a number of higher-level subgraphs. Then, we identify the transmission subgraph (TSG) in each subgraph. Both the higher-level subgraphs and the TSGs are recursively defined, i.e., we split each level i subgraph into several level ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Inference and labeling of metric-induced network topologies

    Publication Year: 2005, Page(s):1053 - 1065
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (928 KB) | HTML iconHTML

    The development and deployment of distributed network-aware applications and services require the ability to compile and maintain a model of the underlying network resources with respect to one or more characteristic properties of interest. To be manageable, such models must be compact; and to be general-purpose, should enable a representation of properties along temporal, spatial, and measurement... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive parallel job scheduling with flexible coscheduling

    Publication Year: 2005, Page(s):1066 - 1077
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1240 KB) | HTML iconHTML

    Many scientific and high-performance computing applications consist of multiple processes running on different processors that communicate frequently. Because of their synchronization needs, these applications can suffer severe performance penalties if their processes are not all coscheduled to run together. Two common approaches to coscheduling jobs are batch scheduling, wherein nodes are dedicat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic layer management in superpeer architectures

    Publication Year: 2005, Page(s):1078 - 1091
    Cited by:  Papers (41)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1312 KB) | HTML iconHTML

    Superpeer unstructured P2P systems have been found to be very effective by dividing the peers into two layers, superlayer and leaf-layer, in which message flooding is only conducted among superlayer and all leaf-peers are represented by corresponding superpeers. However, current superpeer systems do not employ any effective layer management schemes, so the transient and low-capacity peers are allo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiround algorithms for scheduling divisible loads

    Publication Year: 2005, Page(s):1092 - 1102
    Cited by:  Papers (49)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB) | HTML iconHTML

    Divisible load applications occur in many fields of science and engineering and can be easily parallelized in a master-worker fashion, but pose several scheduling challenges. While a number of approaches have been proposed that allocate load to workers in a single round, using multiple rounds improves overlap of computation with communication. Unfortunately, multiround algorithms are difficult to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comment on "Issues and challenges in the performance analysis of real disk arrays"

    Publication Year: 2005, Page(s):1103 - 1104
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (145 KB) | HTML iconHTML

    We address an analysis of the SCAN disk scheduling, which approximates the mean seek distance as the ratio of maximum distance and disk/spl I.bar/queue+1. We also comment on using the mean seek distance to estimate the mean disk response time. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TPDS Information for authors

    Publication Year: 2005, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (75 KB)
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2005, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (143 KB)
    Freely Available from IEEE

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