By Topic

Solving the processor identity problem in O(n) space

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

2 Author(s)
L. Lim ; Div. of Comput. Sci., California Univ., Davis, CA, USA ; A. Park

The processor identity problem is the problem of assigning unique identifiers to processors that communicate through shared memory. Solutions to fundamental multiprocessor coordination problems such as the mutual exclusion problem and the choice coordination problems often rely on unique identifiers. A solution to the processor identity problem simplifies shared memory processor design by eliminating the need to encode processor identifiers in system hardware or software structures. The original solution to the processor identity problem required O(n2) space. Further refinements lowered the space requirements to O(n log2n). This paper presents a protocol which only requires O(n) space

Published in:

Parallel and Distributed Processing, 1990. Proceedings of the Second IEEE Symposium on

Date of Conference:

9-13 Dec 1990