# US 2013/0155837 A1 · Selecting a Master Processor From an Ambiguous Peer Group

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2013/0155837 A1
- Document ID: US20130155837A1
- Status: Published application
- Kind: A1
- Application number: 13/736,413
- Filed: 2013-01-08
- Published: 2013-06-20
- Earliest claimed: 2011-12-15
- Assignees: International Business Machines Corporation
- Inventors: David R. ENGEBRETSEN; Stephen A. KNIGHT; Adam C. LANGE-PEARSON; Jaimeson J. SALEY
- Web page: https://patentgrep.com/patent/US20130155837A1

## CPC

- H04L 49/15: Interconnection of switching modules
- H04L 41/0803: Configuration setting
- H04L 41/12: Discovery or management of network topologies
- H04L 67/1051: {Group master selection mechanisms}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A distributed switch may include a plurality of special-purpose processors that control the different functions of the switch. To enable some special services, however, the distributed switch may need one of these processors to perform the role of a master. When a processor is powered on, the processor may publish a corresponding unique ID. Before electing the master, the special-purpose processors may use a discovery process to identify the network topology of the switch and evaluate the published IDs to determine which processor should be the master. If all the processors nominate the same master processor, then that processor is elected as the master and may finish configuring the distributed switch to enable the special services.

## Claims

### Claim 1

A method of electing a master processor from a plurality of processors, comprising:
storing in a first portion of a shared memory a first unique identifier for a first processor of the plurality of processors, wherein the shared memory is accessible by the plurality of processers via a network fabric;
traversing the network fabric comprising the plurality of processors;
reading, from a second portion of the shared memory, a second unique identifier for a second processor of the plurality of processors;
determining, based on one or more criteria, a nominee identifier from among the first and second unique identifiers;
storing the nominee identifier in a register in the first portion of the shared memory, wherein the nominee identifier is read from the register by one of the plurality of processors; and
electing the master processor that corresponds to the nominee identifier.

### Claim 2 (depends on 1)

The method of claim 1, wherein electing the master processor that corresponds to the nominee identifier further comprises:
after storing the nominee identifier in the register, determining whether the second portion of the shared memory contains the same nominee identifier;
if so, electing the master processor that corresponds to the same nominee identifier; and
otherwise, determining whether a different unique identifier stored in the second portion of the shared memory better satisfies the one or more criteria than the nominee identifier.

### Claim 3 (depends on 2)

The method of claim 2, further comprising, if the different unique identifier better satisfies the one or more criteria than the nominee identifier:
re-traversing the network fabric to identify a third processor of the plurality of processors, wherein the third processor stores a third unique identifier in a third portion of the shared memory; and
determining, based on the one or more criteria, a different nominee identifier from among the first, second, and third unique identifiers.

### Claim 4 (depends on 1)

The method of claim 1, wherein the first and second portions of the shared memory are distributed such that each portion is uniquely located on separate hardware components.

### Claim 5 (depends on 4)

The method of claim 4, wherein at least two of the plurality of processors are located on separate hardware components.

### Claim 6 (depends on 4)

The method of claim 4, wherein the first portion of the shared memory and the first processor are both located on one of the separate hardware components, wherein, before the master processor is elected, only the first processor is permitted to write data to the first portion of the shared memory.

### Claim 7 (depends on 1)

The method of claim 1, further comprising:
upon determining that the elected master processor fails, electing a new master processor.
