![]() ![]() ![]() Further, the method includes an operation for dynamically adjusting the second weight based on the current resource utilization in the storage system. One method includes operations for assigning a first weight to a processing task that increases resource utilization of a resource for processing incoming input/output (IO) requests, and for assigning a second weight to a generating task that decreases the resource utilization of the resource. This way, one write request does not monopolize the use of the flash chip for a period of time, allowing other requests to be queued while the chunklet is being processed by the all-flash storage.Ībstract: Methods, systems, and computer programs are presented for allocating CPU cycles and disk Input/Output's (IOs) to resource-creating processes based on dynamic weights that change according to the current percentage of resource utilization in the storage device. One chunklet is processed at a time per write request. As write requests come in, the write requests are broken into chunklets, and then the chunklets are queued for processing by the flash chip. A chunklet is defined as a block of data having the calculated maximum size. In one implementation, a determination is made on what is the maximum size of a request to flash storage that improves the throughput of a flash chip (e.g., write requests beyond a certain size do not improve throughput). Also, a large read request may slow down smaller read requests by filling the incoming requests queue. There could be several problems when reading or writing from all-flash storage, such as a large write request slowing down small read requests, or other write requests. ![]() ![]() Publication/Patent Number: US20170024149A1Ībstract: In an all-flash storage array, write requests can take about 9 to 10 times longer than a read request of the same size. When the system detects that the first segment is being evicted from the second memory, the system re-caches the block into a second segment in the second memory if the block status of the block is active and the frequency of access to the block is above a predetermined value. Whenever an operation on a block is detected making the block inactive in one volume, the system determines if the block is still active in any volume, the block being cached in a first segment in the second memory. In one method, a block status is maintained in a first memory to identify if the block is active or inactive, blocks being stored in segments that are configured to be cacheable in a second memory, a read-cache memory. Publication/Patent Number: US20170060764A1Ībstract: Methods and systems are presented for evicting or copying-forward blocks in a storage system during garbage collection. The scheduling, replication and/or application performance may be managed by a daemon associated with the storage management application which communicates with an agent associated with an application server on which the application executes. The application protection profile specifies scheduling and replication of snapshots for application data to be stored on the volume, and the application performance profile specifies performance parameters such as setting a block size, enabling or modifying a data caching algorithm, turning on or modifying data compression, etc. Publication/Patent Number: US20170161152A1Ībstract: A storage management application of a storage array is operable to create a new volume on the storage device array, and to automatically configure, responsive to user selection of an application protection profile, data protection services for application data to be stored on the volume, and/or, responsive to user selection of an application performance profile, application specific performance parameters. The draining includes producing data segments that include two or more of said data blocks. The method includes draining data blocks, from time to time, from said read cache-on-write buffer to end storage of said storage. In this example, only a sub-set of said data blocks are temporarily stored in said read cache-on-write buffer. The method also includes processing said data blocks, while processing said storing, to identify data blocks and/or metadata to store in a read cache-on-write buffer. The processing includes storing data blocks of the write command to a write buffer of the storage array. The method includes, processing, by the storage application, a write command from the application. The storage application is configured to process write commands and read commands to and from storage of the storage array, and the write commands and the read commands being from an application. The method includes executing a storage application on the storage array. One example method is for storage processing on a storage array. Publication/Patent Number: US2018081591A1Ībstract: Methods and storage arrays are described. ![]()
0 Comments
Leave a Reply. |