By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 9 • Date Sept. 2008

Filter Results

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

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

    Publication Year: 2008, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (77 KB)
    Freely Available from IEEE
  • A Token-Based Distributed Group Mutual Exclusion Algorithm with Quorums

    Publication Year: 2008, Page(s):1153 - 1166
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5215 KB) | HTML iconHTML

    The group mutual exclusion problem is a generalization of mutual exclusion problem such that a set of processes in the same group can enter critical section simultaneously. In this paper, we propose a distributed algorithm for the group mutual exclusion problem in asynchronous message passing distributed systems. Our algorithm is based on tokens, and a process that obtains a token can enter critic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computationally Efficient Distributed and Delegated Certification

    Publication Year: 2008, Page(s):1167 - 1174
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (211 KB) | HTML iconHTML

    Certification in public key cryptographic applications concerns the involvement of a CA (Certifying Agent) in approving the validity of users' public keys. Distributed certification pertains to the case where several CAs are involved in issuing certificates. This also includes the case of multi-attribute certification, where different CAs approve different user's attributes. In delegated certifica... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving Systems of Linear Equations on the CELL Processor Using Cholesky Factorization

    Publication Year: 2008, Page(s):1175 - 1186
    Cited by:  Papers (40)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1786 KB) | HTML iconHTML

    The Sony/Toshiba/IBM (STI) CELL processor introduces pioneering solutions in processor architecture. At the same time it presents new challenges for the development of numerical algorithms. One is effective exploitation of the differential between the speed of single and double precision arithmetic; the other is efficient parallelization between the short vector SIMD cores. The first challenge is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High-Performance Resource Allocation and Request Redirection Algorithms for Web Clusters

    Publication Year: 2008, Page(s):1186 - 1200
    Cited by:  Papers (15)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1777 KB) | HTML iconHTML

    With increasing richness in features such as personalization of content, Web applications are becoming increasingly complex and hence compute intensive. Traditional approaches for improving performance of static content Web sites have been based on the assumption that static content such as images are network intensive. However, these methods are not applicable to the dynamic content applications ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compiler-Directed Code Restructuring for Improving Performance of MPSoCs

    Publication Year: 2008, Page(s):1201 - 1214
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4274 KB) | HTML iconHTML

    One of the critical goals in code optimization for multi-processor-system-on-a-chip (MPSoC) architectures is to minimize the number of off-chip memory accesses. This is because such accesses can be extremely costly from both performance and power angles. While conventional data locality optimization techniques can be used for improving data access pattern of each processor independently, such tech... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Novel State Transition Method for Metaheuristic-Based Scheduling in Heterogeneous Computing Systems

    Publication Year: 2008, Page(s):1215 - 1223
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2717 KB) | HTML iconHTML

    Much of the recent literature shows a prevalance in the use of metaheuristics in solving a variety of problems in parallel and distributed computing. This is especially ture for problems that have a combinatorial nature, such as scheduling and load balancing. Despite numerous efforts, task scheduling remains one of the most challenging problems in heterogeneous computing environments. In this pape... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DSDM: A Distributed Service Discovery Model for Manets

    Publication Year: 2008, Page(s):1224 - 1236
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4217 KB) | HTML iconHTML

    Service discovery is indispensable to ad hoc networking where establishing a stand-alone and self-configurable communication environment is the main objective. This paper concentrates on designing a distributed service discovery model for service sharing among diverse mobile devices in mobile ad hoc networks. This model is built on top of the network layer of the TCP/IP stack and benefits from the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Diverse Firewall Design

    Publication Year: 2008, Page(s):1237 - 1251
    Cited by:  Papers (43)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4218 KB) | HTML iconHTML

    Firewalls are the mainstay of enterprise security and the most widely adopted technology for protecting private networks. An error in a firewall policy either creates security holes that will allow malicious traffic to sneak into a private network or blocks legitimate traffic and disrupts normal business processes, which in turn could lead to irreparable, if not tragic, consequences. It has been o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reaching Agreement among Virtual Subnets in Hybrid Failure Mode

    Publication Year: 2008, Page(s):1252 - 1262
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4141 KB) | HTML iconHTML

    Fault-tolerance is an important research topic in the study of distributed systems. To cope with the influence of faulty components, reaching a common agreement in the presence of faults before performing certain tasks is essential. However, the Byzantine Agreement (BA) problem is a fundamental problem in fault-tolerant distributed systems. In previous studies, protocols dealing with the BA proble... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Provably Efficient Online Nonclairvoyant Adaptive Scheduling

    Publication Year: 2008, Page(s):1263 - 1279
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (618 KB) | HTML iconHTML

    Multiprocessor scheduling in a shared multiprogramming environment can be structured in two levels, where a kernel-level job scheduler allots processors to jobs and a user-level thread scheduler maps the ready threads of a job onto the allotted processors. We present two provably-efficient two-level scheduling schemes called G-RAD and S-RAD respectively. Both schemes use the same job scheduler RAD... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Deployment Schemes for Mobile Wireless Sensor Networks to Ensure Multilevel Coverage

    Publication Year: 2008, Page(s):1280 - 1294
    Cited by:  Papers (47)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4494 KB) | HTML iconHTML

    One of the research issues in wireless sensor networks (WSNs) is how to efficiently deploy sensors to cover an area. In this paper, we solve the k-coverage sensor deployment problem to achieve multi-level coverage of an area I. We consider two sub-problems: k-coverage placement and distributed dispatch problems. The placement problem asks how to determine the minimum number of sensors required and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Build Your Career in Computing [advertisement]

    Publication Year: 2008, Page(s): 1295
    Request permission for commercial reuse | PDF file iconPDF (66 KB)
    Freely Available from IEEE
  • Silver Bullet Security Podcast Series

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

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

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