By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 6 • Date June 2005

Filter Results

Displaying Results 1 - 13 of 13
  • [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
  • A 1.5 approximation algorithm for embedding hyperedges in a cycle

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

    The problem of minimum congestion hypergraph embedding in a cycle (MCHEC) is to embed the hyperedges of a hypergraph as adjacent paths around a cycle, such that the maximum congestion over any physical link in the cycle is minimized. The problem is NP-complete in general, but solvable in polynomial time when all hyperedges contain exactly two vertices. In this paper, we first formulate the problem... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate algorithms for document placement in distributed Web servers

    Publication Year: 2005, Page(s):489 - 496
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB) | HTML iconHTML

    We study approximate algorithms for placing a set of documents into M distributed Web servers in this paper. We define the load of a server to be the summation of loads induced by all documents stored. The size of a server is defined in a similar manner. We propose five algorithms. Algorithm 1 balances the loads and sizes of the servers by limiting the loads to kl and the sizes to k... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient parallel hierarchical clustering algorithms

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

    Clustering of data has numerous applications and has been studied extensively. Though most of the algorithms in the literature are sequential, many parallel algorithms have also been designed. In this paper, we present parallel algorithms with better performance than known algorithms. We consider algorithms that work well in the worst case as well as algorithms with good expected performance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Communication contention in task scheduling

    Publication Year: 2005, Page(s):503 - 515
    Cited by:  Papers (44)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB) | HTML iconHTML

    Task scheduling is an essential aspect of parallel programming. Most heuristics for this NP-hard problem are based on a simple system model that assumes fully connected processors and concurrent interprocessor communication. Hence, contention for communication resources is not considered in task scheduling, yet it has a strong influence on the execution time of a parallel program. This paper inves... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient assignment and scheduling for heterogeneous DSP systems

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

    This paper addresses high level synthesis for real-time digital signal processing (DSP) architectures using heterogeneous functional units (FUs). For such special purpose architecture synthesis, an important problem is how to assign a proper FU type to each operation of a DSP application and generate a schedule in such a way that all requirements can be met and the total cost can be minimized. We ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Perimeter-based defense against high bandwidth DDoS attacks

    Publication Year: 2005, Page(s):526 - 537
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB) | HTML iconHTML

    Distributed denial of service (DDoS) is a major threat to the availability of Internet services. The anonymity allowed by IP networking, together with the distributed, large scale nature of the Internet, makes DDoS attacks stealthy and difficult to counter. To make the problem worse, attack traffic is often indistinguishable from normal traffic. As various attack tools become widely available and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Differentiation, QoS guarantee, and optimization for real-time traffic over one-hop ad hoc networks

    Publication Year: 2005, Page(s):538 - 549
    Cited by:  Papers (17)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB) | HTML iconHTML

    Nodes having a self-centrically broadcasting nature of communication form a wireless ad hoc network. Many issues are involved to provide quality of service (QoS) for ad hoc networks, including routing, medium access, resource reservation, mobility management, etc. Previous work mostly focuses on QoS routing with an assumption that the medium access control (MAC) layer can support QoS very well. Ho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Feedback utilization control in distributed real-time systems with end-to-end tasks

    Publication Year: 2005, Page(s):550 - 561
    Cited by:  Papers (60)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB) | HTML iconHTML

    An increasing number of distributed real-time systems face the critical challenge of providing quality of service guarantees in open and unpredictable environments. In particular, such systems often need to enforce utilization bounds on multiple processors in order to avoid overload and meet end-to-end deadlines even when task execution times are unpredictable. While recent feedback control real-t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design space exploration of a software speculative parallelization scheme

    Publication Year: 2005, Page(s):562 - 576
    Cited by:  Papers (15)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2408 KB) | HTML iconHTML

    With speculative parallelization, code sections that cannot be fully analyzed by the compiler are optimistically executed in parallel. Hardware schemes are fast but expensive and require modifications to the processors and/or memory system. Software schemes require no changes to the hardware of existing shared-memory systems, but can suffer from significant overheads involved with the speculative ... 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