Abstract: A logical map represents fragments from separate versions of a data object. Migration of data from a first (old) version to the second (new) version happens gradually, where write operations go to the new version of the data object. The logical map initially points to the old data object, but is updated to point to the portions of the new data object as write operations are performed on the new data object. A background migration copies data from the old data object to the new data object.

Abstract: Described apparatuses and methods track access metadata pertaining to activity within respective address ranges. The access metadata can be used to inform prefetch operations within the respective address ranges. The prefetch operations may involve deriving access patterns from access metadata covering the respective ranges. Suitable address range sizes for accurate pattern detection, however, can vary significantly from region to region of the address space based on, inter alia, workloads produced by programs utilizing the regions. Advantageously, the described apparatuses and methods can adapt the address ranges covered by the access metadata for improved prefetch performance. A data structure may be used to manage the address ranges in which access metadata are tracked. The address ranges can be adapted to improve prefetch performance through low-overhead operations implemented within the data structure.

Abstract: A method of allocating variables to computer memory includes determining at compile time when each of the plurality of variables is live in a memory region and allocating a memory region to each variable wherein at least some variables are allocated at compile time to overlapping memory regions to be stored in those memory regions at runtime at non-overlapping times.

Abstract: A computing system has a processing device (e.g., CPU, FPGA, or GPU) and memory regions (e.g., in a DRAM device) used by the processing device during normal operation. The computing system is configured to: monitor use of the memory regions in volatile memory; based on monitoring the use of the memory regions, identify at least one of the memory regions of the volatile memory; initiate a hibernation process; and during the hibernation process, copy data stored in the identified memory regions to non-volatile memory.

Abstract: A method is described for managing the issuance and fulfillment of memory commands. The method includes receiving, by a cache controller of a memory subsystem, a first memory command corresponding to a set of memory devices. In response, the cache controller adds the first memory command to a cache controller command queue such that the cache controller command queue stores a first set of memory commands and sets a priority of the first memory command to either a high or low priority based on (1) whether the first memory command is of a first or second type and (2) an origin of the first memory command.

Abstract: Various embodiments include methods and devices for virtual cache coherency. Embodiments may include receiving a snoop for a physical address from a coherent processing device, determining whether an entry for the physical address corresponding to a virtual address in a virtual cache exists in a snoop filter, and sending a cache coherency operation to the virtual cache in response to determining that the entry exists in the snoop filter.

Abstract: Various embodiments described herein provide for using a prefetch buffer with a cache of a memory sub-system to store prefetched data (e.g., data prefetched from the cache), which can increase read access or sequential read access of the memory sub-system over that of traditional memory sub-systems.

Abstract: Various embodiments described herein provide for using a prefetch buffer for a data interface bridge, which can be used with a memory sub-system to increase read access or sequential read access of data from a memory device coupled to the data interface bridge.

Abstract: Described apparatuses and methods track access metadata pertaining to activity within respective address ranges. The access metadata can be used to inform prefetch operations within the respective address ranges. The prefetch operations may involve deriving access patterns from access metadata covering the respective ranges. Suitable address range sizes for accurate pattern detection, however, can vary significantly from region to region of the address space based on, inter alia, workloads produced by programs utilizing the regions. Advantageously, the described apparatuses and methods can adapt the address ranges covered by the access metadata for improved prefetch performance. A data structure may be used to manage the address ranges in which access metadata are tracked. The address ranges can be adapted to improve prefetch performance through low-overhead operations implemented within the data structure.

Abstract: Systems, apparatuses, and methods for predictive memory access are described. Memory control circuitry instructs a memory array to read a data block from or write the data block to a location targeted by a memory access request, determines memory access information including a data value correlation parameter determined based on data bits used to indicate a raw data value in the data block and/or an inter-demand delay correlation parameter determined based on a demand time of the memory access request, predicts that read access to another location in the memory array will subsequently be demanded by another memory access request based on the data value correlation parameter and/or the inter-demand delay correlation parameter, and instructs the memory array to output another data block stored at the other location to a different memory level that provides faster data access speed before the other memory access request is received.

Abstract: A method for providing elastic columnar cache includes receiving cache configuration information indicating a maximum size and an incremental size for a cache associated with a user. The cache is configured to store a portion of a table in a row-major format. The method includes caching, in a column-major format, a subset of the plurality of columns of the table in the cache and receiving a plurality of data requests requesting access to the table and associated with a corresponding access pattern requiring access to one or more of the columns. While executing one or more workloads, the method includes, for each column of the table, determining an access frequency indicating a number of times the corresponding column is accessed over a predetermined time period and dynamically adjusting the subset of columns based on the access patterns, the maximum size, and the incremental size.

Abstract: A method for an in-memory distributed cache includes receiving a write request from a client device to write a block of client data in random access memory (RAM) of a memory host and determining whether to allow the write request by determining whether the client device has permission to write the block of client data at the memory host, determining whether the block of client data is currently saved at the memory host, and determining whether a free block of RAM is available. When the client device has permission to write the block of client data at the memory host, the block of client data is not currently saved at the memory host, and a free block of RAM is available, the write request is allowed and the client is allowed to write the block of client data to the free block of RAM.

Abstract: Techniques are disclosed for dynamically managing a cache. Certain techniques include clustering I/O requests into a plurality of clusters by a machine-learning clustering algorithm that collects the I/O requests into clusters of similar I/O requests based on properties of the I/O requests. Further, certain techniques include identifying, for a received I/O request, a cluster stored in the cache. Certain techniques further include loading a set of blocks of the identified cluster into the cache.

Abstract: Apparatuses, systems, and methods for hierarchical memory systems are described. A hierarchical memory system can leverage persistent memory to store data that is generally stored in a non-persistent memory, thereby increasing an amount of storage space allocated to a computing system at a lower cost than approaches that rely solely on non-persistent memory. An example method includes receiving a request to access data via an input/output (I/O) device, determining whether the data is stored in a non-persistent memory device or a persistent memory device, and redirecting the request to access the data to logic circuitry in response to determining that the data is stored in the persistent memory device.

Abstract: A digital signal processor, a digital signal processing (DSP) system, and a method for accessing external memory space are disclosed. The digital signal processor may include: a digital signal processing (DSP) core; and a program port and a data port which are connected to the DSP core and configured to access an external memory, where the program port and the data port are respectively configured to communicate with a memory management unit configured for management of an access address.

Abstract: A memory management system for facilitating communication between an interconnect and a system memory of a system-on-chip includes a plurality of memory controllers coupled with the system memory, and processing circuitry coupled with the interconnect and the plurality of memory controllers. The processing circuitry is configured to receive a transaction request from the interconnect, and identify a memory controller of the plurality of memory controllers that is associated with the received transaction request. Further, the processing circuitry is configured to provide the transaction request to the identified memory controller for an execution of a transaction associated with the received transaction request.

Abstract: The increased use of graph algorithms in diverse fields has highlighted their inefficiencies in current chip-multiprocessor (CMP) architectures, primarily due to their seemingly random-access patterns to off-chip memory. Here, a novel computer memory architecture is proposed that processes operations on vertex data in on-chip memory and off-chip memory. The hybrid computer memory architecture utilizes a vertex's degree as a proxy to determine whether to process related operations in on-memory or off-chip memory. The proposed computer memory architecture manages to provide up to 4.0× improvement in performance and 3.8× in energy benefits, compared to a baseline CMP, and up to a 2.0× performance boost over state-of-the-art specialized solutions.

Abstract: A method includes receiving, at a first computing device, a first input/output (IO) command from a first artificial intelligence processing unit (AI PU), the first IO command associated with a first AI model training operation. The method further includes receiving, at the first computing device, a second IO command from a second AI PU, the second IO command associated with a second AI model training operation. The method further includes assigning a first timestamp to the first IO command based on a first bandwidth assigned to the first AI model training operation. The method further includes assigning a second timestamp to the second IO command based on a second bandwidth assigned to the second AI model training operation.

Abstract: The invention relates to methods, and an apparatus for data reads in a host performance acceleration (HPA) mode. One method is performed in a host side to include: obtaining a value of an extended device-specific data (Ext_CSD) register in a flash controller from the flash controller, where the host side and the flash controller communicate with each other in an embedded multi-media card (eMMC) protocol; and allocating space in a system memory as an HPA buffer, and storing a plurality of first logical-block-address to physical-block-address (L2P) mapping entries obtained from the flash controller when the value of the Ext_CSD register comprises information indicating that an HPA function is supported, where each L2P mapping entry stores information indicating which physical address that user data of a corresponding logical address is physically stored in a flash device.

Abstract: Nested commands for a radio frequency front end (RFFE) bus are provided. In particular, timing commands may be nested inside a normal data flow. On receipt of a nested timing command, a slave on the RFFE bus suspends or halts an active command and addresses the timing command. On completion of the timing command, the slave returns to the halted command. By allowing such nested commands, counters in the slave that would otherwise be used to track triggers may be eliminated or reduced and power may be conserved by placing a clock signal associated with the bus into a low power mode.

Abstract: A method for protecting a system from a malicious USB device. The method includes one or more computer processors interrupting a universal serial bus (USB) enumeration process corresponding to a first USB device operatively couple to a system. The method further includes determining whether the first USB device is a human interface device (HID) based on a set of descriptor values corresponding to the first USB device. The method further includes responding to determining that that first USB device is a HID by generating a validation challenge. The method further includes presenting the validation challenge to a user of the system. The method further includes responding to determining that the user fulfils one or more actions of the validation challenge by resuming the USB enumeration process corresponding to the first USB device.

Abstract: A processor comprises a plurality of processing units on an integrated circuit interconnected by an exchange. The exchange has a group of exchange paths extending between first and second portions of the integrated circuit. Each group has a first exchange block in the first portion and a second exchange block in the second portion. The processor has a first external interface in the first portion a second external interface in the second portion and a routing bus which routes packets between the external interfaces and the exchange blocks. The first external interface exchanges packets between the integrated circuit and a host. The second interface exchanges packets between the integrated circuit and another integrated circuit. Errors may be trapped when packets are wrongly addressed. A network of such processors is also provided.

Abstract: A communication device mounted in each of a plurality of information processing devices connected to a fabric, the communication device comprises: a serial interface that transmits and receives a first packet compliant with a Peripheral Component Interconnect Express (PCIe) standard; a requester unit that acquires the first packet from the serial interface and converts the first packet that has been acquired into a second packet that is transmitted and received via the fabric among a plurality of the information processing devices sharing a memory space that is virtually extended by using a device identifier specific to each of the information processing devices; a fabric communication unit that transmits and receives the second packet via the fabric; and a completer unit that acquires the second packet from the fabric communication unit and generating a response packet to a request included in the second packet that has been acquired.

Abstract: A processor in a network has a plurality of processing units arranged on a chip. An on-chip interconnect enables data to be exchanged between the processing units. A plurality of external interfaces are configured to communicate data off chip in the form of packets, each packet having a destination address identifying a destination of the packet. The external interfaces are connected to respective additional connected processors. A routing bus routes packets between the processing units and the external interfaces. A routing register defines a routing domain for the processor, the routing domain comprising one or more of the additional processor, and at least a subset of further additional processors of the network, wherein the additional processors of the subset are directly or indirectly connected to the processor. The routing domain can be modified by changing the contents of the routing register as a sliding window domain.

Abstract: One or more computer processors to receive an object to store in a cloud storage environment, wherein the cloud storage environment includes a default storage policy. The one or more processors determine whether the object includes a foreign policy as an attribute of metadata associated with the object. The one or more processors, responsive to determining the object includes the foreign policy as an attribute of the metadata associated with the object, determine whether the foreign policy includes storage rules that differ from the default storage policy of the cloud storage environment, and the one or more processors, responsive to determining the storage rules included in the foreign policy of the metadata of the object differ from the default storage policy of the cloud storage environment, store the object based on the storage rules of the foreign policy, and ignore the default storage policy of the cloud storage environment.

Abstract: A query specifying a source repository and a target repository is received from a client device. A source index is generated that corresponds to the source repository and represents a snapshot of metadata associated with data contained in the source data repository. The source index is filtered based on filtering criteria specified by the query to obtain a filtered source index. Attributes of data corresponding to the filtered source index are determined as well as data retrieval type parameters. Without initiating a data migration of the data corresponding to the filtered source index from the source repository to the target repository, predicted data migration metrics associated with the data migration are determined and presented to an end user of the client device. The end user is provided with the capability to initiate or forego the data migration based on an evaluation of the predicted data migration metrics.

Abstract: In some examples, a data management system processes snapshots of a distributed file system, the distributed file system having files, each file comprising multiple data chunks. The data management system performs operations including storing file-to-chunk mapping in file system metadata; creating, for each chunk, a chunk generation ID by associating each chunk with a file system generation ID; in a next-generation snapshot of the distributed file system, incrementing, for all chunks in the next-generation snapshot, the respective chunk generation IDs; and taking a snapshot of the file system metadata and storing an updated file-to-chunk mapping associated with the next-generation snapshot.

Abstract: When a customer-support ticket is created or updated in an online customer-support system, the system applies a set of triggers, which modify the ticket based on business rules, to the ticket, wherein each trigger performs actions that modify the ticket when conditions for parameters associated with the ticket are satisfied. During this process, the system evaluates condition nodes in condition graphs for the set of triggers, wherein a condition graph for a trigger is a directed graph comprised of condition nodes that specify conditions on one or more parameters associated with the ticket. During this evaluation, if a valid path through a condition graph comprising satisfied condition nodes is discovered, the system fires a trigger associated with the condition graph. Also, while evaluating the condition nodes, the system performs one or more range-searching operations to quickly evaluate conditions for frequently occurring parameters in the condition graphs.

Abstract: In an embodiment, a database platform receives a request from a client for creation of an attachable-and-detachable database session, and responsively creates the requested attachable-and-detachable database session for the client. The database platform sets the attachable-and-detachable database session as a current database session for the client at the database platform. The database platform determines that the client has detached from the attachable-and-detachable database session, and thereafter continues to maintain the attachable-and-detachable database session in data storage at the database platform.

Abstract: A computer-implemented method of creating a database of characterising codes, each characterising code being indicative of character of a respective example of a physical system. The method comprises the steps of performing for each example: (a) receiving data including respective values of a plurality of parameters associated with the system; (b) identifying, from a plurality of data clusters, a data cluster for each value, said data clusters each defining a range of possible values of the respective parameter; (c) assigning each parameter to its identified data cluster; (d) generating, from the assigned data clusters, a characterising code for that example including a unique label for each of the identified data clusters; and (e) storing the characterising code in a database of characterising codes.

Abstract: A blockchain is generated as a cloud-based software service in a blockchain environment. The blockchain immutably archives particular usage of any device, perhaps as requested by a user. The user may thus peruse past or historical usage (such as message logs) and individually select historical messages that are desired for a blockchain recordation in the blockchain. Moreover, the usage may be publicly ledgered by still other blockchains, thus providing two-way ledgering for improved record keeping.

Abstract: Systems and methods for dynamically moving virtual machine (VM) data based upon context are described. In some embodiments, an Information Handling System (IHS) may include a processor and a memory coupled to the processor, the memory having program instructions stored thereon that, upon execution, cause the IHS to: select a VM having a plurality of VM files; identify, among the plurality of VM files, a movable VM file; and transfer the movable VM file from a first storage tier to a second storage tier based upon a usage classification associated with the movable VM file.

Abstract: Systems and methods utilize telemetry data to provide administrators with metric information related to a detected IHS (Information Handling System) event, such as an error condition, where the provided metric information is particularized to the context of the event. A remote access controller (RAC) of the IHS stores metric reports received from metric sources. The RAC receives an indication of the event that specifies a first IHS component as a source of the event and specifies a time associated with the event. The RAC identifies stored metric reports generated by the first component prior to the first time and identifies stored metric reports generated by components that are logically and/o physically related to the first component. The RAC generates an event report that includes the metric reports generated by the first component prior to the first time and the metric reports generated by components related to the first component.

Abstract: Methods, systems, and apparatus for, for data compression based on a key-value store. In one aspect, a method includes generating, at a server, a current dictionary based on a plurality of key-values stored in a storage system of the server; receiving a key-value pair transmitted by a client device; and performing, at the server, data compression on a key-value in the key-value pair by using the current dictionary; and storing the key-value in the storage system of the server.

Abstract: A system and method are provided for logically copying data from a source database to a first target database and a second target database. Based on table partition information, the source database is queried to collect partition metadata information for a first set of partitions and a second set of partitions. A first set of the partition metadata information for the first set of partitions and a second set of the partition metadata information for the second set of partitions can be used to create at least one extent chunk for each partition of a table. The source database can be queried, based on a first set of extent chunks and a second set of extent chunks, for a first set of data to be written to the first target database and a second set of data from the source database to be written to the second target database.

Abstract: From among physical storage devices (PSDs) of a storage system, a set of two or more of the PSDs that are eligible for scrubbing may be determined; and from among the set, a relative eligibility of the PSDs may be determined. Conformance prediction analysis may be applied to determine the set and the relative eligibility of PSDs of the set. The conformance prediction analysis may determine a scrubbing eligibility classification (e.g., label), and a confidence value for the classification, which may serve as the relative eligibility of the PSD. The eligible PSDs may be ranked in an order according to determined confidence values, and may be further classified according to such order. The future workload of the storage system may be forecasted, and the scrubbing of PSDs may be scheduled based on the forecasted workload of the system and the relative eligibilities of the set of PSDs.

Abstract: Techniques are disclosed relating to performing database defragmentation operations by autonomously rebuilding index objects stored in one or more tablespaces of a database. In various embodiments, the disclosed techniques include autonomously performing defragmentation operations for one or more tablespaces in a database in an online manner such that a server system may continue to service data access requests while performing the defragmentation operations. In one non-limiting embodiment, for example, the disclosed techniques include selecting a first tablespace to defragment based on its level of fragmentation (e.g., relative to the other tablespaces). The server system may then rebuild index objects, from the first tablespace, to a new tablespace such that the index objects are stored in the new tablespace without fragmentation.

Abstract: System and method for integrating systems to implement data quality processing. A business rule creation module is configured to create a business rule associated with a business term. A data quality specification module is configured to create a data quality specification based on the business rule. The data quality specification comprises (1) an identity of a column of a table stored in a database comprising data to be tested; (2) a test to perform on the data to be tested; and (3) reference data required to perform the test on the data. A validation module is configured to receive the data quality specification; retrieve data associated with the column from the database; and test the retrieved data in accordance with the test using the reference data. A result publication module is configured to return a result of the test to the data quality specification module.

Abstract: The systems and methods described here can reduce the storage space required (memory and/or disk) to store certain types of data, provide efficient (fast) creation, modification and retrieval of such data, and support such data within the framework of a multi-version database. In some embodiments, the systems and methods can store each field of a set of records as a vector of values, e.g., a data vector. A set of records can be represented using a vector hash vector, or “vhash” vector, wherein each element of the vhash vector contains a unique identifier of a data vector, based on a cryptographic hash of the data vector. A header table can store associations between labels and “vhash” vectors that pertain to those labels. Identical data vectors can be re-used between different record sets or vhash vectors needing that vector, thus saving space.

Abstract: The technology relates to cosharding tables within a distributed storage system. A data table including one or more rows may be received. Each row in the data table may include an identifier key and pieces of data. Each piece of data in the data table may be indexed into individual rows of an index table, wherein each row in the index table includes data associated with the identifier key of the data table from which the piece of data in the respective row was indexed. The index table may be sharded into splits, wherein the sharding includes assigning each row of the index table into one of the splits based on the identifier key of the data table from which the piece of data in the respective row was indexed. The splits may be stored into two or more portions of the distributed storage system.

Abstract: An order management system in electronic communication with a database may be configured to manage concurrent update requests for the order data stored in the database. In particular, the order management system may be configured to receive two or more order modification requests, determine that the second order modification request includes one or more aspects that conflict with the modified order and includes one or more aspects that do not conflict with the modified order, send a notification to the second user, wherein the notification includes the one or more aspects that conflict with the modified order, and modify the modified order according to the one or more aspects of the second order modification request that do not conflict with the modified order to create a second modified order.

Abstract: Systems, methods, and devices for transactional processing of change tracking data for a database are discussed. A method includes generating a micro-partition based on execution of a transaction on a table of a database, the micro-partition reflecting changes made to the table by the transaction. A change tracking entry is generated in response to the execution of the transaction. The change tracking entry includes an indication of one or more modifications made to the table by the transaction and an indication of the micro-partition generated based on the execution of the transaction. The change tracking entry is stored in the micro-partition as metadata. At least one existing micro-partition is removed from the table, responsive to storing the change tracking entry.

Abstract: Methods, computer program products and/or systems are provided that perform the following operations: obtaining payload attribute fields; determining potential matching fields from the payload attribute fields; determining a matching function for each of the potential matching fields; determining an attribute score for each of the potential matching fields based on the matching function; obtaining a score list for a reference data set; determining a correlation of the attribute score for each of the potential matching fields with the reference data set score list; selecting new matching fields from the potential matching fields based at least in part on the correlation; determining an optimal weight for each of the selected new matching fields; selecting attribute fields for matching from the selected new matching fields based on a threshold rate for false positives and false negatives; and providing the attribute fields for matching and the associated optimal weight for the attribute fields.

Abstract: This disclosure provides systems, methods and apparatuses for detecting anomalous activity in an electronic system. In some implementations, a system generates a set of model parameters based on a number (n) of historical datapoints in a dataset, where each datapoint represents activity detected in the electronic system over a respective period of time. The system receives a first new data point for the data set and generates a first test parameter based on a value of the first new datapoint and an average and a measure of spread of the n historical datapoints. The system further compares the first test parameter to the set of model parameters and determines whether the first new datapoint represents an anomaly based at least in part on the comparison.

Abstract: Approaches in accordance with various embodiments can perform spatial hash map updates while ensuring the atomicity of the updates for arbitrary data structures. A hash map can be generated for a dataset where entries in the hash map may correspond to multiple independent values, such as pixels of an image to be rendered. Update requests for independent values may be received on multiple concurrent threads, but change requests for independent values corresponding to a hash map entry can be aggregated from a buffer and processed iteratively in a single thread for a given hash map entry. In the case of multi-resolution spatial hashing where data can be stored at various discretization levels, this operation can be repeated to propagate changes from one level to another.

Abstract: Systems and methods for pre-allocating and utilizing storage space in a relational database are provided. In embodiments a method includes: obtaining transaction data including data regarding record insertions in a relational database, wherein each record of the record insertions is associated with a key value; identifying a type of each of the record insertions as either a random insertion type or a key range insertion type based on the database transaction data, wherein the random insertion type comprises records associated with respective key values inserted in a random order, and the key range insert type comprises records associated with a range of key values inserted within a certain time period; predicting a new range of key values associated with future record insertions based on the type of each of the record insertions; and pre-allocating page space in one or more pages of the relational database for the future record insertions.

Abstract: A method for augmenting a database application with blockchain technology is disclosed. The method involves recording data modifications made by a database application into a corresponding database as well as on a blockchain for global consensus confirmation. This is done without changing the existing application architecture and with minimal code changes to the existing application. Records in the database requiring synchronization with the blockchain are subjected to consensuses voting, and unauthorized database changes are rolled back, thereby granting immutability and non-repudiation characteristics to a traditional database application. Records in databases are thus made globally consistent. An existing database application can be deployed on a blockchain without significantly modifying the code. Multiple applications can synchronize data through a common blockchain, which greatly simplifies building blockchain applications.

Abstract: An analysis system connects to a set of data sources and perform natural language questions based on the data sources. The analysis system connects with the data sources and retrieves metadata describing data assets stored in each data source. The analysis system generates an execution plan for the natural language question. The analysis system finds data assets that match the received question based on the metadata. The analysis system ranks the data assets and presents the ranked data assets to users for allowing users to modify the execution plan. The analysis system may use execution plans of previously stored questions for executing new questions. The analysis system supports selective preprocessing of data to increase the data quality.

Abstract: An information management system is provided herein that combines data backup and data migration operations such that data appears available in a network-accessible folder when in fact the data is stored as a secondary copy in a secondary storage device. For example, a user can indicate that a first file should be added to the network-accessible folder. A client computing device can transmit the first file to a secondary storage computing device that performs a backup operation to store a backup copy of the first file in the secondary storage device. The secondary storage computing device can also generate an index of the first file, which includes a location of the backup copy of the first file, and transmit the index to a server that manages the network-accessible folder. Thus, the backup copy of the first file can be retrieved if the first file is selected via the network-accessible folder.

Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. The program identifies a first data structure having a first type. The first data structure is configured to store a set of geometries. The program further identifies a second data structure associated with the first data structure. The second data structure is configured to store modifications to the set of geometries. The program also perform a merge operation on the first data structure and the second data structure to form a third data structure.