By Topic

Parallel and Distributed Systems, IEEE Transactions on

Issue 8 • Date Aug. 2005

Filter Results

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

    Publication Year: 2005 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (158 KB)  
    Freely Available from IEEE
  • [Inside front cover]

    Publication Year: 2005 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (91 KB)  
    Freely Available from IEEE
  • On optimal replication of data object at hierarchical and transparent Web proxies

    Publication Year: 2005 , Page(s): 673 - 685
    Cited by:  Papers (13)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (624 KB) |  | HTML iconHTML  

    This paper investigates the optimal replication of data objects at hierarchical and transparent Web proxies. By transparent, we mean the proxies are capable of intercepting users' requests and forwarding the requests to a higher level proxy if the requested data are not present in their local cache. Two cases of data replication at proxies are studied: 1) proxies having unlimited storage capacitie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed resolution of network congestion and potential deadlock using reservation-based scheduling

    Publication Year: 2005 , Page(s): 686 - 701
    Cited by:  Papers (6)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1328 KB) |  | HTML iconHTML  

    Efficient and reliable communication is essential for achieving high performance in a networked computing environment. Finite network resources bring about unavoidable competition among in-flight network packets, resulting in network congestion and, possibly, deadlock. Many techniques have been proposed to improve network performance by efficiently handling network congestion and potential deadloc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel routing algorithms for nonblocking electronic and photonic switching networks

    Publication Year: 2005 , Page(s): 702 - 713
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (856 KB) |  | HTML iconHTML  

    We study the connection capacity of a class of rearrangeable nonblocking (RNB) and strictly nonblocking (SNB) networks with/without crosstalk-free constraint, model their routing problems as weak or strong edge-colorings of bipartite graphs, and propose efficient routing algorithms for these networks using parallel processing techniques. This class of networks includes networks constructed from ba... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Perfect difference networks and related interconnection structures for parallel and distributed systems

    Publication Year: 2005 , Page(s): 714 - 724
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1040 KB) |  | HTML iconHTML  

    In view of their applicability to parallel and distributed computer systems, interconnection networks have been studied intensively by mathematicians, computer scientists, and computer designers. In this paper, we propose an asymptotically optimal method for connecting a set of nodes into a perfect difference network (PDN) with diameter 2, so that any node is reachable from any other node in one o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance, algorithmic, and robustness attributes of perfect difference networks

    Publication Year: 2005 , Page(s): 725 - 736
    Cited by:  Papers (5)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (864 KB) |  | HTML iconHTML  

    Perfect difference networks (PDNs) that are based on the mathematical notion of perfect difference sets have been shown to comprise an asymptotically optimal method for connecting a number of nodes into a network with diameter 2. Justifications for, and mathematical underpinning of, PDNs appear in a companion paper. In this paper, we compare PDNs and some of their derivatives to interconnection ne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing permutations on baseline networks with node-disjoint paths

    Publication Year: 2005 , Page(s): 737 - 746
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (616 KB) |  | HTML iconHTML  

    Permutation is a frequently-used communication pattern in parallel and distributed computing systems and telecommunication networks. Node-disjoint routing has important applications in guided wave optical interconnects where the optical "crosstalk" between messages passing the same switch should be avoided. In this paper, we consider routing arbitrary permutations on an optical baseline network (o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of deterministic routings, multicasts, and topologies on RHiNET-2 cluster

    Publication Year: 2005 , Page(s): 747 - 759
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1880 KB) |  | HTML iconHTML  

    System area networks (SANs), which usually accept arbitrary topologies, have been used to connect nodes in PC/WS clusters or high-performance storage systems. Although deadlock-free routings, multicasts, and topologies for SANs have been widely developed, their evaluation on real PC clusters was rarely done. Thus, the evaluation of routings, multicasts, and topologies in real systems is important ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An analysis of EDF schedulability on a multiprocessor

    Publication Year: 2005 , Page(s): 760 - 768
    Cited by:  Papers (56)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (272 KB) |  | HTML iconHTML  

    A new schedulability test is derived for preemptive deadline scheduling of periodic or sporadic real-time tasks on a single-queue m-server system. The new test allows the task deadline to be more or less than the task period, and is based on a new analysis concept, called a μ-busy interval. This generalizes a result of Goossens et al. [2003] that a system of periodic tasks with maximum individu... 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
    Save to Project icon | Request Permissions | PDF file iconPDF (91 KB)  
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2005 , Page(s): c4
    Save to Project icon | Request Permissions | PDF file iconPDF (158 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