Abstract: A copy of files of a primary storage system are stored at a secondary storage system. The metadata associated with the copy of the files of the primary storage system stored at the secondary storage system are analyzed to determine at least a portion of a hierarchical storage tier management plan for the primary storage system including by identifying one or more files to be migrated from a first tier of storage of the primary storage system to a different storage tier. An implementation of at least a portion of the hierarchical storage tier management plan is initiated.

Abstract: A TOE component obtains a first storage address, where the first storage address is an address of a first storage block in a memory, the first storage block stores a target TCP packet, and the target TCP packet includes a packet header and a TCP payload. The TOE component obtains the packet header from the first storage block based on the first storage address. The TOE component performs TCP-related protocol processing based on the packet header, where the TCP payload is not read out of the first storage block by the TOE component when the TOE component performs TCP-related protocol processing based on the packet header.

Abstract: Techniques are provided for metadata management for enabling automated switchover. An initial quorum vote may be performed before a node executes an operation associated with metadata comprising operational information and switchover information. After the initial quorum vote is performed, the node executes the operation upon one or more mailbox storage devices. Once the operation has executed, a final quorum vote is performed. The final quorum vote and the initial quorum vote are compared to determine whether the operation is to be designated as successful or failed, and whether any additional actions are to be performed.

Abstract: Systems and methods for operating a virtual memory pool are disclosed. A network of computing machines having local real memory is provided. A translation table, which is not tightly coupled to the real memory of any one of the computing machines in the network, is generated comprising connections between locations of the various local real memories to segments of the virtual memory pool. A request is received to access a particular segment of the virtual memory pool. An address for a particular computing machine and a location in its local real memory is retrieved from the translation table. A copy of the particular segment is requested from the particular computing machine.

Abstract: Parity data associated with commands to, and indications from, a configuration register that includes a first command FIFO for receiving commands and a response FIFO for returning indications can be managed. Commands can be tracked by storing the commands in a second command FIFO and a command can be dequeued from the second command FIFO, in response to a command emerging from the response FIFO. Parity data can be generated from the data associated with a write operation, and stored in a parity latch corresponding to the configuration register, in response to the dequeued command being a successfully completed write operation. The generated parity data can be read from a parity latch corresponding to the configuration register and provided the generated parity data for return with an indication that the dequeued command is a successfully completed write operation.

Abstract: A method, a device, and a non-transitory storage medium are described in which a mobile edge computing service is provided. The mobile edge computing service provides for the hosting of a function of an application in a mobile edge computer network, and another function of the application to be hosted in a network external from the mobile edge computer network. The mobile edge computing service includes an on-boarding service that obtains subscription information and policies. The mobile edge computing service also includes network resource availability and security measure verifications.

Abstract: Some examples described herein relate to programmable devices that include a data processing engine (DPE) array that permits shifting of where an application is loaded onto DPEs of the DPE array. In an example, a programmable device includes a DPE array. The DPE array includes DPEs and address index offset logic. Each of the DPEs includes a processor core and a memory mapped switch. The processor core is programmable via one or more memory mapped packets routed through the respective memory mapped switch. The memory mapped switches in the DPE array are coupled together to form a memory mapped interconnect network. The address index offset logic is configurable to selectively modify which DPE in the DPE array is targeted by a respective memory mapped packet routed in the memory mapped interconnect network.

Abstract: The present disclosure relates to a method for extending kernel functionality of a kernel of a container-based virtualization system. The method comprises: providing in the container-based virtualization system a compiling container for compiling kernel modules against the kernel of the container-based virtualization system, and an application container for extending kernel functionality of the kernel using a kernel module. The application container may input the kernel module to the compiling container. The compiling container may compile the kernel module in the compiling container. The application container may receive from the compiling container the compiled kernel module. The application container may load the compiled kernel module to the kernel of the system for enabling the extension of the kernel functionality.

Abstract: Techniques are disclosed for dynamically allocating dedicated encrypted storage for containers/applications in a containerized environment. Only those container(s) are able to access an encrypted storage volume that have access to the volume secret for the volume. The volume secret is combined with a pre-key using a hash-based key derivation function (HKDF) to obtain the volume/encryption key for the volume. In various aspects, one is able to specify the amount of encrypted storage desired/required in a storage/host volume to be allocated to a container on-demand. The containerized application for which an instant dynamically allocated dedicated storage volume is created may be a composable multi-container or microservices application. The encrypted storage volume is optimally assembled from the partitions of the storage devices available on a host. The storage devices may be local to the host or remote or in the cloud.

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: The present invention provides a display system comprising: first and second information processing devices; first and second display devices configured to switch between a first display mode, in which a first image output from the first information processing device is displayed across the first and second display devices, and a second display mode, in which a second image output from the second information processing device is displayed across the first and second display devices; a detector configured to detect whether a pointing position is positioned on a switch area arranged in at least one of the first and second display devices; and a display switcher configured to, when the detector detects the pointing position on the switch area in the first display mode, switch a display mode from the first display mode to the second display mode.

Abstract: In one embodiment, a method includes creating, by a computing device, an inter process communication (IPC) channel for communication from a producer process to a consumer process. The IPC channel includes a message buffer mapped to a first virtual address space of a kernel of an operating system and to a second virtual address space of the consumer process in a user space of the operating system. A sender handle for the message buffer is sent to the producer process. The kernel receives a request, which includes the sender handle, to send a message from the producer process to the consumer process through the IPC channel. Responsive to a determination that the request is permitted, the kernel writes the message to the message buffer using the sender handle, such that message written in the message buffer is accessible to the consumer process through the second address space.

Abstract: Methods, systems, and devices related to the convergence of networking and computing capabilities are described. In one representative aspect, a method for application development is described. The method includes making available a first set of services for an application in a domain. The domain corresponds to an industry having a set of business rules, and the first set of services is structured to invoke a second set of services pre-deployed on a first set of communication nodes. The second set of services includes common functionalities according to the set of business rules in the domain. The method also includes deploying the first set of services on a second set of communication nodes to enable an execution of a subset of the business rules in the domain that is specific to the application.

Abstract: A method and apparatus for distribution of applications amongst a number of servers, ensuring that changes to application data on a master for that application are asynchronously replicated to a number of slaves for that application. Servers may be located in geographically diverse locations; the invention permits data replication over high-latency and lossy network connections and failure-tolerance under hardware and network failure conditions. Access to applications is mediated by a distributed protocol handler which allows any request for any application to be addressed to any server, and which, when working in tandem with the replication system, pauses connections momentarily to allow seamless, consistent live-migration of applications and their state between servers.

Abstract: Techniques are disclosed for dynamically allocating encrypted storage for containers/applications in a containerized environment. In various aspects, one is able to specify the amount of encrypted storage desired/required in a storage/host volume to be allocated to a container on-demand. The containerized environment may employ its own hardware resources or be implemented on an infrastructure-as-a-service (IaaS). The containerized application for which an instant dynamically allocated storage volume is created may be a composable multi-container or microservices application. The encrypted storage volume is optimally assembled from the partitions of the storage devices available on a host. The storage devices may be local to the host or remote or in the cloud. Techniques are also disclosed for decommissioning a previously allocated encrypted storage volume based on the present design.

Abstract: The data storage system according to certain aspects can filter secondary copies of data (e.g., backups, snapshots, archives, etc.) generated by multiple client computing devices into a single, filtered, global reference copy. A reference copy may be a filtered view or representation of secondary storage data in a data storage system. A reference copy may include a data structure that includes references to a subset of secondary storage data that meets certain filtering criteria. The filtering criteria may be specified by users according to user preference. Data included in a reference copy may be stored in native format (e.g., format of the application that generated the data) and be accessible through the application associated with the data.

Abstract: A data processing system includes multiple processing units coupled to a system interconnect including a broadcast address interconnect and a data interconnect. The processing unit includes a processor core that executes memory access instructions and a cache memory, coupled to the processor core, which is configured to store data for access by the processor core. The processing unit is configured to broadcast, on the address interconnect, a cache-inhibited write request and write data for a destination device coupled to the system interconnect. In various embodiments, the initial cache-inhibited request and the write data can be communicated in the same or different requests on the address interconnect.

Abstract: A method performed by a UE may comprise transmitting capability information to an IMS. The capability information may indicate that the UE supports data transfer via IMS. The UE may transmit data and an XML message, based on capability. The XML message may describe the data transmitted. In some embodiments, the data may be binary data, for example, binary animation data. Other binary types may be supported.

Abstract: A hybrid emulation system and method for hybrid emulation of a design under test (DUT). The DUT has system memory logically segmented into a plurality of memory blocks. The hybrid emulation system comprises a hardware emulation system to emulate a first portion of the DUT during the hybrid emulation. The hybrid emulation system also comprises a simulation system to simulate a second portion of the DUT during the hybrid emulation. At least one of the hardware emulation system or the simulation system is configured to assign a memory block of the plurality of memory blocks to one of the hardware emulation system or the simulation system based on memory access statistics describing accesses to the memory block during the hybrid emulation.

Abstract: Techniques for thematic landing pages are disclosed. In some embodiments, a process for providing thematic landing pages includes receiving a user query for a theme; determining products (e.g., using a processor) that are relevant to the theme (e.g., based on a content relevancy); and generating a thematic web page for the theme based on the relevant products. For example, the thematic landing page can be associated with a merchant web site, and the relevant products can be products that are available via the merchant web site.

Abstract: Techniques are disclosed for dynamically allocating storage for containers/applications in a containerized environment. In various aspects, one is able to specify the amount of storage desired/required in a storage/host volume to be allocated to a container on-demand. The containerized environment may employ its own hardware resources or be implemented on an infrastructure-as-a-service (IaaS). The containerized application for which an instant dynamically allocated storage volume is created may be a composable multi-container or microservices application. The storage volume is optimally assembled from the partitions of the storage devices available on a host. The storage devices may be local to the host or remote or in the cloud. Techniques are also disclosed for decommissioning a previously allocated storage volume based on the present design.

Abstract: Methods, systems, and apparatuses are disclosed for blockchain-based hierarchical data storage. One method includes determining, based on a blockchain stored in a database that includes multiple levels of storage, a block number interval that includes one or more block numbers associated with data nodes included in a state Merkle tree stored in a target data storage and to be migrated to a lower level of storage with lower storage cost in response to the data nodes meeting a data migration condition, each of the data nodes is associated with a block number of a block of the blockchain where the corresponding data node is last updated, and the data nodes in the state Merkle tree are in the form of key-value pairs (KVPs), each key of the KVPs comprises a node identifier (ID) and a block number associated with the corresponding data node.

Abstract: An approach is described that provides a distributed directory structure within a storage of an information handling system (a local node). A request is received with the request corresponding to a shared virtual address. The shared virtual address that is shared amongst a number of nodes that includes the local node and some remote nodes. A Global Address Space Directory (GASD) is retrieved that corresponds to a global virtual address space. The GASD is stored in a Coordination Namespace that is stored in a memory that is distributed amongst the nodes. A mapping that is included in the GASD is used to determine the node where the shared virtual address currently resides. The shared virtual address is then accessed from the node where it currently resides.

Abstract: A method for execution by a dispersed storage and task (DST) execution unit includes receiving a slice access request for execution by the DST execution unit. At least one ordered codec algorithm is identified. The slice access request is executed by utilizing the at least one ordered codec algorithm. A slice access response indicating an outcome of the slice access request is generated by the DST execution unit.

Abstract: Resource management includes: operating in a first mode, including executing a controller operation in connection with a plurality of local elements, wherein the controller operation is executed by a configurable resource; switching from the first mode to a second mode; and operating in the second mode, including: executing a data processing task in a first portion of the configurable resource; and executing the controller operation in connection with the plurality of local elements, in a second portion of the configurable resource.

Abstract: The disclosed technology relates to a process for general-purpose ring buffer handling in a network controller. Specifically, general purpose ring buffers are used in software queue on both the host domain and the network controller to carry out user-defined protocols. The protocols define the relationship of the ring buffers in the host domain and the network controller domain (e.g. how data is moved and processed). The protocols minimize interruptions to the network controller. Furthermore, the implementation of ring buffers in the network controller domain also provides additional resources to the host domain for carrying out the user-defined protocols.

Abstract: A message request method and a device of the message request method are provided, and the device is applicable to a USB multi-port electronic device including N type-C ports. The message request method includes receiving a message, and assigning, according to a port identifier of the message, the message to a corresponding message pending queue of N message pending queues; selecting, according to a largest message pending first algorithm, a message pending queue with a maximum quantity of messages from the N message pending queues, and obtaining a queue identifier corresponding to the message pending queue; extracting the message from the message pending queue corresponding to the queue identifier; and delivering the message to a policy engine of the type-C port corresponding to the queue identifier, to make a request for the message.

Abstract: Techniques for distributed node management are described. In some implementations, distributed node management includes determining a host of a distributed system to be unhealthy; requesting a plurality of leases from peers in the distributed system, each lease to guarantee the lease providing peer will not undergo voluntary maintenance; upon receiving the requested plurality of leases, reporting the host as unhealthy to a load balancer of the distributed system, the load balancer to balance traffic of the host and not direct traffic to the unhealthy host; and reporting the host as healthy to the load balancer of the distributed system after a predetermined period of time.

Abstract: A storage system in one embodiment comprises at least one storage array comprising a plurality of storage devices. The storage array is configured to communicate over one or more networks with a plurality of host devices. The storage array is further configured to receive one or more commands from a given one of the host devices directing that a particular user-defined name be assigned to a particular one of the storage devices, and responsive to receipt of the one or more commands, to determine if any other user-defined name is already assigned to the particular storage device, and if there is no other user-defined name already assigned to the particular storage device, to assign the particular user-defined name to the particular storage device and to store information characterizing the assignment of the particular user-defined name to the particular storage device in persistent memory of the storage array.

Abstract: System and methods for managing versions of partition maps in a distributed data store are disclosed. A relational database may use partition maps to indicate the location of data in a particular partition, or in a replica thereof. These partition maps may be versioned using a two-stage mechanism in which partition map updates are communicated to all nodes, or to affected nodes only, and in which operation may continue without waiting for acknowledgment of their application to each node. The system may handle minor partition changes differently than major partition changes. For example, if a replica of a partition is promoted to be a primary copy due to hardware or network failures, partition map changes may only be propagated to nodes in the same replica group. For major partition changes (e.g., splits, moves, mergers, added partitions, or size change), a new partition map may be made available to all nodes.

Abstract: A computing system having memory components, including first memory and second memory. The computing system further includes a processing device, operatively coupled with the memory components, to: receive, in a prediction engine, usage history of pages in the second memory; train a prediction model based on the usage history; predict, by the prediction engine using the prediction model, likelihood of the pages being used in a subsequent period of time; and responsive to the likelihood predicted by the prediction engine, copy by a controller data in a page in the second memory to the first memory.

Abstract: A system includes one or more servers, and a plurality of wireless telecommunications devices registered with the system. The servers obtain corresponding client configuration states for at least some of the registered client devices, wherein a client configuration state for a given registered client device includes and/or is based on information about other devices with which the given registered client device can communicate in at least one direction. The servers determine and maintain a virtual representation of at least one hybrid network of gateways and the registered client devices. The servers determine a particular sub-network configuration of a particular sub-network for a particular client device, based on the virtual representation of the at least one hybrid network and on a client configuration state for the particular client device. The particular sub-network comprises at least one path between the one or more servers and the particular client device.

Abstract: Concepts and technologies are disclosed herein for providing and using an accessory setting service. Accessory data can be received from a computing device in communication with an accessory. The accessory data can include a unique identifier associated with the accessory. Based upon the unique identifier, a determination can be made as to whether or not the accessory data relates to a new accessory. If the accessory data does not relate to a new accessory, settings data associated with the accessory can be generated and transmitted to a recipient. If the accessory data relates to the new accessory, accessory settings associated with the accessory can be identified and stored with the unique identifier as accessory settings data.

Abstract: A method includes upon storage of a set of encoded data slices in one or more sets of storage units of a dispersed storage network (DSN), setting, by a computing device of the DSN, a deletion time for the set of encoded data slices and an encoded data slice reduction time for the set of encoded data slices. The encoded data slice reduction time is set at a time prior to the deletion time. Upon expiration of the encoded data slice reduction time, the method further includes implementing an encoded data slice reduction scheme. The encoded data slice reduction scheme includes one or more of: a reduced rebuild operation and an explicit deletion. The explicit deletion includes deleting encoded data slices such that a remaining number of encoded data slices is equal to or exceeds a decode threshold number and is less than a pillar width number.

Abstract: Disclosed herein are an apparatus and method for providing storage for providing a cloud service. The apparatus includes a data distribution and storage unit for distributing data in order to store the data in integrated storage, including on-premises storage and cloud storage; a backend storage management unit for connecting to the integrated storage in order to store the data and providing information about storage tiering pertaining to the data; a data manipulation unit for providing the integrated storage as virtual data storage regardless of a location at which the data is actually stored; and a storage connection unit for providing a user with an interface for the virtual data storage as a single virtual storage unit.

Abstract: An apparatus comprises processing circuitry (4) and an instruction decoder (6) which supports vector instructions for which multiple lanes of processing are performed on respective data elements of a vector value. In response to a vector predication instruction, the instruction decoder (6) controls the processing circuitry (4) to set control information based on the outcome of a number of element comparison operations each for determining whether a corresponding element passes or fails a test condition. The control information controls processing of a predetermined number of subsequent vector instructions after the vector predication instruction. The predetermined number is hard-wired or identified by the vector predication instruction. For one of the subsequent vector instructions, an operation for a given portion of a given lane of vector processing is masked based on the outcome indicated by the control information for a corresponding data element.

Abstract: Resources are loaded into a resource container in an in-memory database system in which pages are loaded into memory and having associated physical disk storage. Each resource is assigned a new time stamp when such resource is loaded into the resource container. At least some of the references are subsequently accessed and time stamps associated with these accesses resources are selectively updated based on the type of access. These time stamps are later used to evict least recently used resources (as indicated by their time stamps) from the resource container.

Abstract: A massively parallel database management system includes an index store and a payload store including a set of storage systems of different temperatures. Both the stores each include a list of clusters. Each cluster includes a set of nodes with storage devices forming a group of segments. Nodes and clusters are connected over high speed links. The list of clusters within the payload store includes clusters of different temperatures. The payload store transitions data of a segment group from a higher temperature to a segment group in a lower temperature cluster in parallel. A node moves data of a segment in the higher temperature cluster to a corresponding node's segment in the lower temperature cluster. Once the data is written in the destination segment in the lower temperature cluster, the source segment is freed to store other data. The temperatures include blazing, hot, warm and cold.

Abstract: Method and apparatus for stress management in a searchable data service. The searchable data service may provide a searchable index to a backend data store, and an interface to build and query the searchable index, that enables client applications to search for and retrieve locators for stored entities in the backend data store. Embodiments of the searchable data service may implement a distributed stress management mechanism that may provide functionality including, but not limited to, the automated monitoring of critical resources, analysis of resource usage, and decisions on and performance of actions to keep resource usage within comfort zones. In one embodiment, in response to usage of a particular resource being detected as out of the comfort zone on a node, an action may be performed to transfer at least part of the resource usage for the local resource to another node that provides a similar resource.

Abstract: A storage system in one embodiment comprises at least one storage array comprising a plurality of storage devices. The storage array is configured to communicate over one or more networks with a plurality of host devices. The storage array is further configured to receive one or more commands from a given one of the host devices directing that a particular user-defined name be assigned to a particular one of the storage devices, and responsive to receipt of the one or more commands, to determine if any other user-defined name is already assigned to the particular storage device, and if there is no other user-defined name already assigned to the particular storage device, to assign the particular user-defined name to the particular storage device and to store information characterizing the assignment of the particular user-defined name to the particular storage device in persistent memory of the storage array.

Abstract: A permission setting register stores therein information indicating whether or not access is to be permitted to each node, per segment of a shared memory. When an abnormality occurs in a node, a permission canceling unit sets, for a segment that the abnormal node has been using, information in the permission setting register, the information corresponding to the abnormal node, to not permit access. When there is an access request from a remote node to a shared memory segment, a checking unit determines, with hardware, whether or not the access is permitted, based on the permission setting register, an access token included in the access request, and a memory token register.

Abstract: An example of a wireless communication system includes a master apparatus and a slave apparatus. Upon receiving a participation request from the slave apparatus, the master apparatus generates an IP address of the slave apparatus, generates an ARP table in which an IP address and a MAC address of the master apparatus are associated with each other and the IP address and a MAC address of the slave apparatus are associated with each other, and transmits the ARP table to the slave apparatus. The slave apparatus stores the received ARP table therein. When transmitting data to the master apparatus, the slave apparatus transmits the data to the master apparatus with reference to the ARP table.

Abstract: An exemplary embodiment of the disclosure provides a data merge method for a memory storage device. The method comprises: performing a data merge operation to store valid data collected from a source node comprising at least one first physical unit to a recycling node comprising a second physical unit. The data merge operation comprises: reading a first data from the at least one first physical unit by a first reading operation; performing a first stage programming operation on the second physical unit according to the first data; reading the first data from the at least one first physical unit again by a second reading operation after the first stage programming operation is performed; and performing a second stage programming operation on the second physical unit according to the first data read by the second reading operation.

Abstract: Embodiments of the present invention provide a method, system and computer program product for the integration of a rules engine with message oriented middleware. In an embodiment of the invention, a method for managing a messaging component in message oriented middleware has been provided. The method includes creating shared memory in the memory of a computer and adding or deleting tokens in the shared memory corresponding to objects such as messages and message queues, created in and removed from, respectively, in a messaging component of message oriented middleware. The method additionally includes applying rules in a rules engine to the tokens in the shared memory. Finally, the method includes directing management operations in the messaging component responsive to the applied rules by the rules engine.

Abstract: Techniques for managing data stored in a hierarchical storage management (HSM) system are provided. A first controller receives a request to migrate a data item to a first storage tier managed by the first controller, wherein the data item is not associated with an object ID and a HSM status value indicates that the data item is resident on a second storage tier. The first controller generates an initial object ID, creates a new record for the data item in a data structure, sets an object ID field and a parent ID field of the record to the initial object ID. The first controller stores the data item on the first storage tier and sends an acknowledgement identifying the initial object ID as an object ID of the data item to a second controller that manages the second storage tier. The second controller updates the HSM status value.

Abstract: A method for execution by a dispersed storage and task (DST) execution unit includes receiving a slice access request for execution by the DST execution unit. At least one ordered codec algorithm is identified. The slice access request is executed by utilizing the at least one ordered codec algorithm. A slice access response indicating an outcome of the slice access request is generated by the DST execution unit.

Abstract: A terminal device includes: a condition checking unit to monitor an operation state of the terminal device by executing a terminal managing program, and determine whether the terminal device is in a state of a preset condition for terminal protection; a communication control unit to control the communication unit to be connected to the terminal management server using the location information when the condition checking unit determines that the terminal device is in a state of the condition for terminal protection, and control the communication unit to send the identification information to the terminal management server; and a lock control unit configured to lock the terminal device by executing the terminal managing program when a lock command is issued by, and received from, the terminal management server.

Abstract: A method, non-transitory computer readable medium, and device that assists with sharing non-volatile memory solid state drives across a cluster group includes receiving a request for a block of storage in a non-volatile memory solid state drive in one of the plurality of non-volatile memory disk shelves. Information associated with each of a plurality of solid state drives in the plurality of non-volatile memory disk shelves associated with the received request is obtained. A namespace for each of the plurality of solid state drives in the plurality of non-volatile memory disk shelves using the obtained information is created. The requested block of storage in the non-volatile memory solid state drive associated with one of the created namespace is assigned to the requesting client computing device.

Abstract: Technologies for addressing data in a memory include an apparatus that includes a memory and a controller. The memory is to store sub-blocks of data in a data table and a pointer table of locations of the sub-blocks in the data table. The controller is to manage the storage and lookup of data in the memory. Further, the controller is to store a sub-block pointer in the pointer table to a location of a sub-block in the data table and store a second pointer that references an entry where the sub-block pointer is stored in the pointer table.

Abstract: A data storage device includes a nonvolatile memory device configured to read and output a plurality of data chunks; and a data processing block configured to perform decoding on the data chunks, the data processing block comprising a sequencer configured to generate a decoding information on the data chunks; and a core circuit configured to perform normal decoding on a first data chunk among the data chunks based on the decoding information, and perform fast decoding on a second data chunk among the data chunks depending on whether a result of the normal decoding satisfies a fast decoding condition, wherein the fast decoding requires a shorter execution time than the normal decoding.