By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 10 • Date Oct. 2005

Filter Results

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

    Publication Year: 2005, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (142 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
  • Adaptive divisible load scheduling strategies for workstation clusters with unknown network resources

    Publication Year: 2005, Page(s):897 - 907
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (880 KB) | HTML iconHTML

    Conventional divisible load scheduling algorithms attempt to achieve optimal partitioning of massive loads to be distributed among processors in a distributed computing system in the presence of communication delays in the network. However, these algorithms depend strongly upon the assumption of prior knowledge of network parameters and cannot handle variations or lack of information about these p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Feedback-based synchronization in system area networks for cluster computing

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

    Many applications in cluster computing require QoS (quality of service) services. Since performance predictability is essential to provide QoS service, underlying systems must provide predictable performance guarantees. One way to ensure such guarantees from network subsystems is to generate global schedules from applications' network requests and to execute the local portion of the schedules at e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • QoS-aware replica placement for content distribution

    Publication Year: 2005, Page(s):921 - 932
    Cited by:  Papers (58)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB) | HTML iconHTML

    The rapid growth of new information services and business-oriented applications entails the consideration of quality of service (QoS) in content distribution. This paper investigates the QoS-aware replica placement problems for responsiveness QoS requirements. We consider two classes of service models: replica-aware services and replica-blind services. In replica-aware services, the servers are aw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reducing server data traffic using a hierarchical computation model

    Publication Year: 2005, Page(s):933 - 943
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1056 KB) | HTML iconHTML

    Commercial workloads impose heavy demands on memory and storage subsystems in a server and often result in a large amount of traffic in I/O and memory buses. To reduce the data movement between the storage subsystem and the processing units, we propose a hierarchical computing (HC) system that distributes processing elements across the storage hierarchy. We present a programming model that allows ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalability aspects of instruction distribution algorithms for clustered processors

    Publication Year: 2005, Page(s):944 - 955
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1264 KB) | HTML iconHTML

    In the evolving submicron technology, making it particularly attractive to use decentralized designs. A common form of decentralization adopted in processors is to partition the execution core into multiple clusters. Each cluster has a small instruction window, and a set of functional units. A number of algorithms have been proposed for distributing instructions among the clusters. The first part ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving load balance with flexibly assignable tasks

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

    In many applications of parallel computing, distribution of the data unambiguously implies distribution of work among processors. But, there are exceptions where some tasks can be assigned to one of several processors without altering the total volume of communication. In this paper, we study the problem of exploiting this flexibility in assignment of tasks to improve load balance. We first model ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Iterative adaptation for mobile clients using existing APIs

    Publication Year: 2005, Page(s):966 - 981
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1120 KB) | HTML iconHTML

    Iterative adaptation is a novel approach to adaptation for resource-limited mobile and wireless environments that supports powerful application-specific adaptations without requiring modifications to the application's source code. Common productivity applications, such as browsers, word processors, and presentation tools, export APIs that allow external applications to control their operation. The... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimized distributed delivery of continuous-media documents over unreliable communication links

    Publication Year: 2005, Page(s):982 - 994
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (952 KB) | HTML iconHTML

    Video-on-demand (VoD) applications place very high requirements on the delivery medium. High-quality services should provide for a timely delivery of the data-stream to the clients plus a minimum of playback disturbances. The major contributions of this paper are that it proposes a multiserver, multi-installment (MSMI) solution approach (sending the document in several installments from each serve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A spatiotemporal communication protocol for wireless sensor networks

    Publication Year: 2005, Page(s):995 - 1006
    Cited by:  Papers (123)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (888 KB) | HTML iconHTML

    In this paper, we present a spatiotemporal communication protocol for sensor networks, called SPEED. SPEED is specifically tailored to be a localized algorithm with minimal control overhead. End-to-end soft real-time communication is achieved by maintaining a desired delivery speed across the sensor network through a novel combination of feedback control and nondeterministic geographic forwarding.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on recursive cube of rings network

    Publication Year: 2005, Page(s):1007 - 1008
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (57 KB) | HTML iconHTML

    We describe and analyze the problems existing on RCR network, a family of scalable interconnection network topologies proposed by Sun and Cheung, which include disconnected graph, the definition of bisection width, and network diameter. And, necessary modifications on some RCR topological parameters including bisection width and network diameter are made. 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 (142 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