Patent classifications
G06F9/544
Data tiering service with cold tier indexing
A tiering service that supports cold tier indexing includes a warm tier and a cold tier and a resource manager that automatically relocates data items between the warm tier and the cold tier or removes data items from the cold tier in accordance with a tiering policy. The tiering service also includes a client interface configured to receive a request specifying index criteria for a cold tier index to be created. The tiering service generates a cold tier index based on data items stored in cold tier flat files satisfying the index criteria included in the request to create a cold tier index. Also, the tiering service automatically updates the cold tier index after it is stored in the cold tier as data items are relocated between the warm tier and the cold tier or removed from the cold tier in accordance with the tiering policy. In some embodiments, the tiering service also provides a common interface for accessing the cold tier index and a warm tier index.
System and method for validating in-memory integrity of executable files to identify malicious activity
A malicious code detection module identifies potentially malicious instructions in volatile memory of a computing device before the instructions are executed. The malicious code detection module identifies an executable file, including an .exe file, in memory, validates one or more components of the executable file against the same file stored in non-volatile storage, and issues an alert if the validation fails.
System and method for recording transaction associated with a page-oriented non-volatile memory
A transaction recording method associated with a page-oriented non-volatile memory is disclosed. The method includes identifying page requiring one or more update for implementing a defined transaction. Further, the method includes replicating the page in a non-volatile buffer. The method further includes updating the identified page with the transaction contents. The transaction is committed if the page is updated without interruption else the entire transaction is rolled-back.
TECHNOLOGIES FOR OFFLOADING ACCELERATION TASK SCHEDULING OPERATIONS TO ACCELERATOR SLEDS
Technologies for offloading acceleration task scheduling operations to accelerator sleds include a compute device to receive a request from a compute sled to accelerate the execution of a job, which includes a set of tasks. The compute device is also to analyze the request to generate metadata indicative of the tasks within the job, a type of acceleration associated with each task, and a data dependency between the tasks. Additionally the compute device is to send an availability request, including the metadata, to one or more micro-orchestrators of one or more accelerator sleds communicatively coupled to the compute device. The compute device is further to receive availability data from the one or more micro-orchestrators, indicative of which of the tasks the micro-orchestrator has accepted for acceleration on the associated accelerator sled. Additionally, the compute device is to assign the tasks to the one or more micro-orchestrators as a function of the availability data.
INFORMATION PROCESSING APPARATUS, AND METHOD OF CONTROLLING COMMUNICATION BETWEEN CONTAINER AND PROCESS IN THE INFORMATION PROCESSING APPARATUS
An information processing apparatus including at least one container and at least one process, stores a communication method in association with a container or a process of a transmission source and a container or a process of a transmission destination, and has a communication unit that controls communication between the container and the process. The communication unit receives, from a container or a process of a transmission source, data including transmission source information indicating the transmission source, transmission destination information and communication data, references the stored communication method and obtains a communication method of the communication data on the basis of the received transmission source information and the received transmission destination information, and transmits, to a container or a process of the transmission destination, the communication data according to the obtained communication method.
DETECTING AND MANAGING LOSSES OF EVENT DATASETS IN A COMPUTING NETWORK
Losses of event datasets in computing networks can be detected and managed according to some examples. One example can include a system that can identify a slot among a group of slots of a ring buffer in which to store an event dataset. The system can determine a sequence number to associate with the event dataset. The system can then write the sequence number in a first predefined area of the slot of the ring buffer. Additionally, the system can initiate a write process for writing the event dataset in a second predefined area of the slot of the ring buffer, the second predefined area being separate from the first predefined area. The system can detect a completion of the write process and, in response to detecting the completion of the write process, include a write-completion indicator in the first predefined area.
Data processing system
A data processing system has a poll mode driver and a library supporting protocol processing. The poll mode driver and the library are non-operating system functionalities. An application is provided. An operation system is configured while executing in kernel mode and in response to the application being determined to be unresponsive, use a helper process being an operating system functionality executing at user-mode to cause a receive or transmit mode of the application to continue.
Relocation and persistence of named data elements in coordination namespace
An approach is disclosed that relocates a named data element. A request to move a name corresponding to the named data element is received from a first storage area in a Coordination Namespace to a second storage area in the Coordination Namespace. The first storage area has a first level of persistence, and the second storage area has a second level of persistence. The named data element exists in a Coordination Namespace that is allocated in a memory distributed amongst a plurality of nodes that include the local node and one or more remote nodes. The approach then creates a copy of the named data element in the second storage area.
Incremental build system using an inferred dependency graph collected with a system monitor
Disclosed are servers, software, systems, media, and methods for performing automated software tests by executing incremental software builds that skip unnecessary steps based at least in part on a dependency graph generated via tracking system calls during an initial software build, discovering dependencies based on resources accessed, and correlating dependencies with steps of the initial software build.
Data pipeline using a pluggable topology connecting components without altering code of the components
A method, a system, and a computer product for connecting computing components are disclosed. One or more data input and output properties of a data processing component in a plurality of data processing components are determined. At least one of the data input properties and data output properties of the data processing component are configured for connection of the data processing component to another data processing component in the plurality of data processing components in the data processing pipeline using a predetermined data pipeline connection topology. Using the predetermined data pipeline connection topology, the data processing component and another data processing component are dynamically connected using the configured properties.