Abstract: Provided are a computer program product, system, and method for determining an ordering to use to open and close programs that call other programs. A dependency file indicates for each calling program at least one called program called by the calling program, wherein a called program that calls another program also comprises a calling program. The dependency file is processed to determine an order in which the called programs are called by the calling programs. A determination is made from the order the called programs called by an invoked calling program. The determined called programs are invoked according to the order. The calling program is invoked in response to invoking the determined called programs. The order indicates the order in which the calling programs and the called programs are invoked so the called programs are invoked before invoking the calling programs that invoke the called programs.

Abstract: In one aspect of the present description, in a distributed node management system for a distributed computing system having multiple processor nodes, each processor node has a local data structure which contains a “to-do tasks” synchronization table that resides on each such processor node. The “to-do-tasks” synchronization table contains one or more actions that each processor node may perform to facilitate maintaining the operations of the associated processor node with equivalent knowledge of the system configuration, status and backup capabilities as the other processor nodes of the distributed computing system. Other features and aspects may be realized, depending upon the particular application.

Abstract: According to various aspects and embodiments, an energy management system is provided. The system includes a memory, at least one processor coupled to the memory, and a data acquisition management component executable by the at least one processor and configured to generate a first request to perform at least one first managed task, the first request including an identifier of at least one asset and an identifier of an attribute of the at least one asset, transmit the first request to one or more data acquisition devices, receive a first response including information descriptive of a value associated with the attribute, and generate, in response to receiving the first response and in accord with at least one energy management goal, a second request to perform at least one second managed task.

Abstract: The present invention discloses an alternative arrangement to wake-on-LAN and which is designed specifically for multi-tenant cloud computing and virtualized server environments. This new arrangement identifies which tenants or applications of a multi-tenant server are idle, and when a tenant or application is identified as idle, it transparently reduces the reserved computational capacity footprint of the application or tenant without shutting down the tenancy or exiting the application. Furthermore, the near-instantaneous resumption of the idle tenant or application is achieved when some external event is detected which relates to the passivated tenant or application.

Abstract: Aspects include computing devices, systems, and methods for implementing scheduling an execution process to an execution processor cluster to take advantage of reduced latency with a victim cache. The computing device may determine a first processor cluster with a first remote shared cache memory having an available shared cache memory space. To properly schedule the execution process, the computing device may determine a second processor cluster with a lower latency to the first remote shared cache memory than an execution processor cluster scheduled with the execution process. The second processor cluster may be scheduled the execution process, thus becoming the execution processor cluster, based on a size of the available shared cache memory space and the latency of the second processor cluster to the first remote shared cache memory. The available shared cache memory space may be used as the victim cache for the execution process.

Abstract: A method includes using processing circuitry and at least one memory configured to store a plurality of threads. The method includes providing an environment associated with an operating system to execute one or more threads of the plurality of threads. The environment includes a plurality of virtual priorities and a plurality of actual priorities. Each of the plurality of threads is allowed to select a virtual priority of the plurality of virtual priorities. The method also includes associating an actual priority of the plurality of actual priorities to one of the plurality of threads based on the plurality of virtual priorities assigned to the plurality of threads. The method also includes executing the one of the plurality of threads associated with the actual priority.

Abstract: A method for scheduling tasks from a program executed by a multi-processor core system is disclosed. The method includes a scheduler that groups a plurality of tasks, each having an assigned priority, by priority in a task group. The task group is assembled with other task groups having identical priorities in a task group queue. A hierarchy of task group queues is established based on priority levels of the assigned tasks. Task groups are assigned to one of a plurality of worker threads based on the hierarchy of task group queues. Each of the worker threads is associated with a processor in the multi-processor system. The tasks of the task groups are executed via the worker threads according to the order in the hierarchy.

Abstract: A method and apparatus for batch-processing multiple data in an electronic device are provided. A method for batch-processing multiple data in a first processor includes transmitting batching data configuration information to a second processor of the electronic device according to batching option information of at least one application; receiving, from the second processor, batching data including at least one data acquired via at least one sensor of the electronic device based on the batching data configuration information; and batch-processing the received batching data according to the batching option information, for the at least one application.

Abstract: The invention relates to a method (500) for assigning a computational block of a software program to cores of a multi-processor system, the method (500) comprising: evaluating (501) a first number of available cores of a first type of the multi-processor system and a second number of available cores of a second type of the multi-processor system; determining (502) a first number of loops of the computational block for binding with the cores of the first type and a second number of loops of the computational block for binding with the cores of the second type; binding (503) the first number of loops with the cores of the first type and binding the second number of loops with the cores of the second type; and executing (504) the loops of the computational block according to the binding (503).

Abstract: The data storage system according to certain aspects can manage the archiving of virtual machines to (and restoring of virtual machines from) secondary storage. The system may archive virtual machines (VMs) that are determined to have a low level of utilization. The system may create a virtual machine placeholder for an archived VM, which may be a “light” or minimal version of the VM that acts like the actual VM. By using a VM placeholder, a VM may appear to be active and selectable by the user. When the user selects the VM, the VM placeholder can interact with the user in similar manner as the VM. Accessing the VM placeholder may trigger restore of the archived VM from secondary storage. The restore of the archived VM may be “seamless” to the user since the VM remains available while it is being restored.

Abstract: Techniques for load balancing and fault tolerant service are described. An apparatus may comprise load balancing and fault tolerant component operative to execute a load balancing and fault tolerant service in a distributed data system. The load balancing and fault tolerant service distributes a load of a task to a first node in a cluster of nodes using a routing table. The load balancing and fault tolerant service stores information to indicate the first node from the cluster of nodes is assigned to perform the task. The load balancing and fault tolerant service detects a failure condition for the first node. The load balancing and fault tolerant service moves the task to a second node from the cluster of nodes to perform the task for the first node upon occurrence of the failure condition.

Abstract: Systems, apparatus, articles, and methods are described including operations for runtime dispatching among a heterogeneous group of processors.

Abstract: Functionality is disclosed herein for using a context sensitive framework to identify relevant applications to a current context and to provide data received from the relevant applications to a user. Instead of a user having to manually locate and launch an application, relevant applications determined by a contextual service may provide data in response to receiving the context data. The applications that are identified as relevant to the context determine the application data to provide to the contextual service. The contextual service selects at least a portion of the application data to provide for display within a user interface. In some configurations, the selected application data is displayed within a user interface that maintains a same look and feel regardless of the application data that is displayed.

Abstract: A method for providing communication between application programs running via devices connected to a same network is provided. The method includes an operation for connecting a first application program, which is running in a first device via a web socket server in the first device, with a second application program, which is running in a second device, and an operation for transmitting and receiving data between the second application program and the first application program via the web socket server.

Abstract: A method comprising causing actuation of a notification indicative of occurrence of an event, receiving an indication of a notification disablement input associated with the notification, causing disablement of the notification based, at least in part, on the notification disablement input, receiving an indication of a notification enablement input associated with the notification, and causing enablement of the notification based, at least in part, on the notification enablement input is disclosed.

Abstract: A method of operating an operating system for providing inter-application communications between a publisher application and a subscriber application. The method includes receiving a publication request from the publisher application at an operating system, receiving a subscriber application from the subscriber application at the operating system, performing an operating system based event brokering procedure based on the publication request and the subscription request, and publishing an event based on the procedure.

Abstract: A method for all-to-all message exchange between program tasks including N>1 hierarchy levels ln, n=1 to N, in which a first level l1 includes a plurality of group tasks and each higher level l(n>1) includes at least one group of level l(n-1) groups to which that task belongs in respective hierarchy levels of the network topology; sending a message via the interconnection network to a respective destination task whose hierarchical identifier is determined; and using the hierarchical identifier to send the program task and the network topology, such that the resulting exchange pattern for the all-to-all message exchange exploits a hierarchical distance in the network topology in a desired manner.

Abstract: A remote procedure call channel for interprocess communication in a managed code environment ensures thread-affinity on both sides of an interprocess communication. Using the channel, calls from a first process to a second process are guaranteed to run on a same thread in a target process. Furthermore, calls from the second process back to the first process will also always execute on the same thread. An interprocess communication manager that allows thread affinity and reentrancy is able to correctly keep track of the logical thread of execution so calls are not blocked in unmanaged hosts. Furthermore, both unmanaged and managed hosts are able to make use of transparent remote call functionality provided by an interprocess communication manager for the managed code environment.

Abstract: A method and associated system for interfacing between a caller application and a service module. A service module builds a service module data structure pursuant to a previously received request. The request includes at least one caller application attribute describing the request. The service module data structure includes a generic service document and at least one service module attribute. Each service module attribute is stored in a relational table of the service module data structure. The requests serviced within the service module data structure, resulting in instantiating the generic service document. The generic service document is returned to the caller application. Building each service module attribute includes: constructing the generic service document and creating at least one container in the generic service document. Each container is respectively associated with each service module attribute in each mapping of at least one mapping.

Abstract: Embodiments relate to pre-silicon device testing using a persistent command table. An aspect includes receiving a value for a persistent command parameter from a user. Another aspect includes determining whether the value of the persistent command parameter is greater than zero. Another aspect includes based on determining whether the value of the persistent command parameter is greater than zero, selecting a number of commands equal to the value of the persistent command parameter from a regular command table of a driver of a device under test. Another aspect includes adding the selected commands to the persistent command table of the driver. Another aspect includes performing testing of the device under test via the driver using only commands that are in the persistent command table of the driver.

Abstract: A system and method for inspecting a testing state includes determining one or more entities to be manipulated during execution of a test of the system, generating an instance of each of the entities using a plurality of entity templates and a plurality of value generators, and executing the test using the generated instances. At least one of the generated instances includes a first value generated randomly. The test is being executed by one or more processors of the system. In some examples, generating an instance of a first one of the entities includes identifying a first one of the entity templates corresponding to a type of the first entity, determining one or more attributes for the first entity based on the first entity template, and generating an instance of each of the attributes using the entity templates and the value generators.

Abstract: Methods, apparatuses, systems, and devices are described for improving data durability in a data storage system. In one example method of improving data durability, a hardware failure risk indicator may be determined for each of a plurality of data storage elements in the data storage system. The method may also include storing one or more replicas of a first data object on one or more of the plurality of data storage elements, with a quantity of the one or more replicas and a distribution of the one or more replicas among the plurality of data storage elements being a function of the hardware failure risk indicators for each of the plurality of data storage elements. In some examples, the hardware failure risk indicators may be dynamically updated based on monitored conditions, which may result in dynamic adjustments to the quantity and distribution of the data object replicas.

Abstract: Apparatus suitable for detecting a fault in a processor comprises a monitor which receives input and output signals from the processor and generates a hash index key which is used to access entries in a hash table. The entries may include actions such as setting a timer so that the response of an output to a change of state of an input may be confirmed as valid within a specified time interval.

Abstract: An analysis device includes a storage device and a processor. The storage device is configured to store therein performance information of each subject which is any type of performance of any device or any process in an information processing device. The processor is configured to acquire first performance information of a first subject from the information processing device and compare the first performance information with performance information of the first subject previously stored in the storage device to calculate a variation rate. The processor is configured to store the first performance information in the storage device when the variation rate exceeds a predetermined variation rate. The processor is configured to calculate a sampling rate for each subject and determine analysis candidate subjects which have a sampling rate higher than a predetermined sampling rate. The processor is configured to analyze a relationship between performance information of the analysis candidate subjects.

Abstract: In a method for verifying the integrity of first to Nth binaries (N is a natural number greater than or equal to 2), the method may comprise: loading the first to Nth binaries into a main memory in order to execute the binaries; verifying a self hash to verify, by the Kth binary (K=1, . . . , N-1) which has been loaded into the main memory, the integrity thereof by using a hash; and verifying a link hash by setting any one of the first to Kth binaries as a verification binary and setting a (K+1)th binary to be loaded into the main memory as a binary to be verified so that the verification binary verifies the integrity of the binary to be verified by using a hash.

Abstract: There is disclosed a method for secure data reading in a data handling system, said data handling system comprising an address dispatcher for dispatching read requests to a memory comprising a first memory region, an anomaly signal producer and an anomaly handler, the method comprising the following steps: the address dispatcher dispatches a first read request to a first memory region; subsequent to dispatching the first read request, the address dispatcher dispatches a second read request to said first memory region; subsequent to dispatching the second read request, the address dispatcher dispatches a third read request to said first memory region; the anomaly signal producer produces a first anomaly signal if a result produced by the memory in response to the first read request does not agree with a result produced by the memory in response to the third read request; the anomaly signal producer produces a second anomaly signal if the memory does not produce a predefined result in response to the second rea

Abstract: In the invariant analysis, a fault cause is judged correctly. A correlation model storing unit (112) of an operation management apparatus (100) stores a correlation model including one or more correlation functions each of which indicates a correlation between two metrics different each other among a plurality of metrics in a system. The correlation destruction detecting unit (103) detects correlation destruction of the correlation which is included in the correlation model by applying newly inputted values of the plurality of metrics to the correlation model. The abnormality calculation unit (104) calculates and outputs a centrality degree which indicates a degree to which a first metric is estimated to be center of distribution of correlation destruction on the basis of a correlation destruction degree of one or more correlations between each of one or more second metrics having a correlation with the first metric and each of one or more metrics other than the first metric among the plurality of metrics.

Abstract: Apparatuses and methods for comparing a sense current representative of a number of failing memory cells of a group of memory cells and a reference current representative of a reference number of failing memory cells is provided. One such apparatus includes a comparator configured to receive the sense current and to receive the reference current. The comparator includes a sense current buffer configured to buffer the sense current and the comparator is further configured to provide an output signal having a logic level indicative of a result of the comparison.

Abstract: Apparatus and method for detecting anomalies in a computer system are disclosed herein. In some embodiments, multiple probes are executed on an evolving data set. Each probe may return a result. Property values are then derived from a respective result returned by a corresponding probe. Surprise scores corresponding to the property values are generated, where each surprise score is generated based on a comparison between a corresponding property value and historical property values. The corresponding property value and the historical property values are derived from results returned from the same probe. Historical surprise scores generated by the anomaly detection engine are accessed. Responsive to a comparison between the plurality of surprise scores and the plurality of historical surprise scores, a monitoring system is alerted of an anomaly regarding the evolving data set.

Abstract: A method for quickly detecting a fault includes: detecting, by a Kernel Black Box KBox set, a fault occurred in an operation system; and generating, by the KBox set, fault information based on the detected fault; and transmitting, by the KBox set, system fault notification information including the fault information to an application high availability HA subsystem via a management unit of an infrastructure layer, to trigger a service fault processing of the application HA subsystem. Thus, the fault or unhealthiness of an OS is detected rapidly and a service application layer is timely notified to process the fault, thus reducing service loss.

Abstract: A rack comprising a control module and a plurality of nodes is present. The control module comprises a rack management controller (RMC), and each of the plurality of nodes comprises a baseboard management controller (BMC). The RMC communicates with the BMCs respectively through a plurality of default communication channels, and the RMC controls the nodes and transmits necessary data thereto through the BMCs. When losing response signal from one of the BMCs, the RMC resends same signal to the non-responded BMC. If a resend threshold is achieved, the RMC sends a control signal to a reset pin of the non-responded BMC directly through a GPIO channel to force the non-responded BMC to reset.

Abstract: A system and method for managing peripheral device failures is disclosed. The method includes detecting, at a processor of a peripheral bus, a failure of a first bus device at a downstream port from the processor. The downstream port is populated by the first bus device and the processor is communicatively coupled at an upstream port to a root complex. The processor is configured to isolate the failure of the first bus device from the root complex. The method also includes, responsive to detecting the failure, suspending communication of data to the first bus device, receiving information regarding a second bus device selected from a cluster of a plurality of bus devices, and assigning the second bus device to the downstream port.

Abstract: Disclosed herein are a system, non-transitory computer readable medium, and method for recovering from an abnormal failure of a program. Changes made by a plurality of threads of the program are undone in a reverse order in which the changes were made.

Abstract: Systems and methods are provided for acquiring status information from a plurality of memory die. An apparatus is provided that includes a plurality of memory die and a memory controller. The memory controller is configured to broadcast a first status command to the plurality of memory die, receive a first status response concurrently from the plurality of memory die based on the first status command, and send a repair command to one or more of the plurality of memory die in response to the first status response not satisfying first predetermined status criteria.

Abstract: Automatic remediation is provided to a serviced system. Selected system information associated with the serviced system is received. A set of one or more symptoms is generated using the selected system information. A knowledge repository is searched using the set of symptoms to identify a root cause. A remediation package corresponding to the root cause is obtained and, if permitted, the remediation package is caused to be performed on the serviced system.

Abstract: A technique is provided for accumulating failures. A failure of a first row is detected in a group of array macros, the first row having first row address values. A mask has mask bits corresponding to each of the first row address values. The mask bits are initially in active status. A failure of a second row, having second row address values, is detected. When none of the first row address values matches the second row address values, and when mask bits are all in the active status, the array macros are determined to be bad. When at least one of the first row address values matches the second row address values, mask bits that correspond to at least one of the first row address values that match are kept in active status, and mask bits that correspond to non-matching first address values are set to inactive status.

Abstract: A safe operating region of a complex integrated circuit may be determined by selecting an operating point for the integrated circuit (IC) at a first voltage and first frequency. A test program is executed by a central processing unit (CPU) comprised within the IC to test a portion of the IC. Communication activity between the IC and a host system is recorded to form a data log while the test program is being executed. A crash is detected by storing and examining the data log periodically, and assuming that the test program has crashed when any one of a predetermined set of crash conditions is detected during examination of the data log. The operating point may be iteratively changed and execution of the test program repeated while continuing to check for a crash until a crash is detected.

Abstract: Systems and methods for providing automated computer support are described herein. One described method comprises receiving a plurality of snapshots from a plurality of computers, storing the plurality of snapshots in a data store, and creating an adaptive reference model based at least in part on the plurality of snapshots. The described method further comprises comparing at least one of the plurality of snapshots to the adaptive reference model, and identifying at least one anomaly based on the comparison.

Abstract: A method, system, and/or computer program product for dynamic array masking is provided. Dynamic array masking includes, during execution of computer instructions that access a cache memory, detecting an error condition in a portion of the cache memory. The portion of the cache memory contains an array macro. Dynamic array masking, during the execution of the computer instructions that access a cache memory, further includes dynamically setting mask bits to indicate the error condition in the portion of the cache memory and preventing subsequent writes to the portion of the cache memory in accordance with the dynamically set mask bits. Embodiments also include evicting cache entries from the portion of the cache memory. This evicting can include performing a cache purge operation for the cache entries corresponding to the dynamically set mask bits.

Abstract: A technique is provided for accumulating failures. A failure of a first row is detected in a group of array macros, the first row having first row address values. A mask has mask bits corresponding to each of the first row address values. The mask bits are initially in active status. A failure of a second row, having second row address values, is detected. When none of the first row address values matches the second row address values, and when mask bits are all in the active status, the array macros are determined to be bad. When at least one of the first row address values matches the second row address values, mask bits that correspond to at least one of the first row address values that match are kept in active status, and mask bits that correspond to non-matching first address values are set to inactive status.

Abstract: Example apparatus and methods provide improved reclamation, garbage collection (GC) and defragmentation (defrag) for data storage devices including solid state drives (SSD) or shingled magnetic recording (SMR) drives. An erasure code (EC) layer that facilitates logically or physically erasing data from the SSD or SMR as a comprehensive GC or defrag is added to the SSD or SMR. Erased data may be selectively recreated from the EC layer as needed. Pre-planned EC write zones may be established to further optimize GC and defrag. Recreated data may be written to selected locations to further optimize SSD and SMR performance. Erasure code data may be distributed to co-operating devices to further improve GC or defrag. Example apparatus and methods may also facilitate writing data to an SMR drive using tape or VTL applications or processes and providing a pseudo virtual tape library on the SMR drive.

Abstract: According to one embodiment, a memory system includes a memory, and a processor. The memory converts an amount of charge held by a memory cell into a value. The processor executes a first process of reading first data from the memory. The processor executes a second process of reading the first data by making the memory use a first determination potential different in a case where error correction of the first data read through the first process is failed. The processor executes a third process of reading second data from the memory by making the memory use a third determination potential in a case where error correction of the first data read through the second process is succeeded. The third determination potential is the first determination potential used by the memory in a case where error correction of the first data read through the second process is succeeded.

Abstract: A data storage device includes a flash memory and a controller. The flash memory includes a plurality of dies, and each of the dies includes a first memory plane and a second memory plane, wherein the first memory plane includes a plurality of pages and the second memory plane includes a plurality of pages. The controller corrects data stored in the first memory plane and the second memory plane according to an ECC capability table, wherein the ECC capability table is arranged to record a first ECC capability value of the first memory plane and a second ECC capability value of the second memory plane.

Abstract: A wear leveling method and apparatus and a storage medium are disclosed, the method including: performing error correction on data read from a physical block to obtain corrected data, and counting corrected bits in the corrected data to obtain the number of the corrected bits, where the data as read may be previously written to the physical block in a dynamic wear leveling manner and/or a static wear leveling manner, and the number of the corrected bits is negatively correlated with a residual service life of the physical block; detecting whether the obtained number of the corrected bits is more than a preset bit-number threshold value; and transferring data stored in the physical block, if the number of corrected bits is detected as more than the preset bit-number threshold value.

Abstract: Systems and techniques for managing data storage are disclosed. In some aspects, a front-end node responds to a request to write an object by dividing the object into multiple source data segments. The front-end node generates redundancy data for the multiple source data segments using a rateless erasure encoding. The front-end node associates a respective subset of the redundancy data with each of the multiple source data segments, wherein each subset of redundancy data and associated source data segment form an encoded segment. The rateless erasure encoding further includes defining multiple segment-level fragments within each of the encoded segments. The front-end node transmits each of the encoded segments to a selected one of multiple storage nodes, wherein each of the selected storage nodes are selected based on a determined storage layout of the encoded segments across the multiple storage nodes.

Abstract: A method includes detecting a storage error regarding an encoded data slice. The method further includes determining failure mode information regarding a set of storage units. The method further includes determining, based on the failure mode information, whether to use a data-based rebuilding protocol or a zero information gain rebuilding protocol for rebuilding the encoded data slice. The method further includes, when the zero information gain rebuilding protocol is to be used to rebuild the encoded data slice retrieving zero information gain partial encoded data slices from one or more storage servers of the set of storage servers; and rebuilding the encoded data slices based on the zero information gain partial encoded data slices.

Abstract: Provided are a computer program product, system, and method for correcting overlapping data sets in a volume. A determination is made of overlapping data sets in a first volume that are assigned a same data unit. The data sets in the first volume that are not assigned a same data unit are copied to a second volume. The same data unit is processed to determine one of the overlapping data sets for which the same data unit is intended and copied to the determined overlapping data set in the second volume.

Abstract: The present application discloses an operation synchronization method and device, and a storage medium, which belong to the field of network technologies. The method includes: when an editing operation of a first terminal on multimedia resource information is received, executing the editing operation on the multimedia resource information; querying data connection information corresponding to account information used by the first terminal; determining whether the queried data connection information comprises data connection information of a second terminal; when the queried data connection information comprises the data connection information of the second terminal, synchronizing the editing operation on the multimedia resource information to the second terminal.

Abstract: A backup tool can manage multi-level backup into a cloud and restoration from the cloud. The backup tool can request a data source to stream backup data to the backup tool, and the backup tool can then generate data objects from the data stream for storing into the cloud. The backup tool generates the data objects in accordance with serialization of the data stream. The order of the data objects resulting from the data stream serialization is encoded into the names of the data objects. In addition, the backup tool encodes the backup level into the object names. With sequencing and backup level encoded into the data object names, the data objects can be stored in the cloud for later restoration.

Abstract: A system for image recovery comprises an input interface and a processor. The input interface is configured to receive a block backup volume that can be mounted. The processor is configured to determine a merged chain map by consolidating one or more incremental chain maps and to store an image using the merged chain map and a volume map.