USPatent applicationPatented

System and method for identifying shared virtual memory in a computer cluster

Granted 20 Aug 2002 · 6 office actions

Application· this page
8763912
filed 11 Dec 1996
Publication
Not published
not published
Patent
US 6,438,663
granted 20 Aug 2002

Life of the application

27 dated events
⤢ drag to zoom1998200020022004200620082010201220142016ProsecutionOwnershipTerm & fees
ProsecutionOwnershipTerm & feeshover for detail · click to open

Abstract

For use with a computer cluster having virtual memory logical devices associated therewith, a system and method for determining which of the virtual memory logical devices are shared devices and a computer cluster employing such system or method. The system includes: (1) a polling circuit that retrieves volume information from at least some of the virtual memory logical devices and (2) a matching circuit that determines which ones of the at least some of the virtual memory logical devices are shared devices as a function of the volume information.

Description

6 parts
›TECHNICAL FIELD OF THE INVENTION

The present invention is directed, in general, to a computer system and, more specifically, to a system and method for identifying shared virtual memory (such as volumes of disk storage) in a cluster of cooperating computer systems.

›BACKGROUND OF THE INVENTION

Computer “clusters” comprising two or more processing devices and one or more associated storage devices are a very common and useful system configuration. Clusters provide highspeed communication between, and share resources among, the processing systems, storage devices and/or peripheral devices. The ability of clustered computer systems to share resources, in particular to share memory storage devices, is one of the key advantages of computer clusters.

Frequently, the fixed disk drives in a computer cluster are divided into volumes. The disk volumes may be shared by more than one device in the cluster, or may be non-shared. This distinction is not readily apparent to a user, since drives are usually addressed by a logical drive letter. The user thus has no way of determining whether or not a logical drive letter is assigned to the same volume on all systems in the cluster. This is a disadvantage in those applications where it is important to know whether or not a resource is shared by one or more devices. For example, if individual copies of a database application are resident in two servers and the database for the application is stored in a shared memory volume, either server can access the database even if the other server is malfunctioning or off-line for routine maintenance. However, if the database was stored in non-shared memory associated with a first one of the servers, the remaining server can access the database only by communicating with the first server.

Accordingly, what is needed in the art is a system and method that allows a user to determine which of the disk volumes in a complex cluster are shared between machines in the cluster.

›SUMMARY OF THE INVENTION

To address the above-discussed deficiencies of the prior art, the present invention provides, for use with a computer cluster having virtual memory logical devices associated therewith, a system and method for determining which of the virtual memory logical devices are shared devices and a computer cluster employing such system or method. The system includes: (1) a polling circuit that retrieves volume information from at least some of the virtual memory logical devices and (2) a matching circuit that determines which ones of the at least some of the virtual memory logical devices are shared devices as a function of the volume information.

As previously described, it is difficult to determine, in a complex computer cluster, which virtual memory logical devices are shared. This is so because conventional operating systems, such as Windows® NT®, do not provide a direct way to determine whether a device is shared. The present invention introduces the concept of employing the volume information that is conventionally associated with the virtual memory logical devices to determine (by deduction) which ones of the virtual memory logical devices are shared devices. Because it is highly unlikely (supporting mathematics to follow) that two devices would ever have the same volume information, the likelihood that the present invention is correct in its determination is correct, for all practical purposes.

In one embodiment of the present invention, the polling circuit retrieves the volume information as a function of drive letters that are common to computer systems in the computer cluster. In the embodiment to be illustrated and described, the polling circuit retrieves drive letters (e.g., “C:” in DOS-based computer systems) corresponding to devices of each computer system. In one embodiment of the present invention, the polling circuit retrieves the volume information from virtual memory logical devices that are available to the at least some of the virtual memory logical devices. In the embodiment to be illustrated and described, only available virtual fixed disk drive devices are polled for volume information.

In one embodiment of the present invention, the volume information is selected from the group consisting of: (1) volume name, (2) serial number, (3) maximum file length, (4) file system flags and (5) file system name. Those skilled in the art will readily perceive, however, that other information pertaining to a given virtual memory logical device can be retrieved for the purposes of determining whether the given device is shared.

In one embodiment of the present invention, the at least some of the virtual memory logical devices are fixed disk drives and the computer cluster is under control of a flat operating system. A “flat operating system” is one that does not divide memory into segments. Almost all modern operating systems are flat, using paging techniques to manage memory. This allows the operating systems to employ virtual memory management wherein volatile and nonvolatile main memory and nonvolatile secondary storage (such as disk drives) are addressed in a unified scheme.

In one embodiment of the present invention, the computer cluster is under control of a Windows® NT® operating system, the polling circuit employing Windows® NT® operating system commands selected from the group consisting of: (1) GetLogicalDrives( ), (2) GetDriveType( ) and (3) GetVolumelnformation( ). Those skilled in the art are familiar with these commands as they are typically employed, but will understand that use of these commands to deduce whether a device is shared has been heretofore unknown.

In one embodiment of the present invention, the operating system employs the plurality of logical fixed disk drives as virtual memory. Once it is known which of the logical fixed disk drives are shared, the operating system can more efficiently employ the resources of the computer cluster to execute a task on specific computer systems within the cluster.

The foregoing has outlined, rather broadly, preferred and alternative features of the present invention so that those skilled in the art may better understand the detailed description of the invention that follows. Additional features of the invention will be described hereinafter that form the subject of the claims of the invention. Those skilled in the art should appreciate that they can readily use the disclosed conception and specific embodiment as a basis for designing or modifying other structures for carrying out the same purposes of the present invention. Those skilled in the art should also realize that such equivalent constructions do not depart from the spirit and scope of the invention in its broadest form.

›BRIEF DESCRIPTION OF THE DRAWINGS

For a more complete understanding of the present invention, reference is now made to the following descriptions taken in conjunction with the accompanying drawings, in which:

FIG. 1 illustrates a block diagram of an exemplary computer network cluster according to one embodiment of the present invention; and

FIGS. 2A and 2B collectively illustrate a flow diagram of an exemplary method for determining which of the disk volumes in a network cluster are shared between machines in the cluster according to one embodiment of the present invention.

›DETAILED DESCRIPTION · 1 of 2

Referring initially to FIG. 1, illustrated is a block diagram of an exemplary computer network cluster according to one embodiment of the present invention. A computer system 100 is illustratively provided and includes processing units 101 - 104 , personal computer (PC) stations 111 - 113 and disk storage devices (disk drives) 121 - 125 . The term “include” and its derivatives, as used herein, mean inclusion without limitation.

Processing units 101 - 104 may be server computers or PC workstations similar to PC 111 -PC 113 . Processing units 101 - 104 , disk storage devices 121 - 125 and PC 111 -PC 113 comprise a complex cluster and share resources and communicate with one another via communication link 105 . Additionally, processing units 102 - 104 and disk storage devices 121 - 124 may comprise a separate complex cluster. Communication link 105 may be any one of a number of widely used network links, including Fiber Distributed Data Interface (FDDI). Computer network 100 is configured as a bus topology, such as Ethernet, but may also be configured as other topologies, including token ring or star.

In a preferred embodiment, computer network 100 advantageously uses a Small Computer Systems Interface (SCSI) adapter to couple the disk drives to the processing unit and PC interfaces. SCSI adapters allow disk drives and processing units to be daisy-chained together, such as disk drives 123 and 124 and processing units 102 - 104 . This is particularly important as a cluster grows. As FIG. 1 indicates, disk drive 121 is a local drive associated with processing unit 102 , disk drive 122 is a local drive associated with processing unit 103 , and disk drive 125 is a local drive associated with PC 111 . Disk drive 123 is associated with processing units 102 and 103 and disk drive 124 is associated with processing units 103 and 104 . Although the disk drives are not coupled directly to communication link 105 , disk drives 121 - 125 may nonetheless be accessed by other network devices through one of the processing units or personal computers to which each disk drive is connected.

As stated above, in a complex cluster, it is difficult for a user to determine which logical drive letters correspond to shared disk volumes, since different drive letters may be used by different processing units and/or PCs to represent the same shared disk volume. The present invention provides a means for determining which disk volumes in a cluster are shared by using the volume drive information to identify shared resources. In one embodiment, processing units 101 - 104 include one or more registers that are used as a polling circuit to retrieve volume information from the virtual memory logical devices and (2) processing circuitry that is used as a matching circuit to determine which ones of the virtual memory logical devices are shared devices by comparing the volume information.

In one embodiment of the present invention, the virtual memory logical devices are fixed disk drives, such as disk drives 121 - 125 and the computer cluster is under control of a flat operating system. A “flat operating system” is one that does not divide memory into segments. Flat operating systems use paging techniques to manage memory, thereby allowing the operating systems to employ virtual memory management wherein volatile and nonvolatile main memory and nonvolatile secondary storage (such as disk drives) are addressed in a unified scheme.

In one embodiment of the present invention, the computer cluster is under control of a Windows® NT® operating system, the polling circuit employing Windows® NT® operating system commands selected from the group consisting of: (1) GetLogicalDrives( ), (2) GetDriveType( ) and (3) GetVolumelnformation( ). Those skilled in the art are familiar with these commands as they are typically employed, but will understand that use of these commands to deduce whether a device is shared has been heretofore unknown.

In a preferred embodiment, the volume information includes volume name, serial number, maximum file length, file system flags and the file system name for each volume. The volume serial number is a unique identifier assigned by the operating system when the disk is formatted. It is a random 32-bit binary number, resulting in 2 32 =4,294,967,296 different values. If the volume information, including the volume serial number, of two or more disk volumes used by separate devices is identical, then present invention determines that the disk volumes are actually a single shared volume and the volume is added to the list of shared disk drives. Since the probability that two nonshared volumes will have the same randomly selected serial number is approximately 1 in 4.3 billion, it is highly unlikely that this determination by the present invention will be wrong.

In an exemplary embodiment, processing unit 102 and processing unit 103 both retrieve logical drive letters from disk drive 123 . For example, in a DOS operating system, logical drive letters A:, B:, and C: may be associated with processing unit 102 and drive letters E:, F:, and G: may be associated with processing unit 103 . Upon running GetVolumelnformation( ) upon each drive letter, it is determined that drive letter B: and drive letter G: have identical volume information, including the same volume serial numbers. It may then be safely determined by processing units 102 and 103 , and by the system administrator that logical drive letter B: and logical drive letter G: correspond to the same volume in shared disk space.

Conventional computer system architecture is more fully discussed in The Indispensable PC Hardware Book , by Hans-Peter Messmer, Addison Wesley (2nd ed. 1995) and Computer Organization and Architecture , by William Stallings, MacMillan Publishing Co. (3rd ed. 1993); conventional computer, or communications, network design is more fully discussed in Data Network Design , by Darren L. Spohn, McGraw-Hill, Inc. (1993); conventional data communications is more fully discussed in Voice and Data Communications Handbook , by Bud Bates and Donald Gregory, McGraw-Hill, Inc. (1996), Data Communications Principles , by R. D. Gitlin, J. F. Hayes and S. B. Weinstein, Plenum Press (1992) and The Irwin Handbook of Telecommunications , by James Harry Green, Irwin Professional Publishing (2nd ed. 1992); and conventional circuit design is more fully discussed in The Art of Electronics , by Paul Horowitz and Winfield, Cambridge University Press (2nd ed. 1991). Each of the foregoing publications is incorporated herein by reference for all purposes.

›DETAILED DESCRIPTION · 2 of 2

FIGS. 2A and 2B collectively illustrate a flow diagram of an exemplary method implemented by processing units 101 - 104 for determining which of the disk volumes in a network cluster are shared between machines in the cluster, and, more particularly, for identifying shared disk volumes and the logical drive letters corresponding to the shared volumes, all according to one embodiment of the present invention. Each of a remote system and a local system in the network cluster obtains and stores a list of available fixed drives (Steps 205 and 210 ). In a Windows NT environment, this would be accomplished by using the GetLogicalDrives( ) command, which generates a list of drive letters. The drive letter information is read and the GetDriveType( ) command is used to determine whether or not a selected logical drive is a fixed drive (Steps 215 and 220 ). If the drive is not a fixed drive, the drive is ignored and the next drive letter is read, until each drive letter has been examined (Steps 230 , 235 , and 215 ).

If, however, a drive is a fixed drive, each system uses the GetVolumelnformation( ) command to obtain and store the volume information for each logical drive, i.e., volume name, serial number, maximum file length, file system flags and file system name for each disk volume (Steps 240 , 245 , 250 and 255 ). Next, the volume information for all of the disk volumes is examined to see if any volumes have identical volume information (Steps 260 and 265 ). If the volume information is different, then the disk volumes are not shared (Steps 270 ) and the disk volume is further ignored. If the volume information is identical, the logical drive letters are added to the list of shared drives (Steps 275 ). The process is repeated until all combinations of logical drive letters have been compared (Steps 280 and 215 ).

From the above, it is apparent that the present invention provides, for use with a computer cluster having virtual memory logical devices associated therewith, a system and method for determining which of the virtual memory logical devices are shared devices and a computer cluster employing such system or method. An exemplary system includes: (1) a polling circuit that retrieves volume information from at least some of the virtual memory logical devices and (2) a matching circuit that determines which ones of the at least some of the virtual memory logical devices are shared devices as a function of the volume information.

Although the present invention has been described in detail, those skilled in the art should understand that they can make various changes, substitutions and alterations herein without departing from the spirit and scope of the invention in its broadest form.

Claims as granted

20 claims

Log in to read the claims of this application.

Log in to unlock

Classifications

9 codes
IPC · International Patent Classification
Section G — Physics
  • G06F3/06
  • G06F13/16
USPC · US Patent Classification
711/148711/147710/10710/11710/16711/112710/8

Claim changes

Soon
Coming soonHow the claims changed between publication and grant

See which claims were amended, added or cancelled during examination, with every added and removed word marked.

AmendedAddedCancelledUnchanged

The published claims of this application are not paired with the granted ones in what we hold.

File wrapper

⤢ drag to zoom199719981999200020012002USPTOApplicantNon-final rejectionNon-final rejectionNon-final rejectionFinal rejectionRequest for continued examinationResponse after non-finalResponse after final
USPTOApplicanthover for detail · click to open
Pendency
5.7 y
2,078 days filing → grant
Office actions
6
non-final + final
Responses
6
1 RCE
Examiner
B. James Peikari
art unit 2186 · TC 2100
Citations: 5 back · 11 forward

See the full prosecution history — every USPTO and applicant action on this file, in order.

Log in to unlock

Documents

Log in to open the documents of this file: the application as filed, every office action and response, the notice of allowance.

Log in to unlock

Chain of title

⤢ drag to zoom1998200020022004200620082010201220142016Owner 1Owner 4liens, releases & corrections
TitleLienReleasehover for detail · click to open

See the full assignment history — every owner this patent has passed through, with recordation dates and reel/frame numbers.

Log in to unlock