By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 7 • Date July 2004

Filter Results

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

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

    Publication Year: 2004, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (55 KB)
    Freely Available from IEEE
  • Adaptive memory allocations in clusters to handle unexpectedly large data-intensive jobs

    Publication Year: 2004, Page(s):577 - 592
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1488 KB) | HTML iconHTML

    In a cluster system with dynamic load sharing support, a job submission or migration to a workstation is determined by the availability of CPU and memory resources of the workstation at the time (L. Xiao et al., 2002). In such a system, a small number of running jobs with unexpectedly large memory allocation requirements may significantly increase the queuing delay times of the rest of jobs with n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A global-state-triggered fault injector for distributed system evaluation

    Publication Year: 2004, Page(s):593 - 605
    Cited by:  Papers (13)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (928 KB) | HTML iconHTML

    Validation of the dependability of distributed systems via fault injection is gaining importance because distributed systems are being increasingly used in environments with high dependability requirements. The fact that distributed systems can fail in subtle ways that depend on the state of multiple parts of the system suggests that a global-state-based fault injection mechanism should be used to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interprocessor communication with limited memory

    Publication Year: 2004, Page(s):606 - 616
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1016 KB) | HTML iconHTML

    Many parallel applications require periodic redistribution of workloads and associated data. In a distributed memory computer, this redistribution can be difficult if limited memory is available for receiving messages. We propose a model for optimizing the exchange of messages under such circumstances which we call the minimum phase remapping problem. We first show that the problem is NP-complete,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • EMPOWER: a cluster architecture supporting network emulation

    Publication Year: 2004, Page(s):617 - 629
    Cited by:  Papers (9)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1200 KB) | HTML iconHTML

    Network research generally requires a simulation or emulation environment to test protocol implementations, to evaluate the performance of a scheme or a system, and to study complicated and highly varying network operations. For large network simulation, simulators consume a large amount of time and memory; and its result is largely based on some modeling assumptions that may not hold in the real ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Measuring the robustness of a resource allocation

    Publication Year: 2004, Page(s):630 - 641
    Cited by:  Papers (73)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB) | HTML iconHTML

    Parallel and distributed systems may operate in an environment that undergoes unpredictable changes causing certain system performance features to degrade. Such systems need robustness to guarantee limited degradation despite fluctuations in the behavior of its component parts or environment. This research investigates the robustness of an allocation of resources to tasks in parallel and distribut... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum and maximum utilization bounds for multiprocessor rate monotonic scheduling

    Publication Year: 2004, Page(s):642 - 653
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (968 KB) | HTML iconHTML

    The utilization bound for real-time rate monotonic (RM) scheduling on uniprocessors is extended to multiprocessors with partitioning-based scheduling. This allows fast schedulability tests to be performed on multiprocessors and quantifies the influence of key parameters, such as the number of processors and task sizes on the schedulability of the system. The multiprocessor utilization bound is a f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Classifying matrices separating rows and columns

    Publication Year: 2004, Page(s):654 - 665
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1176 KB) | HTML iconHTML

    The classification problem transforms a set of N numbers in such a way that none of the first N/2 numbers exceeds any of the last N/2 numbers. A comparator network that solves the classification problem on a set of r numbers is commonly called an r-classifier. We show how the well-known Leighton's Columnsort algorithm can be modified to solve the classification problem of N=rs numbers, with 1 ≤... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • k-Coteries for tolerating network 2-partition

    Publication Year: 2004, Page(s):666 - 672
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB) | HTML iconHTML

    A network partition, which makes it impossible for some pairs of processes to communicate with each other, is one of the most serious network failures. Although the notion of k-coterie is introduced to design a k-mutual exclusion algorithm that is robust against network failures, the number of processes allowed to simultaneously access the critical section may fatally decrease once network partiti... 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: 2004, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (53 KB)
    Freely Available from IEEE
  • [Back cover]

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