Abstract: Within a social network, a user may establish a set of contacts who share with the user various content items and comments related thereto. However, these content items are often hosted by a content source outside of the social network, and the user may have to transition to the content source to view the content item, and then transition back to the social network to submit a comment. Instead, a device may monitor the social network to record shared content items. When the user requests a presentation of the content source, the content items hosted by the content source that have been shared with the user may be included in the presentation. The presentation of the content source may also accept comments from the user regarding a content item, and send the comments to the social network where the content item was shared with the user.

Abstract: Disclosed are various embodiments for a local networked storage that is linked to a remote networked storage system. In one embodiment, among others, a computing device obtains a request from a client device to read a file stored in a remote networked storage system. The computing device determines whether the file is stored in a local cache. The file is sent to the client device through a local network when the file is stored in the local cache. The computing device obtains the file from the remote networked storage system when the file is not stored in the local cache, where an indication of a user account is provided to the remote networked storage system. The file is sent to the client device in response to the file being obtained from the remote networked storage system.

Abstract: Methods, systems, and computer-readable media for customizable event-triggered computation at edge locations are disclosed. A request for content is received at an edge server from a client device. The content is sought from a content cache at the edge server or from an origin server coupled to the edge server. Processing of the request is initiated, comprising encountering an event. The event is associated with a function specified by a customer. The function associated with the event is executed at the edge server using process isolation. The content is generated based at least in part on execution of the function. The content is sent from the edge server to the client device.

Abstract: A configurable SIMD multiplication circuit is provided to perform multiplication on a multiplicand operand M and multiplier operand R with varying data element sizes supported. For each result element generated based on corresponding elements of the multiplicand operand M and the multiplier operand R, the multiplication is performed according to radix-N modified Booth multiplication, where N=2P and P?3. A Booth digit selection scheme is described for improving the efficiency with which higher radix modified Booth multiplication can be implemented in a configurable SIMD multiplier.

Abstract: Systems, methods, and machine-storage medium for classifying snapshot image processing are described. The system receives read requests to read snapshot information. Each read request includes an offset identifying a storage location and a length. The snapshot information includes snapshots including a full snapshot and at least one incremental snapshot. The read requests include a first read request to read data from the snapshot information. The system generates a first plurality of read events including a second plurality of read events that are generated by processing the first read request. The second plurality of read events includes first and a second read events. The system identifies whether utilizing a cache optimizes the job based on the first plurality of read events.

Abstract: A method for brokering an exchange of data between a backend server, a first client, and a second client is provided. The method can include receiving, from the backend server and/or the first client coupled with the backend server, a message. The response to the receipt of the message can include posting the message to a message queue having a same topic as the message. The message can be posted to the message queue at least by appending the message to a key-value pair corresponding to the message queue. The key-value pair can be stored in the distributed data storage system. The message can be sent to a second client coupled with the backend server based at least on the second client having subscribed to the topic of the message queue. Related systems and articles of manufacture, including computer program products, are also provided.

Abstract: Intelligent data throttling in data movement operations, such as secondary-copy operations in a storage management system. A local throttling manager may intelligently interoperate with co-resident data agents and/or a media agent executing on any given local computing device, whether a client computing device or a secondary storage computing device. The local throttling manager may allocate and manage the available bandwidth for various jobs and their constituent data streams—across the data agents and/or media agent. Effective bandwidth for the secondary-copy operation may be adjusted based on available bandwidth from the computing device due to increased demand for the bandwidth from other operations, such as services that may be hosted on the computing device.

Abstract: Methods, systems, computer-readable media, and apparatuses may provide for the intermediated retrieval of applications on a network. A computing device may be configured to receive an application from an application server on a network. Based on, for example, the network conditions between the computing device and the application server, the computing device may query a plurality of intermediary servers. Based on a decision that, for example, the network conditions between the computing device, application server, and a selected intermediary server are better than the network conditions between the computing device and the application server, the computing device may cause the application to be retrieved by a host application of the selected intermediary server. The host application may process and transmit the application to the computing device. The computing device may display the processed application and transmit user input corresponding to the processed application to the intermediary server.

Abstract: A data protection technique involves, based on a first set of policies on a first storage array, generating a second set of policies on a second storage array to track the first set. The first array maintains a first storage object, and the second array maintains a second storage object as a replica of the first storage object. The technique further includes detecting assignment of the first set of policies to the first storage object and, in response to such detection, assigning the second set of policies to the second storage object. Application of a set of storage policies to a storage object may be delayed if the storage object is a replication destination. A policy group may identify multiple data protection rules or policies, which may include a snapshot rule and/or replication rule, and a user may be prevented from directly making a rule modification to a policy group. An orphan policy group cleanup operation may be performed to delete orphan policy groups.

Abstract: Techniques for processing I/O operations may include: randomly assigning extent identifiers of extents to RAID groups; receiving write activity information for the extents for a sampling period; for each of the RAID groups, performing stream detection processing in accordance with the first write activity information and determining stream groups, wherein each stream group of one of the RAID groups includes extents of the RAID group belonging to a same write stream in the RAID group, wherein stream groups across all RAID groups are uniquely identified using stream group identifiers; tagging a write operation directed to one of the extents with a first stream group identifier denoting a stream group including the one extent; and issuing the write operation to a solid state drive of one of the RAID groups. Stream detection may use K-Means clustering algorithm. An aggregate address range of logical devices is mapped to the extent identifiers.

Abstract: Described herein are techniques for reading data from a distributed storage system and for writing data to a distributed storage system. The disclosed techniques make use of efficient computing task and thread usage to minimize or reduce overhead and improve read or write efficiency. For example, read or write tasks may handle multiple read or write operations instead of just a single operation, which may reduce overhead associated with task creation and termination. Additionally, operations within a single task may be processed in parallel. For example, the disclosed techniques provide MapReduce implementations useful in Apache Hadoop that perform better than previous MapReduce implementations.

Abstract: Methods, systems, and apparatuses are provided for a storage system that implements a hierarchical namespace service. A storage system includes a plurality of physical nodes and a plurality of sets of virtual nodes. Each set of virtual nodes is managed by a corresponding physical node. Each virtual node is configured to manage a respective set of directory blocks. Each directory block is a respective partition of a storage namespace and is managed by a corresponding single virtual node. Each virtual node maintains a directory block map. The directory block map maps file system object names in a hierarchical namespace to entity block identifiers in the flat namespace for entity blocks (files and folders) stored in directories corresponding to the managed set of directory blocks. Load balancing may be performed by moving virtual nodes between physical nodes, and by splitting directory blocks.

Abstract: Embodiments of the present disclosure provide a computer program product, a system and a method for providing access to storage resources by receiving a user selection of one or more of a plurality of source storage resources; establishing corresponding backup storage resources for the selected one or more source storage resources.

Abstract: Embodiments for workload management by aggregating locality information for a set of files in a cluster of hosts, from a file level to a level of the set of files in a cluster of hosts. To facilitate workload scheduling in the cluster, a subset of the set of files is selected. A set of storage size counters, each assigned to a host in the cluster, is reset. An overall storage size counter is reset, and the files in the subset of the set of files are scanned. For each scanned file, locality information of the file is retrieved and added to the storage size counters of the hosts, and a total size of the file is added to the overall storage size counter. An output proportion of the storage size counter of each host is then computed from the overall storage size counter.

Abstract: Described is a framework that manages a clustered, distributed NoSQL data store across multiple server nodes. The framework may include daemons running on every server node, providing auto-sharding and unified data service such that user data can be stored and retrieved consistently from any node. The framework may further provide capabilities such as automatic fail-over and dynamic capacity scaling.

Abstract: In some examples, to define a connection path of an initiator to target ports of a plurality of controller nodes that manage access of data in a storage system, a provisioning system determines loads of respective sets of target ports, and selects a selected set of target ports from among the sets of target ports for inclusion in the connection path based on the determined loads.

Abstract: Systems and methods are disclosed to share comments regarding a content item presented among via different Internet services. For example, a method for sharing comments among Internet services may include presenting a first content item to a plurality of users over the Internet via a first Internet service; receiving at the first Internet service a first comment that is related to the first content item and is received from a user through the Internet; presenting the first comment in conjunction with the first content item via the first Internet service; sending the first comment from the first Internet service to a second Internet service; receiving at the first Internet service a second comment from the second Internet service, wherein the second comment is different than the first comment; and presenting the second comment in conjunction with the first content item via the first Internet service.

Abstract: A method and system for thread aware, class aware, and topology aware memory allocations. Embodiments include a compiler configured to generate compiled code (e.g., for a runtime) that when executed allocates memory on a per class per thread basis that is system topology (e.g., for non-uniform memory architecture (NUMA)) aware. Embodiments can further include an executable configured to allocate a respective memory pool during runtime for each instance of a class for each thread. The memory pools are local to a respective processor, core, etc., where each thread executes.

Abstract: In one embodiment, a processor includes: a core to execute instructions, the core including a plurality of mailbox storages and a trust table to store a trust indicator for each of the plurality of mailbox storages; a first core perimeter logic coupled to the core and including a first storage to store state information of the core when the core is in a low power state; and a second core perimeter logic coupled to the first core perimeter logic and the core, the second core perimeter logic including a second storage to store the state information of the core when the first core perimeter logic is in a low power state. Other embodiments are described and claimed.

Abstract: A method, article of manufacture, and apparatus for managing data. In some embodiments, this includes determining a usage level of a file, wherein the file is stored in a first storage system, moving the file to a second storage system based on the determined usage level of the file updating location information in a catalog based on the movement of the file, and performing at least a portion of a query on the file after updating location information in the catalog.

Abstract: A method is provided, including the following method operations: rendering, by a client device, game title icons in a gaming platform interface to a display device, the game title icons identifying video games that are accessible through the gaming platform interface using the client device; receiving, by the client device, user selection data indicating selection of a game title icon and identifying a corresponding video game for exploration of related Internet content; generating a search query based on the identified video game, transmitting the search query over the network to a search engine, and receiving results of the search query over the network from the search engine, the results identifying Internet content items related to the video game; generating preview images of at least some of the Internet content items; rendering the preview images in association with the identified video game via the gaming platform interface.

Abstract: Methods, computing systems and computer program products implement embodiments of the present invention that include defining a plurality of failure domains for sets of storage devices in a storage facility, and defining, using the failure domains, one or more limitations for distributing data on the storage devices. Upon identifying a data distribution configuration for a software defined storage system that is compliant with the one or more limitations, the identified data distribution configuration can be presented to a user. The failure domains may include physical failure domains, logical failure domains, or a combination of physical and logical failure domains, and the limitations may include mandatory limitations or a combination of mandatory and non-mandatory limitations.

Abstract: A system according to certain aspects improves the process of data restoration and application recovery operations. The system can back up primary data based on network path information associated with a client computing device. When the primary data becomes corrupted or unavailable, a previously backed up copy of the primary data may be used as the primary data to achieve instant application recovery. For example, when a portion of the primary data is requested by a user or an application, the system may identify a corresponding portion in the backed up copy of the primary data and provide the identified portion to the user or the application in a manner transparent to the user or the application. Alternatively, the application running on the client computing device may send a request for the backup copy of the primary data to the secondary storage device upon determining that the requested data is not available.

Abstract: An approach is provided in which an information handling system receives a set of discovery results that correspond to source application services executing in source environments. The information handling system then maps the set of discovery results to a target pattern includes at least one declarative description describing one or more components included in at least one of the one or more source environments. In turn, the information handling system creates a target application service based, at least in part, on the target pattern.

Abstract: A switching device is implemented in a network-attachable data transfer device to provide data storage access to other such devices. In some embodiments, network-attachable data transfer devices are arranged in a clustered configuration to provide various computational and storage services. When one or more devices of the cluster fails, various implementations associated with the switching device, via an external data interface, provide operational mitigation, optimized data recovery, and efficient reinstatement of normal operation of the cluster.

Abstract: In one embodiment, a guest operating system in a host computer receives a write command for a partition in a plurality of partitions of a heterogeneous disk. The heterogeneous disk is mounted in the guest operating system. The guest operating system reads service level agreement level information for the partition and inserts the service level agreement level information in a field of the write command. Then, the write command is sent to a heterogeneous disk layer where the heterogeneous disk layer uses the service level agreement information in the field to select a storage device associated with the service level agreement information.

Abstract: A method for distributed file transfers with high performance and reliability includes creating, on a first Trivial File Transfer Protocol (TFTP) server, a global cache, where the global cache is used to store up to a first portion of a data file. The method further includes storing, on the first TFTP server, in the global cache, one or more continuous data blocks that have exceeded a defined first request rate threshold, where the one or more continuous data blocks make up a subset of the data blocks of the first portion of the data file. The method further includes predicting, on the first TFTP server, a next data block in the data file to be stored in the global cache and in response to predicting the next data block, storing, on the first TFTP server, the next data block in the global cache.

Abstract: A method for distributed file transfers with high performance and reliability includes creating, on a first Trivial File Transfer Protocol (TFTP) server, a global cache, where the global cache is used to store up to a first portion of a data file. The method further includes storing, on the first TFTP server, in the global cache, one or more continuous data blocks that have exceeded a defined first request rate threshold, where the one or more continuous data blocks make up a subset of the data blocks of the first portion of the data file. The method further includes predicting, on the first TFTP server, a next data block in the data file to be stored in the global cache and in response to predicting the next data block, storing, on the first TFTP server, the next data block in the global cache.

Abstract: In one general embodiment, a computer program product for sharing a data management policy with a load balancer comprises a computer readable storage medium having program instructions embodied therewith, wherein the computer readable storage medium is not a transitory signal per se. Additionally, the program instructions are executable by a processor to cause the processor to perform a method comprising analyzing, by the processor, a plurality of data management factors within an object-based storage system, determining, by the processor, a data management policy for predetermined data within the object-based storage system, based on the analyzing, and sharing, by the processor, the data management policy for the predetermined data with a load balancer associated with the object-based storage system.

Abstract: Various embodiments of the present disclosure provide a method for presenting a storage cluster status, comprising: in response to a request for monitoring a first target node in a storage cluster, monitoring whether a configuration status of the first target node is changed; and in response to the configuration status of the first target node being changed, presenting changed configuration status information of the first target node to the user.

Abstract: A system, article, and method of rendering late or early audio-video frames.

Abstract: A compute server receives, at a first compute server of a plurality of compute servers, a request from a client device, where the plurality of compute servers are part of a distributed cloud computing platform, and wherein the request is a request for a network resource. The compute server executes, by a single process at the first compute server, a nonce generator, wherein the nonce generator is run in a one of a plurality of isolated execution environments, locates at least one content item in response to the request for the network resource, detects a first nonce value in the at least one content item, computes a second nonce value by the nonce generator, and replaces the first nonce value with the second nonce value in the content item.

Abstract: A data storage device can have at least a buffer memory, a selection module, and a non-volatile memory. The buffer memory and non-volatile memory may consist of different types of memory while the non-volatile memory has one or more rewritable in-place memory cells. The buffer memory and non-volatile memory may each store data associated with a pending data request as directed by the selection module until a settle time of the rewritable in-place memory cell has expired.

Abstract: The invention provides a system and method for file synchronization. One embodiment of the system of this invention includes a software program stored on a computer readable medium. The software program can be executed by a computer processor to receive a file from a server; store the file as a cached file in a cache; determine if the cached file has been modified; and if the cached file has been modified, communicate the cached file directly to the database.

Abstract: A technique for facilitating file system operations in a data storage system provides multiple version family databases. Each version family database identifies members of a respective version family, i.e., a respective set of files in a file system that are related by file snapping. When a snap of a file is created, the file system updates a version family database for the version family that includes the file, such that the version family database identifies both the file and the snap.

Abstract: Embodiments of the present disclosure provide a method and device for storage management. The method comprises receiving at a storage management device a configuration request for a storage space managed by the storage management device, the configuration request indicating a capacity of the storage space and a target size of a chunk in the storage space; and based on the capacity and the target size, dividing the storage space into a metadata region storing a chunk status indicator indicating whether the chunk is assigned with data and a data region including the chunk with the target size. Embodiments of the present disclosure also provide a corresponding device.

Abstract: A method for optimizing scheduler selection by a distributed storage (DS) unit of a dispersed storage network (DSN) begins with a DS unit receiving a dispersed storage error function from a DSN user and queries DS elements to determine measured throughput and measured latency. The method resumes when the DS unit receives measured throughput and measured latency from the DSN elements and selects a scheduler based on the measured throughput and measured latency. The method continues with the DS unit receiving a different updated measured throughput and measured latency from the DSN elements and selecting a different scheduler.

Abstract: Described is an information sharing method and apparatus, which are directed to information published by a user in a social network. For information published by a user in a social network, when a sharing instruction of the user is received, a selection box comprising one or more sharing targets is displayed for the user, each sharing target has its corresponding social network, and the social network corresponding to the sharing target includes a social network which published the information; when a submission instruction of the user is received, the information is sent to a sharing target selected by the user from the selection box. By using the present method, the spread of information can be accelerated, and the implementation is simple and convenient.

Abstract: Systems, methods and devices are provided to alert a user of content delivered on multiple channels to events of interest occurring on channels other than the channel being listened to or viewed. Playback of content in which an event of interest or key event has occurred is time-shifted or delayed at the content transmission source or at the user device. Metadata that identifies events of interest in the content is transmitted to the user device. The user device generates alerts to the user based on the metadata in sufficient lead time to enable the user to not only tune to a channel on which an event of interest is occurring, but to do so sufficiently in advance of an event of interest so as to hear and/or see relevant portions of the content leading up to and/or following such an event.

Abstract: Methods and systems for Ethernet fabric protection in a disaggregated OTN switching system that include PIU modules each having multiple ports for OTN to Ethernet transceiving and an Ethernet fabric as a switching core are disclosed. An OTN over Ethernet module in each of the PIU modules may enable various OTN functionality to be realized using the Ethernet fabric which may include multiple Ethernet fabric planes. A PIU module may transmit Ethernet packets using a first working port over a first Ethernet fabric plane and may transmit Ethernet packets using a second working port over a second Ethernet fabric plane. When the PIU module detects a fault condition on the second Ethernet fabric plane, the PIU module may transmit Ethernet packets using a third protection port over the first Ethernet fabric plane instead of using the second working port.

Abstract: An information processing method includes: performing rendering on a graphical user interface to obtain at least one virtual resource object; when detecting a skill-release trigger gesture on at least one skill object, performing rendering to obtain a skill-release supplementary control object, having a skill-release control halo object and a virtual joystick object; when detecting a dragging operation on the virtual joystick object, controlling a skill-release location of the skill object to be correspondingly adjusted; and determining whether the virtual joystick object is out of a threshold range and, when the virtual joystick object is not out of the threshold range, selecting a target character object satisfying a first preset policy from at least one character object within a skill releasable range of the skill object according to a detected release operation of the dragging operation, and performing a skill-release operation on the target character object.

Abstract: A performance-based storage service level agreement (SLA) can be established that specifies one or more storage performance parameters. A storage allocation process can include receiving a request for a storage SLA that specifies one or more storage performance parameters, determining, for a virtual machine (VM) and based at least in part on the one or more storage performance parameters in the storage SLA: (i) a storage location among a set of candidate storage locations, and (ii) an amount of storage to allocate. The amount of storage can then be allocated at the storage location for the VM to use in making storage requests. Runtime enforcement of the storage SLA can utilize a scheduling mechanism that buffers individual storage requests into different queues that are used for meeting one or more storage performance requirements specified in storage SLA.

Abstract: With an idempotent POST request, the URL (and headers) cannot be used as an HTTP cache key. To cache idempotent POST requests, the POST body is digested and appended the URL with the digest and used as the cache key. Subsequent requests with the same payload will end up hitting the cache rather than the origin server. A forward cache proxy at the client end and reverse cache proxy at the server end are deployed. The client sends the request to the forward proxy that looks up the cache. If there is a cache miss, the forward cache proxy digests the body and sends only the digest to the reverse proxy. The reverse cache proxy looks up request cache to find if there is a match for the request and send that request to the server.

Abstract: Systems for managing shared entities between computing clusters while avoiding race conditions. Multiple clusters are interconnected over a network. When a node of a cluster intends to move a shared data item or virtual machine from its cluster to another cluster, the movement or migration can be initiated by establishing sole ownership followed by a request to an arbiter to intermediate during the movement or migration. The request explicitly includes subject entity metadata that describes sharing states pertaining to the subject entity. Upon granting a request, the arbiter generates a master copy of the entity metadata and grants itself read-write access. Any other sharers of the subject entity observe read-only access while the arbiter maintains the sole master copy. A sharer of the subject entity can cause changes to the subject entity through the arbiter. The arbiter can pass ownership to a new cluster to complete the subject entity migration.

Abstract: A method writes a data block from a client application onto object storage. Object storage receives a write request with a data block over an API from a coupling server, the data block being an update to a target file stored within object storage. Next, object storage receives a completion request from the coupling server for the target file. Then, object storage receives a final manifest from the coupling server, the final manifest includes for each data block of the target file an identifier for said data block, a start location, an end location or a size, and a unique identifier for the data block; the manifest has the data blocks ordered by positions in the target file. Finally, object storage assembles of new version of the target file using the final manifest, the received data block and other data blocks of the target file, and writes a new version into object storage.

Abstract: Certain embodiments described herein are generally directed to processing domain objects in a distributed system using logical sharding. In some embodiments, a central control plane (CCP) node receives a domain object. In some embodiments, if the CCP node determines that the domain object is not already present in a shared data store and that the CCP node is the logical master of the domain object, the CCP node generates a status based on the domain object, and stores the status and domain object in the shared data store. In some embodiments, the shared data store notifies the plurality of CCP nodes of the stored status and domain object.

Abstract: A computer program product, system, and method for receiving an I/O from a host; at a first splitter, adding metadata for the I/O to a backlog; and at a second splitter, sending the I/O to both a storage array and to a data protection appliance (DPA). In some embodiments, the first splitter is located at the host and both the DPA and the second splitter is located within the storage array.

Abstract: A server computer comprising an Input/Output (I/O) adapter device and a host device receives I/O requests for transactions from a client computer via a network. According to various embodiments, the host device can offload certain data processing for storing payload data for the transactions to the I/O adapter device. The I/O adapter device can perform data mirroring or data striping on the payload data and can send the mirrored or striped data for storing in the plurality of storage volumes. The plurality of storage volumes can include one or more remote storage volumes and/or one or more local storage volumes.

Abstract: Data stores may implement prioritized scheduling of data store access requests. When new access requests are received, the new access requests may be scheduled for prioritized execution on processing resources. Access requests that are currently being executed with prioritized execution may be reprioritized to make additional capacity for prioritized execution of the new access requests. Prioritized execution may be automatically enabled or disabled for a data store based on monitoring of performance metrics for executing access requests.

Abstract: A distributed file system that includes multiple computing node tiers. Each of at least some of the multiple computing node tiers has multiple computing nodes having like characteristics. The distributed file system also has an executable component in the form of a distribution component that comprises logic that distributes state of file system entities amongst the computing node tiers. The distribution is performed so that latency of file system requests are reduced due to state responsive to many requests being much closer latency wise to the file system requestor(s). Furthermore, the distribution considers durability guarantees of the state, thereby meeting durability guarantees.