ПАРАЛЛЕЛЬНАЯ СОРТИРОВКА СЛИЯНИЕМ

Группа изобретений относится к вычислительной технике и может быть использована для сортировки данных в памяти. Техническим результатом является обеспечение сортировки для ассиметричной архитектуры памяти. Способ содержит этапы, на которых сортируют (1101) распределенные входные данные, локально по узлу (701, 702) обработки данных, посредством развертывания первых процессов на узлах (701, 702) обработки данных для создания множества сортированных списков в сегментах (401, 402, 403, 404) локальной памяти узлов (701, 702) обработки данных; создают (1102) последовательность диапазонных блоков (703, 704, 713, 714) в сегментах локальной памяти узлов (701, 702) обработки данных, копируют (1103) указанное множество сортированных списков в указанную последовательность диапазонных блоков (703, 704, 713, 714), сортируют (1104) элементы диапазонных блоков (703, 704, 713, 714), локально по узлу (701, 702) обработки данных, с использованием вторых процессов для создания сортированных элементов в диапазонных ...

ИНТЕРФЕЙСЫ ДЛЯ ОБРАБОТКИ ЦИФРОВЫХ МУЛЬТИМЕДИЙНЫХ ДАННЫХ

... 1. Машиночитаемый носитель (704), запрограммированный исполняемыми компьютером инструкциями (706), которые при исполнении процессором (702) выполняют способ (500) для подготовки мультимедийного содержимого (122) к презентации, где мультимедийное содержимое можно получить от мультимедийного источника (304/324) в виде множества элементов (407) мультимедийного содержимого, и где способ содержит этапы, на которых: ! определяют (502) участок (432) первого запоминающего устройства (430), распределенного для хранения элементов мультимедийных данных, принятых от мультимедийного источника; ! определяют (504) первый элемент мультимедийных данных, принятых от мультимедийного источника; ! определяют (506) первую ячейку запоминающего устройства для данного первого элемента мультимедийного содержимого в распределенной части данного первого запоминающего устройства; ! создают (508) первую структуру данных, связанных с первым элементом мультимедийных данных, причем данная первая структура данных имеет ...

СПОСОБ ОПТИМИЗАЦИИ РАБОТЫ КОМПЬЮТЕРА И ОСНОВНАЯ ЭНЕРГОНЕЗАВИСИМАЯ ЗАПОМИНАЮЩАЯ СРЕДА, ОПТИМИЗИРОВАННАЯ С ПОМОЩЬЮ РАЗДЕЛОВ СПЕЦИАЛЬНОГО НАЗНАЧЕНИЯ

... 1. Способ оптимизации работы компьютера, причем этот способ предусматривает: А) подготовку основной энергонезависимой запоминающей среды таким образом, что она содержит базовый набор разделов специального назначения, который включает в себя раздел, где установлены файлы, которые являются частью операционной системы; раздел для динамических файлов, файлов временного характера или файлов, модифицируемых на регулярной основе, являющихся результатом задач, присущих работе операционной системы и приложений; раздел для файлов, которые являются частью приложений; и раздел для файлов пользователя; В) установку операционной системы и драйверов устройств аппаратного обеспечения, а также связанных обновлений, вставок и дополнений, которые осуществляют вклад в их оптимальную работу, которая тонко настроена посредством конфигураций и перемещением обязательных файлов таким образом, что установленные элементы расположены в их соответствующих разделах специального назначения, так что они распознают и используют ...

MEMORY WITH REPEATED INDEPENDENT SERIAL CONNECTION

METHOD FOR ELIMINATING FILE FRAGMENTATION AND REDUCING AVERAGE SEEK TIMES IN A MAGNETIC DISK MEDIA ENVIRONMENT

Using external memory devices to improve system performance

Systems and methods for enhancing performance of software applications

A system for enhancing performance of a software application obtains a list of files to be processed by the software application, and sorts that list in the order of the physical position of files in the list on a hard drive. The files are loaded in the sorted order which can decrease or minimize the total file seeking time, thereby increasing the speed of execution of the software.

Improved processes for making opioids including 14-hydroxycodeinone and 14-hydroxymorphinone

Improved processes for making opioid products having low impurity levels including making 14-hydroxycodeinone and 14-hydroxymorphinone from thebaine and oripavine, respectively.

TECHNIQUES FOR GENERATING SNAPSHOTS OF DATASETS

In various embodiments, a write state application generates a snapshot that includes one or more data values associated with a source dataset. In operation, the write state application performs one or more compression operations on the source dataset to generate a first compressed record. The write state application then serializes the first compressed record and a second compressed record to generate a first compressed record list. Finally, the write state application generates the snapshot based on the first compressed record list. When the data values are accessed from the first snapshot, the size of the snapshot is maintained. Advantageously, because the size of the snapshot is smaller than the size of the source dataset, some consumers that are unable to store the entire source dataset in random access memory (RAM) are able to store the entire snapshot in RAM.

METHODS, SYSTEMS AND DEVICES RELATING TO DATA STORAGE INTERFACES FOR MANAGING ADDRESS SPACES IN DATA STORAGE DEVICES

Data address management systems, methods, devices and uses for minimizing interaction with data consumers' data on data storage devices, an embodiment comprising an external bus for communicatively interfacing the data storage system and data consumers; at least one storage medium components, each storage medium component comprising a plurality of storage locations having a unique storage location indicators; a translation layer module comprising a data address space having data addresses associable with storage location indicators; and a controller configured to store data in the storage locations and creating associations in the translation layer module between data addresses and the physical location indicators; wherein the data address space is accessible by the data consumer for addressing requests relating to data stored on the storage device and wherein the controller is configured to manipulate the arrangement of the data addresses in the data address space.

DATA PROCESSING DEVICE AND DATA PROCESSING METHOD

The embodiments of the invention provides a data processing device and data processing method to resolve the problem in the prior art that the data security in memory is not high because the data backup speed in memory is not fast. By writing the fist data written into memory into a first nonvolatile storage unit in the form of a log file, and writing the log file of the first data written into the first nonvolatile storage unit into the second nonvolatile storage unit, as the writing data speed of the first nonvolatile storage unit is higher than that of the second nonvolatile storage unit, the data processing device and data processing method provided by the embodiments of the invention can realize the fast backup of the data in memory and ensure the data security in memory when the data in memory is lost caused by exceptional cases.

Multi-bank memory with multiple read ports and multiple write ports per cycle

Intelligent coded memory architecture with enhanced access scheduler

For the cluster storage system for load balancing in a method and system

Ｉ／Ｏ 디바이스 및 컴퓨팅 호스팅 상호동작

I/O 디바이스가 컴퓨팅 호스트에 커플링된다. 일부 실시예들에서, 디바이스는 디바이스의 맵의 새도우 카피 및/또는 디바이스의 상태와 같은 정보를 저장하기 위해 디바이스에 직접 커플링되지 않은 컴퓨팅 호스트의 메모리를 활용하도록 인에이블된다. 맵의 새도우 카피의 저장은 디바이스 및 컴퓨팅 호스트 중 하나 또는 양자가 예를 들어, 판독 레이턴시를 감소시키기 위해 맵의 새도우 카피를 활용하게 할 수 있다. 상태의 저장은 디바이스가 저전력 상태에 진입할 때 그렇지 않으면 분실되는 휘발성 상태를 디바이스가 세이브하게 할 수 있다. 일부 실시예들에서, 디바이스는 표준 커맨드의 하나 또는 그 초과의 비표준 변경자들을 구현한다. 비표준 변경자들은 표준 커맨드들의 실행을 변경하여, 표준 커맨드들만을 갖는 호스트 프로토콜에는 존재하지 않는 특징들을 제공한다.

VIRTUAL STORAGE SERVICE SYSTEM BASED ON A BLOCK DEVICE AND A METHOD THEREOF CAPABLE OF REDUCING THE RISKINESS OF A LOSS AND AN INVASION OF INFORMATION STORED IN A DEVICE VOLUME

PURPOSE: A virtual storage service system based on a block device and a method thereof are provided to supply a volume snap shot backup except for redundancy data by designating a distributed node for a device volume by users. CONSTITUTION: A web server(100) receives selection information including virtual storage capacity, the number of storage nodes(410-440), a kind of the storage nodes, a distributing method, and a selected storage node for a virtual storage service from a terminal. A control center server(300) generates a virtual disk volume by referring to the selection information. The storage nodes generate the virtual disk volume according to the control of the control center server. A database(200) stores information about the storage nodes and information about the virtual disk volume. COPYRIGHT KIPO 2013 [Reference numerals] (100) Web server; (20) Network; (300) Cloud center server; (410) Storage node 1; (420) Storage node 2; (430) Storage node 3; (440) Storage node 4; (AA) Kernel ...

STORAGE CONTROLLER DATA REDISTRIBUTION

DATA STORAGE DEVICE AND OPERATING METHOD THEREOF

볼륨 영역들의 중복성 제거

... 볼륨 영역들의 대략적인(coarse-grained) 중복성 제거를 수행하기 위한 시스템 및 방법. 저장 제어기는 제1 볼륨의 제1 영역이 제2 볼륨의 제2 영역과 동일하다는 것을 검출하며, 제1 볼륨은 제1 매체를 가리키고, 제2 볼륨은 제2 매체를 가리킨다. 동일 영역들의 검출에 응답하여, 저장 제어기는 제1 매체의 제1 범위가 제2 매체의 제2 범위의 기저가 된다는 지시를 저장한다. 또한, 동일 영역들의 검출에 응답하여, 제2 매체의 제2 범위와 관련된 맵핑들이 무효화된다.

프로세서―기반 시스템의 메모리 내의 압축된 메모리 라인들의 우선순위―기반 액세스

... 개시된 양상들은 프로세서-기반 시스템에서 압축된 메모리 라인들의 우선순위-기반 액세스에 관한 것이다. 일 양상에서, 프로세서-기반 시스템의 메모리 액세스 디바이스는 메모리에 대한 판독 액세스 요청을 수신한다. 판독 액세스 요청이 상위 우선순위이면, 메모리 액세스 디바이스는, 압축된 메모리 라인에 액세스하기 위해 물리적 메모리 어드레스로서 판독 액세스 요청의 로지컬 메모리 어드레스를 사용한다. 그러나, 판독 액세스 요청이 하위 우선순위이면, 메모리 액세스 디바이스는 판독 액세스 요청의 로지컬 메모리 어드레스를 상위 우선순위 라인들의 압축에 의해 남겨진 메모리 공간 내의 하나 또는 그 초과의 물리적 메모리 어드레스들로 변환한다. 이러한 방식으로, 상위 우선순위 압축된 메모리 액세스들의 효율은 달리 압축된 메모리 라인들을 찾고 이들에 액세스하는 데 요구되는 인디렉션(indirection)의 레벨을 제거함으로써 개선된다.

메모리 시스템 및 메모리 시스템의 동작 방법

... 본 발명의 실시예들은 메모리 시스템 및 메모리 시스템의 동작 방법에 관한 것이다. 본 발명의 실시예들에 따르면, 메모리 시스템은 호스트로부터 페치하는 커맨드를 저장 가능한 N개의 서브미션 큐에 대한 테일 도어벨 정보 또는 호스트로부터 페치한 커맨드의 실행 결과를 저장 가능한 N개의 컴플리션 큐에 대한 헤드 도어벨 정보를 저장하는 버퍼 메모리를 포함할 수 있다.

파일 단편화를 고려한 시스템 콜 순서 기반의 I/O 스케줄링 방법 및 이를 수행하는 시스템

... 적어도 하나의 애플리케이션(application)이 요청한 적어도 하나의 시스템 콜(system call)에서 파생된 복수의 I/O 리퀘스트(input/output request)에 대하여 각각 시스템 콜 식별자를 부여하는 단계와, 상기 복수의 I/O 리퀘스트를 상기 시스템 콜 식별자 순으로 정렬하는 단계와, 상기 정렬된 복수의 I/O 리퀘스트를 스토리지(storage)로 전달하는 단계를 포함하는, I/O 스케줄링 방법 및 이를 수행하는 시스템이 제공된다. 이에 따르면, 사용자와 빈번하게 상호작용하는 애플리케이션이 실행되는 모바일 또는 데스크톱 환경에서 파일 단편화로 인해 증가한 읽기 지연시간을 최소화할 수 있으며, 나아가 사용자 경험(UX)을 향상시킬 수 있다.

메모리 시스템

... 본 발명은 메모리 시스템에 관한 것으로, 메모리 장치들 간에 데이터를 전송하기 위한 기술이다. 이러한 본 발명은 데이터와 헤더 정보를 포함하는 데이터 패킷을 서로 간에 직접적으로 전달하는 복수의 메모리 장치 및 복수의 메모리 장치 중 소스 메모리 장치에 데이터 패킷을 송신하고, 복수의 메모리 장치 중 마지막 메모리 장치로부터 데이터 패킷을 수신하는 메모리 제어부를 포함하고, 복수의 메모리 장치 각각은 헤더 정보를 해시하여 서로 다른 위치의 어드레스 영역에 데이터를 액세스한다.

Memory System and Method of Operating the Memory System

... 본 발명의 기술적 사상에 따른 메모리 시스템은 복수의 메모리 셀들을 포함하는 메모리 장치, 및 상기 메모리 장치를 제어하는 메모리 컨트롤러를 포함하고, 상기 메모리 컨트롤러는, 호스트로부터 수신한 복수의 커맨드들을 순차적으로 저장하는 저장부, 저장된 상기 복수의 커맨드들 중 동일 워드 라인에 대한 프로그램 커맨드와 독출 커맨드 사이의 간격을 판단하는 판단부, 및 판단된 상기 간격을 기초로 하여 상기 독출 커맨드에 대응되는 독출 전압 레벨을 결정하는 독출 전압 결정부를 포함한다.

Systems and methods for nvme controller virtualization to support multiple virtual machines running on a host

WRITE MANGEMENT FOR PROTECTING ERASED BLOCKS IN FLASH MEMORY

Power and performance management using MAIDx and adaptive data placement

The present invention is a method for storing data. The method includes the step of dividing data into a plurality of uniformly-sized segments. The method further includes storing said uniformly-sized segments on a plurality of storage mechanisms. The method includes the steps of monitoring access to the uniformly-sized segments stored on the plurality of storage mechanisms to determine an access pattern; monitoring access patterns between the plurality of disks and monitoring performance characteristics of the plurality of storage mechanisms to determine a performance requirement for the plurality of storage mechanisms. Finally, the method includes the step of migrating at least one segment of the plurality of uniformly-sized segments from a first storage mechanism of the plurality of storage mechanisms to a second storage mechanism of the plurality of storage mechanisms in response to at least one of the access patterns or the performance requirements.

Auxiliary interface for non-volatile memory system

A non-volatile memory system is formed a plurality of memory banks and a controller, where the controller has an auxiliary memory interface for use with an additionally non-volatile memory bank, where the additional memory bank and interface are used for metadata, such as logical to physical translation data. The other banks are used for user data. In an exemplary embodiment, a non-volatile memory could include a controller and (N+1) NAND flash memories, where N of these memories would store user data, but the remaining memory with its own controller interface would be dedicated to the storage of metadata. This allows for the metadata to be kept in non-volatile memory, but still quite readily accessible relative to the typical paging/overlay arrangement for metadata that is typically used in many non-volatile memory system.

Methods of utilizing address mapping table to manage data access of storage medium without physically accessing storage medium and related storage controllers thereof

A storage controller for managing data access of a storage medium, comprising: a storage unit, storing an address mapping table to record at least a physical address of a first data stored in the storage medium, where the physical address of the first data is mapped to a logical address of the first data; anda processing unit, coupled to the storage unit, wherein when receiving a command for handling at least the first data in the storage medium internally, the processing unit processes the address mapping table to serve the command without controlling the storage medium to physically accessing at least the first data stored therein.

Memory device and control unit thereof, and data storage method for memory device

A memory device and a control unit thereof, and a data storage method for memory device are provided. The memory device comprises a data storage medium and a control unit. The data storage media comprises a data storage region having a plurality of first data blocks. When performing a read operation on a data block, the control unit determines whether a read count of the data block is greater than a first predetermined number, and determines whether the data block is a first data block. When all the results are positive, the control unit converts a plurality of first data blocks into a plurality of data blocks with smaller storage capacity and faster access speed, and performs a data movement operation.

Compare-and-swap transaction

A compare and swap transaction can be issued by a master device to request a processing unit to select whether to write a swap data value to a storage location corresponding to a target address in dependence on whether a compare data value matches a target data value read from the storage location. The compare and swap data values are transported within a data field of the compare and swap transaction. The compare data value is packed into a first region of the data field in dependence of an offset portion of the target address and having a position within the data field corresponding to the position of the target data value within the storage location. This reduces latency and circuitry required at the processing unit for handling the compare and swap transaction.

Memory operations on data

The present disclosure includes apparatuses and methods related to memory operations on data. An example method can include executing an operation by writing a first managed unit to a second managed unit, and placing the first managed unit in a free state, wherein the first managed unit is located at a particular distance from the second managed unit.

DATA PROCESSING SYSTEM, DEVICE, SECONDARY STORAGE DEVICE, AND RECORDING MEDIUM

REDUNDANT DATA STORAGE FOR UNIFORM READ LATENCY

A memory apparatus (100, 200, 300, 500, 600, 700) has a plurality of memory banks (d0 to d7, m0 to m3, p, p0, p1), wherein a write or erase operation to the memory banks (d0 to d7, m0 to m3, p, p0, p1) is substantially slower than a read operation to the banks (d0 to d7, m0 to m3, p, p0, p1). The memory apparatus (100, 200, 300, 500, 600, 700) is configured to read a redundant storage of data instead of a primary storage location in the memory banks (d0 to d7, m0 to m3, p, p0, p1) for the data or reconstruct requested data in response to a query for the data when the primary storage location is undergoing at least one of a write operation and an erase operation.

INFORMATION PROCESSING DEVICE, EXTERNAL STORAGE DEVICE, HOST DEVICE, RELAY DEVICE, CONTROL PROGRAM, AND CONTROL METHOD OF INFORMATION PROCESSING DEVICE

According to one embodiment, an external storage device switches to an interface controller for supporting only a read operation of nonvolatile memory when a shift condition for shifting to a read only mode is met. A host device switches to an interface driver for supporting only the read operation of the nonvolatile memory when determining to recognize as read only memory based on information acquired from the external storage device.

SYSTEMS AND METHODS FOR COMPRESSING DATA IN NON-VOLATILE SEMICONDUCTOR MEMORY DRIVES

A non-volatile semiconductor memory (NVSM) storage system includes a NVSM drive interface configured to receive host data sectors (HDSs) from a host interface. A buffer managing module is configured to store the HDSs in a buffer. A compression module is configured to compress the HDSs to generate compressed HDSs of different lengths. A drive data sector (DDS) generating module is configured to add nuisance data to the compressed HDSs to generate DDSs. The DDSs are stored in NVSM.

SYSTEM AND METHOD FOR RETRIEVING AND STORING MULTIMEDIA DATA

Requests are received for storing/retrieving and storing data from/to a plurality of storage devices (100). A processor (300) is designed for handling each request, based, e.g., upon the load of each processor. A request for retrieving data is forwarded directly from the designated processor to the storage device via a switch, (250). Responses from the storage devices are routed directly to the designated processor via the switch (250). The switch (250) independently routes the request for retrieving data and the responses between the storage devices (100) and the processor, based on information obtained by the processor. Data provided by a designated processor is stored on the storage devices (100) via a switch (250). The switch (250) independently routes the data to be stored directly from the designated processor to the storage devices (100), based on information created by the processor. Requests and responses are exchanged between the switch (250) and the storage devices (100) via ...

Collocation of object storage data with removable media

Various embodiments for managing data objects stored in a tiered data object storage environment, by a processor device, are provided. In one embodiment, a method comprises measuring a service level of a data set tagged to be collocated, and comparing accumulated service levels for a data distribution of the data set to a predetermined service level threshold value, such that if the predetermined service level threshold value is reached, a collocated data optimization event is performed.

MEMORY AND PROCESSOR AFFINITY IN A DEDUPLICATED ENVIRONMENT

A page type may be identified for each of a plurality of memory pages, the page type corresponding to a particular process that accesses a particular memory page of the plurality of memory pages. The plurality of memory pages may each respectively include duplicate data. The duplicate data may be a same set of data values. Each of the plurality of respective memory pages may be ranked as candidates to deduplicate the set of data values to. The ranking may be based on at least the page type. In response to identifying the first processor and identifying a first memory device, the duplicate data may be deduplicated from the plurality of memory pages to a highest ranked memory page. The deduplication may correspond to coalescing the duplicate data to the highest ranked memory page.

ALLOCATION STRATEGIES FOR DATA STORAGE APPLICATIONS

A physical storage volume can be partitioned into a plurality of master blocks of an equal master block size. Each master block of the plurality of master blocks can be allocated for storage of a single storage page size of a plurality of predefined storage page sizes provided for storage of data by a data storage application. A received page size can be determined for a storage page designated by the data storage application for storage on the physical storage volume, and the storage page can be stored in a free block of a master block of the plurality of master blocks having the single page size equivalent to the received page size. Related methods, systems, and articles of manufacture are also disclosed.

Storage device and control method

A storage device includes a non-volatile memory including a buffer of a first size and a controller. The controller is configured to transmit a control command to the non-volatile memory, and then repeat a process including a first process of changing a phase value of a timing signal indicating timing to read or write data from or to the non-volatile memory and a second process of reading or writing data having a second size smaller than the first size from or to the non-volatile memory in synchronization with the timing signal of the changed phase value, a certain plurality of times without transmitting any other control command to the non-volatile memory during repetition of the process.

SYSTEM FOR HANDLING INPUT/OUTPUT REQUESTS BETWEEN STORAGE ARRAYS WITH DIFFERENT PERFORMANCE CAPABILITIES

An apparatus comprising a remote storage array, a primary storage array and a network. The remote storage array may be configured to (i) define a queue size based on a performance capability of the remote storage array, (ii) generate a multiplier based on resources being used by the remote storage array, and (iii) adjust the queue size by the multiplier. The primary storage array may be configured to execute input/output (IO) requests between the remote storage array and the primary storage array based on the adjusted queue size. The network may be configured to connect the remote storage array to the primary storage array.

Scalable data using RDMA and MMIO

To improve upon some of the characteristics of current storage systems in general and block data storage systems in particular, exemplary embodiments combine state-of-the art networking techniques with state-of-the-art data storage elements in a novel way. To accomplish this combination in a highly effective way, it is proposed to combine networking remote direct memory access (RDMA) technique and storage-oriented memory mapped input output (MMIO) technique in a system to provide direct access from a remote storage client to a remote storage system with little to no central processing unit (CPU) intervention of the remote storage server. In some embodiments, this technique may reduce the required CPU intervention on the client side. These reductions of CPU intervention potentially reduce latency while providing performance improvements, and/or providing more data transfer bandwidth and/or throughput and/or more operations per second compared to other systems with equivalent hardware.

FAST COPY USING FILE SYSTEM BLOCK MAPPINGS

Multiple target blocks are allocated on a first storage device to store a target object. The target blocks are arranged to be in a one-to-one correspondence with multiple source blocks of a source object. The target blocks are set to a non-populated state, and target blocks in the non-populated state are populated with data from corresponding source blocks. While the target blocks are being populated, if a request is received to retrieve data from one of the target blocks that is in the non-populated state, then the one of the target blocks is populated with the data from the corresponding source block and set to a populated state.

CONCURRENT RESPONSE FOR DEVICE INFORMATION DURING AN INITALIZATION PROCESS FOR A STORAGE DEVICE

Methods operable on a storage controller and related structure are provided for responding to inquiry commands from a host for a storage device. A command requesting information about a storage device is received from a host. In response to the command, the storage controller determines that the storage device is not initialized, and begins an initialization process for the storage device. Information received from the storage device during the initialization process is stored for completing a response to the inquiry. A response to the inquiry is transmitted to the host based on the stored information to complete the inquiry without waiting for the storage device to complete the initialization.

Method and apparatus for integration of non-volatile memory

Described herein is a method and system for directly accessing and transferring data between a first memory architecture and a second memory architecture associated with a graphics processing unit (GPU) by treating the first memory architecture, the second memory architecture and system memory as a single physical memory, where the first memory architecture is a non-volatile memory (NVM) and the second memory architecture is a local memory. Upon accessing a virtual address (VA) range by a processor, the requested content is paged in from the single physical memory and is then redirected by a virtual storage driver to the second memory architecture or the system memory, depending on which of the GPU or CPU triggered the access request. The memory transfer occurs without awareness of the application and the operating system.

Hard disk system with non-volatile IC based memory for storing data

A hard disk system for storing user data for an information device. The hard disk system includes a non-volatile, IC based memory such as e.g., a memory utilizing MRAM, to non volatilely store system data for the hard disk. Examples of system data include a master list, a list of unused sectors, and a list of defective sectors. In some examples, the master list includes the physical location on a hard disk where data of a file is stored. The non-volatile memory is operably coupled to a data storage system processor and may be implemented on a circuit board with the data storage system processor.

HARDWARE VIRTUALIZATION

Embodiments of the present disclosure relate to traffic class management of NVMe (non-volatile memory express) traffic. One or more virtual controllers for at least one host adapter (HA) of a storage device are generated. Each virtual controller is assigned a unique controller identifier (ID) Additionally, one or more input/output (IO) queues for each virtual controller are established. Further, IO workloads are processed via each IO queue.

Method for initialization of storage systems

A method and apparatus are described for providing initialization in large storage systems as a background function, upon demand, and upon receipt of write requests. The initialization may be carried out under control of the hard disk drive itself, a storage controller, or both systems. The initialization is performed transparently to the host computer making operation of the storage system immediately after it is coupled to the host feasible.

Circular buffer descriptor for describing and/or accessing a circular buffer

Accessing a circular buffer in memory from a processor may be performed with the aid of precomputed values stored in a pointer descriptor field of a processor storage element, such as a register. The pointer descriptor may store a precomputed value for calculating a memory address in the circular buffer, which may include two values, in which the two values are based, at least in part, on the size of the circular buffer, but neither be the size of the circular buffer. The first value may be used to derive a starting memory location for a circular buffer. The second value may be used in combination with the first value to calculate an end memory location. The start and end locations or addresses, along with the precomputed stored values, are then used to calculate the next address based on the current address of a circular buffer in an efficient manner.

Partial volume access in a physical stacked volume

In one embodiment, a VTS system includes a tape volume cache, a storage drive for interacting with sequential access storage media; logic for receiving a mount request to access host data record(s) stored on a storage medium, the mount request including a virtual volume identifier of a logical volume and a logical block identifier of the first requested host data record therein; logic for issuing a locate command to position the sequential access storage medium to about a physical block in the logical volume having at least a portion of the requested host data record(s) therein based on the virtual volume identifier and the logical block identifier; logic for creating and supporting a partial virtual volume in the tape volume cache; and logic for copying at least the physical block to the partial virtual volume. Other systems, methods, and computer program products are also described, according to other embodiments.

Computing erasure metadata and data layout prior to storage using a processing platform

Techniques are provided for computing data and metadata layout prior to storage in a storage system using a processing platform. An exemplary processing platform comprises one or more of a compute node and a burst buffer appliance. The processing platform communicates with a plurality of the compute nodes over a network, wherein a plurality of applications executing on the plurality of compute nodes generate a plurality of data objects; computes erasure metadata for one or more of the data objects on at least one of the compute nodes; and provides the erasure metadata with the corresponding one or more data objects to a storage system. The processing platform optionally determines a full set of the data objects to be stored and queries the storage system to determine an anticipated layout of the full set of the data objects to be stored. The anticipated layout allows special handling, for example, for small files and large files that are identified based on predefined criteria.

SPECULATIVE READ MECHANISM FOR DISTRIBUTED STORAGE SYSTEM

Provided is an apparatus directing to a speculative read mechanism for a distributed storage system. The apparatus includes a remote direct memory access (RDMA) network interface card (RNIC) (100) for a server (250), wherein the RNIC (100) includes an onboard memory (105), a trigger control (120) and a port for connection of the RNIC (100) to a client (200). The onboard memory (105) is operable to provide a buffer (110) for storage of data from a distributed storage system for a read request from the client (200). The trigger control (120) includes a programmable trigger condition. The RNIC (100) is operable to support a speculative read of data in response to a read request snoop of a write of data to the onboard memory (105), and upon detecting the trigger condition, to provide the data in the buffer to the client (200).

Semiconductor memory system with resistive variable memory device having scheduler for changing generation period of command and driving method thereof

A semiconductor memory system including a resistive variable memory device and a driving method thereof are provided. The semiconductor memory system includes a memory controller including a scheduler configured to determine a generation period of a write command; a memory device including a memory cell array, the memory device being configured to write data input from the memory controller in the memory cell array in response to the write command; and a data determination circuit configured to output a change signal to the scheduler when all logic levels of the input data are equal to each other, the scheduler changing the generation period of the write command in response to the change signal.

Computer system, storage system and method for saving storage area by integrating same data

Provided is a storage system capable of saving actually used physical storage areas and of achieving a high speed in write processing. There is disclosed a computer system including a server and a storage system, in which physical storage areas of a disk drive are managed for each one or more physical blocks of predetermined sizes, and allocation of one or more physical blocks to a plurality of logical blocks of predetermined sizes is managed, and the storage system stores data written in a first logical block in a first physical block allocated to the first logical block and allocates the first physical block to a second logical block where the same data as the data stored in the first physical block is to be written.

Dynamic response shaping for command aging

The present invention provides a method, apparatus and article of manufacture for selecting commands to execute from a command queue in a data storage device. The present invention reduces maximum service times under random queued workloads by executing the oldest command in the queue at a constant and predetermined rate. This yields a minimal yet predictable performance penalty, while significantly reducing maximum service times.

Buffered automated flash controller connected directly to processor memory bus

A mechanism is provided for buffer linking in a buffered solid state drive controller. Responsive to the buffered flash memory module receiving from a memory bus of a processor a memory command specifying a write operation, the mechanism initializes a first memory buffer in the buffered flash memory module. The mechanism associates the first memory buffer with an address of the write operation. The mechanism performs a compare operation to compare a previous and a next address with respect to an address associated with the first memory buffer with a plurality of buffers. The mechanism assigns a link tag to at least one buffer identified in the compare operation and the first memory buffer to form a linked buffer set. The mechanism writes to the first memory buffer based on the memory command. The mechanism builds at least one input/output command to persist contents of the linked buffer set and writes the contents of the linked buffer set to at least one solid state drive according to the ...

Access rate prediction in a hybrid storage device

Access rate prediction in a hybrid storage device is disclosed, including: using a first tier type of storage access counts to model an access distribution across a first tier type of storage and a second tier type of storage at a storage device; and generating a predicted first tier type of storage hit rate that is predicted to result from moving an existing VM off of the storage device using access statistical information associated with the existing VM and the access distribution at the storage device.

Method and mobile terminal for processing write request

A method for processing a write request is disclosed, the method includes: determining, by an IO scheduler, that current IO scheduling is in a blocked state; selecting, by the IO scheduler, a target synchronous write request from to-be-processed IO requests; adding, by the IO scheduler, an acceleration flag to the target synchronous write request, where the acceleration flag is used to instruct a flash memory controller to perform acceleration processing on the target synchronous write request by using idle space of a flash memory; after the flash memory controller receives, from the IO scheduler, the target synchronous write request, determining, by the flash memory controller, a size of the idle space of the flash memory; and when the size of the idle space of the flash memory is greater than a threshold, performing, by the flash memory controller, acceleration processing on the target synchronous write request.

Buffer memory accessing method, memory controller and memory storage device

A method for accessing a buffer memory in a memory storage device is provided, wherein the buffer memory, which has a plurality of write buffer units, is equipped in the memory storage device having a rewritable non-volatile memory module. The method includes: receiving a write data from a host system and determining whether the number of used write buffer unit is smaller than a predefined value or not. The method also includes: if the number of the used write buffer unit is not smaller than the predefined value, temporarily storing the write data into one of the write buffer unit which is not being used and transmitting a confirmation message corresponding to the write data to the host system after a predefined time interval. Therefore, the method can reduce the latency of write operations of the host system.

Synchronizing selected portions of data in a storage management system

Disclosed methods and systems leverage resources in a storage management system to partially synchronize primary data files based on synchronizing selected portions thereof without regard to changes that may be occurring in other non-synchronized portions. Accordingly, a number of primary data files may be partially synchronized by synchronizing designated portions thereof via auto-restore operations from backup data. This approach relies on storage management resources to designate portions of source data that is to be kept synchronized across any number of targets; detect changes to the designated portions; back up changes to secondary storage; and distribute the changes from secondary storage to the associated targets, with minimal impact to the primary data environment. The approach may be mutually applied, so that changes in any one of an associated group of source data files may be likewise detected, backed up, and distributed to the other members of the group.

Data processing device and data processing method

Embodiments of the present invention provide a data processing device and a data processing method. In the data processing device and the data processing method provided by the embodiments of the present invention, first data in a memory is written into a first non-volatile storage unit in a log file form, and a log file of the first data written into the first non-volatile storage unit is written into a second non-volatile storage unit. Because a data write speed of the first non-volatile storage unit is higher than a data write speed of the second non-volatile storage unit, fast backup of the data in the memory can be achieved, and when the data in the memory is lost in an abnormal situation, security of the data in the memory can be ensured.

Data buffer allocation in a non-blocking data services platform using input/output switching fabric

Data buffering allocation in a microprocessor complex for a request of memory allocation is supported through a remote buffer batch allocation protocol. The separation of control and data placement allows simultaneous maximization of microprocessor complex load sharing, and minimization of inter-processor signaling/metadata migration. Separating processing control from data placement allows the location of data buffering to be chosen so as to maximize bus bandwidth utilization and achieve non-blocking switch behavior. This separation reduces the need for inter-processor communication and associated interrupts thus improving computation efficiency and performance.

Hypercache RAM based disk emulation and method

A computer system (20) utilizes a monitor (24), keyboard (26), hard disk drive (28), processor (30), computer memory block (32), and memory based disk emulation device (22) to reduce access time for swap and paging files, thereby enhancing the computer system performance. The disk emulation device includes a device (22) manager (38) operable to select the number of logical drives, and a disk emulator (40) operable to cause actual memory devices (44-50) to appear as the virtual memory of the computer system disk drive (28). A memory controller (42) divides data bytes into data sets of two or four bits and saves the data sets simultaneously to the emulation memory devices (44-50). A backup battery (52) is provided to power the memory controller (42) and emulation memory devices (44-50) in the event of primary power supply failure.

METHOD AND SYSTEM FOR TRANSFORMATION OF LOGICAL DATA OBJECTS FOR STORAGE

Systems capable of transformation of logical data objects for storage and methods of operating thereof are provided. One method includes identifying among a plurality of requests addressed to the storage device two or more write requests addressed to the same logical data object, deriving data chunks corresponding to identified write requests and transforming the derived data chunks, grouping the transformed data chunks in accordance with the order the requests have been received and in accordance with a predefined criteria, generating a grouped write request to the storage device, and providing mapping in a manner facilitating one-to-one relationship between the data in the obtained data chunks and the data to be read from the transformed logical object. The method further includes obtaining an acknowledging response from the storage device, multiplying the obtained acknowledging response, and sending respective acknowledgements to each source that initiated each respective write request ...

Electronic device and operating method thereof

An electronic device comprising: a controller; and a non-transitory machine-readable storage medium configured to output status information in response to a status check command, and store instructions which are executed by the controller, wherein the instructions comprise: an instruction for generating an internal command to be serviced by the non-transitory machine-readable storage medium; an instruction for generating the status check command to transfer to the non-transitory machine-readable storage medium at a point of time that a waiting time corresponding to the internal command has elapsed after the internal command is transferred to the non-transitory machine-readable storage medium; an instruction for determining the operation status of the non-transitory machine-readable storage medium based on the status information; and an instruction for variably setting the waiting time based on the operation status.

Memory system including a nonvolatile memory and a volatile memory, and processing method using the memory system

A memory system having multiple memory layers includes a first memory layer comprising a volatile memory, a second memory layer comprising a first sub-memory and a second sub-memory. In response to a reference failure that occurred in the first memory layer, to which a read reference failed data and a write reference failed data are respectively loaded from lower level memory layer.

Performing data storage optimizations across multiple data storage systems

Described are techniques for performing data storage optimizations. A data storage optimizer on a first data storage system connected to a set of other data storage systems receives performance classification information. The first data storage system includes a first set of storage devices of a first performance classification. The set of other data storage systems includes a second set of storage devices of a second performance classification different from the first performance classification. A write operation is received from the host to write first data to a target address of a virtually provisioned device. It is determined that physical storage is not currently allocated for the target address of the virtually provisioned device. A first portion of physical storage is allocated for storing the first data. The first portion of physical storage is included in a storage device of the second set having the second performance classification.

Performance counters for computer memory

In some examples, performance counters for computer memory may include ascertaining a request associated with a memory address range of computer memory. The memory address range may be assigned to a specified performance tier of a plurality of specified performance tiers. A performance value associated with a performance attribute of the memory address range may be ascertained, and based on the ascertained performance value, a weight value may be determined. Based on the ascertained request and the determined weight value, a count value associated with a counter associated with the memory address range may be incremented. Based on an analysis of the count value associated with the counter, a determination may be made as to whether the memory address range is to be assigned to a different specified performance tier of the plurality of specified performance tiers. Based on a determination that the memory address range is to be assigned to the different specified performance tier, the memory ...

TECHNOLOGIES FOR STRUCTURED DATABASE QUERY

Technologies for determining set membership include a computing device that further includes one or more accelerator devices. Each accelerator device is to receive input data and definition table configuration data, the input data including a packed unsigned integers of column data from database and the definition table configuration data including a set membership query condition, generate a definition table indicative of element values that satisfy the set membership query condition, generate a lookup request for an element of the column data of the input data, perform the lookup request by accessing the definition table to determine whether the element satisfies the set membership query condition, and generate output indicative of whether the element is a member of the set membership.

Cache aware searching of buckets in remote storage

Embodiments are disclosed for performing cache aware searching. In response to a search query, a first bucket and a second bucket in remote storage for processing the search query. A determination is made that a first file in the first bucket is present in a cache when the search query is received. In response to the search query, a search is performed using the first file based on the determination that the first file is present in the cache when the search query is received, and the search is performed using a second file from the second bucket once the second file is stored in the cache.

Video and Graphics System with Video Scaling

A video and graphics system has a reduced memory mode in which video images are reduced in half in horizontal direction during decoding. The video and graphics system includes a video decoder for decoding MPEG-2 video data. The video images may not be downscaled in the horizontal direction when no bi-directionally predicted pictures are used. The video and graphics system may output an HDTV video while converting the HDTV video and providing as another output having an SDTV format or another HDTV format. The output having an SDTV format may be recorded using a video cassette recorder (VCR) while the HDTV video is being displayed.

Disk storage system

A disk storage system containing a storage device having a record medium for holding the data, a plurality of storage sub-systems having a controller for controlling the storage device, a first interface node coupled to a computer using the data stored in the plurality of storage sub-systems, a plurality of second interface nodes connected to any or one of the storage sub-systems, a switching means connecting to a first interface node and a plurality of second interface nodes to perform frame transfer between a first interface node and a plurality of second interface nodes based on node address information added to the frame. The first interface node has a configuration table to store structural information for the memory storage system and in response to the frame sent from the computer, analyzes the applicable frame, converts information relating to the transfer destination of that frame based on structural information held in the configuration table, and transfers that frame to the switching ...

Implementing storage adapter performance optimization with enhanced hardware and software interface

A method and controller for implementing storage adapter performance optimization with chained hardware operations and an enhanced hardware (HW) and firmware (FW) interface minimizing hardware and firmware interactions, and a design structure on which the subject controller circuit resides are provided. The controller includes a plurality of hardware engines; and a processor. A data store is configured to store a plurality of control blocks. A global work queue includes a plurality of the control blocks selectively arranged in a predefined chain to define sequences of hardware operations. The global work queue includes a queue input coupled to the processor and the hardware engines and an output coupled to the hardware engines. The control blocks are arranged in respective engine work queues designed to control hardware operations of the respective hardware engines and respective control blocks are arranged in an event queue to provide completion results to the processor.

Disk controller and controlling method of the same

Disclosed is a disc controller, which includes a network controlling unit for receiving a data input/output request sent from an external device through a network, and a disc controlling unit formed in the same circuit board in which the network controlling unit is formed, the disc controlling unit coupling the network controlling unit thereto by an internal bus provided in the circuit board. In the disc controller, the disc controlling unit is configured to receive a command sent from the network controlling unit through the internal bus and execute a data input/output for a disc drive in response to the command.

Multi-dimensional computer storage system

In an embodiment of the invention, an apparatus comprises: a multi-dimensional memory that is expandable in a first direction; wherein the multi-dimensional memory comprises a serial chain; wherein the serial chain comprises a first serial chain that is expandable in a first direction; and wherein the first serial chain comprises a first memory controller, a first memory module coupled to the first memory controller, a second memory controller coupled to the first memory controller, and a second memory module coupled to the second memory controller. In another embodiment of the invention, a method comprises: providing a multi-dimensional memory that is expandable in a first direction; wherein the multi-dimensional memory comprises a serial chain; wherein the serial chain comprises a first serial chain that is expandable in a first direction; and wherein the first serial chain comprises a first memory controller, a first memory module coupled to the first memory controller, a second memory ...

Command queuing

The present disclosure includes apparatuses and methods for command queuing. A number of embodiments include receiving a queued command request at a memory system from a host, sending a command response from the memory system to the host that indicates the memory system is ready to receive a command in a command queue of the memory system, and receiving, in response to sending the command response, a command descriptor block for the command at the memory system from the host.

Storage system and performance management method of storage system

It is an object to use a storage region in an efficient manner and maintain a performance of a storage system. A volume group GR11 includes reference volumes 1411, 1413, and 1415 and source volumes 1412, 1414, 1416, and 1417 that derive from the reference volumes. Each of the volumes stores only the difference data from a volume that is a parent thereof. A volume that is a cause of a problem is moved or copied from a pool of the moment 1410 to other pool 1420. A configuration of a volume group is modified.

Reading a portion of data to replicate a volume based on sequence numbers

An indication to replicate, for a second storage resource, a volume that is stored at a first storage resource may be received. A snapshot of the volume that is stored at the second storage resource may be identified. Data with operations to data blocks of the volume may be identified. A sequence number range, containing one or more sequence numbers, associated with the snapshot of the volume that is stored at the second resource may be received. Furthermore, a portion of the data associated with the operations to the data blocks of the volume based on the sequence number range that is associated with the snapshot of the volume that is stored at the second resource may be received to replicate the volume at the second storage resource.

Efficient data movement within file system volumes

Embodiments are directed to efficiently managing data storage and efficiently storing data. In one scenario, a computer system receives a write request addressed to one portion of data storage within a data store. The computer system redirects the received write request to another portion of data storage which includes storage containers, each of which is a logically specified portion of the data store. The computer system determines which storage container the write request is to write to, and identifies a storage container that is to be de-staged from the second portion of data storage to the first portion of data storage. The computer system then de-stages the identified storage containers to the first portion of data storage, the data of the de-staged container being stored on the first portion of data storage in the same order in which the data was stored in the identified storage container prior to de-staging.

Storage device

According to one embodiment, a storage device includes a first memory cell; a second memory cell; and a controller configured to, in response to receiving a first command set, execute a first erase operation which is included in an erase operation of data of the first memory cell, and suspend the first erase operation, and in response to receiving a second command set, execute a read operation or a write operation of the second memory cell and subsequently resume the suspended first erase operation.

Key value based block device

A method for providing block access on top of a key-value store comprising a distributed data storage system is provided. The method can include receiving, at a block device, a first input/output operation requesting one or more data blocks. The first input/output operation can be translated into a second input/output operation requesting one or more key-value pairs. The second input/output operation can be performed by at least sending the second input/output operation to the key-value store. Related systems and articles of manufacture, including computer program products, are also provided.

METHOD FOR BACKING UP DATA ON TAPE

A method for backing up data on a tape is provided. This method includes: copying the first data area excluding the third data area, and the second data area, to the tape as a single, contiguous fourth data area. The second data area is copied to a position corresponding to the replacement of the third data area in the contiguous fourth data area. The third data area is copied to the tape as a fifth data area separate from the fourth data area. The index information for identifying the fourth data area, and the index information for identifying the fifth data area, are stored to the tape.

NON-TRANSITORY COMPUTER-READABLE RECORDING MEDIUM, BOUNDARY VALUE SPECIFYING METHOD, AND BOUNDARY VALUE SPECIFYING APPARATUS

A process includes collecting information relating to a response time to a service request to an information processing system and information relating to a used amount of a resource in the information processing system at specified time intervals, the used amount of the resource being used for the service request, fitting a prescribed distribution to a histogram of a response time in each of sections for a pair of the response time and the used amount of the resource, and calculating a degree of fitting of the histogram and the prescribed distribution in each of the sections, each of the sections being obtained by dividing the used amount of the resource at prescribed intervals, and specifying a boundary value that defines a threshold of the used amount of the resource in accordance with a change in the degree of fitting.

ADAPTIVE LINE WIDTH CACHE SYSTEMS AND METHODS

The present disclosure techniques for implementing a computing system that includes a processing sub-system, a memory sub-system, and one or more memory controllers. The processing sub-system includes processing circuitry that performs an operation based on a target data block and a processor-side cache coupled between the processing circuitry and a system bus. The memory sub-system includes a memory that stores data blocks in a memory array and a memory-side caches coupled between the memory channel and the system bus. The one or more memory controllers control caching in the processor-side cache based at least in part on temporal relationship between previous data block targeting by the processing circuitry and control caching in memory-side cache based at least in part on spatial relationship between data block storage locations in the memory channel.

SYSTEM AND METHODOLOGY FOR AUTOMATIC CLASSIFICATION AND SEPARATION OF STORAGE RESOURCES BASED ON OPTIMIZING I/O REQUIREMENTS

A system and method for classifying storage resources in a cluster of computers comprises one or more memory devices and a plurality of processors. Each memory device among the one or more memory devices stores a set of program modules. At least one processor executes the set of program modules. The set of program modules comprises an input module, a disk speed analyzer module, a disk size analyzer module, and a disk assignment module. The input module receives a first signal. The disk size analyzer module and the disk speed analyzer module determines a data transfer rate and a memory size of the new memory device, and classifies the new memory device. The disk assignment module assigns the new memory device as one of a journal storage unit and a data storage unit.

Integrated Main Memory And Coprocessor With Low Latency

System, method, and apparatus for integrated main memory (MM) and configurable coprocessor (CP) chip for processing subset of network functions. Chip supports external accesses to MM without additional latency from on-chip CP. On-chip memory scheduler resolves all bank conflicts and configurably load balances MM accesses. Instruction set and data on which the CP executes instructions are all disposed on-chip with no on-chip cache memory, thereby avoiding latency and coherency issues. Multiple independent and orthogonal threading domains used: a FIFO-based scheduling domain (SD) for the I/O; a multi-threaded processing domain for the CP. The CP is an array of independent, autonomous, unsequenced processing engines processing on-chip data tracked by SD of external CMD and reordered per FIFO CMD sequence before transmission. Paired I/O ports tied to unique global on-chip SD allow multiple external processors to slave chip and its resources independently and autonomously without scheduling ...

SECURED EXECUTION OF AN ALGORITHM

An algorithm execution method includes carrying out a first execution of the algorithm by a processing unit, sending at least one first result, which is to be written into a memory, to a memory management circuit, and storing said first result into a first area of the volatile memory. The method also includes carrying out a second execution of the algorithm by the processing unit, sending at least one second result, which is to be written into the memory, to the memory management circuit, and applying, by means of the memory management circuit, a different processing for the at least one second result in the second execution than was applied for the at least one first results in the first execution.

DYNAMIC MODIFICATION OF IO SHAPING MECHANISMS OF MULTIPLE STORAGE NODES IN A DISTRIBUTED STORAGE SYSTEM

At least one processing device is configured to detect a failure event impacting at least a first storage node of a plurality of storage nodes of a distributed storage system, and responsive to the detected failure event, to modify an input-output (IO) shaping mechanism in each of the storage nodes in order to at least temporarily reduce a total number of IO operations that are concurrently processed in the distributed storage system. For example, modifying an IO shaping mechanism in each of the storage nodes illustratively comprises transitioning the IO shaping mechanism in each of the storage nodes from a first operating mode to a second operating mode that is different than the first operating mode. The second operating mode of the IO shaping mechanism illustratively has a relatively faster responsiveness to changes in IO operation latency as compared to the first operating mode of the IO shaping mechanism.

Expanding information dispersal algorithm width without rebuilding through imposter slices

A method and system for expanding a set of storage units. Expanding a set of storage units includes facilitating storage of a set of encoded data slices in a set of storage units within a first time frame. When detecting expansion of the set of storage units with new storage units within a second timeframe, primary storage units of the expanded set of storage units based are identified based on a write threshold value associated with the expanded set of storage units. For each new primary storage unit, storage of an imposter encoded data slice sourced from another storage unit that is not a primary storage unit but holds an encoded data slice of the set of encoded data slices is facilitated. The other storage unit then deletes the imposter encoded data slice.

TECHNOLOGIES FOR MANAGING A RESERVED HIGH-PERFORMANCE MEMORY REGION OF A SOLID STATE DRIVE

Technologies for establishing and managing a high-performance memory region of a solid state drive include reserving a region of a volatile memory of the solid state drive for storage of host data. Memory accesses received from a host may be directed toward the reserved region of the volatile memory or toward a non-volatile memory of the solid state drive. Due to the structure of the volatile memory, memory accesses to the reserved region may exhibit lower access timing relative to memory accesses to the non-volatile memory. As such, the reserved region may be utilized as storage space for journaling and logging of data and/or other applications. Upon shutdown or a power failure event, data stored in the reserved region of the volatile memory is copied to the non-volatile memory and subsequently reinstated to the volatile memory upon the next initialization event.

Optimizing Write and Wear Performance for a Memory

Determining and using the ideal size of memory to be transferred from high speed memory to a low speed memory may result in speedier saves to the low speed memory and a longer life for the low speed memory.

BUFFER SYSTEMS AND METHODS OF OPERATING THE SAME

A buffer system may include a buffer configured to receive input data having an assigned priority level, store the input data within a memory stack regardless of the priority level assigned to the input data, and sequentially output the input data stored in the memory stack in order of the priority levels assigned to the input data.

Two Stage Command Buffers To Overlap Iommu Map And Second Tier Memory Reads

IOMMU map-in may be overlapped with second tier memory access, such that the two operations are at least partially performed at the same time. For example, when a second tier memory read into a storage device controller internal buffer is initiated, an IOMMU mapping may be built simultaneously. To achieve this overlap, a two-stage command buffer is used. In a first stage, content is read from a second tier memory address into the storage device controller internal buffer. In a second stage, the internal buffer is written into the DRAM physical address.

SUPPRESSION OF TIMEOUT OCCURRENCE DURING A DATA READING OPERATION

An apparatus, in response to a data write request, writes target data to a first memory. During data movement from the first memory to a second memory, the apparatus stores first data included in the target data in the first memory, stores second data obtained by excluding the first data from the target data in the second memory, and deletes the second data from the first memory. In response to a data read request from a data requesting source, the apparatus reads the first data from the first memory and transfers the first data to the data requesting source while moving the second data from the second memory to the first memory. After completion of transferring the first data to the data requesting source, the apparatus transfers from the first memory to the data requesting source, the second data that has been moved to the first memory ...

SYSTEM AND METHOD FOR NON-VOLATILE RANDOM ACCESS MEMORY EMULATION

Described herein is a system and method for high speed non-volatile random access memory (NVRAM) emulation. The system and method may utilize a primary storage device and a volatile random access memory (RAM) device to emulate NVRAM functionality. The system and method may allocate a range of the primary storage device. The storage capacity or size of the allocated range may correspond or be at least partially based on a storage capacity or size of the volatile RAM device. Data, such as write requests, may be migrated from the primary storage device to the volatile RAM device. In the event of the unavailability, loss of power, or other such circumstances of the volatile RAM device, data from the volatile RAM device may be migrated back to the previously allocated range of the primary storage device.

Data aging infrastructure for automatically determining aging temperature

A query is received in a session established between an application and an in-memory database. The query is received from the application. Based on one or more criteria defined for individual data aging parameters in the data aging infrastructure, an aging temperature to be applied to the query is determined. The determined aging temperature is received at the application. The aging temperature is automatically set in the session before executing the query in the in-memory database. Based on the determined aging temperature, a partition is loaded from a secondary memory to a main memory. With the aging temperature as reference, the query is executed to fetch a result from the in-memory database.

Scratchpad-based operating system for multi-core embedded systems

An embodiment may involve determining that a first logical partition of a scratchpad memory coupled to a processor core is empty and a first application is scheduled to execute; instructing a direct memory access (DMA) engine to load the first application into the first logical partition and then instructing the processor core to execute the first application from the first logical partition; while the first application is being executed from the first logical partition, determining that a second logical partition of the scratchpad memory is empty and a second application is scheduled to execute; instructing the DMA engine to load the second application into the second logical partition; determining that execution of the first application has completed; and instructing the DMA engine to unload the first application from the first logical partition and instructing the processor core to execute the second application from the second logical partition.

Apparatus for reallocating logical to physical disk devices using a storage controller and method of the same

A storage controller calculates an access frequency of each logical disk; that is selects a first logical disk device of which the access frequency exceeds a first predetermined value, the first logical disk device being allocated to a first physical disk device; selects a second logical disk device which has the access frequency equal to or less than a second predetermined value, the second logical disk device being allocated to a second physical disk device; and reallocates the first and second logical device; and reallocates the first and second logical devices to the second and the first physical disk device, respectively.

Scheduling of i/o writes in a storage environment

A system and method for effectively scheduling read and write operations among a plurality of solid-state storage devices. A computer system comprises client computers and data storage arrays coupled to one another via a network. A data storage array utilizes solid-state drives and Flash memory cells for data storage. A storage controller within a data storage array comprises an I/O scheduler. The data storage controller is configured to receive requests targeted to the data storage medium, said requests including a first type of operation and a second type of operation. The controller is further configured to schedule requests of the first type for immediate processing by said plurality of storage devices, and queue requests of the second type for later processing by the plurality of storage devices. Operations of the first type may correspond to operations with an expected relatively low latency, and operations of the second type may correspond to operations with an expected relatively high latency.

Graphics display system with video scaler

A method for processing video data includes performing by one or more processors and/or circuits in a video processing device, the one or more processors and/or circuits including a video scaler, a memory, and a scaler engine, functions including receiving a video image by the video processing device. The functions also include determining whether the video scaler requires less memory bandwidth to scale the video image before writing the video image to the memory or after reading the video image from the memory, and scaling the video image based on the determination. If the video scaler requires less memory bandwidth to scale the video image before writing the video image to the memory, performing by the one or more processors and/or circuits scaling of the video image in the video scaler using a video input clock of the video scaler to generate a first scaled video image.

Method and system for determining access sequence of data stored on a tape medium

Methods, computer systems, and computer program products are provided for determining an access sequence of a plurality of data groups stored on a tape medium. A first data group in the access sequence is selected based on which data group in the plurality of data groups has a beginning closest to a current position of the tape medium. A second data group in the access sequence is selected based on which remaining data group in the plurality of data groups has a beginning closest to an end of the first data group in the access sequence.

System and method for handling io to drives in a raid system

A system and method for handling IO to drives in a RAID system is described. In one embodiment, the method includes providing a multiple disk system with a predefined strip size. IO request with a logical block address is received for execution on the multiple disk system. A plurality of sub-IO requests with a sub-strip size is generated, where the sub-strip size is smaller than the strip size. The generated sub-IO commands are executed on the multiple disk system. In one embodiment, a cache line size substantially equal to the sub-strip size is assigned to process the IO request.

Computer system management apparatus and management method

The present invention makes it possible for different types of application programs to efficiently use a virtual volume created on a basis of a hierarchized pool. A configuration management part P 30 determines, based on access information, to which of storage tiers 211 actual areas 212 allocated to virtual volumes 220 should be allocated. The configuration management part comprises a determination part P 3020 for determining a type of an application program that uses an actual area, and reallocation destination instruction parts P 3021 and P 3022 for determining reallocation destinations of the actual areas in accordance with the determination result, and instructing the storage apparatus as to these determinations.

Information processing apparatus, method for controlling same

An information processing apparatus processes data to be processed while accessing data to be processed that is stored in a memory or a HDD. The information processing apparatus determines the process content and calculates the access number to the HDD based on the determined process content and the content of data to be processed. The information processing apparatus also decides to store data to be processed in the memory when the access number is more than or equal to a threshold value. The information processing apparatus decides to store data to be processed in the HDD when the access number is less than the threshold value.

File server apparatus, management method of storage system, and program

When a storage capacity of a file server is expanded using an online storage service, elimination of an upper-limit constraint of the file size as a constraint of the online storage service and reduction in the communication cost are realized. A kernel module including logical volumes on the online storage service divides a file into block files at a fixed length and stores and manages the block files to prevent the upper-limit constraint of the file size. When a READ/WRITE request is generated for a mounted file system, only necessary block files are downloaded and used from the online storage service based on an offset value and size information to optimize the communication and realize the communication cost reduction.

Locating host data records on a physical stacked volume

According to one embodiment, a method for accessing host data records stored on a VTS system includes receiving a mount request to access at least one host data record on a VTS system, determining a number of host compressed data records per physical block on a sequential access storage medium, determining a PBID that corresponds to the requested at least one host data record, accessing a physical block on the sequential access storage medium corresponding to the PBID, and outputting the physical block without outputting an entire logical volume that the physical block is stored to. In another embodiment, a VTS system includes random access storage, sequential access storage, support for at least one virtual volume, a storage manager having logic for determining a PBID that corresponds to a SLBID, and logic for performing the above described method. Other methods are also described.

Efficient connection management in a sas target

A method includes pre-configuring a hardware-implemented front-end of a storage device with multiple contexts of respective connections conducted between one or more hosts and the storage device. Storage commands, which are received in the storage device and are associated with the connections having the pre-configured contexts, are executed in a memory of the storage device using the hardware-implemented front-end. Upon identifying a storage command associated with a context that is not pre-configured in the hardware-implemented front-end, software of the storage device is triggered to configure the context in the hardware-implemented front-end, and the storage command is then executed using the hardware-implemented front-end in accordance with the context configured by the software.

Enabling recovery during data defragmentation

In defragmentation of data of a data storage system, the data storage system having at least one storage control and data storage, allowing defragmentation of data with respect to the data storage, the defragmentation comprising analysis and data movement. During the defragmentation and before completion of the defragmentation, in response to the data movement reaching a stable state, further defragmentation analysis and data movement is interrupted; making a point-in-time copy of the data subject to the defragmentation; and resuming the defragmentation analysis and data movement. At a further stable state where a new point-in-time copy is made, an earlier point-in-time copy is withdrawn. Should the defragmentation process end prematurely, a backup of the data subject to defragmentation may be recovered from a most recent point-in-time copy.

System, Method, and Operating Instruction for Improved Data Storage/Retrieval

A method of operating a data library system wherein a host requests media movements from storage slots to and from media drives and also data operations on the media and wherein an operations controller responds to the host with virtual movements of the media according to a protocol associated with a robotic library.

Method and apparatus for redirecting data writes

Apparatuses and methods for redirecting data writes are disclosed. In one embodiment a controller may be configured to receive a command including write data and address data identifying a target zone of a data storage medium; determine whether the target zone contains sufficient available data sectors to store the write data; and record the write data to a common area of a different zone when the target zone does not contain sufficient available data sectors, the common area available to store data when a target zone lacks sufficient available data sectors. In another embodiment, a method may comprise receiving a write command identifying a target zone of a data storage medium; determining whether the target zone contains sufficient available data sectors to store the write data; and recording the write data to a common area of a different zone when the target zone does not contain sufficient available data sectors.

Storage system and data migration processing control method

The present invention appropriately processes a write command issued during data migration processing, and completes the data migration processing promptly. A copy control part 7 , in a case where write data targeted at a migration-source volume 3 A has been received from a host 2 during data migration processing, selects and executes one of a synchronous copy process 6 A and an asynchronous copy process 6 B based on either any one or multiple pieces of prescribed information 7 A through 7 D. This enables write command processing according to a process mode complying a storage system condition.

Multicast write commands

Techniques for implementing a multicast write command are described. A data block may be destined for multiple targets. The targets may be included in a list. A multicast write command may include the list. Write commands may be sent to each target in the list.

Io control method and program and computer

The disclosed method includes obtaining a result concerning a busy rate and the number of accesses per unit time for a storage device including first and second storage areas; determining, from the result, whether an event that a first indicator value for the busy rate is reset occurs; when the event occurred, notifying a controller that makes the number of accesses for the second storage area not greater than the notified number of accesses of the first number of accesses less than the second number of accesses, which was notified immediately before; obtaining another result; updating the first indicator value based on another result; calculating the third number of accesses so that a sum of busy rates corresponding to the third number of accesses and corresponding to the designated number of accesses becomes equal to the updated first indicator value; and notifying the controller of the third number of accesses.

Computer system and data migration method

Proposed are a computer system and a data migration method which enable an improved response performance to a data access request from the user. A client computer or an application on a second file server transmits an access request for access to data stored in a first storage area to a second file server and, if an access request from the client computer is received, the second file server migrates data from a first storage area of a first storage apparatus to a second storage area of a second storage apparatus and, if an access request from the application on the second file server is received, data is migrated from the first storage area of the first storage apparatus to a third storage area of a third storage apparatus.

Storage in tiered environment for colder data segments

Exemplary embodiments for storing data by a processor device in a computing environment are provided. In one embodiment, by way of example only, from a plurality of available data segments, a data segment having a storage activity lower than a predetermined threshold is identified as a colder data segment. A chunk of storage is located to which the colder data segment is assigned. The colder data segment is compressed. The colder data segment is migrated to the chunk of storage. A status of the chunk of storage is maintained in a compression data segment bitmap.

Zero Token

Aspects of the subject matter described herein relate to a zero token. In aspects, a zero token may be used to represent one or more zeroes in an offload write command. A component receiving an offload write command with the zero token is free to write the zeroes in a variety of ways including, for example, changing data structures the component uses to represent the zeroes, issuing another command that writes zeroes, writing physical zeroes, and so forth. A component receiving an offload write command with the zero token does not need to verify that the zero token was obtained from a successful offload read or that the zero token is still valid. In response to an offload read request, a component may provide the zero token to represent all or a portion of the data associated with the offload read request.

Memory allocation buffer for reduction of heap fragmentation

Systems and methods of a memory allocation buffer to reduce heap fragmentation. In one embodiment, the memory allocation buffer structures a memory arena dedicated to a target region that is one of a plurality of regions in a server in a database cluster such as an HBase cluster. The memory area has a chunk size (e.g., 2 MB) and an offset pointer. Data objects in write requests targeted to the region are received and inserted to the memory arena at a location specified by the offset pointer. When the memory arena is filled, a new one is allocated. When a MemStore of the target region is flushed, the entire memory arenas for the target region are freed up. This reduces heap fragmentation that is responsible for long and/or frequent garbage collection pauses.

Method for Data Accessing and Memory Writing for Logic Analyzer

A method of fetching digital data and writing the digital data into a memory of a logic analyzer, which comprises the steps: designate at least a first region and a second region in a memory; set a first triggering condition and a second triggering condition; fetch digital data continuously and write it into the memory while analyzing; and then write first test data which have an identification to satisfy the first triggering condition into the first region, and write second test data which have an identification to satisfy the second triggering condition into the second region. And once the first test data or the second test data are found, stop writing the digital data into the corresponding regions.

Optimizing signature computation and sampling for fast adaptive similarity detection based on algorithm-specific performance

A set of similarity detection algorithms and techniques for determining which signature calculation, sampling, and generation algorithms may be most beneficially applied to application related data are described herein. These algorithms work well with SSD caching software to product high speed, high accuracy, and low false-positive detections. Because the different algorithms may show different performance depending on data sets and different applications, to achieve optimal performance, a calibration process may be applied to each application and associated data set to select the best combination of signature computation and sampling technique. The new algorithms are also very fast with execution times an order of magnitude smaller than existing techniques. While some of the algorithms are presented using examples for the purpose of easy readability, these algorithms are very general and can be easily applied to broad range of cases.

Storage system and storage control method

A storage system includes a storage device having a command reordering function and a storage control apparatus that controls access to the storage device. Commands are issued to the storage device for reading or writing data. The storage control apparatus sets an upper limit to write data size or read data size specified in the commands during a predetermined period after a timeout of an issued command, so as to make it less likely for the storage device to postpone some of the issued commands.

Data transfer method and storage system adopting data transfer method

According to a prior art data transfer method of a storage subsystem, when competition of data transfer accesses occurs, a free access destination port is allocated uniformly without determining the access type or the access state of the access destination, so that the performance of the device is not enhanced. The present invention solves the problem by selecting a data transfer access for completing data transfer with priority based on the access type or the remaining transfer data quantity of competing data transfer accesses, or by changing the access destination of an access standby data transfer access, thereby performing data transfer efficiently.

Data storage using bitmaps

A data storage system comprises a controller, a first lower performance storage medium and a second higher performance storage medium. The controller is connected to the storage mediums and is arranged to control I/O access to the storage mediums. The controller is further arranged to store an image on the first storage medium, initiate a copy function from the first storage medium to the second storage medium, direct all I/O access for the image to the second storage medium, periodically age data from the second storage medium to the first storage medium, create a new empty bitmap for each period, and in response to an I/O access for data in the image, update the latest bitmap to indicate that the data has been accessed and update the previous bitmaps to indicate that the data has not been accessed.

PROGRAMMABLE MEMORY CONTROLLER

One embodiment includes a programmable memory controller. The programmable memory controller includes a request processor that comprises a first domain-specific instruction set architecture (ISA) for accelerating common requests. A transaction processor comprises a second domain-specific ISA for accelerating transaction processing tasks. A dedicated command logic module inspects each memory command to a memory device and stalls particular commands for meeting timing constraints for application specific control of the memory device. 1. A programmable memory controller comprising:a request processor that comprises a first domain-specific instruction set architecture (ISA) for accelerating common requests;a transaction processor that comprises a second domain-specific ISA for accelerating transaction processing tasks; anda dedicated command logic module that inspects each memory command to a memory device and stalls particular commands for meeting timing constraints for application specific control of the memory device.2. The memory controller of claim 1 , wherein the transaction processor generates a set of memory coordinates comprising channel claim 1 , rank claim 1 , bank claim 1 , row and column identifications (IDs) for a requested address and creates a new transaction with the generated memory coordinates for enqueuing in a transaction queue.3. The memory controller of claim 2 , wherein the memory coordinates are dynamic random access memory (DRAM) coordinates claim 2 , and the memory device comprises one or more DRAM devices.4. The memory controller of claim 2 , wherein the transaction processor tracks information comprising resource needs and timing constraints for each memory transaction created by the request processor.5. The memory controller of claim 4 , wherein the transaction processor uses the tracked information for generating a sequence of DRAM instructions that achieve performance energy and quality of service (QoS) goals.6. The memory controller of ...

Storage system providing virtual volumes

Multiple storage area groups into which multiple storage areas provided by multiple storage devices are classified with reference to storage area attributes are managed. The multiple logical volumes to which, in accordance with a write request to at least one address included in multiple addresses in the logical volume, at least one storage area included in the multiple storage areas is allocated are provided. In accordance with the access condition of the at least one address in the logical volume, the data written to the at least one address by the write request is migrated from the at least one storage area included in one of the multiple storage area groups to at least one storage area in another storage area group included in the multiple storage area groups.

ENHANCING TIERING STORAGE PERFORMANCE

Various embodiments for improving data storage and retrieval performance, for a tiered storage environment having levels corresponding to storage performance, are provided. In one embodiment, by way of example only, reference count information of at least one data segment maintained in the tiered storage environment is used to determine which of the levels in the tiered storage environment the at least one data segment is assigned. Those of the at least one data segment having higher reference counts are assigned to a higher performance level than those having lower reference counts. 1. A method for improving data storage and retrieval performance in a computing environment by a processor , comprising:for a tiered storage environment having levels corresponding to storage performance, using reference count information of at least one data segment maintained in the tiered storage environment to determine which of the levels in the tiered storage environment the at least one data segment is assigned, wherein those of the at least one data segment having higher reference counts are assigned to a higher performance level than those having lower reference counts.2. The method of claim 1 , further including obtaining the reference count information from a data deduplication engine.3. The method of claim 1 , further including monitoring the tiered storage environment to associate the reference count information with the at least one data segment.4. The method of claim 3 , wherein upon a first access to the at least one data segment claim 3 , and a determination that the at least one data segment has an associated reference count above a predetermined threshold claim 3 , immediately migrating the at least one data segment to the higher performance level.5. The method of claim 1 , wherein using the reference count information includes using the reference count information as a weighted factor with additional characteristics of the at least one data segment to determine the ...

METHOD AND SYSTEM FOR PROVIDING SUBSTANTIALLY CONSTANT-TIME EXECUTION OF A COPY OPERATION

A system and method for providing a substantially constant-time copy operation for file system objects managed by a storage server begins by generating a snapshot of at least a portion of a data set managed by the storage server. The system then performs a copy operation in the storage server to generate a copy of the data set separate from the snapshot, on a set of block locations containing a predetermined reference value. During the copy operation to generate the copy of the data set separate from the snapshot, the system can receive from a requester a first read request directed to the copy of the data set that the copy operation is to generate. In response to the first data request, the system provides data from the snapshot to the requester by the storage server. 1. A method comprising:generating a snapshot of at least a portion of a data set managed by a storage server;performing a copy operation in the storage server to generate a copy of the data set separate from the snapshot, by defining a set of block locations containing a predetermined reference value and replacing the contents of individual block locations with references to individual data segments;during the copy operation to generate the copy of the data set separate from the snapshot, receiving from a requester a first read request directed to the copy of the data set that the copy operation is to generate; andproviding data from the snapshot to the requester by the storage server, in response to the first read request.2. The method of claim 2 , wherein the predetermined reference value indicates that the set of block locations have not been filled with information from the data set.3. The method of claim 1 , wherein the data set comprises a plurality of references to data blocks and wherein performing the copy operation comprises copying at least a portion of the plurality of references to the copy of the data set.4. The method of claim 1 , further comprising:making a determination, in response ...

Memory systems and methods for controlling the timing of receiving read data

Embodiments of the present invention provide memory systems having a plurality of memory devices sharing an interface for the transmission of read data. A controller can identify consecutive read requests sent to different memory devices. To avoid data contention on the interface, for example, the controller can be configured to delay the time until read data corresponding to the second read request is placed on the interface.

Avoiding client timeouts in a distributed filesystem

The disclosed embodiments disclose techniques that facilitate of avoiding client timeouts in a distributed filesystem. Multiple cloud controllers collectively manage distributed filesystem data that is stored in one or more cloud storage systems; the cloud controllers ensure data consistency for the stored data, and each cloud controller caches portions of the distributed filesystem in a local storage pool. During operation, a cloud controller receives from a client system a request for a data block in a target file that is stored in the distributed filesystem. Although the cloud controller is already caching the requested data block, the cloud controller delays transmission of the cached data block; this additional delay gives the cloud controller more time to access uncached data blocks for the target file from a cloud storage system, thereby ensuring that subsequent requests of such data blocks do not exceed a timeout interval on the client system.

Highly Scalable Storage Array Management with Reduced Latency

Systems and methods for increasing scalability and reducing latency in relation to managing large numbers of storage arrays of a storage network. Separate, dedicated, communication channels may be established between an array manager running on a server and each of a number of storage arrays for respectively performing reading and writing operations to limit the delays imposed by repeated array connection setup and teardown and improve array communication stability (e.g., as compared to performing read/write operations over the same array connection). The read connection can be used to maintain current state information (e.g., volumes, capacities, and the like) for a plurality of storage arrays in a local cache of the array manager that can be quickly accessed by the array manager, such as for presenting substantially current, summary-type state information of the various storage arrays to a user (e.g., upon the user requesting to configure a particular storage array).

Executing a cloud command for a distributed filesystem

The disclosed embodiments disclose techniques for executing a cloud command for a distributed filesystem. Two or more cloud controllers collectively manage distributed filesystem data that is stored in one or more cloud storage systems; the cloud controllers ensure data consistency for the stored data, and each cloud controller caches portions of the distributed filesystem. During operation, a cloud controller presents a distributed-filesystem-specific capability to a client system as a file in the distributed filesystem (e.g., using a file abstraction). Upon receiving a request from the client system to access and/or operate upon this file, the client controller executes an associated cloud command. More specifically, the cloud controller initiates a specially-defined operation that accesses additional functionality for the distributed filesystem that exceeds the scope of individual reads and writes to a typical data file.

Write Mechanism for Storage Class Memory

Storage class memory may be used in an architecture to achieve high performance, high reliability, high compatibility. In some embodiments, reads may be handled in a conventional way used in a memory based model. However writes do not use a memory based model but instead correspond to a storage based model. The hybrid nature can be achieved by setting the storage class memory to be write protected so that all writes must go through a software based block device interface. In some embodiments, the software based block device interface prevents erroneous writes to the storage class memory. 1. A method comprising:setting a storage class memory to read only; andhandling writes to said storage class memory using a storage based model with a block device interface.2. The method of including protecting said memory by writing to a buffer and transferring a batch of data in said buffer to said memory.3. The method of including reorganizing blocks in said buffer to enable said blocks to be written as a group to said memory.4. The method of including changing said memory to writeable before writing from said buffer.5. The method of including changing said memory to read only after writing to said memory.6. The method of including writing to a storage class memory including phase change memory.7. The method of including detecting an idle period and in response writing to said memory.8. The method of including writing to said memory when said buffer is full.9. The method of wherein transferring includes using a memory copy.10. The method of including recognizing to identify contiguous blocks.11. A non-transitory computer readable medium storing instructions executed by a memory controller to:set a storage class memory to read only; andhandle writes to said storage class memory using a storage based model with a block device interface.12. The medium of further storing instructions to protect said memory by writing to a buffer and transferring a batch of data in said buffer to ...

Storage system with multicast dma and unified address space

A system and method for clients, a control module, and storage modules to participate in a unifed address space in order to and read and write data efficiently using direct-memory access. The method for reading data includes determining a first location in a first memory to write a first copy of the data, a second location in a second memory to write a second copy of the data, where the first memory is located in a first storage module including a first persistent storage and the second memory is located in a second storage module including a second persistent storage. The method further includes programming a direct memory access engine to read the data from the client memory and issue a first write request to a multicast address, where the first location, the second location, and a third location are associated with the multicast address.

Synchronous extent migration protocol for paired storage

Exemplary method, system, and computer program embodiments for, in a data storage environment configured for synchronous replication between a primary and secondary pair of storage entities, each having tiered storage devices, extent migration are provided. In one embodiment, by way of example only, a migration instruction is sent, by the primary storage entity, to the secondary storage entity, the migration instruction including a relative priority based on a primary ordered heat map of the tiered storage devices of the primary storage entity. The relative priority is used against a secondary ordered heat map of the tiered storage devices of the secondary storage entity to perform the extent migration, regardless of whether the primary and secondary storage entities are identical.

Storage control device, storage device, storage system, storage control method, and program for the same

A storage control device configured to control a storage device includes a first disk which is in active state and a second disk which is in standby state. The storage control device includes a communication unit and a control unit. The communication unit transmits a read-out request or a write request to the storage device and receives a response to the read-out request or the write request from the storage device. The control unit controls the communication unit so that the communication unit transmits a rotation start command which instructs a start of rotation of the second disk to the storage device, when a time to the point when receiving the response to the read-out request or the write request transmitted to the first disk which is in active state is longer than a predetermined threshold.

Functional device, access system, and communication establishing method

A functional device can communicate with an access apparatus through wireless communication. At least one additional device can be connected to the functional device. The functional device includes an access controller that performs an initialization process of the additional device to obtain characteristic information of the additional device from the additional device, before establishing communication between the access apparatus and the functional device, a memory that stores the obtained characteristic information, a communication unit that performs transmission and reception of data with the access apparatus, and a communication controller that transmits the characteristic information stored in the memory to the access apparatus without performing an initialization process of the additional device, upon establishment of communication with the access apparatus by the communication unit.

APPARATUS AND METHOD FOR DATA MOVEMENT

The present disclosure relates to an apparatus and method capable of carrying out data movement in a memory of a terminal. The apparatus includes a processor configured to transmit a command for data movement and address information for data movement in a memory to the memory, and the memory configured to perform the data movement in units of word line in the memory by using the address information, in response to reception of the command for moving the data. 1. An apparatus for moving data in a terminal , comprising:a processor configured to transmit to a memory a command for data movement and address information for data movement in the memory; andthe memory configured to perform the data movement into units of a word line in the memory by using the address information in response to reception of the command for moving the data.2. The apparatus of claim 1 , wherein the command for data movement is at least one of a first data movement command for moving data in an identical cell array claim 1 , a second data movement command for moving data between different cell arrays claim 1 , and a data movement command for moving data either in the identical cell array or between the different cell arrays according to the address information.3. The apparatus of claim 1 , wherein the memory comprises:a plurality of cell arrays in which the data movement is carried out either in an identical cell array or between different cell arrays;a source row address latch configured to latch a source row address and transmit the latched source row address to a source row decoder of a source cell array including the source row address;a destination row address latch configured to latch a destination row address and transmit the latched destination row address to a destination row decoder of a destination cell array including the destination row address; andan I/O latch configured to transmit data received from sense amplifiers of a source cell array to sense amplifiers of a destination ...

Storage system and storage control method

When a request to write data to a logical storage area realized by a storage area of a first storage apparatus is made in a storage system, a determination section determines whether a write pattern is sequential access or random access. When the write pattern is the sequential access, a control section writes the data to the logical storage area. On the other hand, when the write pattern is the random access, the control section writes the data to a virtual storage area obtained by virtualizing a storage area of a second storage apparatus which is faster in access speed than the first storage apparatus.

Free space collection in log structured storage systems

A mechanism is provided for optimizing free space collection in a storage system having a plurality of segments. A collection score value is calculated for least one of the plurality of segments. The collection score value is calculated by determining a sum, across tracks in the segment, of the amount of time over a predetermined period of time during which the track has been invalid due to a more recent copy being written in a different segment. Segments are chosen for free space collection based on the determined collection score value.

Power gated communication controller

A method includes detecting a communication event over a communication bus 130 coupled to a device, and in response to detecting the communication event, deactivating a module of the device. The method may further include sending a data throttle packet over the communication bus 130 while the deactivated module reactivates.

Storage Block Metadata Tagger

A storage management system may monitor file activity from a file system and tag storage blocks with metadata. The metadata may be used by the storage management system to apply various policies to the blocks. The tagging operation may intercept or monitor file system interaction to classify storage blocks as operating system, application, and data files, as well as other classifications. Some embodiments may include file types, restrictions for physical location, access frequency, block size, and other metadata. The tags may be appended to storage blocks, stored in a separate database, or otherwise associated with the storage blocks. A storage management system may manage storage over many computing devices by handling the storage blocks according to the metadata tags.

SCHEDULING OF I/O IN AN SSD ENVIRONMENT

A system and method for effectively scheduling read and write operations among a plurality of solid-state storage devices. A computer system comprises client computers and data storage arrays coupled to one another via a network. A data storage array utilizes solid-state drives and Flash memory cells for data storage. A storage controller within a data storage array comprises an I/O scheduler. The characteristics of corresponding storage devices are used to schedule I/O requests to the storage devices in order to maintain relatively consistent response times at predicted times. In order to reduce a likelihood of unscheduled behaviors of the storage devices, the storage controller is configured to schedule proactive operations on the storage devices that will reduce a number of occurrences of unscheduled behaviors. 1. A computer system comprising:a data storage medium comprising a plurality of storage devices configured to store data;and a data storage controller coupled to the data storage medium; receive read and write requests targeted to the data storage medium;', 'schedule said read and write requests for processing by said plurality of storage devices; and', 'schedule one or more proactive operations in order to minimize an occurrence of an unscheduled behavior comprising variable performance by one or more of the plurality of storage devices, wherein the variable performance comprises at least one of a relatively high response latency or relatively low throughput., 'wherein the data storage controller is configured to2. The computer system as recited in claim 1 , wherein the storage controller is configured to schedule one or more proactive operations based at least in part on a recent history of I/O requests.3. The computer system as recited in claim 1 , wherein said proactive operations cause one or more of the plurality of devices to enter a state in which it exhibits a relatively high response latency.4. The computer system as recited in claim 3 , wherein ...

Resource sharing in a telecommunications environment

A transceiver is designed to share memory and processing power amongst a plurality of transmitter and/or receiver latency paths, in a communications transceiver that carries or supports multiple applications. For example, the transmitter and/or receiver latency paths of the transceiver can share an interleaver/deinterleaver memory. This allocation can be done based on the data rate, latency, BER, impulse noise protection requirements of the application, data or information being transported over each latency path, or in general any parameter associated with the communications system.

Embedded multimedia card (emmc), host for controlling the emmc, and methods of operating the emmc and the host

A method of operating an eMMC system includes receiving a first command defining a first operation from the host, and storing the first command in a first command register among N command registers, and receiving a second command defining a second operation from the host, and storing the second command in a second command register among the N command registers, wherein the second command is received while the first operation is being performed.

COMMAND PRIORITIZATION IN A COMMAND QUEUE

Devices and techniques for command prioritization in a command queue of a memory device are described herein. A command can be received at the memory device. An expiration time for the command can be obtained and the command can be placed into the command queue. Entries in the command queue are ordered by expiration times of commands stored therein, such that earlier entries are closer to the head of the command queue. When the memory controller is able to perform a command, the memory controller selects the next command at the head of the command queue to perform. 1. A memory device , comprising:a memory array; anda memory controller including,a command queue buffer; and receive a command at the memory device;', 'obtain an expiration time for the command;', 'sort, based on the expiration time for the command, the command among other pending commands by use of a command queue solely ordered by expiration times of commands represented therein, wherein the expiration times of commands represented in the command queue are immutable; and', 'in response to a representation of the command being at the head of the command queue, initiate performance of the command against the memory array., 'processing circuitry including one or more hardware processors, the processing circuitry configured to perform operations to implement command prioritization in a command queue of the memory device, the operations comprising2. The memory device of claim 1 , wherein claim 1 , to obtain the expiration time for the command claim 1 , the processing circuitry is configured to read from a message used to deliver the command to the memory device.3. The memory device of claim 1 , wherein claim 1 , to obtain the expiration time for the command claim 1 , the processing circuitry is configured to create the expiration time by the memory device.4. The memory device of claim 3 , wherein claim 3 , to create the expiration time by the memory device claim 3 , the processing circuitry is configured to: ...

LOG FILE MANAGEMENT

Methods, devices and computer program products facilitate the storage, access and management of log files that are associated with particular client devices. The log files provide a record of user or client device activities that are periodically sent to a data backup center. A dedicated log file server facilitates the processing and storage of an increasingly large number of log files that are generated by new and existing client devices. A storage server pre-processes the received log files to facilitate the processing and storage of the log files by the log file server. This Abstract is provided for the sole purpose of complying with the Abstract requirement rules. This Abstract is submitted with the explicit understanding that it will not be used to interpret or to limit the scope or the meaning of the claims. 1. A method of generating log files from client devices , comprising:at a file service module, receiving a plurality of client log files, each of the client log files comprising a record of client device activities some or all of which of the client device activities associated with a client device user;appending the client log files to a comprehensive log file;based on a compression parameter, compressing a portion of the comprehensive log file to generate a compressed portion of the comprehensive log file, wherein another portion of the comprehensive log file remains uncompressed, the uncompressed portion including more recently generated client log files at the client device; andbased on a transmit parameter, transmitting the comprehensive log file to a log file service module for processing, the processing corresponding to records of client device activities of the client log files.2. The method of claim 1 , wherein:the compression parameter is based on at least one of: the size of the uncompressed portion of the comprehensive log file reaching an uncompressed size quota, a compression schedule occurring at a compression schedule interval, or based on ...

STATISTIC-BASED ISOLATION OF LETHARGIC DRIVES

A method is provided for identifying a lethargic drive. The method includes executing a command directed to at least two drives in a redundant array of independent disks (RAID) configuration. Each of the drives of the at least two drives is associated with a plurality of timing buckets. The method also includes determining a completion time of the command, and, for each of the at least two drives that the command was directed to, counting the completion time of the command in one of the timing buckets associated with the drive. 1. A method , comprising:executing a command directed to at least two drives in a redundant array of independent disks (RAID) configuration, wherein each of the drives of the at least two drives is associated with a plurality of timing buckets;determining a completion time of the command; andfor each of the at least two drives that the command was directed to, counting the completion time of the command in one of the timing buckets associated with the drive.2. The method of claim 1 , further comprising identifying one of the at least two drives as a lethargic drive.3. The method of claim 2 , wherein the lethargic drive is identified by automated logic that analyzes the timing buckets of the drives.4. The method of claim 3 , wherein the timing buckets of the one of the at least two drives identified as the lethargic drive exceed a threshold.5. The method of claim 4 , wherein the threshold includes a total number of counts in all of the timing buckets of the one of the at least two drives identified as the lethargic drive.6. The method of claim 4 , wherein the threshold includes a total number of counts in at least one of the timing buckets of the one of the at least two drives identified as the lethargic drive.7. The method of claim 4 , wherein the threshold is set with respect to the other drives.8. The method of claim 7 , wherein the threshold includes a total number of counts in all of the timing buckets of the one of the at least two ...

STORAGE DEVICE

A storage device is provided. The storage device includes storage clusters, and a controller. The controller receives a command and an address from an external host device, selects a storage cluster according to the received address, and transmits the received command and the received address to the selected storage cluster. The controller controls the storage clusters as normal storage clusters and slow storage clusters according to a temperature of a zone to which the storage clusters belong. 1. A storage device comprising:storage clusters; anda controller configured to receive a command and an address from an external host device, select one of the storage clusters according to the received address, and transmit the received command and the received address to the selected storage cluster,wherein the controller is configured to control the storage clusters as normal storage clusters and slow storage clusters according to temperature of zones to which the storage clusters belong.2. The storage device as set forth in claim 1 , wherein the controller is configured to control at least one storage cluster belonging to a zone as a slow storage cluster when a temperature of the zone is greater than or equal to a threshold temperature claim 1 , and control the at least one storage cluster belonging to the zone as a normal storage cluster when the temperature of the zone is lower than the threshold temperature.3. The storage device as set forth in claim 1 , wherein the controller is configured to transmit the received command and the received address to a normal storage cluster when the received command is a write command and the received address indicates a slow storage cluster.4. The storage device as set forth in claim 3 , wherein the controller is configured to replace the received address indicating the slow storage cluster and an address assigned to a free storage space of the normal storage cluster with each other.5. The storage device as set forth in claim 3 , ...

CREATING SOFTWARE PERFORMANCE TESTING ENVIRONMENT BASED ON VIRTUAL MACHINE

A method for creating a software performance testing environment based on a virtual machine, wherein the method comprises: in response to obtaining a hard disk read/write request triggered by a virtual CPU of the virtual machine, notifying a virtual CPU scheduler to record a CPU time quota t already consumed by the virtual CPU in a current CPU schedule period; in response to detecting completion of hard disk read/write processing corresponding to the hard disk read/write request, predicting a hard disk read/write latency t corresponding to the hard disk read/write request in a target environment; notifying the virtual CPU scheduler to determine a CPU time quota already consumed by the virtual CPU in the current CPU schedule period based on the recorded CPU time quota t and the hard disk read/write latency t; and adjusting a system clock of the virtual machine based on the determined CPU time quota already consumed by the virtual CPU in the current CPU schedule period. The method may obtain, in the created software performance testing environment, a software performance testing result consistent with the result obtained under a highly configured server in the target environment. 1. A method for creating a software performance testing environment based on a virtual machine , comprising:{'b': '1', 'in response to obtaining a hard disk read/write request triggered by a virtual CPU of the virtual machine, notifying a virtual CPU scheduler to record a CPU time quota t already consumed by the virtual CPU in a current CPU schedule period;'}in response to detecting completion of hard disk read/write processing corresponding to the hard disk read/write request, predicting a hard disk read/write latency t corresponding to the hard disk read/write request in a target environment;{'b': '1', 'notifying the virtual CPU scheduler to determine a CPU time quota already consumed by the virtual CPU in the current CPU schedule period based on the recorded CPU time quota t and the hard ...

Buffered Automated Flash Controller Connected Directly to Processor Memory Bus

A mechanism is provided for buffer linking in a buffered solid state drive controller. Responsive to the buffered flash memory module receiving from a memory bus of a processor a memory command specifying a write operation, the mechanism initializes a first memory buffer in the buffered flash memory module. The mechanism associates the first memory buffer with an address of the write operation. The mechanism performs a compare operation to compare a previous and a next address with respect to an address associated with the first memory buffer with a plurality of buffers. The mechanism assigns a link tag to at least one buffer identified in the compare operation and the first memory buffer to form a linked buffer set. The mechanism writes to the first memory buffer based on the memory command. The mechanism builds at least one input/output command to persist contents of the linked buffer set and writes the contents of the linked buffer set to at least one solid state drive according to the at least one input/output command.

MANAGEMENT SYSTEM AND METHOD OF DYNAMIC STORAGE SERVICE LEVEL MONITORING

To manage a storage system for storing write data of I/O (Input/Output) command to a storage volume, a computer program comprises: code for analyzing performance information of I/O operation for a period of time on a storage volume basis; code for deriving a periodic time window having a same type of I/O performance characteristic; code for determining a type of Service Level Objectives (SLO) on a periodic time window basis; code for calculating a threshold value of the SLO; code for providing a user with a type of SLO for a periodic monitoring window and a threshold value of SLO for the periodic monitoring window on a storage volume group basis; and code for monitoring, on a storage volume basis, whether or not a service level value for the periodic monitoring window violates the SLO based on the threshold value of SLO for the periodic monitoring window. 121.-. (canceled)21. A management computer which is coupled to a storage system providing a plurality of storage volumes to one or more servers , the management computer comprising:a memory storing Input/Output (I/O) information, of a storage volume in the plurality of storage volumes, which is derived from the storage system, the I/O information including a number of I/Os by I/O type and plural types of I/O performance values; anda processor configured to:determine, for the storage volumes, a first type of Service Level Objective (SLO) which should be used to monitor the storage volume based on the number of I/Os by I/O type to the storage volume,determine, for the storage volume, a threshold value for the determined first type of SLO based on a first type of an I/O performance value of the storage volume, wherein the first type of the I/O performance value included in the plural types of I/O performance values is associated with the determined first type of SLO, andrecommend the determined first type of SLO and the determined threshold value for the first type of SLO which should be used for monitoring the ...

Accessing data in a dispersed storage network during write operations

A method includes sending data access requests to storage units regarding a set of encoded data slices. The method further includes, when a write transaction is pending for the set of encoded data slices, receiving proposal records from the storage units. The method further includes interpreting the proposal records to determine an ordering of visible versions of the set of encoded data slices stored by the storage units. The method further includes determining whether a threshold number of encoded data slices of a desired version of the set of encoded data slices is visible. The method further includes, when the threshold number of encoded data slices is visible, determining whether to proceed with the data access request. The method further includes, when determined to proceed with the data access request, sending a request to proceed with the data access request to the storage units.

HIERARCHICAL FLASH TRANSLATION LAYER STRUCTURE AND METHOD FOR DESIGNING THE SAME

A Flash Translation Layer (FTL) structure including mapping information for storing data is disclosed. The FTL structure includes a plurality of hierarchical data groups including a zeroth-layer host data group, and first-layer to n-layer metadata groups, and zeroth to nlogs configured in a hierarchical structure in correspondence with the respective hierarchical data groups, for processing data of the corresponding data groups. A klog (0≦k≦n) provides an interface to volatile memory resources dividedly allocated to the klog, an interface to non-volatile memory resources dividedly allocated to the klog, and an interface to at least one of (k−1)and (k+1)logs. 1. A Flash Translation Layer (FTL) structure including mapping information for storing data , comprising:{'sup': 'th', 'a plurality of hierarchical data groups including a zeroth-layer host data group, and first-layer to n-layer metadata groups; and'}{'sup': 'th', 'zeroth to nlogs configured in a hierarchical structure in correspondence with the respective hierarchical data groups, for processing data of the corresponding data groups,'}{'sup': th', 'th', 'th', 'th', 'th, 'wherein a klog (0≦k≦n) provides an interface to volatile memory resources dividedly allocated to the klog, an interface to non-volatile memory resources dividedly allocated to the klog, and an interface to at least one of (k−1)and (k+1)logs.'}2. The FTL structure according to claim 1 , wherein the interface to the at least one of the (k−1)and (k+1)logs is a linear address space readable claim 1 , writable claim 1 , and bytewise-accessible.3. The FTL structure according to claim 1 , wherein the interface to the at least one of the (k−1)and (k+1)logs includes a read command claim 1 , a write command claim 1 , and a flush command claim 1 , and{'sup': 'th', 'wherein the read command requests reading of as many bytes as a byte count, starting at a start address of a log Identifier (ID) address space of the klog and transmission of the read bytes to ...

Memory device for high speed data transfer

A memory device may include a data output controller for generating a first clock signal and a second clock signal in response to a read enable clock signal, a page buffer for storing data, and outputting the data to the data output controller in synchronization with the first clock signal, and a data output buffer for receiving the data from the page buffer and outputting the received data to the external device in synchronization with the second clock signal. The first clock signal is generated in response to a data output delay control signal, the second clock signal is generated irrespective of the data output delay control signal.

Chunk Monitoring

One example of a system includes a plurality of clients, a master chunk coordinator, and a plurality of chunk servers. Each client submits requests to access chunks of objects. The master chunk coordinator maintains chunk information for each object. Each chunk server includes a chunk monitor to monitor client requests, maintain chunk statistics for each chunk based on the monitoring, and transmit the chunk statistics for each chunk to the master chunk coordinator. The master chunk coordinator instructs the chunk servers to re-chunk objects, replicate chunks, migrate chunks, and resize chunks based on the chunk statistics to meet specified parameters. 1. A system comprising:a plurality of clients, each client to submit requests to access chunks of objects;a master chunk coordinator to maintain chunk information for each object; anda plurality of chunk servers to store chunks, each chunk server including a chunk monitor to monitor client requests, maintain chunk statistics for each chunk based on the monitoring, and transmit the chunk statistics for each chunk to the master chunk coordinator,wherein the master chunk coordinator instructs the chunk servers to re-chunk objects, replicate chunks, migrate chunks, and resize chunks based on the chunk statistics to meet specified parameters.2. The system of claim 1 , wherein the chunk statistics comprise hotness claim 1 , reuse claim 1 , read/write ratio claim 1 , concurrent demand claim 1 , and relatedness.3. The system of claim 1 , wherein the chunk information for each object comprises static object information and dynamic object information claim 1 , the dynamic object information comprising a chunk list indicating each chunk of the object claim 1 , ordering of the chunks claim 1 , each chunk replica claim 1 , and each chunk location.4. The system of claim 3 , wherein the chunk list comprises static chunk information and dynamic chunk information for each chunk claim 3 , the dynamic chunk information comprising reuse ...

Non-transitory computer-readable recording medium recoding log obtaining program, log obtaining device, and log obtaining method

A non-transitory computer-readable recording medium recoding a log obtaining program that causes a computer to execute processing, the processing includes: obtaining first log data including request source identification information which is used for identifying a request, a response time period related to the request, and a first log record time, from among a plurality of log data included in an access log recorded in a storage; extracting second log data including a second log record time corresponding to a time that is early by the response time period as compared with the first log record time included in the first log data, from among the plurality of log data; and obtaining third log data including the request source identification included in the first log data from among the second log data.

TWO-LEVEL SYSTEM MAIN MEMORY

Embodiments of the invention describe a system main memory comprising two levels of memory that include cached subsets of system disk level storage. This main memory includes “near memory” comprising memory made of volatile memory, and “far memory” comprising volatile or nonvolatile memory storage that is larger and slower than the near memory. 1. A system comprising:system main memory, the system main memory including a first memory level of volatile memory and a second memory level comprising a non-volatile memory and a volatile memory, the first memory level being a near memory comprising one or more Dynamic Random Access Memory (DRAM) devices and the first memory level to include a cached subset of the second memory level, the second memory level being a far memory that is larger and slower in comparison with the near memory, wherein the system main memory is to be communicatively coupled to a processor separate from the system main memory, and wherein a size of the system main memory to be presented to an operating system (OS) comprises an available size of the second memory level; anda two-level memory (2LM) controller to transfer data between the second memory level and the first memory level of the system main memory and the processor based on one or more OS requests.2. The system of claim 1 , further comprising: disk storage memory.3. The system of claim 2 , wherein the far memory is to include a cached subset of the disk storage memory.4. The system of claim 2 , wherein the second memory level and the disk storage memory are included in a memory subsystem comprising at least one nonvolatile memory device claim 2 , at least one volatile memory device claim 2 , and control logic claim 2 , and the system further comprises:a second memory level controller to partition the memory subsystem into two or more partitions including a memory partition comprising the second memory level and a disk storage memory partition.5. The system of claim 4 , wherein the at ...

Apparatus and method for a non-power-of-2 size cache in a first level memory device to cache data present in a second level memory device

Provided are an apparatus and method for a non-power-of-2 size cache in a first level memory device to cache data present in a second level memory device having a 2 n cache size. A request is to a target address having n bits directed to the second level memory device. A determination is made whether a target index, comprising m bits of the n bits of the target address, is within an index set of the first level memory device. A determination is made of a modified target index in the index set of the first level memory device having at least one index bit that differs from a corresponding at least one index bit in the target index. The request is processed with respect to data in a cache line at the modified target index in the first level memory device.

Processing incomplete data access transactions

A method includes obtaining a set of pending transaction information from a set of storage units regarding a plurality of pending transactions. A pending transaction information includes information regarding an encoded data slice and a computing device issuing a data access request. The method further includes identifying an incomplete transaction based on the set of pending transaction information. The method further includes determining whether to complete the incomplete transaction based on information regarding the requesting computing device. The method further includes, when the incomplete transaction is not to be completed, instructing the storage units to discard a corresponding data access request associated with the incomplete transaction. The method further includes, when the incomplete transaction is to be completed, determining what aspects of the corresponding data access request have not been completed and instructing at least one storage unit to complete the aspects of the corresponding data access request.

MEMORY NETWORK TO PRIORITIZE PROCESSING OF A MEMORY ACCESS REQUEST

In one example, a memory network may control access to a shared memory that is by multiple compute nodes. The memory network may control the access to the shared memory by receiving a memory access request originating from an application executing on the multiple compute nodes and determining a priority for processing the memory access request. The priority determined by the memory network may correspond to a memory address range in the memory that is specifically used by the application. 1. A system comprising: receiving a memory access request from one of the multiple compute nodes;', 'determining a priority for processing the memory access request, wherein the priority corresponds to a target memory address specified in the memory access request; and', 'handling the memory access request according to the determined priority for the memory access request., 'a memory network accessible by multiple compute nodes, the memory network to control access to a memory shared by the multiple compute nodes by2. The system of claim 1 , wherein the memory network is to determine an elevated priority for processing the memory access request when the target memory address specified in the memory access request is within an elevated priority memory address range.3. The system of claim 2 , wherein the memory network is further to control access to the memory by allocating a guaranteed processing bandwidth for the memory access requests with the elevated priority.4. The system of claim 3 , wherein the memory network is to allocate the guaranteed processing bandwidth for elevated priority memory access requests in response to receiving a bandwidth allocation instruction from a monitoring system.5. The system of claim 1 , wherein the memory network is to determine the priority for processing the memory access request through a priority field in the memory access request.6. The system of claim 5 , wherein the priority field is set by a memory controller of one of the multiple compute ...

SYSTEM AND METHOD FOR PREDICTIVE READ OF RANDOM DATA

Systems and methods for predicting read commands and pre-fetching data when a memory device is receiving random read commands to non-sequentially addressed data locations are disclosed. A limited length sequence of prior read commands are generated and compared to a read command history datastore. When a prior pattern of read commands is found corresponding to the search sequence, a next read command that previously followed that search sequence may be used as a predicted next read command and data pre-fetched based on the read command data location information associated with that prior read command that is being used as the predicted read command. 1. A non-volatile memory system comprising:a non-volatile memory;a volatile memory; and receive a current read command comprising read command data location information for data to be read from the non-volatile memory;', 'generate, in the volatile memory, a read command search sequence comprising a list of read command data location information for the current read command and for each of a predetermined number of read commands received sequentially prior to the current read command;', 'compare the generated read command search sequence to a prior read command datastore, the prior read command datastore comprising a list of prior read commands arranged in chronological order of receipt; and', 'responsive to a sequential portion of the list of prior read commands matching the generated read command sequence, retrieve predicted data location information from a next more-recent prior read command in the prior read command datastore located after the sequential portion., 'a controller in communication with the non-volatile memory and the volatile memory, the controller configured to2. The non-volatile memory system of claim 1 , wherein the controller is further configured to pre-fetch data from the non-volatile memory into the volatile memory based on the predicted data location information.3. The non-volatile memory system ...

REDUCING A DATA STORAGE DEVICE READYING TIME

A data storage device includes a first memory section with a reserved area having stored therein an event trigger log that includes a history of past logged events. The data storage device also includes a second memory section separate from the first memory section. The data storage further includes a controller that, upon power up of the data storage device and before the data storage device is ready to receive host commands, allocates a buffer in the second memory section for capturing new events. The controller postpones linking of any captured new events with the past logged events until at least after the data storage device is ready to receive the host commands. 1. A data storage device comprising:a first memory section including a reserved area having stored therein an event trigger log comprising a history of past logged events;a second memory section separate from the first memory section; and upon power up of the data storage device and before the data storage device is ready to receive host commands, allocate a buffer in the second memory section for capturing new events; and', 'postpone linking of any captured new events with the past logged events until at least after the data storage device is ready to receive the host commands., 'a controller configured to2. The data storage device of and wherein the controller is configured to link the captured new events with the past logged events when the data storage device enters into an idle state.3. The data storage device of and wherein the controller is configured to link the captured new events with the past logged events in response to an event trigger log request from a host.4. The data storage device of and wherein the controller is configured to link the captured new events with the past logged events before a power down of the data storage device.5. The data storage device of and wherein the controller is configured to set a new events flag in the buffer upon storing an initial event or first event in ...

PREFETCHING DATA BLOCKS FROM A PRIMARY STORAGE TO A SECONDARY STORAGE SYSTEM WHILE DATA IS BEING SYNCHRONIZED BETWEEN THE PRIMARY STORAGE AND SECONDARY STORAGE

Provided are a computer program product, system, and method for prefetching data blocks from a primary storage to a secondary storage system while data is being synchronized between the primary storage and secondary storage. A determination is made of data blocks to prefetch from the primary storage to the secondary controller not yet synchronized from the primary storage to the secondary storage in anticipation of future access requests for the data blocks to the secondary controller while data blocks are being synchronized between the primary storage and the secondary storage over the network. A prefetch command is sent to prefetch the determined data blocks to copy from the primary storage to the secondary controller to make available to future access requests received at the secondary controller for the determined data blocks. 1. A computer program product for managing data synchronized between a primary storage managed by a primary controller and a secondary storage managed by a secondary controller , wherein the primary controller and the secondary controller communicate over a network , the computer program product comprises a computer readable storage medium having program instructions embodied therewith , the program instructions executable by a processor to cause operations , the operations comprising:determining data blocks to prefetch from the primary storage to the secondary controller not yet synchronized from the primary storage to the secondary storage in anticipation of future access requests for the data blocks to the secondary controller while data blocks are being synchronized between the primary storage and the secondary storage over the network; andsending a prefetch command to prefetch the determined data blocks to copy from the primary storage to the secondary controller to make available to future access requests received at the secondary controller for the determined data blocks.2. The computer program product of claim 1 , wherein the ...

MANAGEMENT OF UNMAP PROCESSING RATES IN DISTRIBUTED AND SHARED DATA STORAGE VOLUMES

The disclosure herein describes managing a rate of processing unmap requests for a data storage volume. Unmap requests are received from a cluster of active hosts that are associated with the data storage volume. Latency data values of each active host are then accessed. A long-term cluster latency average value is calculated based on the accessed latency data values of all active hosts over a long-term time period and a short-term cluster latency average value is calculated based on the accessed latency data values of all active hosts over a short-term time period. An unmap rate adjustment value is calculated based on a difference between the long-term cluster latency average value and the short-term cluster latency average value. The rate of processing unmap requests for the data storage volume is adjusted based on the unmap rate adjustment value and the unmap requests are performed based on the adjusted rate. 1. A computerized method for managing a rate of processing unmap requests for a data storage volume , the method comprising:receiving and buffering, by a processor, unmap requests from a cluster of active hosts that are associated with the data storage volume;calculating, by the processor, an unmap rate adjustment value based on a cluster latency difference between a first cluster latency average value of the cluster of active hosts based on a first time period and a second cluster latency average value of the cluster of active hosts based on a second time period;adjusting, by the processor, the rate of processing unmap requests for the data storage volume based on the calculated unmap rate adjustment value; andperforming, by the processor, the buffered unmap requests based on the adjusted rate of processing unmap requests of the data storage volume.2. The computerized method of claim 1 , further comprising:calculating, by the processor, the first cluster latency average value as a long-term cluster latency average value based on latency data values of all ...

DYNAMIC DISTRIBUTED DATA CLUSTERING

Techniques are described for clustering data at the point of ingestion for storage using scalable storage resources. The clustering techniques described herein are used to cluster time series data in a manner such that data that is likely to be queried together is localized to a same partition, or to a minimal set of partitions if the data set is large, where the partitions are mapped to physical storage resources where the data is to be stored for subsequent processing. Among other benefits, the clustered storage of the data at the physical storage resources can reduce an amount of data that needs to be filtered by many types of queries, thereby improving the performance of any applications or processes that rely on querying the data. 1. A computer-implemented method comprising:generating a partition table used to cluster a plurality of time series data points during ingestion of the plurality of time series data points, the partition table including a first set of partitions defining a first segmentation of a total range of ordered values, wherein each partition of the first set of partitions can be mapped to a single attribute value of a plurality of attribute values associated with the plurality of time series data points;receiving a time series data point generated by a computing device;identifying an attribute value associated with the time series data point;determining that the first set of partitions does not include a partition mapped to the attribute value and that there is not an available partition of the first set of partitions to which the attribute value can be mapped;generating a second set of partitions by bifurcating a subrange associated with each partition of the first set of partitions, the second set of partitions defining a second segmentation of the total range of ordered values;mapping the attribute value to an available partition of the second set of partitions;mapping the available partition of the second set of partitions to one or more ...

I/O REQUEST PROCESSING METHOD AND DEVICE

A host and a storage system communicate with each other by using a NVMeoF protocol are provided. In some embodiments, the host accesses a logical disk of the host by using a control node in the storage system, and sends a state query command to the control node. The state query command is configured to instruct the control node to report a path state of a path corresponding to the control node. Still in those embodiments, the host receives the path state reported by the control node. When the received path state indicates that the logical disk includes an access interval, the host sends an interval query command to the control node; receives access interval information reported by the control node; and records a mapping relationship between the control node and the access interval information. 1. A data processing method , wherein the method is performed by a host communicating with a storage system through a Non-Volatile Memory express over Fabric (NVMeoF) protocol , the host accessing a logical disk of the storage system through a control node in the storage system , and the method comprises:sending a state query command to the control node, wherein the state query command is configured to instruct the control node to report a path state of a path corresponding to the control node;receiving the path state reported by the control node;when the received path state indicates that the logical disk comprises an access interval, sending an interval query command to the control node;receiving access interval information reported by the control node, wherein an access interval indicated by the access interval information is pre-allocated to the control node; andrecording a mapping relationship between the control node and the access interval information.2. The method according to claim 1 , wherein the method further comprises:receiving an I/O request, wherein the I/O request carries a logical address of to-be-accessed data;determining an access interval corresponding to ...

Deterministic Optimization via Performance Tracking in a Data Storage System

A semiconductor data storage memory can receive data access commands into a queue in a first time sequence that correspond with the transfer of data between a host and portions of the memory. The memory may be divided into separate portions that each have a different owner and the access commands may be issued to each of the respective separate portions. The access commands can subsequently be executed in a different, second time sequence responsive to estimated completion times for each of the access commands based on measured completion times for previously serviced, similar commands to maintain a nominally consistent quality of service level for each of the respective owners.

Global Pool of Garbage Collection Units (GCUs) in a Shared Non-Volatile Memory Device

Apparatus and method for managing shared resources in a data storage device such as a solid-state drive (SSD). In some embodiments, a non-volatile memory (NVM) has a population of semiconductor memory dies which are divided into die sets for different users. Each die set includes user garbage collection units (GCUs) for storage of user data blocks by the associated user and overprovisioned global GCUs to store user data blocks from the users of the other die sets. When an imbalance condition exists such that the workload traffic level of a first die set exceeds a workload traffic level of a second die set, at least one host I/O command for the first die set is offloaded for servicing using a selected global GCU of the second die set. The offloaded data may be subsequently transferred to the first die set after the imbalance condition is resolved. 1. A method comprising:dividing a population of semiconductor memory dies in a non-volatile memory (NVM) into a plurality of die sets each separately assigned to a different user, the semiconductor memory dies connected to a controller circuit using a number of parallel channels;arranging each die set into user garbage collection units (GCU) for the storage of user data blocks from an associated user and global GCUs for the storage of user data blocks from a user of a different die set;servicing host input/output (I/O) commands to transfer user data blocks between the respective user GCUs of respective die sets;detecting an imbalance condition in which a workload traffic level of a first die set exceeds a workload traffic level of a second die set; andoffloading at least one of the host I/O commands for the first die set for servicing using a selected global GCU of the second die set responsive to the detected imbalance condition.2. The method of claim 1 , wherein the offloading of the at least one of the host I/O commands comprises writing a parity set to the selected global GCU of the second die set.3. The method of claim ...

INFORMATION PROCESSING DEVICE, EXTERNAL STORAGE DEVICE, HOST DEVICE, RELAY DEVICE, CONTROL PROGRAM, AND CONTROL METHOD OF INFORMATION PROCESSING DEVICE

According to the embodiments, an external storage device switches to an interface controller for supporting only a read operation of nonvolatile memory when a shift condition for shifting to a read only mode is met. A host device switches to an interface driver for supporting only the read operation of the nonvolatile memory when determining to recognize as read only memory based on information acquired from the external storage device. 1. (canceled)2: An information processing system comprising:a host device and a storage device coupled with the host device; a nonvolatile memory including a plurality of blocks; and', control the nonvolatile memory,', 'determine whether a data write operation to the nonvolatile memory is prohibited based on a first value and a first threshold value, the first value being a value of a number of free blocks, the first threshold value corresponding to the first value, and', 'send, when determining the data write operation to the nonvolatile memory is prohibited, information indicating that data write operation to the nonvolatile memory is prohibited;, 'a first controller configured to'}], 'the storage device including acquire a second value from the storage device, the second value being at least one value of a plurality of pieces of statistical information,', 'cause the display to show a certain message when the acquired second value exceeds a second threshold value, the second threshold value corresponding to the second value, and', 'recognize the storage device as a read only device that supports only a read operation of read and write operations of the nonvolatile memory when receiving the information., 'the host device being connectable to a display, the host device including a second controller, the second controller configured to'}3: The information processing system according to claim 2 , wherein the second controller acquires the second threshold value from the storage device.4: The information processing system according to ...

System and method for prediction of multiple read commands directed to non-sequential data

Systems and methods for predicting read commands and pre-fetching data when a memory device is receiving random read commands to non-sequentially addressed data locations are disclosed. A limited length search sequence of prior read commands is generated and that search sequence is then converted into an index value in a predetermined set of index values. A history pattern match table having entries indexed to that predetermined set of index values contains a plurality of read commands that have previously followed the search sequence represented by the index value. The index value is obtained via application of a many-to-one algorithm to the search sequence. The index value obtained from the search sequence may be used to find, and pre-fetch data for, a plurality of next read commands in the table that previously followed a search sequence having that index value.

HYBRIDIZED STORAGE OPTIMIZATION FOR GENOMIC WORKLOADS

A method for more efficiently storing genomic includes designating multiple different data storage techniques for storing genomic data generated by a genomic pipeline. The method further identifies a file, made up of multiple blocks, generated by the genomic pipeline. The method determines which data storage technique is most optimal to store each block of the file. In doing so, the method may consider the type of the file, the stage of the genomic pipeline that generated the file, the access frequency for blocks of the file, the most accessed blocks of the file, and the like. The method stores each block using the data storage technique determined to be most optimal after completion of a designated stage of the genomic pipeline, such that blocks of the file are stored using several different data storage techniques. A corresponding system and computer program product are also disclosed. 1. A method for more efficiently storing genomic data , the method comprising:designating a plurality of different data storage techniques for storing genomic data generated by a genomic pipeline;identifying a file, made up of a plurality of blocks, generated by the genomic pipeline;determining which data storage technique is most optimal to store each block of the file; andstoring each block using the data storage technique determined to be most optimal after completion of a designated stage of the genomic pipeline, such that blocks of the file are stored using several different data storage techniques.2. The method of claim 1 , wherein determining which data storage technique is most optimal comprises taking into account a file type associated with the file.3. The method of claim 1 , wherein determining which data storage technique is most optimal comprises taking into account a stage of the genomic pipeline that generated the file.4. The method of claim 1 , wherein determining which data storage technique is most optimal comprises taking into account an access frequency ...

HIT-BASED ALLOCATION OF QUOTAS OF A CACHE SPACE OF A CACHE MEMORY

A method, storage system and non-transitory computer readable medium. The method may include receiving or generating, and for each storage entity out of multiple storage entities of the storage system, a storage entity distribution of cache hits over a caching period related to cached data associated with the storage entity and determining an allocation of quotas of the cache space to the multiple storage entities. The determining may include: (a) for each storage entity, determining a hit score indicative of a number of cache hits per a caching sub-period of the caching period related to the storage entity; (b) simulating, in an iterative manner, an allocation of quotas of the cache space to the storage entities that substantially maximizes the number of cache hits; and (c) allocating quotas of the cache space to the storage entities of the multiple storage entities, based on an outcome of the simulation. 1. A method for hit-based allocation of quotas of a cache space of a cache memory of a storage system , the method comprises:receiving or generating, by a controller of the storage system and for each storage entity out of multiple storage entities of the storage system, a storage entity distribution of cache hits over a caching period related to cached data associated with the storage entity, wherein the caching period is a time period during which the cached data, associated with the storage entity, was stored in the cache;determining an allocation of quotas of the cache space to the multiple storage entities, wherein the determining comprises:for each storage entity of the multiple storage entities, determining a hit score indicative of a number of cache hits per a caching sub-period of the caching period related to the storage entity distribution of cache hits over the caching period associated with the storage entity;simulating, in an iterative manner, an allocation of quotas of the cache space to the storage entities of the multiple storage entities, that ...

TECHNIQUES TO CONTROL AN INSERTION RATIO FOR A CACHE

Examples may include techniques to control an insertion ratio or rate for a cache. Examples include comparing cache miss ratios for different time intervals or windows for a cache to determine whether to adjust a cache insertion ratio that is based on a ratio of cache misses to cache insertions. 1. An apparatus comprising:circuitry; and determine, during a first time interval, a first cache miss ratio for a cache arranged to store information used by processing logic hosted by a computing platform;', 'determine, during a second time interval, a second cache miss ratio for the cache; and', 'compare the first cache miss ratio to the second cache miss ratio to determine whether to adjust a cache insertion ratio used for the second time interval for use during a subsequent time interval, the cache insertion ratio based on a ratio of cache misses to cache insertions., 'logic for execution by the circuitry to2. The apparatus of claim 1 , comprising the logic to:adjust the cache insertion ratio used for the second time interval to cause a reduction in the cache insertion ratio for use during the subsequent time interval based on the first cache miss ratio being equal to the second cache miss ratio.3. The apparatus of claim 1 , comprising the logic to:adjust the cache insertion ratio used for the second time interval to cause an increase in the cache insertion ratio for use during the subsequent time interval based on the first cache miss ratio being lower than the second cache miss ratio.4. The apparatus of claim 1 , comprising the logic to:adjust the cache insertion ratio used for the second time interval to cause an increase in the cache insertion ratio for use during the subsequent time interval based on the first cache miss ratio being higher than the second cache miss ratio and a previous adjustment to the cache insertion ratio used for the second time interval resulted in an increase in a cache insertion ratio for use during the second time interval.5. The apparatus ...

ENHANCING QUALITY OF SERVICE OF A STORAGE DEVICE

Systems and methods presented herein provide a controller is operable to increase a number of suspend operations during read Input/Output (I/O) operations of a storage device, and to detect an increase in response times for write commands due to the increased number of suspend operations. The controller is also operable to decrease the number of the suspend operations during the reads of the storage device to decrease the response times of the write commands. 1. A storage system , comprising:a storage device operable to store data; anda controller operable to increase a number of suspend operations during Input/Output (I/O) operations of the storage device, to detect an increase in response times for write commands of the storage device due to the increased number of suspend operations, and to decrease the number of the suspend operations during reads of the storage device to decrease the response times of the write commands.2. The storage system of claim 1 , wherein:the storage device is a solid state drive (SSD).3. The storage system of claim 1 , wherein:the storage device is a hard disk drive.4. The storage system of claim 1 , wherein:the controller is further operable to optimize a number of Input/Output operations per second (IOPS) of the storage device by monitoring a transformative function of read IOPS and write IOPS of the storage device.5. The storage system of claim 4 , wherein:the controller is further operable to adaptively adjust the number of suspend operations based on the transformative function of read IOPS and write IOPS of the storage device.6. The method of claim 4 , further comprising:the controller is further operable to adaptively adjust a time interval between the suspend operations based on the transformative function of read IOPS and write IOPS of the storage device.7. A method operable with a storage device claim 4 , the method comprising:increasing a number of suspend operations during Input/Output (I/O) operations of the storage device; ...

ADDRESSING USAGE OF SHARED SSD RESOURCES IN VOLATILE AND UNPREDICTABLE OPERATING ENVIRONMENTS

Systems and methods for optimizing storage system performance are disclosed. A method includes: determining an expected lifetime of each of at least one computing instance; determining a disk data extent evaluation period for each of the at least one computing instance based on the determined expected lifetime; determining an input/output (I/O) wait time threshold for each of the at least one computing instance; determining an I/O wait time of each of the at least one computing instance using the determined disk data extent evaluation period; and in response to the determined I/O wait time of one or more of the at least one computing instance exceeding the determined I/O wait time threshold of the computing instance, moving at least one data extent associated with the one or more computing instance exceeding the determined I/O wait time threshold from hard disk drive storage to solid state drive storage. 1. A method comprising:determining, by a computer device, an input/output (I/O) wait time threshold for a computing instance;determining, by the computer device, an I/O wait time of the computing instance; andin response to the determined I/O wait time of the computing instance exceeding the determined I/O wait time threshold of the computing instance, moving, by the computer device, a data extent associated with the computing instance exceeding the determined I/O wait time threshold from hard disk drive (HDD) storage to solid state drive (SSD) storage.2. The method according to claim 1 , further comprising determining claim 1 , by the computer device claim 1 , a disk data extent evaluation period for the computing instance claim 1 ,wherein the I/O wait time of the computing instance is determined using the disk data extent evaluation period for the computing instance.3. The method according to claim 1 , further comprising receiving a job priority for the computing instance exceeding the determined I/O wait time threshold claim 1 , andwherein the moving the data ...

DETERMINING WEIGHT VALUES FOR STORAGE DEVICES IN A STORAGE TIER TO USE TO SELECT ONE OF THE STORAGE DEVICES TO USE AS A TARGET STORAGE TO WHICH DATA FROM A SOURCE STORAGE IS MIGRATED

The present invention relates to a method, system, and computer program product for determining storage device weight values to use to select one of the storage devices to use as a target storage to which data from a source storage is migrated. A determination is made, for each of the storage devices, of static parameter values for static parameters comprising attributes of the storage device and dynamic parameter values for dynamic parameters providing device health information determined by accessing the storage device to determine operational conditions at the storage device. Storage device weight values are determined as a function of the static parameter values and the dynamic parameter values of the device. The determined storage device weight values are used to select one of the storage devices as the target storage to which data from the source storage is migrated. 126-. (canceled)27. A computer program product for migrating data from a source storage in a source storage tier of storage device to at least one storage device in a target storage tier , the computer program product comprising a non-transitory computer readable storage medium having computer readable program code embodied therein that executes to perform operations , the operations comprising:querying storage devices in the target storage tier to determine dynamic parameter values based on changing operational states of the storage devices, wherein the source storage tier has a different type of storage device than storage devices in the target storage tier;determining, for each of the storage devices in the target storage tier, a storage device weight value as a function of the determined dynamic parameter values of the storage device indicating a health of the storage device;receiving a request to migrate data from the source storage to the target storage tier;determining storage device weight values of the storage devices in the target storage tier; andusing the determined storage device ...

Enhancing quality of service of a storage device

Systems and methods presented herein provide a controller that is operable to monitor a plurality of background commands to a storage device over a pre-determined period of time and to determine how often each of the background commands is issued during the pre-determined period of time. The controller is further operable to establish a time interval for each of the background commands, and to issue each of the background commands at their respective time intervals.

Using deterministic logical unit numbers to dynamically map data volumes

Methods, apparatus and computer program products implement embodiments of the present invention that include storing one or more data volumes to a small computer system interface storage device, and receiving a request to map a given data volume to a host computer. One or more attributes of the given data volume are identified, and using the identified one or more attributes, a unique logical unit number (LUN) for the given data volume is generated. The given data volume is mapped to the host computer via the unique LUN. In some embodiments, the generated LUN includes one of the one or more attributes. In additional embodiments, the generated LUN includes a result of a hash function using the one or more attributes. In storage virtualization environments, the data volume may include secondary logical units, and mapping the given data volume to the host may include binding the SLU to the host.

TECHNOLOGY TO DYNAMICALLY MODULATE MEMORY DEVICE READ GRANULARITY

Technology to dynamically modulate read granularity of a memory device. A computing system may include a controller and one or more memory devices coupled to the controller, the one or more memory devices including instructions, which when executed by the controller, may cause the computing system to determine whether a read to a memory device satisfies a sub-page read policy. In addition, the instructions, when executed, may cause the computing system to issue a sub-page read command to retrieve data from the memory device at sub-page granularity when the read satisfies the sub-page read policy. Moreover, the instructions, when executed, may cause the computing system to issue a full-page read command to retrieve the data at full-page granularity when the read does not satisfy the sub-page read policy or when a read for a segment of sequentially stored data does not satisfy the sub-page read policy. 1. A computing system comprising:a controller; andone or more memory devices coupled to the controller, the one or more memory devices including instructions, which when executed by the controller, cause the computing system to:determine whether a read to a memory device satisfies a sub-page read policy; andissue a sub-page read command to retrieve data from the memory device at sub-page granularity when the read satisfies the sub-page read policy.2. The computing system of claim 1 , wherein the instructions claim 1 , when executed claim 1 , cause the computing system to:determine whether the read satisfies a physical requirement;determine whether the read satisfies a random read requirement; anddetermine whether the read satisfies a maximum sub-page read size.3. The computing system of claim 1 , wherein the instructions claim 1 , when executed claim 1 , cause the computing system to:determine whether a read size of the read matches a current sub-page read size; andset the current sub-page read size to the read size to implement a new sub-page read size.4. The computing ...

MEMORY SYSTEM, MEMORY CONTROLLER FOR MEMORY SYSTEM, OPERATION METHOD OF MEMORY CONTROLLER, AND OPERATION METHOD OF USER DEVICE INCLUDING MEMORY DEVICE

A system includes: a nonvolatile memory; a memory controller configured to control the nonvolatile memory, the memory controller including a first buffer memory for temporarily storing write data to be written to the nonvolatile memory; and a second buffer memory having a lower operational speed and a higher memory capacity than the first buffer memory. The memory controller is configured to transmit the write data from the first buffer memory to the second buffer memory and to the nonvolatile memory, and to release an operational state of the first buffer memory after transmitting the write data from the first buffer memory to the second buffer memory and to the nonvolatile memory. Writing additional write data to the first buffer memory is prohibited prior to the release of the operational state of the first buffer memory, and is permitted after the release of the operational state of the first buffer memory. 1. A system , comprising:a nonvolatile memory;a memory controller configured to control the nonvolatile memory, the memory controller including a first buffer memory for temporarily storing write data to be written to the nonvolatile memory; anda second buffer memory having a lower operational speed and a higher memory capacity than the first buffer memory,the memory controller being configured to transmit the write data from the first buffer memory to the second buffer memory and to the nonvolatile memory, and to release an operational state of the first buffer memory after transmitting the write data from the first buffer memory to the second buffer memory and to the nonvolatile memory,wherein writing additional write data to the first buffer memory is prohibited prior to the release of the operational state of the first buffer memory, and writing the additional write data to the first buffer memory is permitted after the release of the operational state of the first buffer memory.2. The system of claim 1 , wherein the memory controller is configured to ...

METHOD AND SYSTEM FOR LEVERAGING NON-UNIFORM MISS PENALITY IN CACHE REPLACEMENT POLICY TO IMPROVE PROCESSOR PERFORMANCE AND POWER

Method, system, and apparatus for leveraging non-uniform miss penalty in cache replacement policy to improve performance and power in a chip multiprocessor platform is described herein. One embodiment of a method includes: determining a first set of cache line candidates for eviction from a first memory in accordance to a cache line replacement policy, the first set comprising a plurality of cache line candidates; determining a second set of cache line candidates from the first set based on replacement penalties associated with each respective cache line candidate in the first set; selecting a target cache line from the second set of cache line candidates; and responsively causing the selected target cache line to be moved from the first memory to a second memory. 1. A method for selecting a cache line for eviction , the method comprising:determining a first set of cache line candidates for eviction from a first memory in accordance to a cache line replacement policy, the first set comprising a plurality of cache line candidates;determining a second set of cache line candidates from the first set based on replacement penalties associated with each respective cache line candidate in the first set;selecting a target cache line from the second set of cache line candidates; andresponsively causing the selected target cache line to be moved from the first memory to a second memory.2. The method of claim 1 , wherein the cache line replacement policy is a pseudo least recently used (pLRU) policy.3. The method of claim 1 , wherein the replacement penalty associated with a given cache line candidate comprises an amount of time required to access the given cache line candidate from the second memory.4. The method of claim 3 , wherein accessing the given cache line candidate from the second memory comprises fetching a copy of the given cache line candidate from the second memory into the first memory.5. The method of claim 1 , wherein the second set of cache line candidates ...

DYNAMICALLY VARYING TRANSFER SIZE IN A STORAGE DEVICE FOR IMPROVED PERFORMANCE

A method of dynamically varying transfer size in a storage device for improved performance may include receiving, by a processor, a plurality of data transfer parameters. The data transfer parameters may be compared against disk characterization data associated with a Solid State Disk, which is the target of a data transfer request. A data transfer size may be selected from the disk characterization data, based on the compared data transfer parameters. The data transfer request may be modified to use the selected data transfer size. The data transfer request is completed using the modified data transfer parameters. 1. A method of dynamically varying transfer size in a storage device comprising:receiving data transfer parameters for a Solid State Disk (SSD) device using a program, the program being executable by a processor of a computer;comparing the received data transfer parameters against disk characterization data associated with the SSD device;selecting a data transfer size from the disk characterization data associated with the SSD device based on the compared data transfer parameters;modifying the received data transfer parameters based on the selected data transfer size; andcompleting one or more Input/Output (I/O) operations with the SSD device using the modified data transfer parameters.2. The method of claim 1 , wherein comparing the received data transfer parameters further comprises:extracting a SSD device identifier from the received data transfer parameters;searching a plurality of disk characterization data entries for an entry corresponding to the SSD device using the SSD device identifier; andselecting the disk characterization data associated with the SSD device.3. The method of claim 1 , wherein selecting a data transfer size further comprises:matching the received data transfer parameters with the disk characterization data corresponding to the SSD device;providing a default value to the received data transfer parameters based on where a ...

DATA STROBE CALIBRATION

Devices and techniques are disclosed herein for determining, using a host device, a timing relationship between a data strobe signal, such as from an embedded MultiMediaCard (eMMC) device, and an internal clock signal. The host device can control a delay circuit using the determined timing relationship, such as to align received read data for sampling, or to determine or adjust a delay value of the delay circuit. 1. A system comprising:a host device configured to receive read data from an embedded MultiMediaCard (eMMC) device over data lines of a communication interface and a data strobe signal from the eMMC device over a data strobe line of the communication interface,wherein the host device is configured to determine a timing relationship between the data strobe signal and an internal clock signal in a calibration mode to align the read data for sampling, andwherein the host device is configured to receive read data from the eMMC device over the data strobe line in a data mode separate from calibration mode.2. (canceled)3. The system of claim 1 , wherein the host device includes:data pins configured to receive read data from the eMMC device over the data lines of the communication interface; anda data strobe pin configured to receive the data strobe signal from the eMMC device over a data strobe line of the communication interface,wherein the host device is configured to receive read data from the eMMC device over at the data pins in both the calibration mode and the data mode.4. The system of claim 3 , wherein the host device is configured to provide a command to the eMMC device to provide read data over the data strobe line of the communication interface in the data mode.5. The system of claim 3 , wherein the data pins consist of a number (N) of data pins claim 3 , and wherein the host is configured to receive read data from the eMMC device using the N data pins and the data strobe pin claim 3 , collectively N+1 pins claim 3 , in the data mode.6. The system of ...

Memory system and method for controlling nonvolatile memory

According to one embodiment, a memory system classifies a plurality of nonvolatile memory dies connected to a plurality of channels, into a plurality of die groups such that each of the plurality of nonvolatile memory dies belongs to only one die group. The memory system performs a data write/read operation for one die group of the plurality of die groups in accordance with an I/O command from a host designating one of a plurality of regions including at least one region corresponding to each die group. The memory system manages a group of free blocks in the nonvolatile memory for each of the plurality of die group by using a plurality of free block pools corresponding to the plurality of die groups.

SWITCHLESS NVMe FABRIC

A method for connecting a plurality of NVMe storage arrays using switchless NVMe cross connect fiber channel architecture for faster direct connectivity and reduced latencies.

Parallel Boot Execution Of Memory Devices

The present disclosure generally relates to reducing boot latency of memory devices in a dual boot system. The boot code is loaded to the data storage device controller in a flexible manner by being able to receive chunks of the boot code from two separate locations, the host memory buffer (HMB) and the memory device, which may be a NAND device. Part of the boot code may be received from the HMB and another part of the boot code may be received from the memory device. If either the HMB or the memory device can deliver the chunks faster than the other, then the controller can receive the chunks from the faster location and periodically confirm the speed of delivery to ensure the boot code latency is optimized.

DATA COMPRESSION IN A DISPERSED STORAGE NETWORK

A method for execution by a dispersed storage and task (DST) processing unit includes receiving a write request that includes a data object. Characterization data is generated by determining a data type of the data object. Object constraint data is generated by determining a compressibility of the data type and a processing cost of the data type. Optimized trade-off data is generated by optimizing a plurality of trade-off constraints based on the object constraint data. A compression algorithm is selected from a plurality of compression algorithm options based on the optimized trade-off data. A compressed data object is generated by performing the selected compression algorithm on the data object. A plurality of data slices are generated for transmission to a plurality of storage units for storage by performing an information dispersal algorithm on the compressed data object. 1. A method for execution by a dispersed storage and task (DST) processing unit that includes a processor , the method comprises:receiving, via a network, a write request that includes a data object;generating characterization data by determining a data type of the data object;generating object constraint data by determining a compressibility of the data type and a processing cost of the data type;generating optimized trade-off data by optimizing a plurality of trade-off constraints based on the object constraint data;selecting a compression algorithm from a plurality of compression algorithm options based on the optimized trade-off data;generating a compressed data object by performing the selected compression algorithm on the data object; andgenerating a plurality of data slices by performing an information dispersal algorithm on the compressed data object for transmission, via the network, to a plurality of storage units for storage.2. The method of claim 1 , wherein determining the data type of the data object is based on at least one of: a mime type of the data object claim 1 , a name of ...

SYSTEMS AND METHODS FOR SIGNATURE COMPUTATION IN A CONTENT LOCALITY BASED CACHE

The present disclosure relates to methods and circuits for signature computation in a content locality cache. A method can include dividing a received block into shingles, where each shingle represents a subset of the received block. The method can include, for each shingle, determining an intermediate fingerprint by processing the shingle, and determining whether the intermediate fingerprint is more representative of the contents of the block than a previous fingerprint. If so, the method can include storing the intermediate fingerprint as a representative fingerprint. If not, the method can include keeping the previous fingerprint as the representative fingerprint. The method can further include determining whether there are more shingles to process. If so, the method can include processing the next shingle. If not, the method can include computing the signature of the contents of the block by adding the representative fingerprint to a sketch of the received block. 1. A method for computing a signature of contents of a block in a cache , the method comprising:dividing a received block into shingles, wherein each shingle represents a subset of the received block; determining an intermediate fingerprint by processing the shingle;', 'determining whether the intermediate fingerprint is more representative of the contents of the block than a previous fingerprint;', 'if the intermediate fingerprint is determined to be more representative of the contents of the block, storing the intermediate fingerprint as a representative fingerprint;', 'if the intermediate fingerprint is determined to be less representative of the contents of the block, keeping the previous fingerprint as the representative fingerprint;', 'determining whether there are more shingles to process;', 'if there are more shingles to process, processing the next shingle; and, 'for each shingle,'}if there are no more shingles to process, computing the signature of the contents of the block by adding the ...

System and Method for Granular Deduplication

A method of managing a memory system is described, the memory system having a processor with a client interface, a buffer memory, and a storage memory. A LUN (logical unit) is exposed to the client, the LUN having a memory size, and QoS specification. When the processor receives a command from the client to write data to the LUN, determining if the QoS specification includes deduplication and: if the QoS does not include deduplication, processing the command by storing the data in the storage memory and creating metadata uniquely referencing a storage location of the data that is written; or if the QoS includes deduplication, determine if deduplication is possible while meeting a latency value as specified in the QoS specification and performing deduplication. 110.-. (canceled)11. A method comprising:receiving a command to write data to a logical unit (LUN) of memory;determining whether deduplication is supported by a quality of service (QoS) specification associated with the LUN; and deduplicating and storing the data in a storage memory in response to the QoS specification supporting deduplication; and', 'storing the data in the storage memory and creating metadata referencing a storage location of the data in response to the QoS specification not supporting deduplication., 'processing the command, wherein processing the command comprises12. The method of claim 11 , further comprising:determining whether compression is supported by the QoS specification associated with the LUN; andcompressing the deduplicated data when storing the data in the storage memory in response to the QoS specification supporting compression.13. The method of claim 12 , wherein the deduplicated data is compressed when storing the data based on a latency in the QoS specification associated with the LUN.14. The method of claim 11 , wherein the deduplicating and storing the data in the storage memory is based on a latency included in the QoS specification associated with the LUN.15. The ...

Flash memory controller mechanism capable of generating host-based cache information or flash-memory-based cache information to build and optimize binary tree with fewer nodes when cache stores data from host

A flash memory controller includes a processor and a cache. When the processor receives a specific write command and specific data a host, the processor stores the specific data into a region of the cache, and the processor generates host-based cache information or flash-memory-based cache information to build or update/optimize a binary tree with fewer number of nodes to improve the searching speed of the binary tree, reducing computation overhead of multiple cores in the flash memory controller, and minimizing the number of accessing the cache to reduce the total latency wherein the host-based cache information may indicate dynamic data length and flash-memory-based cache information indicates the data length of one writing unit such as one page in flash memory chip.

DISTRIBUTED FILE SERVING ARCHITECTURE SYSTEM WITH METADATA STORAGE VIRTUALIZATION AND DATA ACCESS AT THE DATA SERVER CONNECTION SPEED

Method, apparatus and program storage device that provides a distributed file serving architecture with metadata storage virtualization and data access at the data server connection speed is provided. A host issues a file access request including data target locations. The file access request including data target locations is processed. Remote direct memory access (RDMA) channel endpoint connection are issued in response to the processing of the file access request. An RDMA transfer of the file-block data associated with the file access request is made directly between a memory at the host and a data server. 171-. (canceled)72. A method for providing a distributed file serving architecture with metadata storage virtualization and data access at data server connection speed , comprising:issuing from a host a file access request including data target locations;processing the file access request including data target locations;issuing a remote direct memory access channel endpoint connection in response to the processing the file access request including data target locations; andtransferring file-block data associated with the file access request directly between a memory at the host and a data server.73. A method for providing a distributed file serving architecture with metadata storage virtualization and direct data access , comprising:storing metadata associated with data on a data server in memory at a metadata server;establishing a file-based remote direct memory access protocol session with a host and a data server;receiving a data request at the metadata server from the host through an operations channel established between the host and the metadata server for providing asynchronous communication initiated only by the host;providing from the metadata server to the data server connection and host target buffer information through a back control channel between the metadata server and the data server using the remote direct memory access protocol;processing the ...

Data management device, data management system, and data management method

A data management device includes a processor. The processor is configured to transmit data of a logical volume to a library device different from the data management device so as to record the data of the logical volume on a portable recording medium managed by the library device. The processor is configured to prepare recognition information whenever data of a logical volume is recorded on the portable recording medium. The recognition information is used to recognize entire first logical volumes. Data of the first logical volumes is recorded on the portable recording medium. The processor is configured to transmit the recognition information to the library device so as to record the recognition information on the portable recording medium.

SYSTEMS AND METHODS TO ENABLE ACCESS TO A HOST MEMORY ASSOCIATED WITH A UNIFIED MEMORY ARCHITECTURE (UMA)

A method includes, in a data storage device including a non-volatile memory, receiving, from a host device, a read command to read data from the non-volatile memory. The host device is coupled to the data storage device and includes a memory having a unified memory (UM) area. The method also includes, responsive to the read command, sending a UM read command to the host device. The UM read command instructs the host device to read the data from a location of the UM area. 1. A method comprising: receiving, from the host device, a read command to read data from the non-volatile memory; and', 'responsive to the read command, sending a UM read command to the host device, wherein the UM read command instructs the host device to read the data from a location of the UM area., 'in a data storage device including a non-volatile memory, the data storage device coupled to a host device that includes a memory having a unified memory (UM) area, performing2. The method of claim 1 , wherein the UM read command enables the host device to directly access the data from the UM area of the memory of the host device.3. The method of claim 1 , further comprising:identifying the data stored at a storage location of the non-volatile memory as predicted data prior to sending a UM write command to the host device; andsending the UM write command to the host device based on the data being identified as the predicted data.4. The method of claim 3 , wherein the predicted data comprises read ahead data or pre-fetch data.5. The method of claim 1 , further comprising:reading the data from a storage location of the non-volatile memory; andprior to receiving the read command, sending a UM write command to the host device to write the data to the UM area of the memory of the host device.6. The method of claim 1 , further comprising:in response to receiving the read command, determining whether the data is stored at the UM area based on a UM tracking table, wherein the UM tracking table tracks storage ...

STORAGE CONTROL APPARATUS, STORAGE SYSTEM, AND PROGRAM

A storage control apparatus in a storage system including a plurality of nodes each including a storage apparatus that stores data and the storage control apparatus that controls processing of the data in the storage apparatus, the storage control apparatus includes: a communication unit configured to communicate with a higher-level apparatus that instructs processing of the data in the storage apparatus and with the storage control apparatus included in another node; and a control unit configured to control the communication unit so that a command is transmitted to the storage control apparatuses included in all the other nodes when the communication unit receives the command from the higher-level apparatus, the command including an instruction about processing of data in the storage apparatus included in an arbitrary node. 1. A storage control apparatus in a storage system including a plurality of nodes each including a storage apparatus that stores data and the storage control apparatus that controls processing of the data in the storage apparatus , the storage control apparatus comprising:a communication unit configured to communicate with a higher-level apparatus that instructs processing of the data in the storage apparatus and with the storage control apparatus included in another node; anda control unit configured to control the communication unit so that a command is transmitted to the storage control apparatuses included in all the other nodes when the communication unit receives the command from the higher-level apparatus, the command including an instruction about processing of data in the storage apparatus included in an arbitrary node.2. The storage control apparatus according to claim 1 , further comprising:a storage unit configured to temporarily store data,wherein the control unit stores a command in the storage unit when the communication unit receives the command from the storage control apparatus included in the other node, the command including ...

MEDIA CONTROL DEVICE AND CONTROL METHOD

A media control device includes a processor. The processor is configured to read out, in response to a first request received from an information processing apparatus, part of a plurality of divided data items from recording media and store the part of the plurality of divided data items in a first storage unit. The plurality of divided data items are obtained by dividing a first set of data and stored in the recording media. The processor is configured to access, in response to a second request received from the information processing apparatus, one divided data item stored in the first storage unit. 1. A media control device , comprising: read out, in response to a first request received from an information processing apparatus, part of a plurality of divided data items from recording media and store the part of the plurality of divided data items in a first storage unit, the plurality of divided data items being obtained by dividing a first set of data and stored in the recording media, and', 'access, in response to a second request received from the information processing apparatus, one divided data item stored in the first storage unit., 'a processor configured to'}3. The media control device according to claim 2 , wherein divide, upon receipt of a WRITE request to write target data from the information processing apparatus, the target data to create a first plurality of divided data items,', 'record, in the management information, first information in which the target data is associated with the first plurality of divided data items, and', 'store the first plurality of divided data items in the recording media concurrently., 'the processor is configured to'}4. The media control device according to claim 1 , whereinthe second request is an OVERWRITE request to overwrite the first set of data, starting from a beginning, and read out, in response to the first request, a first divided data item that includes a top block of the first set of data from the recording ...

APPARATUS, METHOD AND PROGRAM PRODUCT FOR DETERMINING THE DATA RECALL ORDER

To provide a technique for optimizing the processing order of recall requests in which the average latency time of a host apparatus is minimized. A storage manager accepts a request of the host apparatus for the recalling data from a tape library, and stores the request in a queue table. In response to storage of the request, the storage manager calculates the latency time for each request in all the conceivable execution orders for all the requests stored in the queue table. The storage manager determines the execution order which minimizes the total calculated latency time for all the requests including the active request. 1. An apparatus for use with a tape library and for determining a data recall order , the apparatus comprising:first latency time prediction means for predicting a latency time, from an acceptance of each request for data required to be recalled from said tape library, to completion of a process in said tape library, in performing the process in each of all the execution orders conceivable for all the requests stored in a queue table; andfirst execution order determination means for determining a first execution order, as an execution order to be applied that is an execution order in which a total sum of said latency time predicted by said first latency time prediction means for all the requests including an active request is minimum.2. The apparatus of claim 1 , further including rearrangement means for rearranging the execution order of all said requests within said queue table in accordance with said execution order to be applied.3. The apparatus of claim 1 , further including:request acceptance means for accepting the request of the host apparatus for data required to recall from said tape library; andstorage means for storing said request in the queue table.4. The apparatus according to claim 1 , wherein said first execution order determination means determines claim 1 , as the execution order to be applied claim 1 , the first execution ...

PARTIAL VOLUME ACCESS IN A PHYSICAL STACKED VOLUME

A computer-implemented method for accessing data stored in a virtual tape storage (VTS) system, according to one embodiment, include receiving a mount request to access at least one host data record in a VTS system, issuing a locate command to position the sequential access storage medium having the logical volume stored therein to about a position where the physical block having at least a portion of the requested at least one host data record therein is located; creating a partial virtual volume in a tape volume cache; and copying the physical block having the at least a portion of the requested at least one host data record therein from the sequential access storage medium to the partial virtual volume in the tape volume cache. An amount of data copied from the logical volume to the partial virtual volume is less than the amount of data in the logical volume. 1. A computer program product for accessing data stored on a virtual tape storage (VTS) system , the computer program product comprising a computer readable storage medium having program instructions embodied therewith , wherein the computer readable storage medium is not a transitory signal per se , the program instructions executable by a digital processing apparatus to cause the digital processing apparatus to perform a method comprising:receiving, by the digital processing apparatus, a mount request to access at least one host data record stored on a sequential access storage medium, the mount request including a virtual volume identifier of a logical volume stored on the sequential access storage medium having the requested at least one host data record therein;determining, by the digital processing apparatus, based on the virtual volume identifier a position on the sequential access storage medium where a physical block comprising the requested at least one host data record begins and an amount of data to copy;issuing, by the digital processing apparatus, a locate command to position the sequential ...

ELECTRONIC CONTROL UNIT FOR VEHICLE AND DATA COMMUNICATION METHOD

An electronic control unit for a vehicle includes a nonvolatile memory that is capable of erasing and writing data electrically, and capable of receiving a program to be written into the nonvolatile memory in units of a predetermined size by means of communication using a communication buffer. The electronic control unit for the vehicle uses communication buffers, the number of which is greater than the number of communication buffers used in an in-vehicle communication environment, to receive the program. 1. An electronic control unit for a vehicle , connected to an external writing device that writes at least a control program for controlling the vehicle and a setting program of communication buffers , and comprising a first communication buffer used for communication with the external writing device and second communication buffers , each used for communication with a corresponding external device that controls the vehicle ,wherein the setting program of the communication buffers received from the external writing device assigns the second communication buffers as the first communication buffer, and the first communication buffer and the second communication buffers assigned as the first communication buffer are used to receive the control program and data from the external writing device.2. The electronic control unit for the vehicle according to claim 1 , wherein a size of the first communication buffer and a size of each second communication buffer are set based on a size of the control program and a size of the data claim 1 , written into a nonvolatile memory that is capable of erasing and writing data electrically.3. The electronic control unit for the vehicle according to claim 1 , wherein the setting program of the communication buffers received from the external writing device is expanded and activated in a nonvolatile memory that temporarily stores data.4. A data communication method for use in an electronic control unit for a vehicle claim 1 , connected ...