Fault recovery in concurrent queue management systems

• US 7,770,061 B2
• Filed: 06/02/2005
• Issued: 08/03/2010
• Est. Priority Date: 06/02/2005
• Status: Active Grant

• Current Assignee: Avaya Incorporated
• Original Assignee: Avaya Incorporated
• Inventors: Qutub, Sami, Sitkowski, Rafal
• Primary Examiner(s): Baderman; Scott T
• Assistant Examiner(s): SCHELL, JOSEPH O
• Application Number:
  US11/143,809
• Publication Number:
  US 20060274372A1
• Time in Patent Office: 1,888 Days
• Field of Search: 714/9, 714/43, 370/229, 370/235, 370/412
• US Class Current: 714/5.11
• CPC Class Codes: G06F 11/1479 Generic software techniques for error detection or fault masking
• CPC Class Codes: G06F 11/3006 where the computing system is distributed, e.g. networked systems, clusters, multiprocessor systems multiprogramming arrangements G06F9/46; allocation of resources G06F9/50
• CPC Class Codes: G06F 11/3055 Monitoring arrangements for monitoring the status of the computing system or of the computing system component, e.g. monitoring if the computing system is on, off, available, not available error or fault processing without redundancy G06F11/0703; error detection or correction by redundancy in data representation G06F11/08; error detection or correction by redundancy in operation G06F11/14; error detection or correction by redundancy in hardware G06F11/16
• CPC Class Codes: H04L 41/0654 using network fault recovery ring fault isolation or reconfiguration in loop networks without recovery actions by a network management system H04L12/437

Abstract

A method for fault tolerance and fault recovery in multiprocessor systems that concurrently manage queues is disclosed. The illustrative embodiment comprises a plurality of servers, a queue of jobs to be assigned to the servers, and two queue managers—a primary unit and a secondary unit—such that the secondary fills in for the primary unit while the primary unit is down. The illustrative embodiment provides for smooth transitions from the normal state into the failure state and back into the normal state without losing jobs or violating the queue discipline of the system.

Claims

1. A method comprising:

queuing at a first queue manager a first job to be served by a first server;

queuing at a second queue manager a second job to be served by said first server;

transmitting a first idle/busy indicator for said first server to said first queue manager and said second queue manager;

assigning said second job to said first server within a first time interval after said first idle/busy indicator becomes idle;

assigning said first job to said first server only after said first idle/busy indicator has been idle for at least said first time interval;

queuing a third job to be served by a second server at said first queue manager;

queuing a fourth job to be served by said second server at said second queue manager;

transmitting a second idle/busy indicator for said second server to said first queue manager and said second queue manager;

assigning said fourth job to said second server by said second queue manager within a second time interval after said second idle/busy indicator becomes idle; and

assigning said third job to said second server by said first queue manager only after said second idle/busy indicator has been idle for at least said second time interval.

2. The method of claim 1 wherein said second job and said fourth job are queued in said second queue manager before said first job and said third job are queued in said first queue manager.

3. The method of claim 1 wherein said fourth job is assigned to said second server before said third job is assigned to said second server.

4. The method of claim 1 wherein said third job is assigned to said second server before said first job is assigned to said first server.

5. The method of claim 1 wherein one or more of said first job, said second job, said third job, and said fourth job are telephone calls.