By Topic

Evaluating and designing software mutual exclusion algorithms on shared-memory multiprocessors

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
$33 $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

3 Author(s)
X. Zhang ; High-Performance Comput. & Software Lab., Texas Univ., San Antonio, TX, USA ; Y. Yan ; R. Castaneda

Performance evaluations of software-based mutual exclusion algorithms must take into account the effects of architectures and systems. We demonstrate a framework for such evaluation, and use the framework as a basis for designing more efficient algorithms. We propose a comprehensive performance evaluation framework that examines the overhead patterns inherent in the mutual exclusion algorithms and in the architectures on which the algorithms run. We used this framework to evaluate several representative mutual exclusion algorithms on the BBN TC2000 and KSR-1. Our research with this framework has helped us determine the characteristics of efficient software mutual exclusion algorithms. Based on these characteristics, we've developed three mutual exclusion algorithms, two of which combine good features of two of the representative algorithms. Tests show that these new algorithms are fast and can be highly scalable

Published in:

IEEE Parallel & Distributed Technology: Systems & Applications  (Volume:4 ,  Issue: 1 )