IP Library Granted Patent US 9,374,315
Granted Patent B2
US 9,374,315 · App. 14/250,852 · Granted Jun 21, 2016

Spare resource election in a computing system

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,374,315
App. No.
14/250,852
Granted
Jun 21, 2016
Kind
B2
Abstract

A computing system comprising multiple computing resources in which one resource assumes spare status using a spare election algorithm. According to the algorithm each computing resource on initialization requests permission to assume spare state from the other computing resources. Then if all of the other computing resources grant the permission the requesting computing resource assumes spare state. If one of the other computing resources does not grant the permission to the requesting resource then the requesting resource assumes normal state.

Claims (28)

1. A method implemented in a first computing resource comprising one of multiple computing resources in a computing system, the method comprising:

sending to the multiple computing resources in the computing system other than the first computing resource a request for permission to assume spare state,

if all the multiple computing resources other than the first computing resource grant the permission, assuming spare state, and

if any of the multiple computing resources does not grant the permission, assuming normal state,

wherein each of the multiple computing resources has a unique identity whereby the multiple computing resources are organized in a hierarchy, and the method further comprises:

receiving a request to assume spare state from one of the multiple resources in the system other than the first resource;

determining whether the resource from which the request was received is lower in the hierarchy than the first resource;

if the resource from which the request was received is lower in the hierarchy, delaying responding to the request until the first resource has assumed spare or normal state; and

if the resource from which the request was received is higher in the hierarchy, responding to the request.

2. The method as claimed in claim 1 in which the first computing resource is configured to communicate with the other resources in the system in a logical circle and further comprising:

receiving a request from or via a neighboring resource in the logical circle for permission to assume spare state,

determining that the request originated at the first resource, and

responding to the request with permission to assume spare state.

3. The method as claimed in claim 1 in which the first computing resource is configured to communicate with the other ones of the multiple computing resources in the system in the manner of a logical circle and further comprising:

receiving a request from or via a neighboring one of the multiple computing resources in the logical circle for permission to assume spare state,

determining that the request originated at one of the multiple computing resources other than the first resource, and

forwarding the request to the next one of the multiple computing resources in the logical circle.

4. The method as claimed in claim 3 further comprising:

receiving a response from the next one of the multiple computing resources and returning the response to the one of the multiple computing resources from or via which the request was received.

5. The method as claimed in claim 3 further comprising determining that the first computing resource has not assumed spare state prior to said forwarding the request to the next one of the multiple computing resources in the circle.

6. The method as claimed in claim 1 comprising sending the request for permission to assume spare state to each of the multiple computing resources in the system other than the first computing resource.

7. The method as claimed in claim 1 comprising determining failure of one of the multiple computing resources to respond to a request from the first resource for permission to assume normal state, and

assuming normal state in response to said determining.

8. The method as claimed in claim 4 comprising determining failure of the next one of the multiple computing resources to respond to the request and

in response to said determining returning to the one of the multiple computing resources, from or via which the request was received, a denial of permission to assume spare state.

9. The method as claimed in claim 1 comprising determining grant or denial of permission to assume spare state from the state of a result object returned from one or more of the multiple computing resources other than the first resource.

10. The method as claimed in claim 1 in which the spare state applies to at least one operation capable of being performed by all of the multiple computing resources.

11. The method as claimed in claim 10 in which the operation is a recording operation.

Assignments (4)
SECURITY INTEREST Recorded Feb 26, 2026
From: NICE LTD; NICE SYSTEMS INC.; NICE SYSTEMS TECHNOLOGIES INC.; INCONTACT, INC.
To: JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT
Reel/Frame 074986/0208 →
PATENT SECURITY AGREEMENT Recorded Dec 6, 2016
From: NICE LTD.; NICE SYSTEMS INC.; AC2 SOLUTIONS, INC.; ACTIMIZE LIMITED; INCONTACT, INC.; NEXIDIA, INC.; NICE SYSTEMS TECHNOLOGIES, INC.
To: JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT
Reel/Frame 040821/0818 →
CHANGE OF NAME Recorded Oct 18, 2016
From: NICE-SYSTEMS LTD.
To: NICE LTD.
Reel/Frame 040387/0527 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 19, 2014
From: ZUR, TAL; KOLODIZNER, EFIM
To: NICE-SYSTEMS LTD.
Reel/Frame 033558/0058 →