By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 7 • July 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 (158 KB)
    Freely Available from IEEE
  • [Inside front cover]

    Publication Year: 2005, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (91 KB)
    Freely Available from IEEE
  • Allocating fragments in distributed databases

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

    For a distributed database system to function efficiently, the fragments of the database need to be located, judiciously at various sites across the relevant communications network. The problem of allocating these fragments to the most appropriate sites is a difficult one to solve, however, with most approaches available relying on heuristic techniques. Optimal approaches are usually based on math... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Agent-based load balancing on homogeneous minigrids: macroscopic modeling and characterization

    Publication Year: 2005, Page(s):586 - 598
    Cited by:  Papers (30)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB) | HTML iconHTML

    In this paper, we present a macroscopic-characterization of agent-based load balancing in homogeneous minigrid environments. The agent-based load balancing is regarded as agent distribution from a macroscopic point of view. We study two quantities on minigrids: the number and size of teams where agents (tasks) queue. In macroscopic modeling, the load balancing mechanism is characterized using diff... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance-driven processor allocation

    Publication Year: 2005, Page(s):599 - 611
    Cited by:  Papers (17)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1264 KB) | HTML iconHTML

    In current multiprogrammed multiprocessor systems, to take into account the performance of parallel applications is critical to decide an efficient processor allocation. In this paper, we present the performance-driven processor allocation policy (PDPA). PDPA is a new scheduling policy that implements a processor allocation policy and a multiprogramming-level policy, in a coordinated way, based on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Moving address translation closer to memory in distributed shared-memory multiprocessors

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

    To support a global virtual memory space, an architecture must translate virtual addresses dynamically. In current processors, the translation is done in a TLB (translation lookaside buffer), before or in parallel with the first-level cache access. As processor technology improves at a rapid pace and the working sets of new applications grow insatiably, the latency and bandwidth demands on the TLB... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time-aware utility-based resource allocation in wireless networks

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

    This paper presents a time-aware admission control and resource allocation scheme in wireless networks in the context of a future generation cellular network. The quality levels (and their respective utility) of different connections are specified using discrete resource-utility (R-U) functions. The scheme uses these R-U functions for allocating and reallocating bandwidth to connections, aiming to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving the performance of distributed virtual environment systems

    Publication Year: 2005, Page(s):637 - 649
    Cited by:  Papers (47)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1528 KB) | HTML iconHTML

    The last years have witnessed a dramatic growth in the number as well as in the variety of distributed virtual environment systems. These systems allow multiple users, working on different client computers that are interconnected through different networks, to interact in a shared virtual world. One of the key issues in the design of scalable and cost-effective DVE systems is the partitioning prob... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An energy-efficient slack distribution technique for multimode distributed real-time embedded systems

    Publication Year: 2005, Page(s):650 - 662
    Cited by:  Papers (24)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1128 KB) | HTML iconHTML

    In multimode distributed systems, active task sets are assigned to their distributed components for realizing one or more functions. Many of these systems encounter runtime task variations at the input and across the system while processing their tasks in real time. Very few efforts have been made to address energy efficient scheduling in these types of distributed systems. In this paper, we propo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The complexity of verifying memory coherence and consistency

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

    The problem of testing shared memories for memory coherence and consistency is studied. First, it is proved that detecting violations of coherence in an execution is NP-complete, and it remains NP-complete for a number of restricted instances. This result leads to a proof that all known consistency models are NP-hard to verify. The complexity of verifying consistency models is not a mere consequen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • [Advertisement]

    Publication Year: 2005, Page(s): 672
    Request permission for commercial reuse | PDF file iconPDF (316 KB)
    Freely Available from IEEE
  • TPDS Information for authors

    Publication Year: 2005, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (91 KB)
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2005, Page(s): c4
    Request permission for commercial reuse | 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. 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