2002•Unpublished venueRequires access

Robust parallel resource management in shared memory multiprocessor systems

I‐Ling Yen, Farokh Bastani

Open publisher page 2 citations

Abstract

Parallel machines are being increasingly used for applications that require both quick response time and high reliability. This poses a challenge in programming these systems since it must be ensured that there is sufficient redundancy to cope with failures and that, at the same time, redundant components are used effectively during failure free periods to enhance the performance. Among the issues, resource management in such systems is highly critical to the robustness and efficiency of the system. A good resource management algorithm should allow the system to continue its operation even in the presence of a significant number of processor failures. Also, the incorporation of fault tolerance should not incur too much overhead. In this paper, we develop two robust resource management algorithms which simultaneously achieve the twin objectives of low overhead and high reliability.>

About this research paper

What this paper is about

Parallel machines are being increasingly used for applications that require both quick response time and high reliability. This poses a challenge in programming these systems since it must be ensured that there is sufficient redundancy to cope with failures and that, at the same time, redundant components are used effectively during failure free periods to enhance the performance. Among the issues, resource management in such systems is highly critical to the robustness and efficiency of the system. A good resource management algorithm should allow the system to continue its operation even in the presence of a significant number of processor failures. Also, the incorporation of fault tolerance should not incur too much overhead. In this paper, we develop two robust resource management algorithms which simultaneously achieve the twin objectives of low overhead and high reliability.>

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Parallel machines are being increasingly used for applications that require both quick response time and high reliability. This poses a challenge in programming these systems since it must be ensured that there is sufficient redundancy to cope with failures and that, at the same time, redundant components are used effectively during failure free periods to enhance the performance. Among the issues, resource management in such systems is highly critical to the robustness and efficiency of the system. A good resource management algorithm should allow the system to continue its operation even in the presence of a significant number of processor failures. Also, the incorporation of fault tolerance should not incur too much overhead. In this paper, we develop two robust resource management algorithms which simultaneously achieve the twin objectives of low overhead and high reliability.>

Key concepts: Fault tolerance, Computer science, Redundancy (engineering), Multiprocessing, Robustness (evolution), Distributed computing, Overhead (engineering), Resource management (computing)

Related papers

Back to paper searchBrowse research topicsOriginal source
Robust parallel resource management in shared memory multiprocessor systems — Research Paper | ScholarLens