Classifications

• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
  • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
  • G06F3/0601—Interfaces specially adapted for storage systems
  • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
  • G06F3/0653—Monitoring storage devices or systems
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
  • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
  • G06F3/0601—Interfaces specially adapted for storage systems
  • G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
  • G06F3/0604—Improving or facilitating administration, e.g. storage management
  • G06F3/0605—Improving or facilitating administration, e.g. storage management by facilitating the interaction with a user or administrator
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
  • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
  • G06F3/0601—Interfaces specially adapted for storage systems
  • G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
  • G06F3/067—Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]

Definitions

• the invention relates to the field of data storage and redundancy. More specifically the invention relates to a manner of fairly allocating storage resources, eg a multi-dimensioned disk array, through a negotiating process.
• Storage is a critical component of almost every software application in use today. As the storage industry has matured, there have been increases to both the number of storage options and the performance of data entry and retrieval. Storage options include, e.g., magnetic tape, Hard Disk Drives (HDD), CD-ROMs, DVD-ROMs, and optical media. HDD category includes, e.g., standalone HDDs, arrays of disks and complex virtual storage environments.
• Disk arrays may be classified, e.g., Redundant Array of Inexpensive Disks (RAID) 0, RAID 1, RAID 0+1 (which have enhanced redundancy and performance), RAID 1+5 and RAID 5, among others.
• Virtual storage environments include Storage Area Networks (SANs) . Each storage option has an associated cost and service level, both of which vary widely.
• Some applications e.g. hosted on one or more servers, occasionally get markedly increased demands for the features of the application. This can result in rapid fluctuations in CPU utilization, network traffic and particularly, for storage.
• these "peak" times are well known and can be identified by a scheduled event, e.g. a date, time and duration. Other times, the peaks are unscheduled, and some responsiveness is needed in an ad hoc manner.
• a method for allocating storage resources begins with monitoring a performance level. If the performance level is beyond a threshold, a further determination is made to see if a requirement change occurred. If so, the embodiment looks up an unused negotiation stage from a set of negotiation stages stored in metadata. Provided the negotiation stage exists, a request is made to for a service based on the unused negotiation stage - wherein the request goes out to a storage provider server. The storage provider makes (or at least appears to make) a storage provider response. The embodiment determines if the SP response is acceptable. If so, the embodiment commits a storage change based on the SP response.
• Figure 1 shows a data processing system in accordance with an illustrative embodiment of the present invention
• Figure 2 shows a block diagram of some of the component parts in accordance with an illustrative embodiment of the present invention
• FIG. 3 is a block diagram of a network in accordance with an illustrative embodiment of the present invention.
• Figure 4 shows a flow diagram expressing the steps that an embodiment may take to occasionally update requirements and an agreement with a storage provider server in accordance with an illustrative embodiment of the present invention.
• a computer 100 which includes system unit 102, video display terminal 104, keyboard 106, storage devices 108, which may include floppy drives and other types of permanent and removable storage media, and mouse 110. Additional input devices may be included with personal computer 100, such as, for example, a joystick, touchpad, touch screen, trackball, microphone, and the like.
• Computer 100 can be implemented using any suitable computer, such as an IBM eServer computer or IntelliStation computer, which are products of International Business Machines Corporation, located in Armonk, New York.
• Computer 100 also preferably includes a graphical user interface (GUI) that may be implemented by means of systems software residing in computer readable media in operation within computer 100.
• GUI graphical user interface
• Data processing system 200 is an example of a computer, such as computer 100 in Figure 1, in which code or instructions implementing the processes of the present invention may be located.
• Data processing system 200 employs a peripheral component interconnect (PCI) local bus architecture.
• PCI peripheral component interconnect
• AGP Accelerated Graphics Port
• ISA Industry Standard Architecture
• Processor 202 and main memory 204 are connected to PCI local bus 206 through PCI bridge 208.
• PCI bridge 208 also may include an integrated memory controller and cache memory for processor 202.
• PCI local bus 206 may be made through direct component interconnection or through add-in connectors .
• local area network (LAN) adapter 210, small computer system interface (SCSI) host bus adapter 212, and expansion bus interface 214 are connected to PCI local bus 206 by direct component connection.
• audio adapter 216, graphics adapter 218, and audio/video adapter 219 are connected to PCI local bus 206 by add-in boards inserted into expansion slots.
• Expansion bus interface 214 provides a connection for a keyboard and mouse adapter 220, modem 222, and additional memory 224.
• SCSI host bus adapter 212 provides a connection for hard disk drive 226, tape drive 228, and CD-ROM drive 230.
• Typical PCI local bus implementations will support three or four PCI expansion slots or add-in connectors .
• An operating system runs on processor 202 and is used to coordinate and provide control of various components within data processing system 200 in Figure 2.
• the operating system may be a commercially available operating system such as Windows XP, which is available from Microsoft Corporation. Instructions for the operating system, an object-oriented programming system, and applications or programs are located on storage devices, such as hard disk drive 226, and may be loaded into main memory 204 for execution by processor 202.
• FIG. 2 may vary depending on the implementation.
• Other internal hardware or peripheral devices such as flash read-only memory (ROM) , equivalent nonvolatile memory, or optical disk drives and the like, may be used in addition to or in place of the hardware depicted in Figure 2.
• ROM read-only memory
• optical disk drives and the like may be used in addition to or in place of the hardware depicted in Figure 2.
• the processes of the present invention may be applied to a multiprocessor data processing system.
• data processing system 200 may not include SCSI host bus adapter 212, hard disk drive 226, tape drive 228, and CD-ROM 230.
• the computer to be properly called a client computer, includes some type of network communication interface, such as LAN adapter 210, modem 222, or the like.
• data processing system 200 may be a stand-alone system configured to be bootable without relying on some type of network communication interface, whether or not data processing system 200 comprises some type of network communication interface.
• data processing system 200 may be a personal digital assistant (PDA) , which is configured with ROM and/or flash ROM to provide non-volatile memory for storing operating system files and/or user-generated data.
• PDA personal digital assistant
• data processing system 200 also may be a notebook computer or hand held computer in addition to taking the form of a PDA.
• data processing system 200 also may be a kiosk or a Web appliance.
• processor 202 uses computer implemented instructions, which may be located in a memory such as, for example, main memory 204, memory 224, or in one or more peripheral devices 226-230.
• Table 1 depicts a metadata structure.
• a negotiation stage is a list of at least two requirements.
• the requirements are usually a kind of test or criteria with which to measure the "goodness" of the proposal from the perspective of the storage consumer.
• each parameter (as shown in the rows in Table 1) is sought to be "as good or better". This may mean, in some circumstances, that a parameter must be "equal or greater than” to satisfy the criteria. In other circumstances, a parameter must be "equal or lesser than” .
• Parameters may include a data throughput rate, either measured in a long-term sustained rate, or on a burst criteria. Other parameters may be the percent availability during a contracted or negotiated period, which may be during a month. Time to recover from failure may be a parameter. Presence of backup as being either "none", “optional” or “required” could be another parameter. Space could be another parameter. Architecture among the Redundant Array of Inexpensive Disks (RAID) also could be a parameter, wherein requirements could be for RAID 0, RAID 1, RAID 5, among others .
• RAID Redundant Array of Inexpensive Disks
• Those parameters do not measure goodness. Those parameters include: time range, date range and delay to next negotiation.
• the final three lines of Table 1 show a monetary exchange for various features of the storage on a x per' basis, i.e. for each accounted consumption or use, a charge is applied which may be later used for billing.
• a token accounting may be applied.
• a pool of credits or tokens would be allocated to several applications (each distinct embodiments of the invention) .
• Each application would have its tokens limited to those with which it is configured, as from time to time replenished by a common administrative team.
• Such an environment would be suited, for example, to a corporation or other common legal entity which owns or controls the storage provider server and the various computers that run applications that are operating embodiments of the invention. It would thus be the relative scarcity of tokens that would guide the establishment of (by delegated personnel of the entity) negotiation stages within each application.
• FIG 3 is a block diagram of a network in accordance with an illustrative embodiment of the present invention.
• Storage consumer 301 may support a running application that is constructed using a data processing system, such as data processing system 200 of Figure 2.
• storage consumer 301 may be implemented with any suitable data processing system.
• Storage consumer 301 may run an operating system 303, which may provide partitioned access to hardware resources to one or more applications 305 that, from time to time, may be run on storage consumer 301.
• An application may execute the steps of an embodiment of the present invention, and via the network 311, may communicate with storage provider 321.
• Storage provider 321, likewise, may operate hardware constructed according a data processing system, such as data processing system 200 in to Figure 2.
• Storage provider 321 may merely be a commercial, widely available storage, such as, e.g. gmail.com, photobucket.com or any other service that describes a rudimentary storage made available online.
• Figure 4 is a flowchart showing the steps performed at a storage consumer.
• the storage consumer may measure a performance level that may correlate with data storage requirement fluctuations. For example, the storage consumer may measure CPU usage which might suggest that locally run applications need more or less data storage. Another example may be shifts in the network throughput. Still another example might be the occurrence of a certain time - which may denote usage shifts as may occur, e.g. with the lull that happens on websites when a geographic area finishes celebrating the New Year, and thus people are retiring to bed. These changes in CPU usage, network throughput and time are examples of changes in performance level. When the performance level, however measured, goes beyond a threshold, a storage event (step 401) is deemed to have occurred.
• a storage event may also occur based on a scheduled event.
• an alternative storage event occurs when detecting a scheduled event.
• Either an internal timekeeping device may signal an event occurrence, or the data processing system 200 may determine time through a network available resource, among other things.
• the embodiment hereinafter called “consumer” makes an evaluation of whether currently available (or committed) resources are sufficient to meet the anticipated needs, i.e. it determines whether a requirements change occurred (step 403) . If the determination is "no”, then continued monitoring for a storage event continues. If the determination is "yes”, then the embodiment looks up (step 405) an unused negotiation stage from among at least one negotiation stages stored in a metadata structure or storage requirements profile. The unused negotiation stage is unused from the perspective that it has not been used in a recent iteration of the steps (step 405) through (step 411) . The unused negotiation stage may be selected on the basis of its "goodness". Such negotiation stages may be used in order, and may be exhausted when the worst negotiation stage is used in the steps (step 405) through (step 411) .
• the embodiment may request (step 407) a service based on the unused negotiation stage.
• the service request may contain two or more of the parameters from the unused negotiation stage.
• the use of "as good or better” or “equal or greater than” in the request is unnecessary, as such conditions are implicit in the role of storage consumer - i.e. its obvious that a user of storage would prefer, all other things being equal, that the storage amount be greater than required.
• the request may be a packet or series of packets that carry two or more of the parameters from the unused negotiation stage.
• the request may include the steps of forming the packet or packets, as well as the sending of such packet or packets via a LAN adapter 210 from Figure 2.
• the request (step 407) of the storage consumer may be an http request or SOAP request made to a terms of service page or a known service parameter page of the storage provider, wherein the http request or Simple Object Access Protocol (SOAP) request may carry parameters of the negotiation stage to the storage provider.
• SOAP Simple Object Access Protocol
• a storage provider may create a service provider response or SP response.
• the SP response may acknowledge and accept the request.
• the SP response may echo back the parameters in the request - an indication of acceptance.
• the SP response may vary one or more parameters, showing what it is committing.
• the consumer may receive the response (step 409) .
• the request may return a hypertext markup page from the storage provider as the SP response.
• the storage consumer may screen scrape the hypertext markup page to select the details that are applicable, e.g. storage capacity, duration of offer and the like in association with the receiving the response (step 409) .
• Consumer may evaluate to see if the SP response is at or better than the request parameters, i.e. determining that the SP response is acceptable (step 411) . If not, more negotiation stages are looked up (step 405) , provided there are more unused negotiation stages (step 421) .
• step 411 it is hoped that the SP response is acceptable (step 411) , which is known to occur if all parameters are at or better than any request made. If this happens, the consumer commits the storage change (step 413) . And such committed changes may form the basis for determining if a requirements change happens later. Committing the storage change could be as simple as lighting a green LED for as long as adequate storage has been committed for the next 24 hour period. Committing the storage change could be establishing a reference table of the network location of the storage that is intended to be used during an interval, e.g. by mapping a network drive to a preferred letter designation. The committing of the storage may include calling a program to automatically give registration details to a known registration page of the storage provider. At the conclusion of committing the storage changes (step 413) , the steps of the embodiment may end. At this time, any entry or row in a metadata structure (Table 1) is considered to be renewed and, once again, in an unused state.
• Table 1 any entry or row in a metadata structure (Table 1)
• the present invention may be able to respond to changing conditions, or anticipated changes, and attempt to obtain revised storage size, speed, durability among other parameters, without discernable operator intervention.

Landscapes

• Engineering & Computer Science (AREA)
• Theoretical Computer Science (AREA)
• Human Computer Interaction (AREA)
• Physics & Mathematics (AREA)
• General Engineering & Computer Science (AREA)
• General Physics & Mathematics (AREA)
• Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Priority Applications (1)

Applications Claiming Priority (2)

Publications (1)

Family

ID=36283971

Family Applications (1)

Country Status (4)

Cited By (1)

Families Citing this family (9)

Citations (6)

Family Cites Families (14)

• 2005
  • 2005-04-19 US US11/109,086 patent/US7793058B2/en not_active Expired - Fee Related
• 2006
  • 2006-04-05 WO PCT/EP2006/061357 patent/WO2006111475A1/en not_active Ceased
  • 2006-04-05 CN CN200680009933A patent/CN100583045C/zh not_active Expired - Lifetime
  • 2006-04-05 JP JP2008507047A patent/JP5324914B2/ja not_active Expired - Fee Related

Patent Citations (6)

Also Published As

Similar Documents

Legal Events