31 results about "Cache locality" patented technology

The invention provides a data processing method and device of a processor, equipment, a medium and a program product. The method comprises the steps of loading an mth data block in a first matrix to a first cache position of an internal memory through a first thread in a thread group of a processor, and loading an nth data block in a second matrix to a second cache position of the internal memory; loading the (n + 1) th data block in the second matrix from the external memory to a third cache position of the internal memory through the first thread, and performing multiplication operation on the data blocks in the first cache position and the data blocks in the second cache position through the second thread; and loading the (n + 1) th data block in the second matrix from the internal memory to a second cache position of the internal memory through the first thread, and performing multiplication operation on the data block in the first cache position and the data block in the third cache position through the second thread. According to the invention, the calculation speed of multiplication in the processor can be improved.

The invention provides a communication method, communication node equipment, a computer readable medium and a product, and relates to the technical field of communication, and the communication method comprises the steps: receiving a first information transmission frame sent by a first opposite-end communication node; in response to retransmission indication information generated according to a sending sequence number of the first information transmission frame, sending a first retransmission indication frame to the first opposite-end communication node, the first retransmission indication frame comprising the retransmission indication information and a first receiving sequence number, the first receiving serial number is the receiving serial number of the information transmission frame sent by the first opposite-end communication node confirmed to be correctly received at the last time by the local-end communication node; the first retransmission indication frame is used for the first opposite-end communication node to start reading the cached information transmission frame from a cache position corresponding to a first receiving serial number in a pre-configured retransmission cache region corresponding to the local-end communication node in response to the retransmission indication information, and retransmission operation is carried out.

The invention relates to the field of data lookup, and discloses a locality perception lookup table lookup method, which comprises the following steps of: S1, reordering between rows: clustering and reordering the rows of an input vector and a weight matrix according to the same quantized value to enable elements with the same quantized value to be continuously distributed; for a common matrix GeMV scene, cache locality is improved through rearrangement and subsequent blocking operation, and repeated loading of a lookup table LUT is reduced. And the data locality of the GeMV scene is remarkably improved through inter-line reordering and a virtual mapping strategy. On the basis of reordering of input vector element values, elements with the same value are aggregated, so that the LUT line loading times are reduced to 256 times at most from being in direct proportion to the input dimension d, and frequent replacement of the LUT lines in the WRAM is avoided; meanwhile, a weight matrix is divided into BR * BC sub-matrixes, the characteristic that vertical adjacent rows share an accumulator is utilized, multi-row sub-matrix calculation is loaded at a time, and virtual rearrangement maintains the row matching relation between an input vector and the weight matrix through index mapping.

The present application provides a point cloud data processing method, an apparatus, and a point cloud data processing circuit. The point cloud data processing method includes: when processing current point data by an i-th level algorithm, reading current sliding window data centered on the current point data, the current sliding window data including at least two cached data, each cached data being stored in a corresponding cache location, each cached data comprising point data and tag information identifying row number information of the point data, where i is an integer greater than 1; determining target point data based on the tag information, and determining corresponding cached data based on the target point data; and updating the current sliding window data based on the cached data that has been determined, and performing the i-th level algorithm processing on the current sliding window data.

The invention provides a content resource cache position updating method and device, equipment, a medium and a product, and belongs to the technical field of artificial intelligence, and the method comprises the steps: determining accessed path information of a target content resource in a preset time period in response to an acquisition request of the target content resource initiated by a terminal user; inputting the visited path information into a pre-trained anomaly detector, and judging whether the visited path information is abnormal or not by the anomaly detector and outputting a detection result; if the detection result is abnormal, obtaining a structure topological graph of cache nodes used for caching the content resources, and determining a feature matrix and an adjacent matrix of the structure topological graph; and obtaining a cache position updating result of the target content resource according to the feature matrix, the adjacent matrix and the accessed path information. Compared with a mode of maintaining manual configuration of an administrator, the cache position updating speed is higher, errors are not prone to occurring, and the requirement of a terminal user for application experience and increasing internet application flow can be met.

A data processing service receives a request from a user to execute code in a notebook. The service initiates a first VM for execution of the code in the notebook based on the request. The first VM may be set up with a virtual environment with configurations for executing the code. The service automatically caches the virtual environment with the configurations in a data store and automatically caches metadata associated with the virtual environment in a metadata store. The metadata may include a location identifier for identifying a caching location of the virtual environment in the data store. The metadata may include an expiration condition. When the virtual environment meets the expiration condition, the virtual environment will be invalidated in the data store. The service executes the code in the notebook in the virtual environment.

This application provides an IP address network partitioning method, apparatus, device, and storage medium, belonging to the field of asset management technology. The method includes: converting a target IP address into an integrated IP address block, wherein the target IP address belongs to either IPv4 or IPv6; determining the host bit width based on a variable-length subnet mask, and logically right-shifting the tail address block within the IP address block according to the host bit width to obtain a bit value; comparing the bit value of the tail address block with a reference bit value of the tail address block in a preset network partitioning rule to determine whether the target IP address matches the network partitioning rule. This method eliminates code redundancy and branch prediction failures. It significantly improves cache locality and instruction pipeline efficiency, thereby enhancing the adaptability of the solution.

Embodiments of the present application provide a robot order-picking method, system, server and storage medium, and relate to the technical field of intelligent warehousing. The method comprises: obtaining an order-picking task of moving a target bin in a warehouse from a first storage position in a first rack to a second storage position in a second rack; determining a first cache position of the target bin according to the first storage position, and controlling a first robot to move the target bin from the first storage position to the first cache position; the first cache position belongs to a first cache area in the same column as the first rack; determining a second cache position of the target bin according to the second storage position and the first cache position, and controlling a second robot to move the target bin from the first cache position to the second cache position; the second cache position belongs to a second cache area in the same column as the second rack and in the same layer as the first cache area; and controlling a third robot to move the target bin from the second cache position to the second storage position, thereby improving order-picking efficiency.

The invention relates to an annotation data processing method and device, equipment, a medium and a product, and the method comprises the steps: obtaining corresponding incremental annotation data in response to an annotation operation of a user on a current page; storing the incremental annotation data to a cache position corresponding to the current page, and rendering the incremental annotation data to the current page; and under the condition that the user ends the annotation operation for the current page, exporting each piece of incremental annotation data in the cache position corresponding to the current page. According to the method, every time the user performs the annotation operation on the current page, the annotation data generated by the annotation operation serves as the increment annotation data to be cached, and after the user ends the annotation operation for the current page, the caching work of the increment annotation data of the current page is completed; therefore, the exporting efficiency of the annotation data is greatly improved.

The invention discloses a cloud native database memory pooling method and device, electronic equipment and a storage medium, and the method comprises the steps: constructing a local buffer pool and a remote buffer pool hash table at each computing node in a database cluster comprising a master computing node and a plurality of slave computing nodes, the remote buffer pool hash table is used for recording the cache positions of the data pages in other computing nodes; responding to a data page access request received by any computing node, taking the computing node as a current node, and querying a local buffer pool; under the condition that the data page is not cached locally, the current node queries a remote buffer pool hash table to determine whether the data page is cached in a target computing node or not; and under the condition that the data page is cached in the target computing node, the current node reads the data page from a local buffer pool of the target computing node through a remote direct memory access network. According to the method and the device, the cluster-level memory utilization rate is improved, delay among the computing nodes is eliminated, and elastic capacity expansion and shrinkage are realized.

A processing system includes one or more DMA engines that load data from memory or another cache location without storing the data after loading it. As the data propagates past caches located between the memory or other cache location that stores the requested data (“intermediate caches”), the data is selectively copied to the intermediate caches based on a cache replacement policy. Rather than the DMA engine manually storing the data into the intermediate caches, the cache replacement policies of the intermediate caches determine whether the data is copied into each respective cache and a replacement priority of the data. By bypassing storing the data, the DMA engine effectuates prefetching to the intermediate caches without expending unnecessary bandwidth or searching for a memory location to store the data, thus reducing latency and saving energy.

The invention discloses an online car-hailing driver position caching method, which comprises the following steps of: preprocessing a position message reported by a driver, and mapping the preprocessed position message to a space-time key consisting of a geographic unit identifier and a time bucket number; according to a comparison result of the offset of the original timestamp in the corresponding time bucket and a preset threshold value, writing the driver identifier into a cache position identified by one or more continuous space-time keys, and setting uniform survival time for the cache position; in response to a nearby driver query request of the passenger, determining an associated geographic unit set according to a query position, and determining a target time bucket number according to a query moment; and obtaining and returning a nearby driver identifier set by concurrently reading a cache position jointly determined by the geographic unit set and the target time bucket number. A high-performance and extensible solution is provided for systems needing real-time geographic position management, such as online car-hailing and instant distribution.

In one implementation, a computer implemented method for predicting new information based on a previous information may include creating a draft cache and a target cache within a memory of the computer wherein the draft cache and the target cache have a fixed length. The method may include storing tokens representing the information into the caches, the storing may start at a leftmost cache location. The method may also include forming a mask and an index or pointer for each cache. As new entries are formed, they are added to the caches, and the masks and pointers are updated to include to the entries that are added.

The present disclosure relates to a page data acquisition method and apparatus, a communication device, a storage medium, and a program product. The method comprises: receiving a geographic cache pre-request sent by a client, the geographic cache pre-request being used for requesting page cache data of a target page of a target application; in response to the geographic cache pre-request, on the basis of a target query strategy, determining, from geographic cache data, a target cache location matching the location of the client, and target page cache data corresponding to the target cache location, wherein the target query strategy comprises a target query radius, the distance between the target cache location and the location of the client is less than or equal to the target query radius, the geographic cache data comprises a plurality of cache locations and a plurality of pieces of page cache data respectively corresponding to the plurality of cache locations, and the page cache data is real page data of the target page displayed by the client at the corresponding cache locations before the geographic cache pre-request; and returning the target page cache data to the client.

Apparatuses, systems, and techniques to cause information to be invalidated in a second cache location after information is stored in a first cache location. In at least one embodiment, one or more circuits are to perform an application programming interface (API) to cause information to be invalidated in a second cache location after information is stored in a first cache location.

Systems and methods are provided for routing wireless emergency calls to an appropriate public safety answer point (PSAP). When an emergency call is initiated by user equipment (UE), an age of the cached location of the UE is determined. Based on the age of the cached location, a variable delay timer is assigned for communicating a session information protocol (SIP) INV message comprising a location of the UE to a gateway. The location, in various aspects either the cached location or the fresh location, is communicated to the gateway, enabling the UE to communicate with the PSAP.

The invention relates to the technical field of quantitative financial distributed computing, and discloses a distributed parallel Monte Carlo financial risk assessment method and a distributed parallel Monte Carlo financial risk assessment system. Comprising the following steps: analyzing task dependence intensity to identify a task cooperation group, counting data access topological characteristics to calculate a cache value score, determining an optimal cache position according to an access mode, monitoring a task migration event to execute cache cooperation migration, and periodically re-evaluating to dynamically adjust the cache based on a buffer mechanism. The technical problem that a traditional caching strategy neglects that tasks depend on spatial locality and do not respond to task migration in a cooperative mode is solved, and intelligent cooperative optimization of caching data layout and task distribution is achieved.

The invention belongs to the technical field of data processing, and particularly discloses a high-performance and false-positive-free cuckoo filter design method, which is characterized in that a one-to-one correspondence relationship between elements and hash values is realized through unique hash mapping, and false positive is eliminated fundamentally; and meanwhile, a multi-candidate bucket mapping strategy of the main bucket group and the auxiliary bucket group is utilized, and the cache locality is improved in combination with relative distance coding, so that the element migration frequency under high load is effectively reduced. The filter provided by the invention has constant time complexity in insertion, query and deletion operations, and realizes excellent space utilization rate and throughput performance while keeping zero false positive rate. The structure is particularly suitable for data processing scenes such as network data filtering, intrusion detection, firewall matching and malicious traffic identification which have extremely high requirements on accuracy and real-time performance.

The invention relates to a data processing method and device, computer equipment and a storage medium. The method comprises the following steps: in response to a current processing request, determining a storage condition of to-be-processed data in an annular cache queue; determining the consistency between the current processing request and the historical processing request under the condition that the to-be-processed data is stored in the annular cache queue; under the condition that the current processing request is consistent with the historical processing request, updating the cache position of the to-be-processed data in the annular cache queue according to the current processing request; and under the condition that the head pointer in the annular cache queue moves to the cache position corresponding to the to-be-processed data, processing the to-be-processed data based on the current processing request. By adopting the method, storage space waste can be avoided.

Systems and methods for producing an acceleration structure provide for subdividing a 3-D scene into a plurality of volumetric portions, which have different sizes, each being addressable using a multipart address indicating a location and a relative size of each volumetric portion. A stream of primitives is processed by characterizing each according to one or more criteria, selecting a relative size of volumetric portions for use in bounding the primitive, and finding a set of volumetric portions of that relative size which bound the primitive. A primitive ID is stored in each location of a cache associated with each volumetric portion of the set of volumetric portions. A cache location is selected for eviction, responsive to each cache eviction decision made during the processing. An element of an acceleration structure according to the contents of the evicted cache location is generated, responsive to the evicted cache location.

The present invention provides a computer-implemented method for providing a service to a trusted execution environment (TEE). A data item is written by a process running in the TEE to a pre-defined cache location. The data item is monitored to determine whether it is evicted from the pre-defined cache location. A setup procedure is accepted as complete based on the data item not being evicted from the pre-defined cache location. The present invention can be used in a variety of applications including, but not limited to, several anticipated use cases in cloud services, machine learning, and medical / healthcare. This invention can also provide lower access times if optimized for performance.

The invention provides a cache error processing method, a cache controller and computer equipment, and the method comprises the steps: obtaining first data from a lower-level storage request under the condition that a 2-bit error exists in a label of a first cache position used for storing the first data in a process of processing a first data request, setting the label state of the first cache position as an invalid state; the first data request is used for requesting the first data; and / or, in the process of processing the first data request, when it is found that a label of a second cache position for storing second data has a 2-bit error, setting the state of the label of the second cache position as an invalid state. According to the method, the cache can effectively process 2-bit tag memory bank errors.

The application discloses an edge network digital twin application migration and evolution method based on non-stationary online learning and belongs to the technical field of communication network resource management and edge computing. The application is suitable for digital twin application deployment and service request processing under end-edge-cloud cooperation. The method is based on non-stationary online learning, dynamically migrates and continuously evolves the digital twin application in the system to adapt to the mobility of physical entities and the continuous change of states. With the aim of maximizing the long-term average weighted service quality of the digital twin application under the premise of meeting the system cost constraint, the method comprises adopting a non-stationary slot machine learning assisted online joint optimization algorithm to determine the service priority of each type of service request in the digital twin application, the migration position of the digital twin application, the experience knowledge type for personalized service capability improvement, and the ability record fusion type and cache position for diversified service capability maintenance.

The application provides a data processing method, device, equipment, medium and program product of a processor. The method comprises the following steps: loading, by a first thread in a thread group of the processor, an mth data block in a first matrix to a first cache location of an internal memory and loading an nth data block in a second matrix to a second cache location of the internal memory; loading, by the first thread, an (n+1)th data block in the second matrix from an external memory to a third cache location of the internal memory, and performing, by a second thread, a multiplication operation on the data block in the first cache location and the data block in the second cache location; loading, by the first thread, the (n+1)th data block in the second matrix from the internal memory to the second cache location of the internal memory, and performing, by the second thread, the multiplication operation on the data block in the first cache location and the data block in the third cache location. According to the application, the calculation speed of the multiplication operation in the processor can be improved.

The application discloses a shortest instruction distance scheduling method and system of a smart contract virtual machine. The method comprises: static analysis and preprocessing, constructing an instruction dependency graph and calculating comprehensive weights of dependency edges; runtime dynamic scheduling, scheduling and synchronizing instructions according to dynamic priorities through a lock-free ready queue, a resource bitmap and a ring bus; multi-thread cooperation and load balancing, performing instruction-level work stealing among processor cores based on dynamic thresholds. The calculation of comprehensive weights and dynamic priorities takes minimizing global distance cost as an optimization target, and is used for improving cache locality and instruction-level parallelism of instruction execution. The system comprises a static analysis module, a runtime scheduling engine and a load balancer module. The application takes minimizing the execution distance of dependent instructions as a core optimization target, effectively improves instruction-level parallelism and cache locality, and thus significantly improves the execution performance and resource utilization of the smart contract virtual machine in a high-concurrency scenario.

A system and method for enhancing reasoning in neural network-based generative models through software-defined Virtual Neurons—active processing units with configurable activation functions and weighted connections—instantiated during inference without modifying pretrained parameters. Virtual Neurons maintain state vectors in dedicated in- memory data structures managed by a cognitive overlay layer, distinct from external storage and context-token buffers used by prior art. Organization follows hierarchical tiers scaled by α* = (γCs / βCf)^(1 / (β-γ)); for γ ≈ 0.8, β ≈ 1.5, α* ≈ √2, providing optimal path length and cache locality. Cognitively-isolated sandboxes with data-structure-level barriers enable Virtual Double hypothesis exploration by cloning internal cognitive state graphs (not token sequences), with O(1) rollback. A multilayer introspective feedback system evaluates internal cognitive structure (not output scores) and triggers structural modifications. Combined interaction produces runtime adaptation, speculative branching, and self-correction not achievable by components alone.

The embodiment of the application relates to the technical field of data processing, and discloses a business request processing method and system, a server and a storage medium. The business request processing method is applied to each cache node of a CDN, the CDN further comprises a proxy server in communication with each cache node and a source station in communication with the proxy server, and the method comprises the following steps: processing a business request sent by the proxy server according to an information digest algorithm to obtain a cache location; detecting whether cache data corresponding to the business request can be obtained according to the cache location; when the cache data is obtained according to the cache location, sending the cache data to the proxy server; and when the cache data is not obtained according to the cache location, sending a cache data nonexistence instruction to the proxy server, so that the proxy server communicates with the source station to obtain the cache data when the cache data nonexistence instruction is received; the CDN can improve the processing efficiency of the business request and reduce resources used for development, operation and maintenance of the CDN.

The invention discloses a front-end resource access and intelligent caching method and system based on LSTM, and belongs to the technical field of front-end resource access. In order to solve the problem of page loading speed, in the process that a user accesses a Web application, user behavior data including a page ID, a click element, residence time, a network speed and an equipment type are collected in real time through a JavaScript SDK, and user historical behavior data are obtained; constructing a user behavior prediction model by using a long short-term memory (LSTM) network, setting the input of the model as a user historical behavior sequence, and setting the output of the model as a probability distribution prediction result of a page or a functional module accessed by the user in the next step; dynamically adjusting a cache strategy, including cache time, cache content and cache position; resources accessed by the user are loaded in advance; the page loading speed, the resource request times and the user residence time are monitored in real time, and the resource loading optimization effect is evaluated. Real-time performance feedback is provided, and continuous optimization is supported.

The utility model discloses a circuit supporting multipath ADPCM hardware operation. The circuit comprises an ADPCM arithmetic unit, a cache selection module, an operation counter, an Index and Presample cache module, and an Index and Presample cache setting module. The ADPCM arithmetic unit is respectively connected with the ADPCM compression value input unit, the cache selection module and the PCM value output unit; the cache selection module is connected with the Index and Presample cache module and the operation counter; the operation counter is connected with the Index and Presample cache setting module and the ADPCM arithmetic unit; according to the method, the cache position extraction and storage are accurately controlled, the stability and reliability of the multi-channel decoding rotation process are ensured, the real-time requirement is met, the hardware resource utilization rate is improved, and an efficient, flexible and stable ADPCM decoding solution is provided for a multi-audio channel scene.