|Publication number||US7721022 B2|
|Application number||US 12/459,067|
|Publication date||May 18, 2010|
|Filing date||Jun 26, 2009|
|Priority date||May 4, 2005|
|Also published as||EP1889142A2, EP1889142A4, EP1889142B1, US7418531, US7594044, US20060253621, US20070300035, US20090271543, WO2006119446A2, WO2006119446A3|
|Publication number||12459067, 459067, US 7721022 B2, US 7721022B2, US-B2-7721022, US7721022 B2, US7721022B2|
|Inventors||Michael Allan Brewer, David Alan Burton, Michael Lee Workman|
|Original Assignee||Pillar Data Systems, Inc.|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (14), Non-Patent Citations (14), Referenced by (1), Classifications (16), Legal Events (2)|
|External Links: USPTO, USPTO Assignment, Espacenet|
The present invention relates to quality of service for data storage volumes.
This application is a continuation of U.S. application Ser. No. 11/897,431, Systems and Methods and Processing I/O Requests in Data Storage Systems, filed on Aug. 29, 2007, now U.S. Pat. No. 7,594,044 B2, which is a continuation of U.S. application Ser. No. 11/122,495, Quality of Service for Data Storage Volumes, filed on May 4, 2005, now U.S. Pat. No. 7,418,531 B2, which are both incorporated by reference herein.
This application also incorporates by reference herein as follows:
U.S. application Ser. No. 10/264,603, Systems and Methods of Multiple Access Paths to Single Ported Storage Devices, filed on Oct. 3, 2002, now abandoned;
U.S. application Ser. No. 10/354,797, Methods and Systems of Host Caching, filed on Jan. 29, 2003, now U.S. Pat. No. 6,965,979 B2;
U.S. application Ser. No. 10/397,610, Methods and Systems for Management of System Metadata, filed on Mar. 26, 2003, now U.S. Pat. No. 7,216,253 B2;
U.S. application Ser. No. 10/440,347, Methods and Systems of Cache Memory Management and Snapshot Operations, filed on May 16, 2003, now U.S. Pat. No. 7,124,243 B2;
U.S. application Ser. No. 10/600,417, Systems and Methods of Data Migration in Snapshot Operations, filed on Jun. 19, 2003, now U.S. Pat. No. 7,136,974 B2;
U.S. application Ser. No. 10/616,128, Snapshots of File Systems in Data Storage Systems, filed on Jul. 8, 2003, now U.S. Pat. No. 6,959,313 B2;
U.S. application Ser. No. 10/677,560, Systems and Methods of Multiple Access Paths to Single Ported Storage Devices, filed on Oct. 1, 2003, now abandoned;
U.S. application Ser. No. 10/696,327, Data Replication in Data Storage Systems, filed on Oct. 28, 2003, now U.S. Pat. No. 7,143,122 B2;
U.S. application Ser. No. 10/837,322, Guided Configuration of Data Storage Systems, filed on Apr. 30, 2004, now U.S. Pat. No. 7,216,192 B2;
U.S. application Ser. No. 10/975,290, Staggered Writing for Data Storage Systems, filed on Oct. 27, 2004, now U.S. Pat. No. 7,380,157 B2; and
U.S. application Ser. No. 10/976,430, Management of I/O Operations in Data Storage Systems, filed on Oct. 29, 2004, now U.S. Pat. No. 7,222,223 B2.
The Internet, e-commerce, and relational databases have all contributed to a tremendous growth in data storage requirements, and created an expectation that the data must be readily available all of the time. The desire to manage data growth and produce high data availability has encouraged development of storage area networks (SANs) and network-attached storage (NAS).
SANs move networked storage behind the host, and typically have their own topology and do not rely on LAN protocols such as Ethernet. NAS frees storage from its direct attachment to a host. The NAS storage array becomes a network addressable device using standard Network file systems, TCP/IP, and Ethernet protocols. However, SANs and NAS employ at least one host connected to data storage subsystems containing the storage devices. Each storage subsystem typically contains multiple storage nodes where each node includes a storage controller and an array of storage devices usually magnetic disk (hard disk drive) or magnetic tape drives.
In data storage systems, a host makes I/O requests (i.e., reads and writes) of the data storage subsystems. Each application that is the subject of the I/O request may require different quality of service (QoS). For efficiency each host can accumulate a batch of I/O requests from application users and transmit them to the data storage subsystem.
When the host receives I/O requests, it should process the higher priority requests before the lower priority I/O requests despite the problem that I/O requests arrive at the host without regard to priority. For example, the host should ensure a higher quality of service NAS file system or SAN LUN is not given lower priority than a lower QoS file system or LUN and retain the ability to configure file systems and SAN LUNs by different QoS.
The host must ensure all I/O requests are completed in a reasonable time and must support many applications simultaneously while delivering the appropriate performance to each. It would be helpful if the number of priority levels could be easily modified to allow for different priorities (e.g., two or more) to allow for better tuning of the system. The maximum number of I/O requests allowed per priority level could be then determined through testing and some qualitative analysis of different workloads.
The invention supports classification of volumes (e.g., file systems or LUNs) of a data storage system according to application requirements and allocates space for the volumes on storage devices (e.g., hard disk drives) accordingly. A person such as an IT administrator defines the volumes specifying size, type (e.g., file system or SAN LUN), and priority (e.g., high, medium, low, or archive). The invention schedules I/O requests to the storage devices using the volume definition to match the application requirements and reduce storage seek time between volumes of different priorities.
This invention allows an IT administrator to use the higher performance bands of storage for high performance applications and the remaining capacity of the storage devices for lower performance application. By allocating space in this manner, the data storage system places data on the storage device to support performance needs. In an embodiment, by controlling the scheduling of I/O requests, the data storage system allocates I/O request bandwidth according to user preferences and avoids poor performance caused by seeks across the different performance bands.
To retain the high performance of the outer band, the data storage system limits seek activity to other bands. In addition, the data storage system schedules I/O requests according to priority to enforce the allocation of I/O request bandwidth selected by the customer. To achieve these objectives, the data storage system queues I/O requests by priority and selects I/O requests to send to the data storage subsystems according to target percentages of use.
The following description includes the best mode of carrying out the invention, illustrates the principles of the invention, uses illustrative values, and should not be taken in a limiting sense. The scope of the invention is determined by reference to the claims. Each part or step is assigned its own number in the specification and drawings.
Each host runs an operating system such as Linux, UNIX, a Microsoft OS, or another suitable operating system. Tanenbaum, Modern Operating Systems (2001) describes operating systems in detail and is incorporated herein by reference.
Each host includes a bus adapter 22 between the CPU-memory bus 14 and an interface bus 24, which in turn interfaces with network adapters 17 and 26. The first host 18 communicates through the network adapter 17 over link 28 with the local area network (LAN) 30 with other hosts. The first host 18 also communicates through the network adapter 26 over a link 21 with a storage interconnect network 29. Similarly, the second host 19 communicates over links 38 and 39 with the LAN 30 and the storage interconnect network 29, respectively. The storage interconnect network 29 also communicates over links 32, 34, and 36 with the data storage subsystems 44, 46, and 48, respectively. In sum, the hosts 18, 19 and 20 communicate with each other, the LAN 30 and storage interconnect network 29 and data storage subsystems 44, 46, and 48.
The LAN 30 and the storage interconnect network 29 can be separate networks as illustrated or combined in a single network, and may be any suitable known bus, SAN, LAN, or WAN technology such as Fibre Channel, SCSI, InfiniBand, or Ethernet, and the type of interconnect is not essential to the invention. See Kembel, The FibreChannel Consultant, A Comprehensive Introduction (1998), Kembel, The FibreChannel Consultant, Arbitrated Loop (1996-1997) The FibreChannel Consultant, Fibre Channel Switched Fabric (2001), Clark, Designing Storage Area Networks (2003), Clark, IP SANs: A Guide to iSCSI, iFCP, and FCIP Protocols for Storage Area Networks (2002) and Clark, Designing Storage Area Networks (1999), which are incorporated herein by reference.
U.S. application Ser. No. 10/677,560, Systems and Methods of Multiple Access Paths to Single Ported Storage Devices, filed on Oct. 1, 2003 describes suitable data storage subsystems, each containing at least one disk array, and is incorporated by reference herein. In alternative embodiments, any suitable controller and compatible storage device(s) can be used (e.g. tape drives or semiconductor memory) in the data storage subsystem. Massiglia, The RAID Book: A Storage System Technology Handbook (6th Edition, 1997) describing RAID technology is incorporated by reference herein.
In an embodiment, the disk array 43 is an array of hard disk drives that use zone bit recording (ZBR) to maximize capacity by creating data zones on each disk in a manner that maximizes the areal density (linear density in bits/in. and track density in trks/in.) within each data zone. The innermost track of a disk has a finite linear bit density for recording data that is determined by several factors. Given the rotational speed of the disk drive, the bit density cannot be greater than the rate the read/write (R/W) electronics is able to write and read data. Given the dimensions of the disk, the length of the innermost track and the bit density are used to determine the capacity of that innermost track. As the R/W heads move outward from the innermost track, the radius to each subsequent track increases and, accordingly, the length of each subsequent track increases and the resulting linear bit density decreases. If the data rate were to be held constant across the entire disk surface, the outermost track would contain the same amount of data (capacity) as the innermost track, even though the outermost track is approximately twice as long as the innermost track. In order to take advantage of the increasing track length and the potential for increasing the overall capacity, the disk surface is divided into zones. At the innermost track of each zone, the linear density of the recorded data is increased to again meet the maximum linear bit density that the R/W technology allows. The tracks within each new zone contain higher data capacity than those of the previous zone as the heads move to the outer diameter of the disk. The zone boundaries may be determined by the physical format of the data. Linear densities will be readjusted upward (a new zone created) when a whole sector or multiples of whole sectors (including sector overhead), will fit on the new zone's innermost track. Typically, eight to fifteen data zones are created. ZBR provides increased performance due to the increased data capacity in each zone as the R/W heads move from the innermost zone to the outermost zone.
A host may access secondary storage devices (e.g., disk drives) through a VLUN (virtual logical unit number) that abstracts the storage device(s) as a linear array of fixed-size blocks. A logical block address (LBA) identifies each fixed-sized block. The data storage system constructs a VLUN from all or parts of several physical storage devices such as disk drives. To make a large VLUN, a data storage system may concatenate space allocated from several storage devices. To improve performance, the data storage system maps adjacent regions of VLUN space onto different physical storage devices (striping). To improve reliability, the system holds multiple copies of a VLUN on different storage devices (mirroring). In an embodiment, the term volume encompasses one or more VLUNs used to store SAN LUNs and/or file systems.
Users request write and read operations of the data storage system 100. An IT administrator can assign an archive, low, medium, or high priority for each volume to handle each type of work (e.g., archive, backup, document production, and transaction processing).
In other embodiments, the IT administrator assigns one of a plurality of priorities to each volume. Thus the IT administrator could assign a higher or lower priority to a volume. Also the term for each priority need not be labeled as “archive, low, medium, or high,” but could be any suitable term that assists the user in understanding its predicted performance relative to other priorities.
In operation, a user requests an I/O operation of one of the hosts 18, 19, or 20 which will transmit the request on the LAN 30 or the storage interconnect network 29 to one or more of the data storage subsystems 44, 46, or 48.
If a write is received, the data storage subsystem 44 can use a write-through scheme and not acknowledge the write until the data is written to nonvolatile memory (e.g., disk array 43). This ensures data consistency between the host and data storage subsystem in the event of a power failure, etc.
In a write-back scheme, the data storage subsystem 44 can acknowledge the write before data is written to a disk array 43 as long as the data is stored in another form of nonvolatile memory (e.g., battery backed RAM) until written to the disk array to again ensure data consistency.
The host includes an I/O scheduler that periodically sweeps through the I/O request queues to pick up new I/O requests to send to the data storage subsystems 44, 46, or 48 (
The I/O scheduler looks up the volume priority of each I/O request in a table and tags each I/O request with its priority and transmits the I/O requests in batches to the data storage subsystems in order of priority. In an embodiment, the priority of each I/O request is set in a bit field. The width of the bit field determines the possible levels of priority. In an embodiment, the bit field is a command descriptor block (CDB) of a SCSI command and the three-bit field of the CDB represents up to eight priorities.
As illustrated by
In another embodiment, each data storage subsystem uses the techniques described in U.S. application Ser. No. 10/976,430, Management of I/O Operations in Data Storage Systems, filed on Oct. 29, 2004 to retain the priority ordering of I/O requests to the storage devices (e.g., disk drives). Therefore, the storage devices preferentially service the high priority requests over-medium priority requests. Likewise, the storage devices preferentially service the medium priority requests over low priority requests and so forth. The data storage subsystem uses this ordering to minimize seek between the performance bands of the storage device.
In another embodiment, within each priority, the data storage subsystem sorts the I/O requests according to known disk drive arm scheduling algorithms to reduce seek time. In an embodiment, at the end of a cycle of priority work, the data storage subsystem seeks the disks back to their outer diameters to perform or to be ready to perform high priority requests again.
Thus, the invention takes advantage of performance characteristics of disk drive geometry. For sequential I/O, a disk drive can read or write from the outer diameter approximately twice as fast as it can read or write from the inner diameter. Disk drives store more data per track at the outer diameter and run at a constant rotational velocity; therefore, the data rate scales with the track capacity.
For random I/O, a disk drive reads or writes about 8% faster at the outer diameter than at the inner. Applications can achieve yet higher random I/O rates by confining access to a small portion of the disk drive. For example, confining access to 5% of a disk drive can produce 1.6 times the random I/O throughput as using the entire disk drive. Generally, seek times on disk drives increase with the square root of the seek distance. By keeping the seek distance low, a data storage system improves random I/O performance.
With regard to quality of service I/O scheduling, to retain the high performance of the outer bands of the disk drives, the data storage system limits or eliminates seek activity to the other performance bands. The data storage system schedules I/O requests according to priority to enforce the allocation of I/O bandwidth selected by the administrator. To achieve the objectives, the data storage system queues I/O requests by priority and selects I/O requests to send to the data storage subsystems according to target percentages of use. The table below lists some illustrative priorities and desired allocation of I/O requests to each priority:
Priority of I/O Request
Band of Disk Drive
% of I/O
20% to 60%
60% to 80%
The “band of disk drive” column represents the allocation of capacity on each disk drive. The outermost 20% of the disk drive goes to high priority, the next 40% goes to medium priority, and so forth. It should be understood that the number of priorities, the proportion of the disk allocated, and the percentage of I/O allocated will vary from user to user. For example, the number of priorities can be a plurality, that is, two or more. It depends on types of application, the performance requirements of the applications, and the frequency of use of the applications. Thus, the user should be able to add or delete a priority, change the portions of the disk dedicated to a priority, and the percent of I/O after operations reveal better configurations.
The data storage subsystems address the performance bands through logical block addresses (or LBAs) of the disk drives. LBAs on a disk drive start at zero on the outer diameter and increase up to the capacity of the disk drive, with the highest LBA on the inner diameter of the disk drive. Therefore performance bands correspond to ranges of LBAs on the disk drives.
The “% of I/O” column represents the minimum fraction of the I/O requests that the priority gets. For example, if the data storage system needs to gather 100 I/O requests, then it takes at least 50 high priority requests (if it has that many), 35 medium priority requests, and so forth. In order to not “hang” the host while waiting for sufficient I/O requests to match each of the prescribed % allocations, system timers allow the execution of accumulated I/O requests after reasonable wait periods. The host transmits the I/O requests to the data storage subsystem when the I/O requests meet the batch size but if the I/O requests count does not reach the batch size by a maximum dwell time, the host transmits I/O requests to the data storage subsystem to avoid delay.
The host can also weight the allocation of I/O requests to priorities by the number of volumes assigned to each priority. For example, if high priority is 50% and archive priority 5% of I/O bandwidth, and you have one high priority volume and 20 volumes of archive priority, the host will weight the allocation as follows:
50% × 1 volume = 50%
5% × 20 volumes = 100%
Normalizing the results you have as follows:
In another embodiment, the host may weight the allocation of I/O requests only to volumes that are recently active (e.g., I/O requests received in the last five minutes) in each priority. Each host receives I/O requests from users running applications and translates I/O requests to read or write blocks in a volume into I/O requests to blocks in the data storage subsystems. In an illustrative embodiment, each translated I/O request contains:
World-wide name of target enclosure LUN
Logical block address in the LUN
Number of 512-byte blocks
Read, write, or status inquiry
Physical address of the data in host memory
Priority (high, medium, low, or archive)
In conclusion, many features of the invention were illustrated using the terms high, medium, low, and archive. The terms are not essential to the invention and other names can be used. The terms are only intended to distinguish the priority of the volumes, I/O requests, queues, and performance bands, not to supply a numerical limit or suggest that the priorities could not be identified with other terms.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US5140683||Mar 1, 1989||Aug 18, 1992||International Business Machines Corporation||Method for dispatching work requests in a data storage hierarchy|
|US5548795||Mar 28, 1994||Aug 20, 1996||Quantum Corporation||Method for determining command execution dependencies within command queue reordering process|
|US5724539||Apr 5, 1994||Mar 3, 1998||Digital Equipment Corporation||System for selectively storing stripes of data in tracks of disks so that sum of transfer rates of stripes match communication bandwidth to host|
|US5729718||May 1, 1996||Mar 17, 1998||Quantum Corporation||System for determining lead time latency as function of head switch, seek, and rotational latencies and utilizing embedded disk drive controller for command queue reordering|
|US5761692||May 15, 1995||Jun 2, 1998||Lucent Technologies Inc.||Method and apparatus of retrieving continuous and non-continuous media data from a file system|
|US6078998||Feb 11, 1997||Jun 20, 2000||Matsushita Electric Industrial Co., Ltd.||Real time scheduling of prioritized disk requests|
|US6496899||Feb 28, 2000||Dec 17, 2002||Sun Microsystems, Inc.||Disk scheduling system with bounded request reordering|
|US6745262||Jan 6, 2000||Jun 1, 2004||International Business Machines Corporation||Method, system, program, and data structure for queuing requests having different priorities|
|US6795894||Aug 8, 2000||Sep 21, 2004||Hewlett-Packard Development Company, L.P.||Fast disk cache writing system|
|US6829678||Jul 18, 2000||Dec 7, 2004||International Business Machines Corporation||System for determining the order and frequency in which space is allocated on individual storage devices|
|US7260634||Aug 29, 2002||Aug 21, 2007||Hitachi, Ltd.||Storage device band control apparatus, method, and program|
|US20040255055||Jun 16, 2003||Dec 16, 2004||International Business Machines Corporation||Method, system, and program for executing input/output requests|
|US20050066138||Dec 23, 2003||Mar 24, 2005||Horn Robert L.||Multiple storage element command queues|
|US20050206538||Feb 18, 2005||Sep 22, 2005||Mario Blaum||Skew-tolerant gray codes|
|1||A sensible customer approach: Pillar Customer Service. Designed around one customer. You, copyright 2005, Pillar Data Systems, Inc., US.|
|2||A sensible storage alternative: Pillar Axiom (TM) Storage System, copyright 2005, Pillar Data Systems, Inc., US.|
|3||Corporate Backgrounder-Pillar (TM) Data Systeme, copyright 2005, Pillar Data Systems, Inc., US.|
|4||Corporate Backgrounder—Pillar (TM) Data Systeme, copyright 2005, Pillar Data Systems, Inc., US.|
|5||Datasheet-Axiom File Replicator, Pillar Axiom (TM) Storage System, copyright 2005, Pillar Data Systems, Inc., US.|
|6||Datasheet—Axiom File Replicator, Pillar Axiom (TM) Storage System, copyright 2005, Pillar Data Systems, Inc., US.|
|7||Datasheet-Brick Storage Enclosures, Pillar Axiom (TM) Storage System, copyright 2005, Pillar Data Systems, Inc., US.|
|8||Datasheet—Brick Storage Enclosures, Pillar Axiom (TM) Storage System, copyright 2005, Pillar Data Systems, Inc., US.|
|9||Datasheet-Stammer Storage Controller, Pilot Policy Controller, Pillar Axiom (TM) Storage System, copyright 2005, Pillar Data Systems, Inc., US.|
|10||Datasheet—Stammer Storage Controller, Pilot Policy Controller, Pillar Axiom (TM) Storage System, copyright 2005, Pillar Data Systems, Inc., US.|
|11||From a market need comes an idea: A sensible storage alternative: Pillar Axiom (TM) Storage System, copyright 2005, Pillar Data Systems, Inc., US.|
|12||PCT International Preliminary Examination Report, International Application No. PCT/US06/17186, Jun. 4, 2009.|
|13||PCT International Search Report, International Application No. PCT/US06/17186, Jul. 7, 2008.|
|14||PCT Written Opinion of the International Searching Authority, International Application No. PCT/US06/17186, Jul. 7, 2008.|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US9264506||May 11, 2012||Feb 16, 2016||International Business Machines Corporation||Pull data transfer method in request-response models|
|U.S. Classification||710/36, 711/100|
|International Classification||G06F12/00, G06F3/00|
|Cooperative Classification||G06F3/0613, G06F3/067, G06F3/0631, G06F3/0659, G06F3/0605, G06F3/0635|
|European Classification||G06F3/06A2P4, G06F3/06A4C6, G06F3/06A4T6, G06F3/06A4C1, G06F3/06A2A2, G06F3/06A6D|
|Oct 25, 2011||AS||Assignment|
Owner name: ORACLE INTERNATIONAL CORPORATION, CALIFORNIA
Free format text: IP TRANSFER AGREEMENT;ASSIGNOR:PILLAR DATA SYSTEMS, INC.;REEL/FRAME:027116/0608
Effective date: 20110926
|Oct 23, 2013||FPAY||Fee payment|
Year of fee payment: 4