By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 3 • Date March 2006

Filter Results

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

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

    Publication Year: 2006, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (92 KB)
    Freely Available from IEEE
  • High-level buffering for hiding periodic output cost in scientific simulations

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

    Scientific applications often need to write out large arrays and associated metadata periodically for visualization or restart purposes. In this paper, we present active buffering, a high-level transparent buffering scheme for collective I/O, in which processors actively organize their idle memory into a hierarchy of buffers for periodic output data. It utilizes idle memory on the processors, yet ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient algorithms for minimum congestion hypergraph embedding in a cycle

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

    The minimum congestion hypergraph embedding in a cycle (MCHEC) problem is to embed the hyperedges of a hypergraph as paths in a cycle with the same node set such that the maximum congestion (the maximum number of paths that use any single edge in the cycle) is minimized. The MCHEC problem has many applications, including optimizing communication congestions in computer networks and parallel comput... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast routing computation on InfiniBand networks

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

    The InfiniBand architecture has been proposed as a technology both for communication between processing nodes and I/O devices, and for interprocessor communication. Its specification defines a basic management infrastructure that is responsible for subnet configuration and fault tolerance. Each time a topology change is detected, new forwarding tables have to be computed and uploaded to devices. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements

    Publication Year: 2006, Page(s):227 - 240
    Cited by:  Papers (45)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB) | HTML iconHTML

    A many-to-many k-disjoint path cover (k-DPC) of a graph G is a set of k disjoint paths joining k distinct source-sink pairs in which each vertex of G is covered by a path. We deal with the graph G0 ⊕ G1 obtained from connecting two graphs G0 and G1 with n vertices each by n pairwise nonadjacent edges joining vertices in G0 and vertices i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Processor array architectures for deep packet classification

    Publication Year: 2006, Page(s):241 - 252
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1808 KB) | HTML iconHTML

    This paper presents a systematic technique for expressing a string search algorithm as a regular iterative expression to explore all possible processor arrays for deep packet classification. The computation domain of the algorithm is obtained and three affine scheduling functions are presented. The technique allows some of the algorithm variables to be pipelined while others are broadcast over sys... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiprocessor scheduling and rescheduling with use of cellular automata and artificial immune system support

    Publication Year: 2006, Page(s):253 - 262
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2880 KB) | HTML iconHTML

    The paper presents cellular automata (CA)-based multiprocessor scheduling system, in which an extraction of knowledge about scheduling process occurs and this knowledge is used while solving new instances of the scheduling problem. There are three modes of the scheduler: learning, normal operating, and reusing. In the learning mode, a genetic algorithm is used to discover CA rules suitable for sol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Toward a realistic task scheduling model

    Publication Year: 2006, Page(s):263 - 275
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1384 KB) | HTML iconHTML

    Task scheduling is an important aspect of parallel programming. Most of the heuristics for this NP-hard problem are based on a very simple system model of the target parallel system. Experiments revealed the inappropriateness of this classic model to obtain accurate and efficient schedules for real-systems. In order to overcome this shortcoming, a new scheduling model was proposed that considers t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and implementation of QoS-provisioning system for voice over IP

    Publication Year: 2006, Page(s):276 - 288
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1840 KB) | HTML iconHTML

    In this paper, we address issues in implementing voice over IP (VoIP) services in packet switching networks. VoIP has been identified as a critical real-time application in the network QoS research community and has been implemented in commercial products. To provide competent quality of service for VoIP systems comparable to traditional PSTN systems, a call admission control (CAC) mechanism has t... 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 (92 KB)
    Freely Available from IEEE
  • [Back cover]

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