By Topic

Parallel and Distributed Systems, IEEE Transactions on

Issue 12 • Date Dec. 2005

Filter Results

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

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

    Publication Year: 2005 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (75 KB)  
    Freely Available from IEEE
  • Communication and memory optimal parallel data cube construction

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

    Data cube construction is a commonly used operation in data warehouses. Because of the volume of data that is stored and analyzed in a data warehouse and the amount of computation involved in data cube construction, it is natural to consider parallel machines for this operation. This paper addresses a number of algorithmic issues in parallel data cube construction. First, we present an aggregation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving vector consensus with a wormhole

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

    This paper presents a solution to the vector consensus problem for Byzantine asynchronous systems augmented with wormholes. Wormholes prefigure a hybrid distributed system model, embodying the notion of an enhanced part of the system with "good" properties otherwise not guaranteed by the "normal" weak environment. A protocol built for this type of system runs in the asynchronous part, where f out ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High-performance and low-cost dual-thread VLIW processor using Weld architecture paradigm

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

    This paper presents a cost-effective and high-performance dual-thread VLIW processor model. The dual-thread VLIW processor model is a low-cost subset of the Weld architecture paradigm. It supports one main thread and one speculative thread running simultaneously in a VLIW processor with a register file and a fetch unit per thread along with memory disambiguation hardware for speculative load and s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed admission control model for QoS assurance in large-scale media delivery systems

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

    Conventional admission control models incur some performance penalty. First, admission control computation can overload a server that is already heavily loaded. Also, in large-scale media systems with geographically distributed server clusters, performing admission control on each cluster can result in long response latency, if the client request is denied at one site and has to be forwarded to an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application resource requirement estimation in a parallel-pipeline model of execution

    Publication Year: 2005 , Page(s): 1154 - 1165
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1128 KB) |  | HTML iconHTML  

    We propose a massively parallel framework termed a parallel-pipeline model of execution that can be employed on a homogeneous computational cluster. We show that speedups near-linear in the number of processors are achievable for applications involving reduction operations based on a novel, parallel-pipeline model of execution. As computational clusters become viable alternative platforms for solv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fundamental trade-offs in aggregate packet scheduling

    Publication Year: 2005 , Page(s): 1166 - 1177
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (728 KB) |  | HTML iconHTML  

    In this paper, we investigate the fundamental trade-offs in aggregate packet scheduling for support of guaranteed delay service. In our study, we consider two classes of aggregate packet scheduling algorithms: the static earliest time first (SETF) and dynamic earliest time first (DETF). Through these two classes of aggregate packet scheduling (and together with the simple FIFO packet scheduling al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of server sharing collectives for content distribution

    Publication Year: 2005 , Page(s): 1178 - 1189
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (784 KB) |  | HTML iconHTML  

    Demand for content served by a provider can fluctuate with time, complicating the task of provisioning serving resources so that requests for its content are not rejected. One way to address this problem is to have providers form a collective in which they pool together their serving resources to assist in servicing requests for one another's content. In this paper, we determine the conditions und... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal path embedding in crossed cubes

    Publication Year: 2005 , Page(s): 1190 - 1200
    Cited by:  Papers (33)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (496 KB) |  | HTML iconHTML  

    The crossed cube is an important variant of the hypercube. The n-dimensional crossed cube has only about half diameter, wide diameter, and fault diameter of those of the n-dimensional hypercube. Embeddings of trees, cycles, shortest paths, and Hamiltonian paths in crossed cubes have been studied in literature. Little work has been done on the embedding of paths except shortest paths, and Hamiltoni... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Annual index

    Publication Year: 2005 , Page(s): td05
    Save to Project icon | Request Permissions | PDF file iconPDF (183 KB)  
    Freely Available from IEEE
  • TPDS Information for authors

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

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

Full Aims & Scope

Meet Our Editors

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