By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 9 • Date Sept. 2005

Filter Results

Displaying Results 1 - 15 of 15
  • [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
  • Editor's note

    Publication Year: 2005, Page(s):769 - 771
    Request permission for commercial reuse | PDF file iconPDF (139 KB) | HTML iconHTML
    Freely Available from IEEE
  • A family of mechanisms for congestion control in wormhole networks

    Publication Year: 2005, Page(s):772 - 784
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1680 KB) | HTML iconHTML

    Multiprocessor interconnection networks may reach congestion with high traffic loads, which prevents reaching the wished performance. Unfortunately, many of the mechanisms proposed in the literature for congestion control either suffer from a lack of robustness, being unable to work properly with different traffic patterns or message lengths, or detect congestion relying on global information that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel dynamic programming on clusters of workstations

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

    The standard DP (dynamic programming) algorithms are limited by the substantial computational demands they put on contemporary serial computers. In this work, the theory behind the solution to serial monadic dynamic programming problems highlights the theory and application of parallel dynamic programming on a general-purpose architecture (cluster or network of workstations). A simple and well-kno... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • You can run, but you can't hide: an effective statistical methodology to trace back DDoS attackers

    Publication Year: 2005, Page(s):799 - 813
    Cited by:  Papers (27)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2184 KB) | HTML iconHTML

    There is currently an urgent need for effective solutions against distributed denial-of-service (DDoS) attacks directed at many well-known Web sites. Because of increased sophistication and severity of these attacks, the system administrator of a victim site needs to quickly and accurately identify the probable attackers and eliminate the attack traffic. Our work is based on a probabilistic markin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed approach to node clustering in decentralized peer-to-peer networks

    Publication Year: 2005, Page(s):814 - 829
    Cited by:  Papers (41)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1568 KB) | HTML iconHTML

    Connectivity-based node clustering has wide-ranging applications in decentralized peer-to-peer (P2P) networks such as P2P file sharing systems, mobile ad-hoc networks, P2P sensor networks, and so forth. This paper describes a connectivity-based distributed node clustering scheme (CDC). This scheme presents a scalable and efficient solution for discovering connectivity-based clusters in peer networ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • In-kernel integration of operating system and infiniband functions for high performance computing clusters: a DSM example

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

    The infiniband (IB) system area network (SAN) enables applications to access hardware directly from user level, reducing the overhead of user-kernel crossings during data transfer. However, distributed applications that exhibit close coupling between network and OS services may benefit from accessing IB from the kernel through IB's native verbs interface, which permits tight integration of these s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimal fault-tolerant routing algorithm for weighted bidirectional double-loop networks

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

    Double-loop networks are widely used in computer networks. In this paper, we present an optimal message routing algorithm and an optimal fault-tolerant message routing algorithm for weighted bidirectional double-loop networks. The algorithms presented are novel, and they do not use routing tables. After a precalculation of O(log N) steps to determine network parameters, the algorithms can route me... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hamiltonicity of the WK-recursive network with and without faulty nodes

    Publication Year: 2005, Page(s):853 - 865
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1680 KB) | HTML iconHTML

    Recently, the WK-recursive network has received much attention due to its many favorable properties such as a high degree of scalability. By K(d,t), we denote the WK-recursive network of level t, each of whose basic modules is a d-node complete graph, where d>1 and t≥1. In this paper, we first show that K(d,t) is Hamiltonian-connected, where d≥4. A network is Hamiltonian-connected if it cont... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The exchanged hypercube

    Publication Year: 2005, Page(s):866 - 874
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB) | HTML iconHTML

    This paper presents the exchanged hypercube, a new interconnection network obtained by systematically removing links from a binary hypercube. It maintains several desirable properties of the binary hypercube yet with reduced interconnection complexity. We also introduce the extended binomial tree, a spanning tree of the exchanged hypercube that preserves many desirable properties of the original b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 3D hexagonal network: modeling, topological properties, addressing scheme, and optimal routing algorithm

    Publication Year: 2005, Page(s):875 - 884
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB) | HTML iconHTML

    The 2D hexagonal mesh, based on triangle plane tessellation, is considered as a multiprocessor interconnection network. The 3D hexagonal mesh is presented as a natural extension of the hexagonal mesh. Although the topological properties of the 2D hexagonal mesh are well known, existing addressing schemes are not suitable to be extended to 3D hexagonal mesh. Then, we present, in this paper, a new a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving the performance of software distributed shared memory with speculation

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

    We study the performance benefits of speculation in a release consistent software distributed shared memory system. We propose a new protocol, speculative home-based release consistency (SHRC) that speculatively updates data at remote nodes to reduce the latency of remote memory accesses. Our protocol employs a predictor that uses patterns in past accesses to shared memory to predict future access... 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