By Topic

Parallel and Distributed Systems, IEEE Transactions on

Issue 3 • Date March 2004

Filter Results

Displaying Results 1 - 11 of 11
  • An experimental evaluation of data dependence analysis techniques

    Publication Year: 2004 , Page(s): 196 - 213
    Cited by:  Papers (9)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (2799 KB) |  | HTML iconHTML  

    Optimizing compilers rely upon program analysis techniques to detect data dependences between program statements. Data dependence information captures the essential ordering constraints of the statements in a program that need to be preserved in order to produce valid optimized and parallel code. Data dependence testing is very important for automatic parallelization, vectorization, and any other ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The minimal cost distribution tree problem for recursive expiration-based consistency management

    Publication Year: 2004 , Page(s): 214 - 227
    Cited by:  Papers (6)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1743 KB) |  | HTML iconHTML  

    The expiration-based scheme is widely used to manage the consistency of cached and replicated contents such as Web objects. In this approach, each replica is associated with an expiration time beyond which the replica has to be validated. While the expiration-based scheme has been investigated in the context of a single replica, not much work has been done on its behaviors with respect to multiple... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A class of multistage conference switching networks for group communication

    Publication Year: 2004 , Page(s): 228 - 243
    Cited by:  Papers (3)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1399 KB) |  | HTML iconHTML  

    There is a growing demand for network support for group applications, in which messages from one or more sender(s) are delivered to a large number of receivers. Here, we propose a network architecture for supporting a fundamental type of group communication, conferencing. A conference refers to a group of members in a network who communicate with each other within the group. We consider adopting a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Eligibility-based Round Robin for fair and efficient packet scheduling in wormhole switching networks

    Publication Year: 2004 , Page(s): 244 - 256
    Cited by:  Papers (3)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (972 KB) |  | HTML iconHTML  

    Interconnection networks of parallel systems are used for servicing traffic generated by different applications, often belonging to different users. When multiple users contend for channel bandwidth, fairness in bandwidth sharing becomes a key requirement. In fact, enforcing a fair sharing of channel bandwidth improves flow isolation, thus preventing misbehaving flows from affecting the performanc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting global knowledge to achieve self-tuned congestion control for k-ary n-cube networks

    Publication Year: 2004 , Page(s): 257 - 272
    Cited by:  Papers (11)  |  Patents (14)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1629 KB) |  | HTML iconHTML  

    Network performance in tightly-coupled multiprocessors typically degrades rapidly beyond network saturation. Consequently, designers must keep a network below its saturation point by reducing the load on the network. Congestion control via source throttling-a common technique to reduce the network load-prevents new packets from entering the network in the presence of congestion. Unfortunately, pri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling divisible loads on heterogeneous linear daisy chain networks with arbitrary processor release times

    Publication Year: 2004 , Page(s): 273 - 288
    Cited by:  Papers (12)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (747 KB) |  | HTML iconHTML  

    The problem of distributing and processing a divisible load in a heterogeneous linear network of processors with arbitrary processors release times is considered. A divisible load is very large in size and has computationally intensive CPU requirements. Further, it has the property that the load can be partitioned arbitrarily into any number of portions and can be scheduled onto processors indepen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Transactions on Parallel and Distributed Systems - Table of contents

    Publication Year: 2004 , Page(s): 01
    Request Permissions | PDF file iconPDF (284 KB)  
    Freely Available from IEEE
  • Submission of manuscripts for review

    Publication Year: 2004 , Page(s): 02
    Request Permissions | PDF file iconPDF (206 KB)  
    Freely Available from IEEE
  • Editor's note

    Publication Year: 2004 , Page(s): 193 - 195
    Request Permissions | PDF file iconPDF (278 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Information for authors

    Publication Year: 2004 , Page(s): 289
    Request Permissions | PDF file iconPDF (206 KB)  
    Freely Available from IEEE
  • [Front cover]

    Publication Year: 2004 , Page(s): 290
    Request Permissions | PDF file iconPDF (285 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.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
David Bader
College of Computing
Georgia Institute of Technology