Apparatus and method for building metadata using a heartbeat...

Error detection/correction and fault detection/recovery – Data processing system error or fault handling – Reliability and availability

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C714S015000

Reexamination Certificate

active

06748550

ABSTRACT:

BACKGROUND OF THE INVENTION
1. Technical Field
The present invention is directed to an improved computing device. More specifically, the present invention is directed to an apparatus and method for building metadata using a heartbeat of a clustered system.
2. Description of Related Art
Computer clusters are generally used to perform a multitude of different computing functions because of their fault tolerance and load balancing capabilities. With a computer cluster, multiple computer systems are linked together in order to handle variable workloads or to provide continued operation in the event one fails. Each computer may be a multiprocessor system itself. For example, a cluster of four computers, each with four CPUs, would provide a total of 16 CPUs processing simultaneously. If one of the computers fails, one or more additional computers are still available and may actually take over the functions of the failed computer. In addition, load balancing mechanisms in the computer cluster are able to distribute the workload over the multiple computer systems, thereby reducing the burden on each of the computer systems.
Computer systems within the clustered system typically monitor each other's presence using a heartbeat signal or “keep alive” signal. Each computer system in the clustered system periodically sends out a heartbeat signal to the other computer systems in the clustered system essentially informing them that the sending computer system is still active and do not need their resources taken over by another computer system in the clustered system. If a heartbeat signal is not received from one of the computer systems in the clustered system, the other computer systems will determine that the computer system has failed.
When a member of the cluster has failed, i.e. when a heartbeat signal from one of the computer systems in the clustered system is not received by the other computer systems, or is otherwise not available to the clustered system, the other members of the clustered system must take over for the missing member. However, upon takeover of the functions of the missing system's resource (typically hard disk storage), the remaining members must learn or surmise the configuration of the resources that the missing system was using. This is typically done by having the computer system that is taking over the resources read in the metadata from the resource. The metadata from the resource is data that describes the configuration of the resource, e.g. the file system, data areas, and the like.
The reading in of the metadata from the resource upon detection of a failed computing system in the clustered system may take many processor cycles to complete. In some instances, the reading in of this metadata may take upwards of several minutes to complete. In some clustered systems, a delay of multiple seconds or minutes may mean heavy financial losses. For example, in a clustered system that is used to handle financial transactions, stock purchasing and selling, or the like, a delay of several minutes may cause a large financial impact. Thus, it would be beneficial to have a method and apparatus for minimizing the amount of time necessary for a computer system to takeover the resources of a failed computer system in a clustered system.
SUMMARY OF THE INVENTION
The present invention provides an apparatus and method for building metadata using a heartbeat of a clustered system. The present invention sends portions of metadata for a computer system resource, to each of the other computer systems in the clustered system as a heartbeat data message. Upon receiving the heartbeat data message having the portion of metadata, the receiving computer systems store the portion of metadata in a temporary storage until all of the metadata is received.
In subsequent heartbeat data messages, the remaining portions of the metadata are transmitted to the computer systems which, upon receiving all portions of the metadata, store the metadata in a secure location. If the sending computer system were to fail, the metadata stored in the secure location is read and used to takeover the resources of the failed computer system. In this way, the processing cycles used to read in the metadata from the resources of the failed computer system in the prior art are eliminated.


REFERENCES:
patent: 5666484 (1997-09-01), Orimo et al.
patent: 5715393 (1998-02-01), Naugle
patent: 6167438 (2000-12-01), Yates et al.
patent: 6173418 (2001-01-01), Fujino et al.
patent: 6272648 (2001-08-01), Findlay et al.
patent: 6501950 (2002-12-01), Smith et al.
patent: 2003/0061318 (2003-03-01), Abdelhadi et al.
patent: 2003/0135514 (2003-07-01), Patel et al.
patent: 2003/0233594 (2003-12-01), Earl
Golab, Lukasz “Issues in Data Stream Management” Data unknown.*
Fielding, Roy “Principled Design of the Modern Web Architecture” ACM Transactions on Internet Technology, vol. 2, No. 2, May 2002, pp. 115-150.*
Brodsky, Dmitry “Using Fine-grained connectivity to implement a peer-topeer file system” IEEE 2002.*
Stevens, W. Richard TCP/IP Illustrated vol. 1: the protocols.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Apparatus and method for building metadata using a heartbeat... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Apparatus and method for building metadata using a heartbeat..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Apparatus and method for building metadata using a heartbeat... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3335763

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.