Abstract: Described herein are systems and methods for implementing a processor-local (e.g., a CPU-local) storage mechanism. An exemplary system includes a plurality of processors executing an operating system, the operating system including a processor local storage mechanism, wherein each processor accesses data unique to the processor based on the processor local storage mechanism. Each of the plurality of processors of the system may have controlled access to the resource and each of the processors is dedicated to one of a plurality of tasks of an application. The application including the plurality of tasks may be replicated using the processor local storage mechanism, wherein each of the tasks of the replicated application includes an affinity to one of the plurality of processors.

Abstract: The present disclosure relates to a method and system for executing processes in Virtual Storage Area Network by an array controller. The array controller receives a request for executing a process in VSAN, calculates a time duration for execution of the received process, compares calculated time duration with a predefined time duration, where the received process is divided into a first part and a second part if the calculated time duration exceeds the pre-defined time duration, executes the first part of the received process and assigns the second part of received process to a management server for execution, where the management server comprises a plurality of processing units dedicated for executing the second part of the received process.

Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. The program receives a notification from a java virtual machine indicating that an amount of free memory associated with the java virtual machine is less than a first threshold amount of memory. In response to the notification, the program further transitions from operating in a non-low-memory stat to operating a low-memory state. The low-memory state includes decreasing an amount of memory used by a set of components in a plurality of components of an application operating on the java virtual machine in order to increase the amount of free memory associated with the java virtual machine. The program also determines that the amount of free memory associated with the java virtual machine is greater than a second threshold amount of memory. In response to the determination, the program further transitions from operating in the low-memory state to operating in the non-low-memory state.

Abstract: A method and an apparatus that execute a parallel computing program in a programming language for a parallel computing architecture are described. The parallel computing program is stored in memory in a system with parallel processors. The parallel computing program is stored in a memory to allocate threads between a host processor and a GPU. The programming language includes an API to allow an application to make calls using the API to allocate execution of the threads between the host processor and the GPU. The programming language includes host function data tokens for host functions performed in the host processor and kernel function data tokens for compute kernel functions performed in one or more compute processors, e.g., GPUs or CPUs, separate from the host processor.

Abstract: Ensuring the fair utilization of system resources using workload based, time-independent scheduling, including: determining whether an amount of system resource utilization in the storage system has reached a predetermined utilization threshold; and responsive to determining that the amount of system resource utilization in the storage system has reached a predetermined utilization threshold: determining whether one or more entities in the storage system have utilized system resources in excess of their fair share by a predetermined threshold during a time-independent period; and responsive to determining that one or more entities in the storage system have utilized system resources in excess of their fair share by the predetermined threshold during the time-independent period, freezing, at least partially, an amount by which the one or more entities in the storage system have utilized system resources in excess of their fair share.

Abstract: Methods, systems, computer-readable media, and apparatuses for query-based interest in a simulation are presented. Entities may be simulated on workers, and each entity may comprise one or more components. A simulation system may run bridges on one or more machines, and the bridges may be configured to facilitate data communications between the workers and one or more entity databases. Each worker may be assigned to a different bridge. The system may modify one or more entities to include an interest component, and the interest component may indicate a query subscription to the one or more entity databases, which may affect the communication between bridges and workers. The interest component may also or alternatively indicate a frequency for receiving, from the one or more entity databases, updates for the query subscription.

Abstract: According to one embodiment of the present disclosure, there is provided a processing method including obtaining parallelized unit information for video parallel processing; obtaining performance information that indicates performance of a plurality of cores; and allocating a plurality of video unit data to the plurality of cores based on the parallelized unit information and the performance information. The parallelized unit information includes complexity information that indicates complexity of the plurality of video unit data.

Abstract: This document describes methods, systems and computer program products related to cloud-based rendering. The subject matter of this document is embodied in a method that includes receiving, at a server, information associated with a job of rendering one or more frames at the server, and using, at the server, an application to perform at least a portion of the rendering. The use of the application to perform the rendering bears a charge according to a usage license associated with the application. The method also includes measuring, at the server, an amount of use of the application in performing the rendering for use in determining the charge.

Abstract: Given a current configuration of virtual node groups in a computing cluster and a new configuration indicating one or more changes to the virtual node groups, a cluster manager generates a reconfiguration plan to arrange virtual nodes into the desired virtual node groups of the new configuration while minimizing a number of virtual nodes to be moved between physical nodes in the computing cluster.

Abstract: A hypervisor-based virtual machine isolation apparatus and method. The hypervisor-based virtual machine isolation method performed by the hypervisor-based virtual machine isolation apparatus includes when a hypervisor starts to run virtual machines, allocating one or more colors to each of the virtual machines, allocating a page frame corresponding to the allocated colors to the corresponding virtual machine, allocating an accessible core depending on the colors of the virtual machine, and performing isolation between virtual machines corresponding to an identical color by changing a temporal/spatial scheduling order between the virtual machines corresponding to the identical color.

Abstract: A circuit arrangement and program product for dynamically providing a status of a hardware thread/hardware resource independent of the operation of the hardware thread/hardware resource using an inter-thread communication protocol. A master hardware thread may be configured to communicate status requests to associated slave hardware threads and/or hardware resources. Each slave hardware thread/hardware resource may be configured with hardware logic configured to automatically determine status information for the slave hardware thread/hardware resource and communicate a status response to the master hardware thread without interrupting processing of the slave hardware thread/hardware resource.

Abstract: Methods, systems, and computer-readable media for job scheduling based on job execution history are disclosed. A request is received to schedule a workload comprising a plurality of jobs. A resource allocation score for the workload is determined. The resource allocation score represents (at least in part) an estimated likelihood of successful execution of the workload. A first portion of the workload is scheduled for execution, and a remaining portion (if any) of the workload is delayed. A quantity of jobs in the first portion of the workload is determined based (at least in part) on the resource allocation score. Execution of the first portion of the workload is initiated.

Abstract: Techniques minimize communication while loading a graph. In a distributed embodiment, each computer loads some edges of the graph. Each edge connects a source vertex (SV) to a destination vertex. For each SV of the edges, the computer hashes the SV to detect a tracking computer (TrC) that tracks on which computer does the SV reside. Each computer informs the TrC that the SV originates an edge that resides on that computer. For each SV, the TrC detects that the SV originates edges that reside on multiple providing computers (PCs). The TrC selects a target computer (TaC) from the multiple PCs to host the SV. The TrC instructs each PC, excluding the TaC, to transfer the SV and related edges that are connected to the SV to the TaC. A vertex's internal identifier indicates which computer hosts the vertex. The TrC maintains a mapping between external and internal identifiers.

Abstract: Managing real-time monitoring alerts is provided. An alert is generated for one or more metrics exceeding corresponding defined metric threshold values. A root cause dependency table showing relationships between alerts is retrieved. It is determined whether current real-time metrics are needed from one or more monitoring agents that correspond to dependent alerts not triggered in an alert chain of the generated alert based on information in the root cause dependency table. In response to determining that the current real-time metrics are needed from the one or more monitoring agents that correspond to the dependent alerts not triggered in the alert chain of the generated alert based on the information in the root cause dependency table, the current real-time metrics are requested from the one or more monitoring agents that correspond to the dependent alerts not triggered in the alert chain.

Abstract: A computer-implemented method includes receiving, from a first log agent, a first log collection. The computer-implemented method further includes receiving a first policy, wherein the first policy includes a definition of a first pattern and a definition of a procedure. The computer-implemented method further includes scanning the first log collection against the first policy to determine a match between a portion of the first log collection and the first pattern, with the matching portion of the first log collection being identified as a first data artefact. The computer-implemented method further includes, responsive to identifying the first data artefact, executing the procedure defined by the first policy, wherein the procedure includes: filtering the first log collection to yield a first group of filtered log entries, receiving a first data collection, and sending the first group of filtered log entries and the first data collection to a recipient system.

Abstract: The present invention provides a response message processing method, apparatus, and system, and relates to the communications field. The method includes: sending, according to a device identifier sent by a request device, a query request to a destination device corresponding to the device identifier, so that the destination device returns a response message according to the query request; generating substitution data when an error occurs in the response message, where the substitution data is associated with resource data requested by the query request and is used to substitute for the resource data requested by the query request; and sending response substitution information to the request device, where the response substitution information includes the substitution data and the device identifier.

Abstract: A method for execution by an integrity processing unit includes detecting a storage error associated with storage of at least one encoded data slice in at least one memory of an associated storage unit of a set of storage units. Error parameters associated with the storage error are determined and a plurality of recovery alternatives to abate the storage error are identified based on the error parameters. A plurality of cost-benefit factors that correspond the plurality of recovery alternatives are determined. One of the plurality of recovery alternatives is selected based on the plurality of cost-benefit factors, and execution of the one of the plurality of recovery alternatives is facilitated to abate the storage error.

Abstract: Detecting equipment failure risk in industrial process may include distributing equipment operations data to a cluster of nodes based on a range of time and operation specified in maintenance data associated with the equipment. From a record entry in the maintenance data, an operation, installation and maintenance time may be determined. A plurality of nodes storing equipment operations data associated with the operation during a time range between the installation and the maintenance time are selected. Operation features may be determined by distributed processing operation in the plurality of nodes. The operation features are aggregated and added as an entry in a target table. Equipment failure risk is detected by risk failure analysis performed based on the target table. A signal may be sent to automatically adjust or correct one or more operation features.

Abstract: The present invention relates to a method for transmitting device-specific data over a data transmission system to a plurality of devices connected to the data transmission system. In one step of the method, a broadcast announcement identified with a broadcast identifier is sent to the devices over the data transmission system. An individual device indicator and the broadcast identifier are assigned to each one of the devices. The individual devices are put in a state of readiness to receive the device-specific data after the broadcast announcement has been received. Data reception readiness confirmations are transmitted by the individual devices after the respective device has reached the state of readiness to receive the device-specific data. According to the invention, there is a joint transmission of the device-specific data over the data transmission system to the devices after the devices have transmitted the data reception readiness confirmations.

Abstract: A storage aware memory controller for managing a physical storage system. A described controller: a system for mapping physical memory space into a memory region and a storage region; a system for applying different error protections schemes, in which a fine-grained memory fault tolerance scheme is applied to data in the memory region and a course-grained memory fault tolerance scheme is applied to data in the storage region; and a storage file system that includes a mapping table for mapping logical addresses to physical addresses for data stored in the storage region.

Abstract: A decoding method for a memory storage device including a rewritable non-volatile memory module is provided according to an exemplary embodiment of the invention. The method includes: reading at least one memory cells by using at least one read voltage level to obtain a codeword; performing a parity check operation on the codeword by an error checking and correcting circuit to generate a syndrome sum corresponding to the codeword; and dynamically adjusting a first parameter used by the error checking and correcting circuit in a first decoding operation based on whether the syndrome sum is less than a first threshold value and performing the first decoding operation on the codeword by the error checking and correcting circuit by using the first parameter.

Abstract: A method for execution by a dispersed storage and task (DST) processing unit that includes a processor includes receiving a storage request from a user device via a network, where the storage request indicates a data object for storage in a distributed storage network (DSN) and a licensing identifier associated with the data object. Encoded data slices are generated by utilizing a dispersed storage error encoding scheme. Storage requirement data is generated based on the licensing identifier, indicating unique instance numbers corresponding to each of the encoded data slices. A plurality of write requests are generated, each corresponding to one of the encoded data slices and each for transmission to one of the storage units via the network. Each write request indicates a number of unique writes of a corresponding encoded data slice to a storage unit based on the corresponding unique instance number indicated by the storage requirement data.

Abstract: A computer system for optimizing bandwidth usage within a cloud storage system receives a request, through an application program interface (API), to store a digital file. The computer system then encodes the digital file into a set of multiple distinct blocks of data. The system also transmits the set of multiple distinct blocks of data to multiple remote storage nodes. The multiple distinct blocks of data are divided among at least a portion of the remote storage nodes. The system generates a log that comprises identification information associated with the digital file and an address for each respective block of data within each respective remote storage node. The system then transmits the log to a remote directory server. The directory server comprises multiple different logs that map multiple different digital files to the remote storage nodes.

Abstract: A method for execution by a computing device includes generating a data segment to include a first data object for storage and a plurality of null data objects. The data segment is dispersed storage error encoded to produce a set of encoded data slices that includes a first encoded data slice that corresponds to the first data object, a plurality of null slices corresponding to the null data objects, and a remaining number of error coded slices. Storage of the set of encoded data slices in a set of storage units is facilitated. Storage of a second data object is facilitated, where one null data object is overwritten with the second data object. A partial contribution of the second data object is calculated for each of the error coded slices in accordance with a partial encoding approach. Each error coded slice is updated by utilizing the corresponding partial contribution.

Abstract: A data storage service stores a dataset on a set of storage nodes in accordance with a first encoding. A set of shards constituting quorum, and one or more additional shards, are stored on the storage nodes. The data storage system determines to store the dataset according to a second encoding, in which the second encoding has a greater number of shards. The data storage system reconfigures the storage of the dataset in accordance with the second encoding, such that the reconfigured storage forms additional shards for the second encoding by combining portions of shards of the first encoding.

Abstract: An electronic device with reliable restart function includes a central processing unit (CPU), a complex programmable logic device (CPLD), and a platform controller hub (PCH). The CPU also outputs a trigger signal when a serious error occurs in the electronic device. The CPLD obtains the trigger signal from the CPU, and delays the trigger signal for a first preset time. The PCH chip obtains the trigger signal delayed by the CPLD, and controls the electronic device to perform a system restart according to the trigger signal.

Abstract: A method for managing container images in a container hosting environment, comprising a set of machine nodes for hosting container images, comprises the following steps. At a machine node of the set of machine nodes, at least one image layer of a container image comprising multiple image layers is identified for compaction. The identified image layer is compacted by merging data of the identified layer with data of another image layer of the container image. The data of the compacted image layer is transmitted to a backup store remote from the machine node for storage. The set of machine nodes and the backup store are implemented via processing devices operatively coupled via a communication network to form the container hosting environment. The compacted image layer may then be recovered from the backup store.

Abstract: A media agent is configured to perform substantially autonomously to initiate, continue, and manage information management operations such as a backup job of a certain client's primary data, manage the operations, and generate and store resultant system-level metadata from the operations, etc. The media agent is configured to do this even when out of communication with the storage manager that manages the information management system. When communications are restored, the media agent reports the relevant metadata to the storage manager such that the storage manager may seamlessly integrate the information into its management information infrastructure.

Abstract: In certain embodiments, a tiered storage system is disclosed that provides for failover protection during data backup operations. The system can provide for an index, or catalog, for identifying and enabling restoration of backup data located on a storage device. The system further maintains a set of transaction logs generated by media agent modules that identify metadata with respect to individual data chunks of a backup file on the storage device. A copy of the catalog and transaction logs can be stored at a location accessible by each of the media agent modules. In this manner, in case of a failure of one media agent module during backup, the transaction logs and existing catalog can be used by a second media agent module to resume the backup operation without requiring a restart of the backup process.

Abstract: In a deduplicated microservices-based storage system and method running in a cloud includes frontend and backend microservice nodes that process requests from a plurality of clients and interface with a master node and one or more worker nodes connected as a network for deduplicating, storing and retrieving data from object storage, a worker node receives queries and fingerprints for data segments of a data similarity group to be deduplicated, obtains and returns the similarity group from its cache or from object storage using a key. The system compares the received fingerprints to stored fingerprints to determine non-duplicates for deduplication. The worker node updates similarity groups in its cache and in a write-ahead log with a reference to a compression region of non-duplicate segments, and periodically writes modified objects from its cache to object storage.

Abstract: A method for handling of open transactions in a data replication environment. The method includes querying one or more tables of a source database to determine a first open transaction associated with the one or more tables of the source database. The method further includes determining a database user that initiated the first open transaction. The method further includes querying one or more tables of the target database corresponding to the one or more tables of the source database associated with the first open transaction, to determine whether the database user has access privileges for the one or more tables of the target database and dynamically skipping replication of the first open transaction to the target database, such that the data replication system no longer waits for the first open transaction to complete.

Abstract: A computer implemented method is provided for determining a delay between a first database and an associated replicated database by replicating transactions of the first database in the replicated database, determining a delay between the two databases based on a commit timestamp from the first database and a timestamp associated with the commit transaction becoming visible in the replicated database. Then, after a predefined period of time has elapsed since replicating the commit transaction, determining a second delay based on a timestamp associated with a heartbeat log and a replicated database system time. And, selectively determining to execute or deny a statement received by the replicated database based on the second delay. Related apparatus, systems, techniques and articles are also described.

Abstract: Migrating applications executing on a storage system, including: detecting, by the storage system, that an application executing on a first platform within the storage system should be migrated to a second platform within the storage system; rejecting, by the storage system, all pending input/output (‘I/O’) requests received by the storage system from the application executing on the first platform; and initiating, by the storage system, execution of the application on the second platform.

Abstract: A computer-implemented method to store data may include writing data to at least one of a database or one or more local storage devices. The method may also include generating redundancy information for the data. The method may also include writing the redundancy information to at least one of a remote storage device or a removable storage device.

Abstract: Compare points are detected in a multi-threaded computing environment. One thread of the multi-threaded computing environment has reached a compare point for the one thread. The compare point for the one thread being a point at which results of executing a test case on the one thread is ready to be compared against expected results for that test case. A determination is made as to whether another thread of the multi-threaded computing environment has reached a compare point for the another thread. Execution of the another thread is continued, based on determining the another thread has not reached the compare point for the another thread. The test case of the one thread is, however, not re-executed.

Abstract: A method of simulating device state changes in an integrated system includes receiving a transaction request from a client device, storing the transaction request as a first event in an event log, transmitting the transaction request to a terminal device, storing the transmission of the transaction request as a second event in the event log, receiving a device response from the terminal device, storing the device response as a third event in the event log, and when the integrated system is under test, a simulator replays the stored events in the integrated system under test.

Abstract: A cluster of computer system nodes share direct read/write access to storage devices via a storage area network using a cluster filesystem. At least one trusted metadata server assigns a mandatory access control label as an extended attribute of each filesystem object regardless of whether required by a client node accessing the filesystem object. The mandatory access control label indicates the sensitivity and integrity of the filesystem object and is used by the trusted metadata server(s) to control access to the filesystem object by all client nodes.

Abstract: Diagnostic operations upon a target apparatus 2 having a target transaction master 8 which initiates memory transactions with one or more target transaction slaves 12, 14, 16 are provided by halting operation of the target transaction master 8 while permitting continued operation within the target apparatus 2 of at least some of the target transaction slaves 12, 14, 16. Opening state data representing an operating state of the target transaction master 8 is transferred to a model transaction master 32. Further operation of the target transaction master 8 is emulated using the model transaction master 32 using the opening state data. Diagnostic operations are performed upon the model transaction master 32. When the model transaction master 32 emulates initiation of a memory transaction with a memory address mapped to one of the target transaction slaves 12, 14, 16, this initiates the memory transaction to be performed with the target apparatus 2.

Abstract: A computer receives data from a storage device. The computer identifies a state value of the storage device and at least one maintenance task included in the received data. The computer generates a set of instructions for limiting the workload of a storage device executing maintenance tasks. According to the generated instructions, the computer limits the workload placed on the storage device.

Abstract: Techniques described herein generally relate to a task management system for a chip multiprocessor having multiple processor cores. The task management system tracks the changing instruction set capabilities of each processor core and selects processor cores for use based on the tracked capabilities. In this way, a processor core with one or more failed processing elements can still be used effectively, since the processor core may be selected to process instruction sets that do not use the failed processing elements.

Abstract: A method, a system, and a computer program product for monitoring of software applications are disclosed. A request for data associated with a software application is received. Based on the received request, a monitoring agent is injected in a response data. The response data is responsive to the received request. Using the monitoring agent, at least one transaction implementing the response data is monitored. The transaction is executed by the software application. Data associated with execution of the transaction is collected based on the monitoring.

Abstract: Apparatuses and methods for address detection are disclosed herein. An example apparatus includes an address filter and an address tracking circuit. The address filter may be configured to receive a first address and to determine whether the first address matches an address of a plurality of addresses associated with the address filter. The address tracking circuit may be coupled to the address filter and configured to store the first address responsive to a determination that the first address matches an address of the plurality of addresses associated with the address filter. The address tracking circuit may further be configured to receive a second address and to change a count associated with the first address based on the second address matching the first address. The address tracking circuit may be configured to selectively provide the first address responsive to the count.

Abstract: In one embodiment, a processor comprises a fabric interconnect to couple a first cache agent to at least one of a memory controller or an input/output (I/O) controller; and a first cache agent comprising a cache controller coupled to a cache; and a trace and capture engine to periodically capture a snapshot of state information associated with the first cache agent; trace events to occur at the first cache agent in between captured snapshots; and send the captured snapshots and traced events via the fabric interconnect to the memory controller or I/O controller for storage at a system memory or storage device.

Abstract: Technologies for execution trace with automatic event triggering include a computing device that includes an execution trace hub. The trace hub observes execution trace packets and determines whether the execution trace packets match one or more event trigger rules. If an execution packet matches an event trigger rule, the trace hub invokes an event callback. The event callback may be a predefined hardware function of the computing device or a software function. The trace hub may be configured with event trigger rules and associated event callbacks, for example by writing to one or more corresponding configuration space registers. In response to invoking the event callback, the computing device may, for example, output state information of the computing device to a data storage device, halt execution, activate a debug mode of the processor, or execute a software recovery function. Other embodiments are described and claimed.

Abstract: This disclosure relates generally to data structure abstraction, and more particularly to method and system for data structure abstraction for model checking. In one embodiment, the method includes identifying data structure accesses in the source code. Loops are identified in the data structure accesses, and loop-types are identified in the loops. An abstracted code is generated based on the loop types for abstracting the data structure. Abstracting the data structure includes, for each loop, replacing the data structure accesses by one of a corresponding representative element and a non-deterministic value in the loop body of said loop based on elements accessed, and eliminating loop control statement of said loop operating on elements of data structure based on loop type of said loop, and adding a plurality of non-array assignments at a start and after the loop body of the source code. The abstracted code is provided for the model checking.

Abstract: This disclosure relates to quality control testing of software and hardware applications, and more specifically to performing quality control testing concurrently on multiple software deployments. The method and system monitor user inputs on a master machine to capture user events that are translated into action paths and action requests that concurrently reproduce the user event on a set of test machines with a variety of hardware configurations and software versions.

Abstract: An apparatus, for a first loop included in a program code, determines whether an inner loop is included in the first loop. When the inner loop is included in the first loop, the apparatus determines whether a processing code other than the inner loop is included in the first loop. When both the inner loop and the processing code other than the inner loop are included in the first loop or when no inner loop is included in the first loop, the apparatus adds a performance measurement code for conducting performance measurement of the first loop to the program code.

Abstract: Instrumenting code. One embodiment includes identifying a line of source code having an incomplete instrumentation. A unique identifier tag is obtained from an identifier source. The unique identifier tag is inserted into the instrumentation.

Abstract: Systems and methods for processing breakpoints in a target program executing on a remotely located server computer are presented. In one embodiment, upon receiving instructions to set a breakpoint in a target program, a code block of the target program is identified in which the execution location of the breakpoint is to be set. The identified code block of the target program is re-compiled. Re-compiling the code block of the target program comprises re-compiling the code block without optimizations and including executable instructions at the execution location of the breakpoint to generate a snapshot of debugger information regarding the target program upon the breakpoint triggering. The re-compiled code block is then bound in the target program.

Abstract: According to one embodiment, a method, computer system, and computer program product for memory corruption diagnosis is provided. The present invention may include generating a pattern expression (PE) header file, wherein a plurality of common datatypes associated with a software program are pre-defined. The invention may further include generating a PE for each of the plurality of common datatypes, and generating a PE table by merging the generated PEs for each of the plurality of common datatypes. Upon discovery that memory corruption has occurred, the invention may include transmitting a recorded state of the software program as a core dump file to a server, and using a dump utility to identify overlay content of the core dump file. Lastly, the invention may include identifying a possible source program of the memory corruption by matching the PE tables against the illegally-written overlay content.