|Publication number||US7870128 B2|
|Application number||US 11/495,184|
|Publication date||Jan 11, 2011|
|Priority date||Jul 28, 2006|
|Also published as||US8645347, US8732148, US8892611, US20080027905, US20110087657, US20110258186, US20110270839, US20140108392|
|Publication number||11495184, 495184, US 7870128 B2, US 7870128B2, US-B2-7870128, US7870128 B2, US7870128B2|
|Inventors||Craig Jensen, Andrew Staffer, Robert Stevens Kleinschmidt, Jr., Sopurkh Khalsa, Gary Quan|
|Original Assignee||Diskeeper Corporation|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (14), Non-Patent Citations (4), Referenced by (20), Classifications (12), Legal Events (3)|
|External Links: USPTO, USPTO Assignment, Espacenet|
The present invention relates to accessing data on one or more storage media. In particular, the present invention relates to improving performance when reading one or more storage media by assigning locations for stored files based on a file classification and retrieval value of the data associated with particular regions of the one or more storage media.
For many different types of storage media, the speed with which data may be retrieved varies depending upon where the data is stored on the storage medium. For example, with hard disk drives the retrieval value varies based on physical factors such as seek time, rotational delay, and disk transfer rate. Examples of other storage media for which retrieval value differs based on where the data is stored include, hybrid drives (storage media have rotating platters as well as a solid state component such as a flash component that can store data), and network attached storage such as iSCSI. The retrieval value may be affected by factors other than the physical characteristics of the storage medium, such as the communication link, or network (if used).
Many manufactures of storage media provide information that roughly describes how fast the storage media will provide data. For example, a manufacturer may provide an “average access time”. In practice, the term “average access time” is used to describe how fast a storage medium is. A storage medium with a lower average access time is generally more responsive and “peppier” than one with a higher average access time. But “average access time” is just an average for the whole storage medium. The results may vary for individual accesses to data stored in different locations on that same storage medium. Moreover, manufacturers may quote internal disk transfer rates (the rate that data can be written to or read from the disk) as a range of values. For example, a range might be a minimum of 43 Mbytes per second and a maximum of 78 Mbytes per second. However, the actual transfer rate at any particular place on the disk may be anywhere between the two extremes.
Thus, the actual speed with which data can be read from a storage medium is difficult or impossible to know based solely on manufacturer specifications. Moreover, factors external to the storage medium affect the rate at which data can be retrieved from a storage medium. For example, if a host computer system is connected to one storage medium via a network (“network storage medium”) and another directly via a SCSI cable (“SCSI storage medium”), the retrieval value for the network storage medium may on average be slower than the SCSI storage medium. However, some regions of the network storage medium may have a faster retrieval value than some regions of the SCSI storage medium.
The approaches described in this section are approaches that could be pursued, but not necessarily approaches that have been previously conceived or pursued. Therefore, unless otherwise indicated, it should not be assumed that any of the approaches described in this section qualify as prior art merely by virtue of their inclusion in this section.
The present invention is illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which like reference numerals refer to similar elements and in which:
In the following description, for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be apparent, however, that the present invention may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to avoid unnecessarily obscuring the present invention.
A method, system, and apparatus are described herein for improving performance when reading one or more storage media. Files to be stored on the one or more storage media are classified into a ranking of different sets. The term file, as used throughout this description, is used to mean a file or a portion of a file. Differences in retrieval values of the data, based on where the data is stored on one or more storage media are exploited by selecting which files to store in which regions. By “retrieval value” of a particular location on a storage medium it is meant a time or other value that represents the time it takes to retrieve data from the particular location on the storage medium. As an example, retrieval values may be determined by measuring the difference between the time at which a host process issues a command to access data from a storage medium and the time at which the data is available to the host process. Thus, the retrieval value may factor in the time to transfer data and commands between a host computer system and the storage medium. However, retrieval values can be determined in other ways. For example, in some circumstances a retrieval value could be the difference between the time at which the storage medium receives a command to read data at a particular location and the time at which the storage medium outputs data for the location.
The retrieval value may be a value that approximates the time it takes to retrieve data from the storage medium. However, the retrieval value could be a relative ranking between two regions. For example, it could be determined that data can be retrieved faster from region 1 than region 2, without determining or estimating a time to retrieve data for either region.
Files that have a higher classification are stored in a region that is characterized by a higher retrieval value. The files can be classified based on frequency of access. Thus, files that are more frequently accessed may be stored in a region that has a faster speed of retrievability. The files can be classified by another measure, such as priority. For example, the classification for some or all of the files can be based on user-assigned priority. Other ways in which files can be classified include events, such as a system boot. A still further way in which files can be classified is data grouping. An example of data grouping is storing the files in a manner that reflects the way they appear in a folder on the host computer system.
In accordance with an embodiment of the present invention, a retrieval value for each of a plurality of locations of the one or more storage media is accessed. A classification is formed for files that are currently stored or may be stored on the one or more storage media in the future. For example, files may be classified based on frequency of access. At least some of the files are stored on the one or more storage media based on the classification and the retrieval value of the locations. The storing of the files may include moving a particular file from a location having a given retrieval value to another location having a different retrieval value, or storing to the one or more storage media a file that does not currently exist on the one or more storage media.
In accordance with one embodiment, the one or more storage media is divided into regions according to the retrieval values. A particular region comprises one or more of the locations. The regions are ranked based on the retrieval value for the locations of each particular region. For example, one of the regions may be characterized as a fast region because the locations in that region have fast retrieval time. Another of the regions may be characterized as a slow region because the locations in that region have slow retrieval time. The files are stored in one of the regions, based on the ranking of the regions and the classification of the files. For example, files that are accessed more frequently are stored in the fast region.
The file positioning engine 110 generates retrieval time based dividing data 115, based on the retrieval time data 125. The retrieval time based dividing data 115 describes how the one or more storage media 120 is logically divided into regions that are characterized by different retrieval values. The storage medium retrieval value is not necessarily uniform in a given region. For example, a particular storage medium might have 20 or more different retrieval values, but the storage medium might only be logically divided into three or four regions. Thus, there is not necessarily a single storage medium retrieval value for a particular region. However, the various regions can be characterized by the fastest or slowest storage medium retrieval value in the region or some statistical measure such as mean or medium storage medium retrieval value. The regions can then be ranked from a region characterized by the fastest storage medium retrieval value to a region characterized by the slowest storage medium retrieval value.
The retrieval time based dividing might also define a single region with a continuum of storage medium retrieval values. This region may be characterized as having a first point with a fast storage medium retrieval value and a second point with a slow storage medium retrieval value, with storage medium retrieval values decreasing between the first point and the second point.
The file positioning engine 110 accesses retrieval time data 125 and the file classification data 130 in order to determine where files should be stored on the one or more storage media 120. The file classification data 130 may describe how frequently each file is accessed. The frequency may be broken down by how often the file was accessed over different periods of time. For example, file classification data 130 may describe the number of accesses over the last week, the number of accesses over the last month, etc. The file classification data may also describe a relative priority of files. For example, a user or software program may assign a priority to files. As a particular example, files of a certain type or associated with a given folder may be assigned a high priority. The file classification data may also be based on events. Still a further way to classify files is based on data grouping. Moreover, files can be classified based on any combination of access frequency, events, data grouping, or other factors.
The file frequency access monitor 150 determines frequency of file accesses and provides file frequency access information to the file positioning engine 110. The file priority information 160 describes a priority given to one or more of the files. For example, a user may assign a priority to a file or group of files. The file positioning engine 110 inputs the file priority information. The event detection 180 detects events that may be used by the file positioning engine 110 to classify files. The file grouping information 190 is input to the file positioning engine 110. Based on the file frequency access information, events, file groupings and/or the file priority information, the file positioning engine 110 classifies the files. Based on the file classification and the retrieval time information, the file positioning engine 110 determines where to place files on the one or more storage media 120.
In one embodiment, the retrieval time is determined by a process on a host computer system issuing read commands to various locations on the one or more storage media and determining a value that represents the time to retrieve data from particular storage locations. However, a different technique may be used to determine retrieval times. Note that the retrieval time is not necessarily a time invariant. For example, if the storage medium is accessed via a network, then the retrieval time may be affected by network traffic. The retrieval time is determined based on on-going monitoring of network traffic, in one embodiment.
The retrieval time takes into account substantially all the factors that may be involved in the retrieval time of a particular storage medium, in one embodiment. For example if a volume is made up of several network attached storage devices, the network speed and latency is automatically included in the retrieval time (for example iSCSI). The solid state portion of a hybrid drive's retrieval times can also be determined in relation to its traditional rotating platter.
In one embodiment, internal disk transfer rate information is collected or determined. Retrieval value is affected by internal disk transfer rate. However, it is not necessary to determine or know the internal transfer rate to determine the retrieval value. If a storage medium were to provide internal disk transfer rate information in response to a request to the storage medium, a request for the internal disk transfer rate information can be sent to the storage medium. However, the storage medium may not provide such information via a request. In one embodiment, the internal disk transfer rate information is determined by issuing multiple read commands to the storage medium and measuring response time. A technique for determining internal disk transfer rate is described in U.S. Patent Application entitled “Online Storage Medium Transfer Rate Characteristics Determination”, to Kleinschmidt Jr. et al. filed on Jul. 28, 2006, and incorporated by reference in its entirety as if fully set forth herein. The internal disk transfer rate information may be accessed from a table that describes storage medium transfer rates characteristics for one or more different storage media. For example, storage medium transfer rate characteristics may be obtained for different hard disk drive manufactures/models in any fashion. These internal disk transfer rate characteristics can be stored in a table that is accessible to the file positioning engine, wherein step 202 comprises accessing such a table.
Step 204 is the optional step of logically dividing the storage medium into regions according to the retrieval values. Each particular region comprises one or more of the locations, and the regions are ranked based on the retrieval value for the locations of each particular region. For example, the storage medium might be divided into a region having locations with fast retrieval values, a region having locations with medium retrieval values, and a region having locations with slow retrieval values. The storage medium can be logically divided into any number of regions. In one embodiment, rather than dividing the storage medium into a number of regions, the storage medium is defined having a range of retrieval values from a fast retrieval value to a slow retrieval value. Thus, a single region of the storage medium can be defined to have a continuum of retrieval values.
In general, the storage medium is logically divided into n-regions based on retrieval values. For illustrative purposes, the following example of logically dividing the storage medium into three regions will be used to discuss process 200. However, the storage medium can be logically divided into fewer or greater number of regions.
Region 1—A region characterized by a fast retrieval value.
Region 2—A region characterized by a medium retrieval value.
Region 3—A region characterized by a slow retrieval value.
Step 206 is forming a classification of files that are to be stored on the storage medium or are already stored thereon. Process 300 of
Step 208 is storing the files on the storage medium based on the classification and the retrieval values of the various locations of the storage medium. Continuing with the example in which three regions are used, files that are categorized as hot are placed into Region 1. Therefore, the files that are frequently accessed are placed in a region with a fast retrieval value. Files that are categorized as frozen are placed in Region 3. Therefore, the files that are infrequently accessed are placed in a region with a slow retrieval value. Files that are categorized as cold need not be moved at all except when they must be moved to free up space in region 1, in which case a cold file is placed in Region 2. Therefore, the files that are less frequently accessed tend to be placed in a region with a medium retrieval value.
In step 302, the age of a particular file is determined, based on the file access data or otherwise. In step 304, the frequency of access per a particular time period for the particular file is determined by examining the file access data. For example, the number of times the file was accessed in the last week is determined. However, other time periods can be used.
The time of the last file access is examined to determine if the file is a frozen file. If the last file access occurred more than a threshold time in the past, then the file is placed into a category as a frozen file, in step 308. For example, if the last file access was more than one month in the past, the file is considered frozen.
If the file is not a frozen file, then the number of file accesses over a period of time is analyzed. If the file was accessed more than a threshold number of times over the time period, then the file is placed into a category as a hot file, in step 310. As an example, a hot file is one that has been accessed more than a particular number of times in the last week.
If the file was accessed less than the threshold number of times over the first time period, then the file is placed into a category as a cold file, in step 312. A cold file is, for example, a file that has been accessed less than the threshold number of times within the last week.
Process 300 refers to various time periods and thresholds. These time periods and thresholds may be dynamically adjusted. Process 400 of
Classifying files based on access frequency is an example of one way of classifying files. However, this is not the only way in which files can be classified. Another way to classify files is based on events. Still a further way to classify files is based on data grouping. Moreover, files can be classified based on any combination of access frequency, events, data grouping, or other factors.
An example of an event is a system boot. In order to increase boot time performance of a computer system, files required for booting can be placed on a fast part of the storage medium during shutdown. The files are then in the fast or instant part of the storage medium for the boot event. Once the system is booted the files may be moved to make room for other more pertinent files while the system is up and running. Certain executables can also be thus placed on the fast portion of the storage medium. For example, a frequently-used word processing program or other data processing program can be placed in the fast portion of the storage medium. Rapid launching of such programs makes the computer system faster and more responsive to its users.
Grouping of files or parts of files together on a certain area of the storage medium can also significantly increase performance. For example if you launch a word processor, several different files and/or potions of files are loaded, additionally data may also be loaded at launch. If the computer has to go to several different areas of the disk to load the necessary files or parts of files it will take substantially longer than if all these files were in the same area on this disk. Further grouping folders (directories) with the files they contain will also speed up the computer system under certain circumstances. In order to determine what files to group we merely kept track of what files are read from the disk in sequence. When we can confirm a pattern then those files or portions of files are grouped together.
A File Access Monitor (FAM) is used to track the access frequency of each file on a storage medium volume, in accordance with one embodiment of the present invention. This is done in the background on a computer, in real time, while the computer is being used for work, without adversely impacting that work. As an example, the FAM can provide the number of accesses that have occurred for any file on the system during the last day, the last week, the last two weeks, three weeks or four weeks.
The FAM has an extremely efficient storage method for the access information. This method uses each file's File Record Number as an index into the data store. Any file's record can be accessed using its FRN or the records for all files can be accessed sequentially without requiring the overhead of record searches or maintaining index lists. These storage methods allow the FAM to work in the background without impacting other system processes.
The FAM uses small, fixed length records that are a whole power of two in length, in accordance with one embodiment of the present invention. This allows the access methods previously mentioned to be used without requiring time consuming index calculations or requiring logic to handle records that span buffers, and it keeps the size of the storage manageable. Daily and weekly access counts are stored in each record, in one embodiment. Moreover, the data is effectively aged as time passes, without requiring that the data be processed daily or weekly. This is done by recording a timestamp in each record. When a record is accessed, the current time and the recorded timestamp are used to ripple the data through the day and week counters so it reflects the state at that time, and then the timestamp is updated with the current time.
The FAM contains a method to detect file accesses in real-time on an ongoing basis for any volume on the computer. This method uses a high priority thread that repeatedly and continuously requests information on changes in the directories of a target volume. Any such information received by the thread is queued to a lower priority thread for recording as described above. The high priority thread handles its processing actions very quickly. Using quick processing and high priority allows each monitoring thread to capture information about any and all file accesses while not impacting other processes on the computer.
Computer system 500 may be coupled via bus 502 to a display 512, such as a cathode ray tube (CRT), for displaying information to a computer user. An input device 514, including alphanumeric and other keys, is coupled to bus 502 for communicating information and command selections to processor 504. Another type of user input device is cursor control 516, such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to processor 504 and for controlling cursor movement on display 512. This input device typically has two degrees of freedom in two axes, a first axis (e.g., x) and a second axis (e.g., y), that allows the device to specify positions in a plane.
The invention is related to the use of computer system 500 for implementing the techniques described herein. According to one embodiment of the invention, those techniques are performed by computer system 500 in response to processor 504 executing one or more sequences of one or more instructions contained in main memory 506. Such instructions may be read into main memory 506 from another machine-readable medium, such as storage device 510. Execution of the sequences of instructions contained in main memory 506 causes processor 504 to perform the process steps described herein. In alternative embodiments, hard-wired circuitry may be used in place of or in combination with software instructions to implement the invention. Thus, embodiments of the invention are not limited to any specific combination of hardware circuitry and software.
The term “machine-readable medium” as used herein refers to any medium that participates in providing data that causes a machine to operate in a specific fashion. In an embodiment implemented using computer system 500, various machine-readable media are involved, for example, in providing instructions to processor 504 for execution. Such a medium may take many forms, including but not limited to, non-volatile media, volatile media, and transmission media. Non-volatile media includes, for example, optical or magnetic disks, such as storage device 510. Volatile media includes dynamic memory, such as main memory 506. Transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 502. Transmission media can also take the form of acoustic or light waves, such as those generated during radio-wave and infrared data communications. All such media must be tangible to enable the instructions carried by the media to be detected by a physical mechanism that reads the instructions into a machine.
Common forms of machine-readable media include, for example, a floppy disk, a flexible disk, hard disk, magnetic tape, or any other magnetic medium, a CD-ROM, any other optical medium, punchcards, papertape, any other physical medium with patterns of holes, a RAM, a PROM, and EPROM, a FLASH-EPROM, any other memory chip or cartridge, a carrier wave as described hereinafter, or any other medium from which a computer can read.
Various forms of machine-readable media may be involved in carrying one or more sequences of one or more instructions to processor 504 for execution. For example, the instructions may initially be carried on a magnetic disk of a remote computer. The remote computer can load the instructions into its dynamic memory and send the instructions over a telephone line using a modem. A modem local to computer system 500 can receive the data on the telephone line and use an infrared transmitter to convert the data to an infrared signal. An infrared detector can receive the data carried in the infrared signal and appropriate circuitry can place the data on bus 502. Bus 502 carries the data to main memory 506, from which processor 504 retrieves and executes the instructions. The instructions received by main memory 506 may optionally be stored on storage device 510 either before or after execution by processor 504.
Computer system 500 also includes a communication interface 518 coupled to bus 502. Communication interface 518 provides a two-way data communication coupling to a network link 520 that is connected to a local network 522. For example, communication interface 518 may be an integrated services digital network (ISDN) card or a modem to provide a data communication connection to a corresponding type of telephone line. As another example, communication interface 518 may be a local area network (LAN) card to provide a data communication connection to a compatible LAN. Wireless links may also be implemented. In any such implementation, communication interface 518 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.
Network link 520 typically provides data communication through one or more networks to other data devices. For example, network link 520 may provide a connection through local network 522 to a host computer 524 or to data equipment operated by an Internet Service Provider (ISP) 526. ISP 526 in turn provides data communication services through the world wide packet data communication network now commonly referred to as the “Internet” 528. Local network 522 and Internet 528 both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link 520 and through communication interface 518, which carry the digital data to and from computer system 500, are exemplary forms of carrier waves transporting the information.
Computer system 500 can send messages and receive data, including program code, through the network(s), network link 520 and communication interface 518. In the Internet example, a server 530 might transmit a requested code for an application program through Internet 528, ISP 526, local network 522 and communication interface 518.
The received code may be executed by processor 504 as it is received, and/or stored in storage device 510, or other non-volatile storage for later execution. In this manner, computer system 500 may obtain application code in the form of a carrier wave.
In the foregoing specification, embodiments of the invention have been described with reference to numerous specific details that may vary from implementation to implementation. Thus, the sole and exclusive indicator of what is the invention, and is intended by the applicants to be the invention, is the set of claims that issue from this application, in the specific form in which such claims issue, including any subsequent correction. Any definitions expressly set forth herein for terms contained in such claims shall govern the meaning of such terms as used in the claims. Hence, no limitation, element, property, feature, advantage or attribute that is not expressly recited in a claim should limit the scope of such claim in any way. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US4607346 *||Mar 28, 1983||Aug 19, 1986||International Business Machines Corporation||Apparatus and method for placing data on a partitioned direct access storage device|
|US5398142||May 31, 1989||Mar 14, 1995||Raxco, Inc.||Method for eliminating file fragmentation and reducing average seek times in a magnetic disk media environment|
|US5790886||Dec 5, 1995||Aug 4, 1998||International Business Machines Corporation||Method and system for automated data storage system space allocation utilizing prioritized data set parameters|
|US6098128 *||Sep 17, 1996||Aug 1, 2000||Cyberstorage Systems Corporation||Universal storage management system|
|US6760918 *||Jun 29, 2001||Jul 6, 2004||Scientific-Atlanta, Inc.||Method and apparatus for recordable media content distribution|
|US7191304||Sep 4, 2003||Mar 13, 2007||3Pardata, Inc.||Efficient and reliable virtual volume mapping|
|US20030005454||Jun 29, 2001||Jan 2, 2003||Rodriguez Arturo A.||System and method for archiving multiple downloaded recordable media content|
|US20030121055||Dec 20, 2001||Jun 26, 2003||Kaminski Dariusz S.||Program position user interface for personal video recording time shift buffer|
|US20030200400||Apr 18, 2002||Oct 23, 2003||Peter Nangle||Method and system to store information|
|US20040059758||Sep 20, 2002||Mar 25, 2004||International Business Machines Corporation||Method and apparatus for optimizing extent size|
|US20050060356 *||Mar 5, 2004||Mar 17, 2005||Hitachi, Ltd.||Backup system and method based on data characteristics|
|US20050165796 *||Jan 15, 2004||Jul 28, 2005||Xerox Corporation.||Method and system for managing image files in a hierarchical storage mangement system|
|EP0381651A2||Jan 25, 1990||Aug 8, 1990||International Business Machines Corporation||Managing method and apparatus for data storage|
|WO2004109517A1||Jun 9, 2003||Dec 16, 2004||Fujitsu Limited||Storage management unit, storage unit, file processing system, file management system, and their methods and programs|
|1||Current claims for PCT patent application No. PCT/US2009/030567, 8 pages.|
|2||Harding, W. B. "Object Storage Hierarchy Management", IBM systems journal, IBM Corp. Armonk, New York, US, vol. 29, No. 3, Jan. 1, 1990, pp. 384-397, XP000265371.|
|3||International Search Report and Written Opinion for PCT patent application No. PCT/US2009/030567, dated Apr. 1, 2009, 17 pages.|
|4||Ritchie B. "Beyond HSM: Data Management in the Native Environment. Integration into the native environment is the key to implementing an effective data management solution", Computer Technology Review, Westworld Production , Beverly Hills, CA, US vol. 12 No. 11, Sep. 1. 1993, pp. 46-49, XP000397478.|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US8103251 *||Jan 24, 2012||Chi Mei Communication Systems, Inc.||System and method for managing information of a communication device|
|US8645347||Jun 30, 2011||Feb 4, 2014||Condusiv Technologies Corporation||Assigning data for storage based on a frequency with which the data is accessed|
|US8825940 *||Dec 2, 2008||Sep 2, 2014||Siliconsystems, Inc.||Architecture for optimizing execution of storage access commands|
|US8892611||Dec 17, 2010||Nov 18, 2014||Condusiv Technologies Corporation||Assigning data for storage based on speed with which data may be retrieved|
|US8949565 *||Dec 27, 2009||Feb 3, 2015||Intel Corporation||Virtual and hidden service partition and dynamic enhanced third party data store|
|US9043373 *||Aug 17, 2010||May 26, 2015||Iolo Technologies, Llc||System and method for efficient data storage|
|US9043374 *||Oct 25, 2011||May 26, 2015||Iolo Technologies, Llc||System and method for efficient data storage|
|US9052826||Jan 4, 2011||Jun 9, 2015||Condusiv Technologies Corporation||Selecting storage locations for storing data based on storage location attributes and data usage statistics|
|US9176859||Jan 7, 2009||Nov 3, 2015||Siliconsystems, Inc.||Systems and methods for improving the performance of non-volatile memory operations|
|US20090132621 *||Jan 6, 2009||May 21, 2009||Craig Jensen||Selecting storage location for file storage based on storage longevity and speed|
|US20090300040 *||May 28, 2009||Dec 3, 2009||International Business Machines Corporation||Table partitioning and storage in a database|
|US20090307479 *||Dec 10, 2009||Asustek Computer Inc.||Computer execution system for starting program quickly and method thereof|
|US20100015954 *||Jun 3, 2009||Jan 21, 2010||Chi Mei Communication Systems, Inc.||System and method for managing information of a communication device|
|US20100174849 *||Jan 7, 2009||Jul 8, 2010||Siliconsystems, Inc.||Systems and methods for improving the performance of non-volatile memory operations|
|US20110087657 *||Apr 14, 2011||Diskeeper Corporation||Assigning data for storage based on speed with which data may be retrieved|
|US20110161551 *||Dec 27, 2009||Jun 30, 2011||Intel Corporation||Virtual and hidden service partition and dynamic enhanced third party data store|
|US20110167230 *||Jul 7, 2011||Diskeeper Corporation||Selecting Storage Locations For Storing Data Based on Storage Location Attributes and Data Usage Statistics|
|US20120011314 *||Jan 12, 2012||Infinidat Ltd.||Storage system with reduced energy consumption and method of operating thereof|
|US20120047189 *||Aug 17, 2010||Feb 23, 2012||Iolo Technologies, Llc||System and method for efficient data storage|
|US20120078985 *||Mar 29, 2012||Iolo Technologies, Llc||System and Method for Efficient Data Storage|
|Cooperative Classification||G06F3/067, G06F3/0643, G06F3/0644, G06F3/0613, G06F17/3053, G06F17/30554|
|European Classification||G06F3/06A2P4, G06F3/06A6D, G06F3/06A4F4, G06F3/06A4F6|
|Oct 17, 2006||AS||Assignment|
Owner name: DISKEEPER CORPORATION, CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:JENSEN, CRAIG;STAFFER, ANDREW;KLEINSCHMIDT, JR., ROBERT STEVENS;AND OTHERS;REEL/FRAME:018423/0845;SIGNING DATES FROM 20061005 TO 20061006
Owner name: DISKEEPER CORPORATION, CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:JENSEN, CRAIG;STAFFER, ANDREW;KLEINSCHMIDT, JR., ROBERT STEVENS;AND OTHERS;SIGNING DATES FROM 20061005 TO 20061006;REEL/FRAME:018423/0845
|Mar 20, 2012||AS||Assignment|
Owner name: CONDUSIV TECHNOLOGIES CORPORATION, CALIFORNIA
Free format text: CHANGE OF NAME;ASSIGNOR:DISKEEPER CORPORATION;REEL/FRAME:027897/0101
Effective date: 20120216
|May 6, 2014||FPAY||Fee payment|
Year of fee payment: 4