Abstract: Apparatuses, methods and storage medium associated with application execution enclave memory page cache management, are disclosed herein. In embodiments, an apparatus may include a processor with processor supports for application execution enclaves; memory organized into a plurality of host physical memory pages; and a virtual machine monitor to be operated by the processor to manage operation of virtual machines. Management of operation of the virtual machines may include facilitation of mapping of virtual machine-physical memory pages of the virtual machines to the host physical memory pages, including maintenance of an unallocated subset of the host physical memory pages to receive increased security protection for selective allocation to the virtual machines, for virtualization and selective allocation to application execution enclaves of applications of the virtual machines. Other embodiments may be described and/or claimed.

Abstract: Methods and systems which, for example, reduce energy usage in cache memories are described. Cache location information regarding the location of cachelines which are stored in a tracked portion of a memory hierarchy is stored in a cache location table. Address tags are stored with corresponding location information in the cache location table to associate the address tag with the cacheline and its cache location information. When a cacheline is moved to a new location in the memory hierarchy, the cache location table is updated so that the cache location information indicates where the cacheline is located within the memory hierarchy.

Abstract: Provided herein may be a storage device and a method of operating the same. The method of operating a storage device including a replay protected memory block (RPMB) may include receiving a write request for the RPMB from an external host, selectively storing data in the RPMB based on an authentication operation, receiving a read request from the external host, and providing result data to the external host in response to the read request, wherein the read request includes a message indicating that a read command to be subsequently received from the external host is a command related to the result data.

Abstract: Examples perform asynchronous encrypted live migration of virtual machines (VM) from a source host to a destination host. The encryption of the memory blocks of the VM is performed optionally before a request for live migration is received or after said request. The more resource intensive decryption of the memory blocks of the VM is performed by the destination host in a resource efficient manner, reducing the downtime apparent to users. Some examples contemplate decrypting memory blocks of the transmitted VM on-demand and opportunistically, according to a pre-determined rate, or in accordance with parameters established by a user.

Abstract: A technique includes receiving a request to initialize a region of a memory. Content that is stored in the region is encrypted based at least in part on a stored nonce value and a key. The technique includes, in response to the request, performing cryptographic-based initialization of the memory, including altering the stored nonce value to initialize the region of the memory.

Abstract: Methods and apparatus relating to lightweight trusted tasks are disclosed. In one embodiment, a processor includes a memory interface to a memory to store code, data, and stack segments for a lightweight-trusted task (LTT) mode task and for another task, a LTT control and status register including a lock bit, a processor core to enable LTT-mode, configure the LTT-mode task, and lock down the configuration by writing the lock bit, and a memory protection circuit to: receive a memory access request from the memory interface, the memory access request being associated with the other task, determine whether the memory access request is attempting to access a protected memory region of the LTT-mode task, and protect against the memory access request accessing the protected memory region of the LTT-mode task, regardless of a privilege level of the other task, and regardless of whether the other task is also a LTT-mode task.

Abstract: In some embodiments, a memory initialization detection process includes detecting a read instruction of a program, where the read instruction addresses a particular memory location, and where data corresponding to the particular memory location is cached in a particular cache line of a memory cache. The memory initialization detection process further includes determining, based on metadata stored in the memory cache, that a section of the particular cache line does not store valid data of the program. The memory initialization detection process further includes obtaining validity data from the section of the particular cache line. The memory initialization detection process further includes determining, based on the validity data, whether the read instruction is authorized to proceed.

Abstract: A device includes a connector including first and second portions, each being configured to establish an independent data connection with a portion of first and second connectors in an external device, and a controller. When the first portion is connected with a third portion of the first external connector, and a request to connect with the second portion is received from the second external connector, the controller determines whether or not to accept the request, and transmit an acceptance signal or a rejection signal to the second external connector through the second portion, according to the determination result.

Abstract: A computer-implemented method for offloading a problem having 2n size from processing circuitry to one or more accelerators is disclosed. The processing circuitry and the one or more accelerators include respective memories. In the method, a problem having 2n size is divided into a plurality of units each having 2u size. At least a part of the units is allocated to the one or more accelerators. A determination is made as to whether there is a remaining part of the units to be allocated onto the processing circuitry. A temporary buffer is prepared on each memory of at least the one or more accelerators. The temporary buffer is used for storing a copy of a dependent unit stored on a different memory, during inter-unit calculation.

Abstract: Systems, methods, and circuitries adapt a system-on-chip (SoC) for use with different external devices. In one example, an SOC includes a plurality of SoC data lanes configured to conduct data signals between the SoC and an external device interface. The SoC also includes an interface lane adaptor and a device interface including a plurality of interface connectors. The interface lane adaptor circuitry includes a plurality of SoC adaptor connectors connected to the interface connectors; a plurality of external adaptor connectors connected to the SoC data lanes and configured to be connected to the external device interface; a lane selector circuitry configured to connect a selected one of a first or a second SoC adaptor connector to a selected SoC data lane; and a lane configuration circuitry configured to control the lane selector circuitry to connect either the first or the second SoC adaptor connector to the selected SoC data lane.

Abstract: Differing widths of retimers are developed using differing numbers of individual retimer elements combined together. To maintain synchronous operation, various signals are provided between the individual retimer elements to allow synchronization of the various operations. A first signal is a wired-OR signal that is used for event and operation synchronization. A second set of signals form a serial bus used to transfer proper state information and operation correction data from a master retimer element to slave timer elements. The combination of the wired-OR signal and the serial bus allow the various state machines and operations inside each retimer element to be synchronized, so that the entire width of the link is properly synchronized.

Abstract: Flow control credit management is provided when converting traffic from a first parallel link width on a first link to a second parallel link width on a second link A current value is calculated for a variable flow control credit exchange rate (R) associated with the first and second links. A first flow control credit indicator is received on the second link, and a credit amount calculated based on the first flow control credit indicator and R. A second flow control credit indicator for the credit amount is then transmitted on the first link.

Abstract: A storage system has a management server computer and a storage apparatus. The storage apparatus has a management processor connected to a management server computer via a first network, and a plurality of I/O processors that are connected to the management processor via a second network, that are connected to a storage device, and that conduct I/O with the storage device. The management server computer generates a command for any I/O processor of the plurality of I/O processors. The management server computer encapsulates and encrypts the command to generate an encrypted message, and sends the encrypted message to the management processor. The management processor receives the encrypted message and selects an I/O processor of the plurality of I/O processors as a first address on the basis of the command; and decrypts and undoes the encapsulation of the message to restore the command, and sends the command to the first address.

Abstract: A programmable apparatus for executing a function is disclosed. The programmable apparatus includes a physical interface configured to be connected with an external apparatus. The programmable apparatus also includes a function logic circuit configured to execute the function on the programmable apparatus. The programmable apparatus further includes a plurality of peripheral logic circuits, each of which is configured to connect the function logic circuit with the physical interface using a respective protocol. The programmable apparatus also includes a selector circuit configured to select one from among the plurality of the peripheral logic circuits to activate.

Abstract: Embodiments are provided herein for efficient component communication and resource utilization in a disaggregated computing system. A general purpose link is provided between a plurality of devices in the disaggregated computing system such that the general purpose link is used to connect the plurality of devices. For those of the plurality of devices communicating with one another within a same pool, the connection of the general purpose link is established using a backplane to facilitate the communication; and for those of the plurality of devices communicating with one another within differing pools, the connection of the general purpose link is established through an optical switching device to facilitate the communication.

Abstract: A slave node of one or more slave nodes and a master node of a distributed acquisition system and a method of synchronizing communication of the slave node is provided. The method includes acquiring a configuration that provides a definition for a packet interval, wherein the packet interval definition provides an adequate timing margin to ensure that communication packets transmitted by the master node and the one or more slave nodes occur only at harmonics of the packet interval definition. The method further includes receiving master communication packets from the master node via the bus, determining a start time of at least one most recent master communication packet of the master communication packets received from the master node, calculating a synchronization time based on the start time, and starting transmission of slave communication packets to the master node based on the synchronization time.

Abstract: An apparatus includes a substrate, a classical computing processor formed on the substrate, a quantum computing processor formed on the substrate, and one or more coupling components between the classical computing processor and the quantum computing processor, the one or more coupling components being formed on the substrate and being configured to allow data exchange between the classical computing processor and the quantum computing processor.

Abstract: An example computing system includes a baseboard management controller (BMC), a motherboard, and a daughterboard communicatively coupled to the motherboard. The BMC includes a serial interface. The daughterboard includes a universal asynchronous receiver/transmitter (UART) terminal, a bridging chip, and a microcontroller communicatively coupled to the BMC via the bridging chip. The BMC establishes a serial connection, through the serial interface and the UART terminal, with the microcontroller.

Abstract: An integrated circuit device is disclosed including core circuitry and interface circuitry. The core circuitry outputs in parallel a set of data bits, while the interface circuitry couples to the core circuitry. The interface circuitry receives in parallel a first number of data bits among the set of data bits from the core circuitry and outputs in parallel a second number of data bits. The ratio of the first number to the second number is a non-power-of-2 value.

Abstract: A system-on-chip bus system includes a bus configured to connect function blocks of a system-on-chip to each other, and a clock gating unit connected to an interface unit of the bus and configured to basically gate a clock used in the operation of a bus bridge device mounted on the bus according to a state of a transaction detection signal.

Abstract: A cache management system performs cache management in a Remote Direct Memory Access (RDMA) key value data store. The cache management system receives a request from at least one client configured to access a data item stored in a data location of a remote server, and determines a popularity of the data item based on a frequency at which the data location is accessed by the at least one client. The system is further configured to determine a lease period of the data item based on the frequency and assigning the lease period to the data location.

Abstract: A neural network unit has a first memory that holds elements of a data matrix and a second memory that holds elements of a convolution kernel. An array of neural processing units (NPU) each have a multiplexed register that receives a corresponding element of a row from the first memory and that also receives the multiplexed register output of an adjacent NPU. A register receives a corresponding element of a row from the second memory. An arithmetic unit receives the outputs of the register, the multiplexed register and an accumulator and performs a multiply-accumulate operation on them. For each sub-matrix of a plurality of sub-matrices of the data matrix, each arithmetic unit selectively receives either the element from the first memory or the adjacent NPU multiplexed register output and performs a series of the multiply-accumulate operations to accumulate into the accumulator a convolution of the sub-matrix with the convolution kernel.

Abstract: The presently claimed invention relates to a system and method for organizing data replicated in a target data repository. The method of the presently claimed invention may receive data from a primary data store for replication in the target data repository. The method may then determine that the received data should be organized and stored according to one or more priority metrics. The method may then organize the received data according to the one or more priority metrics, and store the received data based on the priority metrics. Higher priority data may be stored faster data storage devices or be stored in smaller files where lower priority data may be stored in slower data storage devices or be stored in larger files.

Abstract: Aspects of this disclosure relate to protecting email data. For example, email protection rules can instruct an email server to route an email to an email protection module. The one or more email rules can identify a group of one or more email addresses. The email protection module can receive an email from the email server that has an email address of the group as an intended receipt. The email protection module can route the email to secondary storage and store the email in secondary storage to create a secondary copy of the email. The secondary copy can be stored inline to persistent memory of secondary storage, according to certain embodiments. Access to the backup copy of the email stored to the persistent memory can be controlled, for example, based on whether a user had permission to access to the email when the email was sent.

Abstract: The present disclosure provides systems and methods for optimizing lock detection in a change block tracker (CBT). A method comprises detecting changes on a disk volume and saving them to current changes, creating a volume changes and a snapshot changes collection, on a snapshot creation request, moving current changes to frozen changes, on a lock request, moving changes to the volume changes collection of the current snapshot, on another lock request, moving volume changes of current snapshot to frozen changes and deleting snapshot changes of current snapshot, when snapshot name is not the same as current snapshot, otherwise: moving the volume changes collection to the frozen changes, copying the frozen changes to the current changes, moving the snapshot changes collection to the frozen changes, and copying the snapshot changes collection to the current changes, moving all volume changes for other snapshots to current changes and allowing the client to read the frozen changes.

Abstract: Systems and techniques of de-duplicating file and/or blobs within a file system are presented. In one embodiment, an email system is disclosed wherein the email system receives email messages comprising a set of associated attachments. The system determines whether the associated attachments have been previously stored in the email system, the state of the stored attachment, and if the state of the attachment is appropriate for sharing copies of the attachment, then providing a reference to the attachment upon a request to share the attachment. In another embodiment, the system may detect whether stored attachments are corrupted and, if so, attempt to repair the attachment, and possibly, prior to sharing references to the attachment.

Abstract: For reducing activation of similarity search in a data deduplication system using a processor device in a computing environment, input data is partitioned into data chunks. A determination is made as to whether to apply a similarity search process for an input data chunk based on deduplication results of a previous input data chunk in the input data.

Abstract: A Web Application Open Platform Interface (WOPI) server is communicatively connected to an information management (IM) server and to an online application server which acts as a WOPI client of the WOPI server. When a user wishes to open, create, or edit a document in an online application hosted by the online application server, the WOPI server is called, instead of the IM server which manages the document at the backend of an enterprise computing network. The WOPI server is configured for obtaining a working copy of the document from the IM server and providing the working copy to the WOPI client. The WOPI client provides the working copy to the online application for display on the user device. When the work is done, the working copy is sync'd back through the WOPI server to the IM server as a new draft and deleted by the WOPI server.

Abstract: Aspects of the subject technology relate to methods for inter-container communication in a virtual network environment. Steps for implementing an inter-container communication method can include: creating, using a container management system, a file-structure in a shared memory, generating, by the container management system, a first memory-mapping between the file-structure and a first network container, and generating, by the container management system, a second memory-mapping between the file-structure and a second network container. In some aspects, the method can further include steps for transferring at least one data packet from the first network container to the second network container via the file-structure in the shared memory. Systems and machine-readable media are also provided.

Abstract: A system includes reception of a first write request from a client including a first key and a first one or more stream, payload pairs associated with the first key, copying of the first key and the first one or more stream, payload pairs to a first buffer of a volatile memory, storage of data of the first buffer in one or more blocks of a raw block non-volatile memory device, providing of the first buffer to a stream store server, reception of the first buffer at the stream store server, adding of the first key and the first one or more stream, payload pairs to a second buffer of the volatile memory, in key-order, storage of the data of the second buffer in a filesystem storage device, according to stream, and transmission of an indication of the durability of the key to the tail store server.

Abstract: The method includes identifying a first data table that includes a set of rows and a structure. The method further includes creating a second data table and a third data table having a matching structure as the first table. The method further includes distributing the set of rows of the first data table, wherein the set of rows is distributed between one or more of the second data table and the third data table based upon preset parameters. The method further includes, generating one or more operations for the set of rows. The method further includes executing one of the one or more generated operations on the second data table and the third data table.

Abstract: A computer-implemented method and system are provided for monitoring developments in a field of prior art. The method comprises using one or more processors receive a search query including a first patent concept related to the field of prior art; search the Internet as a function of the search query; generate a first set of search results; store the first set of search results in a database; conduct a subsequent search on the Internet as a function of the search query; generate a second set of search results; compare the first and second sets of search results to identify differences in the results; and communicate the differences to a user. An ontology of patent concepts may be stored in a system database. The searches may be conducted automatically on a regular basis thereby notifying the user of any intervening changes in the field of prior art.

Abstract: Methods and apparatus to transform attribute data about assets in a source system data model into attribute data about the same assets in a target system data model. The first step is to extract the necessary attribute data from attribute data collected about inventory assets of a business entity needed to populate the attributes in objects representing those inventory assets in a target system data model. Transformation rules are written which are designed to make all conversions necessary in semantics, units of measure, etc. to transform the source system attribute data into attribute data for the target system which has the proper data format. These transformation rules are executed on a computer on the extracted attribute data and the transformed attribute data is stored in an ER model. In the preferred embodiment, the transformation rules are object-oriented in that transformation rules for subtypes can be inherited from their parent types or classes.

Abstract: Managing database transactions in a distributed database system includes: maintaining, at a first node, a first plurality of records of transactions, each associated with a transaction and including a start time of the transaction and a start time of an oldest transaction that was active at the start time of the transaction; maintaining, at a second node, a second plurality of records of transactions, including records of completed transactions associated with the second node, each including a transaction start time and a transaction end time; receiving at the second node, a message from the first node including a start time of an oldest transaction that was active at the transaction start time of the oldest currently active transaction in the system; and removing, from the second plurality of records, any records of completed transactions with a transaction end time occurring before the start time of the oldest transaction.

Abstract: Merging synonymous entities from multiple structured sources into a dataset includes receiving a first set of paired terms from a first authoritative source for a domain and a second set of paired terms from a second authoritative source for the domain. The first set of paired terms is compared to the second set of paired terms with a similarity assessment based on a clustering statistical algorithm to identify paired terms from the first set of paired terms that share a synonymous term with one or more paired terms from the second set of paired terms. The paired terms associated with the synonymous term are merged and a dataset is generated that associates a normalized version of the synonymous term with any terms included in the merged paired terms.

Abstract: Embodiments can provide a computer implemented method in a data processing system comprising a processor and a memory comprising instructions, which are executed by the processor to cause the processor to implement a system for providing classification job estimation for a data security platform comprising one or more data sources, the method comprising: for each of the one or more data sources: counting the number of databases; counting the number of tables in each database; selecting a random database; selecting a random table within the random database; retrieving a database data sample from the random table; measuring one or more latencies associated with issuing and retrieving the database data sample; measuring a processing time required to evaluate the database data sample against one or more policy rules; compiling one or more mean times for the latencies and processing times; and calculating a data source scan time using the one or more mean times and the number of tables in each database; and calcul

Abstract: An index generation request reception unit configured to receive an index generation request for stored data from one or more information processing apparatuses, and a determination unit configured to determine whether an index of data is generated or not in accordance with identification information attached to the index generation request are provided, so that writing of an object is efficiently processed.

Abstract: Data stream quality management for analytic environments includes an ingress quality specification (IQS) module with a data stream analytic module. The analytic module has a data quality expectation for data of the data stream and receives the data stream from the IQS module. A selector module receives the data stream from an object and selects a subset of the received data stream. A predicate module applies a predicate to the subset to determine if the subset meets the quality expectation of the analytic module. The predicate module modifies the subset of data by annotating the subset to indicate a quality status based on whether the subset meets the quality expectation. The IQS module outputs the data stream with the annotated subset of data to the analytic module. The analytic module outputs an analysis of the object based on whether the annotated subset of data met the quality expectation.

Abstract: Performing hierarchical computations in relational database management systems, where the hierarchical computations are based on tabular input data that builds non-tree topologies by modifying the tabular input data to form tree topologies. One or more nodes, in a hierarchy of nodes, generated from tabular data, can have a non-tree-like topology. One or more attributes of entries in the tabular indexed data structure associated with the one or more nodes having the non-tree-like topology can be modified. The modified attributes can cause the tabular indexed data to form a tree-like topology. The modifying can be based on a type of non-tree-like topology of the one or more nodes having the non-tree-like topology. A navigation function can be selected and applied to the modified tabular indexed data structure to determine a navigation result for traversing the hierarchy of nodes. The navigation result can be provided and the hierarchy traversed.

Abstract: Method and systems for data storage is provided. Metric data corresponding to a component of a datacenter is received, the metric data associated with a metric instance that identifies the component of the datacenter. It is determined that the metric instance is not stored at an index server. The metric instance is stored at the index server, the metric instance being synchronously stored in a flattened format. A slot identification is generated based on at least a portion of the metric instance, and the metric instance is stored at an inventory server in accordance with the slot identification, the metric instance being asynchronously stored in an unflattened format.

Abstract: Techniques for performing database operations using vectorized instructions are provided. In one technique, it is determined whether to perform a database operation using one or more vectorized instructions or without using any vectorized instructions. This determination may comprise estimating a first cost of performing the database operation using one or more vectorized instructions and estimating a second cost of performing the database operation without using any vectorized instructions. Multiple factors that may be used to determine which approach to follow, such as the number of data elements that may fit into a SIMD register, a number of vectorized instructions in the vectorized approach, a number of data movement instructions that involve moving data from a SIMD register to a non-SIMD register and/or vice versa, a size of a cache, and a projected size of a hash table.

Abstract: Identifying unvisited portions of visited information to visit includes receiving information to crawl, wherein the information is representative of one of web based information and non-web based information, computing a locality sensitive hash (LSH) value for the received information, and identifying a most similar information visited thus far. Identifying unvisited portions of visited information further includes determining whether the LSH of the received information is equivalent to most similar information visited thus far and, responsive to a determination that the LSH of the received information is not equivalent to most similar information visited thus far, identifying a visited portion of the received information using information for most similar information visited thus far and crawling only unvisited portions of the received information.

Abstract: A method begins by a dispersed storage (DS) processing module storing a data portion in a dispersed storage network (DSN), where the data portion is associated with a set of data index keys, a version index key, and with a set of portion index keys. The method continues with the DS processing module traversing, based on the set of data index keys, a plurality of index structures to determine whether an object retrieval structure exists for the data portion. When the object retrieval structure exists, the method continues with the DS processing module updating the object retrieval structure by determining whether a version record exists that corresponds to the version index key and when the version record exists, creating, within the version record, a new data portion record for the data portion to include an identifier of the data portion and the set of portion index keys.

Abstract: A system and method, including determining, by a processor, distinction bit positions for index keys of a database index; determining, by the processor, concatenation of the bits of the index keys; and generating a record of the concatenation. Other systems and methods include collecting, by a processor, index keys of a database index in parallel, wherein data pages of a target table are evenly distributed to a plurality of processor cores; scanning, by each of the cores the data pages to extract compressed keys and corresponding record identifiers; sorting, by a plurality of the processor cores, pairs of the compressed key and corresponding record identifier in accordance with a parallel sorting algorithm; generating an index tree in a bottom-up fashion; and storing a record of the generated index tree.

Abstract: Provided are techniques for reduced fixed length sort of variable length columns. A fixed length sort is performed to sort a table having rows for a query, wherein the fixed length sort is based on a sort key comprised of a variable length column. A pre-determined number of the rows are read to identify the variable length column as a candidate for truncation. A length for truncating the variable length column is determined based on database statistics and based on the reading of the pre-determined number of the rows. The variable length column is truncated to the determined length to output a truncated variable length column for the sort key. The rows are sorted on the sort key having the truncated variable length column. Results are generated using the sorted rows and returned for the query.

Abstract: Systems and methods for multiple updates to a database using paths is disclosed. Updates to a graph database can be performed by associating an attribute node, that stores the updated value, to the entity node to-be updated. When the entity node is queried for the value, the nearest attribute node is identified using a shortest path determination.

Abstract: A system may utilize a combination of real-time and polling connectors for data crawling. A real-time connector may use a collector to write data associated with a new event from a database to a channel and record external identifiers (IDs) associated the data. A polling connector may use a verifier to compare the recorded IDs with IDs associated with a batch of data, and may write any data of the batch of data to the channel that has not been written previously written by the collector. The system may include an onboarder for reading data previously stored in the database.

Abstract: Aspects of the embodiments are directed to synchronizing at least a portion of a link-state database. A network element can lose an adjacency. The network element can transmit a request to a neighboring network element for synchronization of a link-state database. The request can include a version number of a last synchronized link-state database from the neighboring network element. The neighboring network element can determine whether the version of the link-state database is greater than or less than a copy of the link-state database stored by the neighboring network element. If the requested version number is less than the neighboring network element's link-state database version number, then the neighboring network element can send changes to the link-state database since the requested link-state database version number.

Abstract: Systems and methods for generating an event-based data set using a computer implemented asset monitoring system are provided. An asset repository stores data related to one or more commissioned assets of an asset monitoring system. When event data is received from an asset, whether an asset maintenance record corresponding to the asset exists in the asset repository is determined based on comparing the data in the asset repository to the event data. When the asset maintenance record is determined to not exist in the asset repository, an asset identification record corresponding to the asset is rendered. The asset identification record comprises the event data and additional asset-related data collected from the asset. An event-based data set is generated based on the asset identification record.

Abstract: A mechanism is provided for updating attribute value information for a data table. The data table involves a set of attributes. The data table has multiple records associated with multiple data blocks. Attribute value information is associated with each data block of the multiple data blocks. The attribute value information is descriptive of at least one attribute of the set of attributes. A first data block may be marked as modified in response to a delete process for deleting from a first data block of the multiple data blocks a record having at least one attribute value that is used for generating the attribute value information of the first data block. In response to scanning the marked first data block, the attribute value information associated with the first data block may be updated based on the scan results.