By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 12 • Date Dec. 2006

Filter Results

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

    Publication Year: 2006, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (146 KB)
    Freely Available from IEEE
  • [Inside front cover]

    Publication Year: 2006, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (88 KB)
    Freely Available from IEEE
  • A Novel {O(n)} Parallel Banker's Algorithm for System-on-a-Chip

    Publication Year: 2006, Page(s):1377 - 1389
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2744 KB) | HTML iconHTML

    This article proposes a novel O(n) Parallel Banker's Algorithm (PBA), which is a parallelized version of the Banker's Algorithm (BA), a well-known O(mtimes n) deadlock avoidance algorithm. We implement the approach in hardware, which we call PBA Unit (PBAU). PBAU is not a mere Verilog HDL translation of BA, but a novel, fully hardware-oriented implementation exploiting maximum hardware parallelism... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Parallel Computational Model for Heterogeneous Clusters

    Publication Year: 2006, Page(s):1390 - 1400
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1828 KB) | HTML iconHTML

    This paper addresses the maximal lifetime scheduling for sensor surveillance systems with K sensors to 1 target. Given a set of sensors and targets in an Euclidean plane, a sensor can watch only one target at a time and a target should be watched by k, kges1, sensors at any time. Our task is to schedule sensors to watch targets and pass data to the base station, such that the lifetime of the surve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Selfish Replication

    Publication Year: 2006, Page(s):1401 - 1413
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1584 KB) | HTML iconHTML

    A commonly employed abstraction for studying the object placement problem for the purpose of Internet content distribution is that of a distributed replication group. In this work, the initial model of the distributed replication group of Leff et al. [CHECK END OF SENTENCE] is extended to the case that individual nodes act selfishly, i.e., cater to the optimization of their individual local utilit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some Compartmentalized Secure Task Assignment Models for Distributed Systems

    Publication Year: 2006, Page(s):1414 - 1424
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB) | HTML iconHTML

    This paper formulates abstract problems of assigning subtasks to agents (processors) in a distributed system with a goal that they can perform its global task efficiently. The paper models the distributed system with a graph that describes the communication capabilities of the constituting agents. This graph is referred to as the "organizational graph.” In addition, the desired task-performi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Simple Data Transfer Technique Using Local Address for Networks-on-Chips

    Publication Year: 2006, Page(s):1425 - 1437
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2643 KB) | HTML iconHTML

    Networks-on-chips (NoCs) have been studied to connect a number of modules in a chip by introducing a network structure which is similar to that in parallel computers. Since embedded streaming applications usually generate predictable small-sized data traffic, the network structure can be customized to the target traffic. Accordingly, we develop a data transfer technique for simplifying routers for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DRP: An Efficient Directional Routing Protocol for Mobile Ad Hoc Networks

    Publication Year: 2006, Page(s):1438 - 1541
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2937 KB) | HTML iconHTML

    Many modern networked applications require specific levels of service quality from the underlying network. Moreover, next-generation networked applications are expected to adapt to changes in the underlying network, services, and user interactions. While some applications have built-in adaptivity, the adaptation itself requires specification of a system model. This paper presents Sapphire, an expe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Imposed Route Reuse in Ad Hoc Network Routing Protocols Using Structured Peer-to-Peer Overlay Routing

    Publication Year: 2006, Page(s):1452 - 1467
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3455 KB) | HTML iconHTML

    The use of wireless in local loop (WiLL) has generated considerable interest due to the advantages it offers such as ease and low cost of deployment and maintenance. With an increase in the number of subscribers in the network, it becomes expedient to employ spectrum reusability techniques such as the use of multihop relaying in order to improve the capacity of the wireless systems. Throughput enh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Twins: A Dual Addressing Space Representation for Self-Organizing Networks

    Publication Year: 2006, Page(s):1468 - 1481
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1360 KB) | HTML iconHTML

    As the size of mobile self-organizing networks increases, the efficiency of location services must increase as well so that addressing/routing scalability does not become an issue. In this paper, we propose a novel architecture, called Twins, tailored for self-organizing networks. Twins architecture involves addressing and locating nodes in large networks, forwarding packets between them, and mana... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enhancing Search Performance on Gnutella-Like P2P Systems

    Publication Year: 2006, Page(s):1482 - 1495
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3000 KB) | HTML iconHTML

    The big challenges facing the search techniques on Gnutella-like peer-to-peer networks are search efficiency and quality of search results. In this paper, leveraging information retrieval (IR) algorithms such as Vector Space Model (VSM) and relevance ranking algorithms, we present GES (Gnutella with Efficient Search) to improve search performance. The key idea is that GES uses a distributed topolo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Using Multidimensional Markov Chains for Performance Evaluation of Hybrid Wireless Networks

    Publication Year: 2006, Page(s):1496 - 1511
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2680 KB) | HTML iconHTML

    The use of Wireless in Local Loop (WiLL) has generated considerable interest due to the advantages it offers such as ease and low cost of deployment and maintenance. With an increase in the number of subscribers in the network, it becomes expedient to employ spectrum reusability techniques such as the use of multihop relaying in order to improve the capacity of the wireless systems. Throughput enh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sapphire: Statistical Characterization and Model-Based Adaptation of Networked Applications

    Publication Year: 2006, Page(s):1512 - 1525
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2784 KB) | HTML iconHTML

    Many modern networked applications require specific levels of service quality from the underlying network. Moreover, next-generation networked applications are expected to adapt to changes in the underlying network, services, and user interactions. While some applications have built-in adaptivity, the adaptation itself requires specification of a system model. This paper presents Sapphire, an expe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximal Lifetime Scheduling for Sensor Surveillance Systems with K Sensors to One Target

    Publication Year: 2006, Page(s):1526 - 1536
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1128 KB) | HTML iconHTML

    This paper addresses the maximal lifetime scheduling for sensor surveillance systems with K sensors to 1 target. Given a set of sensors and targets in an Euclidean plane, a sensor can watch only one target at a time and a target should be watched by k, k geq 1, sensors at any time. Our task is to schedule sensors to watch targets and pass data to the base station, such that the lifetime of the sur... 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: 2006, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (88 KB)
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2006, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (146 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