By Topic

Robust parallel resource management in shared memory multiprocessor systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
I-Ling Yen ; Dept. of Comput. Sci., Michigan State Univ., East Lansing, MI, USA ; Bastani, F.B.

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

Published in:

Parallel Processing Symposium, 1995. Proceedings., 9th International

Date of Conference:

25-28 Apr 1995