77 results about "Data placement" patented technology

The present invention discloses an artificial intelligence-based adaptive big data storage and retrieval optimization system and method designed to intelligently manage and optimize large-scale distributed data environments. The system integrates data acquisition, distributed storage, metadata processing, adaptive learning, and retrieval optimization units configured to work collaboratively for continuous self-optimization. The invention employs deep reinforcement learning and predictive neural network techniques to dynamically analyze system telemetry, workload behavior, and data access patterns in real time, enabling proactive adjustment of data placement, caching, replication, and compression parameters across distributed nodes. The metadata processing framework utilizes graph-based dependency modeling to maintain semantic and contextual relationships among datasets, facilitating intelligent and context-aware data retrieval. The retrieval optimization unit interprets user queries semantically and computes the optimal retrieval route using latency prediction models and dynamic routing techniques.

A memory sub-system having a first memory configured as a non-volatile storage medium of the memory sub-system; and a second memory having an access speed faster than the first memory. A processing device of the memory sub-system is configured to: run a plurality of data placement handlers concurrently; allocate a plurality of data buffers from the second memory to the plurality of data placement handlers respectively; reserve a plurality of backup spaces from the first memory for the plurality of data placement handlers respectively; allocate accumulation buffers from the second memory; and arrange the data placement handlers to time share the accumulation buffers via usages of the backup spaces.

Provided are systems, methods, and apparatuses for assisted cache data placement. In one or more examples, systems, methods, and apparatuses include assigning a first identifier to first data based on an aspect of the first data, the first data being data moved from a cache and assigning a second identifier to second data based on an aspect of the second data, the second data being moved to a storage device based on a policy of the cache. In one or more examples, systems, methods, and apparatuses include storing the first data in a first storage location of the storage device based on the first identifier and storing the second data in a second storage location of the storage device based on the second identifier.

To provide a medical work support system capable of detecting the abnormality of the position of a subject by a simple operation with a low load.SOLUTION: A medical work support system comprising: an image data acquisition unit that acquires image data captured in a state where a subject is placed on a bed; a placement region acquisition unit that acquires a placement region for placing the subject from the image data; a subject position data calculation unit that calculates position data of the subject from the image data; and an abnormality determination unit that determines an abnormality of a position of the subject based on the placement region acquired by the placement region acquisition unit and the position data of the subject.SELECTED DRAWING: Figure 1

The invention relates to managing data placement in a memory subsystem. A system includes a memory device and a memory subsystem controller operably coupled with the memory device, the memory subsystem controller to perform operations including: receiving a memory access command having one or more associated parameters from a host system; determining, using a hardware component of the memory subsystem controller, whether the one or more associated parameters conform to a current flexible data placement (FDP) configuration of the system; and in response to determining that the one or more associated parameters conform to the current FDP configuration of the system, executing the memory access command on an identified segment of the memory device.

Systems and methods are described herein for select content for bid-processing and content placement online placement resources. A computer in an RTB bidding process transmits the selected content to an identified online resource that satisfies the various (and often competing) goal objective thresholds and budget thresholds. The computer transmits the content to the identified online resource, which forwards or transmits the campaign content for display at a user interface of an end-user. The computer analyzes historical data to evaluate the performance of content campaigns against multiple user-selected performance goals and priorities to determine whether to bid for content placement at a given online resource. The computer may generate a blocklist to reject placements at underperforming online resources. The computer may perform optimization functions to determine optimal bid prices that balance the goal objective thresholds and budget threshold and determine whether to bid for the placement.

Methods and systems for providing computer implemented services are disclosed. To provide the services, control variables may be obtained and used to manage operation of the distributed system. The operation may be proactively managed by enforcing data placement standards throughout the system based, at least in part, on the control variables. The enforcement may be performed by identifying preferred placement locations based on the control variables, policies, and / or other factors.

The application provides a long-chain error correction code encoding and decoding method, a system and a readable storage medium, and the method comprises the following steps: S1, minimizing single error cross-cabinet recovery cost through quantization, selecting a suitable data grouping strategy and data placement strategy, and determining encoding parameters; S2, sequentially encoding each dimension of three-dimensional encoding; S3, recovering data by using a decoding algorithm, preferentially using low-dimensional encoding for check recovery, and calling high-dimensional encoding for check recovery of each dimension when recovery fails. The application makes a quantitative analysis on the single error cross-cabinet recovery cost, places the cabinet level strip based on the analysis result, so that the strip crosses fewer cabinets; meanwhile, in the decoding stage of the long-chain error correction code, low-dimensional encoding is preferentially used for check recovery, high-dimensional encoding is called when recovery fails, the network topology is fully considered, the cross-cabinet recovery cost is reduced as much as possible, and then the recovery performance is improved.

A device may include a first memory media, a second memory media, and at least one control circuit configured to receive placement information for data, store, in a portion of the first memory media, based on the placement information, the data, and store, in a portion of the second memory media, based on the placement information, the data. The at least one control circuit may be configured to receive a request to access, from the portion of the first memory media, the data, and access, based on the request, from the portion of the second memory media, the data. The at least one control circuit may be configured to modify, based on an allocation status, the portion of the first memory media to an available state.

A system can present computer storage resources as a consumer storage system, which abstracts resources as chunks in a chunkmanager, which abstracts resources in an uberstore, wherein the uberstore abstracts drives that implement a flexible data placement capability, and wherein the flexible data placement capability facilitates an effect of garbage collection that comprises deallocating data ranges that correspond to reclaim units that comprise groups of blocks. The system can, based on receiving a request to write to the consumer storage system, convert the request to the chunk manager and to the uberstore, and write data to the storage drives, comprising writing to groups of consecutive ubers of the uberstore to a same group of storage drives of the storage drives, via respective reclaim unit handles that correspond to the respective storage drives. The system can garbage collect chunks according to a chunk order and starting at an uber group boundary.

A method and apparatus for placing data in a hierarchical memory are disclosed. A computing device comprising a hierarchical memory composed of a first memory and a second memory, wherein the first memory has a faster access speed than the second memory but has a limited capacity, and the second memory has a slower access speed than the first memory but provides a larger capacity, and a method for placing a packet received through a network into the hierarchical memory comprises: a step of extracting layout information from the payload of the packet; a step of storing the layout information in a queue corresponding to the socket in which the packet was received; a step of determining a destination memory among the first memory or the second memory based on the size of a data field included in the layout information stored in the queue; a step of allocating a space corresponding to the size of the data field to the determined destination memory using a memory allocator; and a step of reading data from the socket in which the packet was received and storing it in the allocated space.

This invention provides a storage system and data placement method that can improve the performance of a storage system by efficiently operating multiple backend drives. [Solution] The storage system is constructed by having multiple storage nodes, each of which includes a storage control unit and is allocated multiple drives. The storage control unit reads and writes data to physical chunks in response to I / O requests from the host device. A drive has multiple physical chunks that are divided to store data. The storage control unit monitors the drive utilization rate for each of the multiple drives and, based on the drive utilization rates of the multiple drives, performs data relocation, moving data located in the physical chunks of the source drive to the physical chunks of the destination drive in order to equalize the drive utilization rates of the multiple drives.

The data management device (1) includes a standard data collection unit (14) that collects standard data, which has been set in advance as data that can be acquired as an analysis item for data analysis, from the production equipment (5) or an operation terminal (6) associated with the production equipment (5), a non-standard data collection unit (11) that collects non-standard data, which is data that includes data related to the production equipment (5) and is not the standard data, from the production equipment (5) or the operation terminal (6), and a data placement unit that stores the non-standard data and standard data as management items associated with the non-standard data in a data storage device.

The application provides an automatic tracing pricing execution method, device and server, relates to the technical field of computer application, and can obtain a tracing account range, then pull the pricing result data of the previous day of a tracing day back to a pricing result table for tracing, and place the position data of the tracing day in a preset position data table, so that after starting a pricing task engine, the tracing times of each FTP account within the tracing date range can be calculated according to the preset tracing date range and the tracing account range; and the tracing pricing task corresponding to each tracing time is sequentially submitted to the preset pricing engine for tracing pricing calculation through the pricing task engine. The whole tracing pricing process can realize process control, so that the risk and cost of tracing can be greatly reduced, and the efficiency of tracing is improved.

A data storage system includes a memory device and a controller. The memory device includes a set of planes and a wordline including a set of pages. The controller includes a first and second minimum write cache control buffer (mWCCBs), processor(s), and a memory. The memory includes instructions, that when executed the processor(s), cause the processor(s) to: determine that an amount of outstanding data of a data stream is not sufficient to occupy the set of planes; store a first portion of the outstanding data in the first mWCCB; release the first portion to the memory device; in coordination with the release of the first portion of the outstanding data, store a second portion of the outstanding data in the second mWCCB; release the second portion to the memory device; and write the first and second portions of the outstanding data to a subset of the set of pages.

A memory sub-system controller performs garbage collection on flexible data placement (FDP) compliant memory sub-systems, such as solid state drives (SSDs). The controller stores a set of data across a plurality of memory components of a set of memory components, a first of the plurality of components being configured to store data in a first set of regions using a first write cursor, and a second of the plurality of components being configured to store data in a second set of regions using a second write cursor. The controller programs data, received from a host system, in a first portion of the first set of regions using the first write cursor. The controller relocates previously programmed data from a second portion of the first set of regions to the first portion of the first set of regions using the first write cursor.

Techniques can include: receiving writes from applications executing on hosts; recording, the writes in entries in a log; and flushing, from the log, the entries denoting the write operations, including: segregating content written by the write operations into streams, wherein each of the streams corresponds to one of a plurality of classes or types of data associated with one of a plurality of I / O profiles characterizing said each stream and said one class or type of data; and for each of the streams corresponding to one class or type of data associated with one I / O profile, persistently storing a corresponding portion of the content in one of a plurality of sub log structured systems (LSSs) used for only storing data of the one class or type that corresponds to said each stream.

A host may not have a large enough internal non-volatile memory to store generated data, such as video. In such situations, the host can store the data in an external data storage device, such as an external solid-state drive (SSD). However, if the storage rate of the external data storage device drops below the rate at which the host is generating and sending the data to the external data storage device, data loss can occur.To help avoid this situation, when a low storage rate is detected, the host can route a portion of data generated by the host to a non-volatile memory in the host for temporary storage and later transfer that data to the external data storage device when the storage rate increases.

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for placement and scheduling of radio signal processing dataflow operations. An example method provides a primitive radio signal processing computational dataflow graph that comprises nodes representing operations and directed edges representing data flow. The nodes and directed edges of the primitive radio signal processing computational dataflow graph are partitioned to produce a set of software kernels that, when executed on processing units of a target hardware platform, achieve a specific optimization objective.Runtime resource scheduling, including data placement for individual software kernels in the set of software kernels to efficiently execute operations on the processing units of the target hardware platform. The resources of the processing units in the target hardware platform are then allocated according to the defined runtime resource scheduling.

The invention provides a memory control method and a memory storage device, and the method comprises the steps: receiving a data writing request from a host system, and obtaining a plurality of access features of to-be-written data according to the data writing request; and according to the plurality of access features, calculating a heat value of the to-be-written data based on a weight dynamic adaptive adjustment mechanism, according to the heat value, determining a data state of the to-be-written data, and placing the to-be-written data in a target queue corresponding to the data state. And when the state of the target queue meets a preset condition, writing the plurality of pieces of to-be-written data in the target queue into an entity block corresponding to the data state. According to the method, the weight for calculating the heat value can be dynamically adjusted, so that the problem that the heat value of the data is calculated by depending on a fixed weight in the related technology, frequent cold and hot data misclassification is caused, a large amount of unnecessary mapping table updating and data migration are caused, and the data processing efficiency is improved is solved. And the performance and the service life of the memory storage device are influenced.

A database management apparatus constructs, for each column in input data, a hierarchical histogram of data distribution with respect to the column by repeating division into a prescribed number of areas based on a degree and a base suitable for a multidimensional sorting algorithm and creation of an equal-width histogram as long as an empty bin is present in a histogram, and creates integer value conversion data that maps a value range width of data in the input data to a converted integer value on the basis of the hierarchical histogram. The database management apparatus places the data, which is in the input data, in a database by multidimensionally sorting the input data according to the multidimensional sorting algorithm on the basis of the integer value conversion data of each column.

A computing apparatus (402, 502, 602) configured for Remote Direct Memory Access (RDMA) is provided. The computing apparatus (402, 502, 602) includes a Network Interface Controller (NIC) (410, 704), a memory (408, 508, 708), and a controller (412). The controller (412) is configured to receive an RDMA request (702), determine that the request carries immediate data, and, in response, obtain a memory address to write to. The controller (412) writes the immediate data to the memory (408, 508, 708) using Direct Memory Access (DMA) to the memory address without placing the data in a Receive Queue (RQ). The apparatus facilitates faster data transfer by bypassing the typical queuing process for immediate data, thereby reducing latency during RDMA operations.

A system can store data in a chunk domain of a log filesystem, wherein the chunk domain comprises a group of chunks. The system can, based on determining to perform an operation on the data, wherein the operation comprises modifying the storing of the data from a first redundant array of inexpensive devices configuration to a second redundant array of inexpensive devices configuration, wherein the operation comprises a tiering operation, wherein the operation comprises a re-keying operation, wherein the operation comprises a restriping operation, or wherein the operation comprises a re-encrypting operation, as part of performing forward garbage collection, moving data of the data according to the operation and based on a flexible data placement command that is supported by a storage device that stores the data after the forward garbage collection is performed.

The application discloses a parallel look-up table method and device supporting nonlinear function expansion function, and relates to the technical field of artificial intelligence, which comprises the following steps: dividing a nonlinear function into several intervals, and representing the function value in each interval by a linear function, wherein the linear function coefficients are stored in a look-up table, and the look-up table is located in local storage; performing multi-format data conversion, expanding and shifting to a predetermined decimal point position according to the data format field in the function type indicator and the format of the input source operand; obtaining the above data placement rule, calculating the in-table offset address of parallel look-up table; adding the vector query base address and the in-table offset address to obtain the storage address of the element to be accessed. The application can quickly realize the conversion from the dependent variable to the in-table offset on the ordinary single-port or double-port memory, and realize the vector look-up table method, improve the utilization rate of the vector calculation structure, general register and other resources, and thus optimize the pipeline performance.

A method of data placement management including: allocating, by a computer express link fabric, portions of resources connected to the computer express link fabric to implement portions of a mapped memory space; receiving, in the computer express link fabric, memory access requests having memory addresses in the portions of the mapped memory space; routing, by the computer express link fabric, the memory access requests to access the portions of the resources allocated to implement the portions of the mapped memory space; adjusting periodically, by the computer express link fabric, implementations of the portions of the mapped memory space using resources allocated over the computer express link fabric; measuring effects of the adjusting; and updating, based on the effects and using a reinforcement learning technique, information configured to select options for the adjusting.

An apparatus may include a storage device that may include at least one storage medium and a controller configured to control the at least one storage medium, wherein the controller may be configured to: receive a write command, wherein the write command may indicate a reclaim unit handle; perform, based on the reclaim unit handle, and based on an operation or condition of the storage device, a selection of a reclaim unit of the at least one storage medium; and store, based on the write command, data to the reclaim unit. The storage medium may include a first reclaim group including the first reclaim unit and a second reclaim group including a second reclaim unit of the at least one storage medium, and the selection of the first reclaim unit may include performing a selection of the first reclaim group.

A host is coupled with a memory system supporting a flexible data placement function. The memory system includes a memory device including K dies. The K dies are divided into L reclaim groups, and each reclaim group includes at least one die. K and L are positive integers greater than or equal to 2. The host includes a user layer and a scheduler. The user layer is configured to send N write requests each corresponding reclaim group information. N is a positive integer. The scheduler is configured to receive the N write requests, and place the N write requests in M request sets. Write requests carrying the same reclaim group information are placed in different ones of the request sets. M is a positive integer less than or equal to N.