Abstract: Embodiments of the present invention provides methods, computer program products, and a system for improving serial performance of a computer system storage volume. Embodiments of the present invention can be used to reduce a partition scheme of a storage volume to allow for a computer system to read the storage volume using additional system resources that were previously idle during a serial read operation. Embodiments of the present invention can be used to reserve random-access memory (RAM) to store metadata describing data stored on a storage volume that utilizes a reduced partition scheme. Once the serial read of the storage volume is complete, the embodiments of the present invention can revert the partition scheme back to the original partition scheme for normal, non-serial read operations.

Abstract: The present invention relates to a system for automating processes, and in particular to a system for optimizing the distribution of work items among available processing resources within such a system. The system includes an active queue controller, executed on an application server that manages the creation and deletion of virtual machines on available resources while querying a data store for work items and instructions for executing that automated processes.

Abstract: Facilitating a smart watch list in storage systems is provided herein. A system can comprise a processor and a memory that stores executable instructions that, when executed by the processor, facilitate performance of operations comprising determining a first priority of a first path of a storage system and a second priority of a second path of the storage system. The operations also can comprise moving the first path to a monitor status and the second path to a wait status based on the first priority of the first path being a higher priority than the second priority of the second path and based on a limitation of a number of paths that are able to be in the monitor status at a same time. Further, the operations can comprise outputting respective information indicative of the first priority, the second priority, the monitor status, and the wait status.

Abstract: Techniques for scheduling replication events may be based upon establishing a plurality of policy groups. Each policy group has a replication schedule that defines when to initiate replication events and a membership selection pattern used to determine which virtual machines belong to which policy group. The policy groups may contain a first policy group and a second policy group, where each policy group has a unique replication schedule and a unique selection pattern. The system may assign a first set of virtual machines to the first policy group based upon the first selection pattern. A second set of virtual machines may be assigned to a second policy group based upon the second selection pattern. Each of the virtual machines in the first policy group may be assigned a first replication schedule and each of the virtual machines in the second policy group may be assigned a second replication schedule.

Abstract: A model drive system models tier changes within enterprise workloads by analyzing past data to automatically generate the capability to detect factors or situations which demand a change of service tier in a preferably hybrid cloud context with potentially multiple providers.

Abstract: Techniques for implementing distributed quality of service controls for data transmissions between clusters in a clustered distributed storage system are described. In one embodiment, a method of distributed quality of service control includes establishing a control channel between a first plurality of nodes associated with a first cluster. The method also includes setting a quality of service (QoS) policy for the first plurality of nodes that establishes a QoS parameter for data transmitted over a shared network from the first cluster to a second cluster. The method further includes communicating messages between the first plurality of nodes over the control channel to signal an allocated portion of the QoS parameter for each node. The method also includes transmitting data by the first plurality of nodes of the first cluster to a second plurality of nodes of the second cluster over the shared network according to the allocated portion.

Abstract: Dynamic scaling of a service in a CDN is performed using content request response times from service instances executing in regions in the CDN. Response times for similar content requests can be aggregated for each region. A cost calculation for each region may be evaluated in conjunction with the associated response time by the service instantiations to decide whether the service should be scaled up or down.

Abstract: The disclosed technology includes accessing a first network application programming interface exposed by a first cloud provider of the plurality of cloud providers to identify a first pricing profile, the first pricing profile associated with the first Cloud provider. Upon identifying the first pricing profile, accessing a second network application programming interface exposed by a second cloud provider of the plurality of cloud providers to identify a second pricing profile, the second pricing profile associated with the second Cloud provider. A load balancing decision is determined comparing the identified first pricing profile with the identified second pricing profile. Next, the determined load balancing decision is executed on a monitored computing-traffic.

Abstract: A zombie server can be detected. Detecting a zombie server can include labeling a plurality of processes as utility software, calculating a utilization of utility software on the plurality of processes executed in one or more processing resources during an interval of time, and calculating a server utilization of the one or more processing resources during the interval of time. Detecting the zombie server can also include determining whether a difference between the utilization of utility software and the server utilization is greater than a threshold, and identifying a server that hosts the processing resource as a zombie server based on a determination that the difference is smaller than the threshold.

Abstract: A memory allocator assigns temporary memory limits to each of a plurality of processes requiring memory. Thereafter, at least one assigned temporary memory limit is changed during execution of a corresponding process. Related apparatus, systems, techniques and articles are also described.

Abstract: Dynamically allocating cache in a multi-tenant infrastructure includes monitoring cache usage for multiple workloads in a multi-tenant processing infrastructure to determine a workload phase. A baseline performance level per workload is determined. The baseline performance level is dependent upon the workload phase. The workloads for each tenant are categorized based on cache utilization and the cache is allocated to each workload based on the baseline performance level, cache utilization, and system wide cache capacity.

Abstract: Disclosed aspects relate to query plan management associated with a shared pool of configurable computing resources. A query, which relates to a set of data located on the shared pool of configurable computing resources, is detected. A virtual machine includes the set of data. With respect to the virtual machine, a set of burden values of performing a set of asset actions is determined. Based on the set of burden values, a query plan to access the set of data is established. Using at least one asset action of the set of asset actions, the query plan is processed.

Abstract: A method performs large-scale data processing in a distributed and parallel processing environment. The method defines application-independent map and reduce operations, each invoking one or more library functions that automatically handle data partitioning, parallelization of computations, and fault tolerance. A user specifies a map operation, which calls one or more of the application-independent map operators to perform data read and write operations. A user also specifies a reduce operation, which calls one or more of the application-independent reduce operators to perform data read and write operations. The method executes application-independent map worker processes. Each map worker process executes the user-specified map operation to read designated portions of input files and store intermediate data values in intermediate data structures. The method also executes application-independent reduce worker processes.

Abstract: One or more non-transitory computer readable media contain program instructions that, when executed, cause one or more processors to: receive first raw data including one or more first data points generated by a first object of a plurality of objects associated with one or more buildings; generate first input timeseries according to the one or more data points; access a database of interconnected smart entities, the smart entities including object entities representing each of the plurality of objects and data entities representing stored data, the smart entities being interconnected by relational objects indicating relationships between the smart entities; identify a first object entity representing the first object from a first identifier in the first input timeseries; identify a first data entity from a first relational object indicating a relationship between the first object entity and the first data entity; and store the first input timeseries in the first data entity.

Abstract: An e-mail system identifies actions or activities that a user takes relative to an e-mail message. The activity is logged as an activity log entry in an activity log. When the user accesses the activity log, the activities and corresponding e-mail messages are accessible to the user through the activity log entry, along with a user interface element that allows the user to take additional actions with respect to the e-mail message in the activity log entry.

Abstract: A markdown budget user interface is provided that implements access to large-scale computational resources capable of concurrently manipulating a number of multi-million item data sets and that allows a retailer to specify inputs. The inputs include a markdown budget constraint that applies across all retailer stores, a group of store-product data sets that each include initial prices and markdown start prices of different combinations of products within all of the retailer stores, and a markdown objective, selected from a group including profit, revenue, and sales volume, to be maximized within the markdown budget constraint. The inputs are received from the retailer using the markdown budget user interface and the large-scale computational resources are invoked to determine a markdown recommendation that includes an indication of the store-product data sets that satisfy both the markdown budget constraint and the markdown objective. The markdown recommendation is provided to the retailer.

Abstract: A system and method for determining optimized resources utilization in a virtual network. The method includes collecting a computing resource parameter from a virtual network, where the computing resource parameter includes at least performance measurements of computing resources in the virtual network; accessing a key performance indicator, where the key performance indicator includes measurement of network traffic performance; and determining, based on the computing resource parameter and the key performance indicator, an optimized resource parameter over a period of time that indicates a usage rule for a computing resource component.

Abstract: A computer-implemented method according to one embodiment includes determining resource usage of at least a first module in a grid storage system having multiple modules and approximately equal resource usage across the multiple modules of the grid storage system. The computer-implemented method further includes determining a garbage collection cost in the grid storage system by stopping garbage collection in a second of the modules of the grid storage system, determining a resource usage in the second module upon stopping the garbage collection, and comparing the resource usage in the second module to the resource usage of the at least the first module. The method further includes adjusting an amount of garbage collection based on both the garbage collection cost and the resource usage.

Abstract: Requests for resources of a web based service are processed by at least updating routing information by a load balancer after determining that a requested resource is not available in a first version of a web based service. The updated routing information indicates the request was previously made against the first version of the web based service and is readable by a second version of the web based service to allow the second version of the web based service to handle the request as a request from the first version and not simply a brand new request.

Abstract: Example implementations related to hyperconverged loads. In an example, a set of system characteristics is defined for a hyperconverged system. A plurality of components of an arbitrary workload running on a computing system are then separately modeled. The modeling converts the plurality of components into a plurality of respective hyperconverged loads. The plurality of respective hyperconverged loads are then allocated among a set of hyperconverged nodes that satisfies the set of system characteristics.

Abstract: Migration specific action requests to perform a set of migration specific actions are sent from a source system instance to a target system instance. Migration specific action responses are received from the target system instance. Based on the migration specific action responses, traffic lights for resource utilization of the target system instance are determined. Based on the traffic lights, a concurrency limit is determined for the specific time. The concurrency limit is applied to scale a total number of ongoing migration specific actions to be requested of the target system instance at the specific time.

Abstract: An information handling system with an improved dynamic application-aware storage optimization includes an application core that is configured to create a plurality of workload descriptors. The workload descriptors may represent workload requirements to implement a particular application program. A data engine performs an analysis of the workload descriptors, and based on the performed analysis the data engine generates a hint. A storage device is configured to use the hint in managing data flow in the information handling system.

Abstract: When a part already transmitted to an object storage is updated by a file system management section while a plurality of parts are being transmitted to the object storage, a file transfer section requests the object storage to generate a temporary object that is a temporarily generated object containing the transmitted and updated part by combining the parts transmitted before update, re-splits a file into a plurality of parts so that the transmitted and updated data and not-transmitted data are handled as parts different from transmitted and not-updated data, and transmits the part containing the transmitted and updated data or the part containing the not-transmitted data to the object storage.

Abstract: A method for a distributed storage network (DSN) includes retrieving a slice of a chunk for execution of a partial task, identifying a record configuration of the slice, facilitating processing of a partial task on at least one record of the slice, and when the slice includes a partial record, identifying a slice location of another slice that includes a remaining partial record corresponding to the partial record, and when the slice location is favorable, retrieving the other slice from the slice location, and facilitating processing of the partial task on at least one record of the other slice.

Abstract: Disclosed are various implementations of approaches for reassigning hosts between computing clusters. A computing cluster assigned to a first queue is identified. The first queue can include a first list of identifiers of computing clusters with insufficient resources for a respective workload. A host machine assigned to a second queue can then be identified. The second queue can include a second list of identifiers of host machines in an idle state. A command can then be sent to the host machine to migrate to the computing cluster. Finally, the host machine can be removed from the second queue.

Abstract: According to one embodiment, a supervisory circuit includes a trigger determination circuit and a trigger table. The trigger determination circuit receives signal processing signals outputted from a plurality of signal processing circuits as trigger signals, determines whether processing operations by the signal processing circuits are executed in a predetermined order, and outputs an interrupt signal when detecting a trigger signal out of setting. The trigger table is provided with trigger-specific tables corresponding to the respective signal processing circuits, reads a trigger setting to occur next based on a trigger determined as being correct by the trigger determination circuit, and outputs a table read signal to the trigger determination circuit.

Abstract: A licensing server object generator identifies a plurality of servers that can be used to obtain a license for accessing a feature of an application. The licensing server object generator determines, for the identified servers, network addresses and utilizes these network addresses to generate a plurality of data objects. Each data object specifies a subset of the network addresses for the servers. The licensing server object generator makes these data objects available to enable use of the data objects to obtain the license.

Abstract: Embodiments for workload management with data access awareness in a computing cluster. In response to receiving an input workload for scheduling by a workload manager, a set of inputs is retrieved from a storage system by a data requirements evaluator module. The data requirements evaluator module generates a list of cluster hosts ranked for performing the input workload according to data access considerations and provides the ranked list of cluster hosts to a scheduler module. The scheduler module generates a scheduling of the input workload to certain hosts within the computing cluster where the generated scheduling is optimized with the data access considerations.

Abstract: Methods and systems for managing a connection in an internet protocol virtual server (IPVS). At least a portion of checkpoint data is transmitted by a first node of the IPVS to a load balancer of the IPVS. The checkpoint data includes information for restoring an active connection of the first node and also information representing the current state of the active connection. The load balancer stores the checkpoint data in association with connection data for the connection. The first node terminates the connection. The load balancer updates the connection data with information about a second node of the IPVS. The checkpoint data is transmitted to the second node. Incoming data packets for the connection are then forwarded to the second node, in accordance with the updated connection data.

Abstract: Described in detail herein is a method of copying data of one or more virtual machines being hosted by one or more non-virtual machines. The method includes receiving an indication that specifies how to perform a copy of data of one or more virtual machines hosted by one or more virtual machine hosts. The method may include determining whether the one or more virtual machines are managed by a virtual machine manager that manages or facilitates management of the virtual machines. If so, the virtual machine manager is dynamically queried to automatically determine the virtual machines that it manages or that it facilitates management of. If not, a virtual machine host is dynamically queried to automatically determine the virtual machines that it hosts. The data of each virtual machine is then copied according to the specifications of the received indication.

Abstract: Each of a plurality of database objects can be assigned to a specific message-passing worker of a plurality of message-passing workers, each executing on a first logical core that shares with at least a second logical core one or more resources of a physical processor core of a plurality of physical processor cores. The second logical core can execute a job worker of a plurality of job workers that implement procedural code. Exclusive write access can be provided to a database object of the plurality of database objects via a message-passing worker of the plurality of message-passing workers while read-only access is provided to any database object of the plurality of database objects via any of the plurality of job workers. Operations can be executed by the message-passing worker in an order in which request messages are received in a message queue of the message-passing worker.

Abstract: A system, method and program product for managing a moving peer-to-peer network. A system is provided that a node tracking system that collects tracking information of nodes in a moving P2P network including position, connection status and computation capability; a network representation system that stores the tracking information in a dynamic graph that specifies nodes and connections between the nodes; a task manager for receiving a task submitted by a requesting node for a service implemented by a provider node; and a network allocation system that determines and allocates an optimal path back and forth between the requesting node and the provider node, wherein the optimal path is selected to minimize an overall wall-time, and wherein the network allocation system estimates future positions of moving nodes for determining the optimal path.

Abstract: An information processing apparatus determines human task counts each representing a number of human tasks in individual workflows. Each workflow defines a procedure of tasks to be performed on a device under management, where the tasks include human tasks to be performed by humans and automated tasks to be executed automatically with remote control via a network. The information processing apparatus then determines priorities of the workflows, based on the human task counts determined therefor, for prioritized use of a connection that is established to communicate with the device under management in order to perform automated tasks thereon.

Abstract: A technology is described for executing work requests. In one example, a worker configured to execute an instance of a program code function of a defined function type that corresponds to an expected work request to execute the program code function may be initialized in computer memory, and the worker may be added to a worker pool. A worker reservation policy may determine how many workers may be held in the worker pool based in part on an anticipated demand for the workers. A work request to execute the program code function may be received, and in response, a work item may be generated for execution by the worker. The worker may be identified in the worker pool, and the worker and the work item may be assigned to a work item manager to enable the work item manager to invoke the worker to execute the work item.

Abstract: Techniques for controlling reactivation of service functions are described. Implementations, for example, enable various ways of controlling and storing service objects that provide service functions.

Abstract: Techniques manage a storage system. Such techniques involve: determining an expected input/output (I/O) concurrency number of an access request for a storage system, the access request being associated with a first one of a plurality of redundant arrays of independent disks (RAIDs) comprised in the storage system; in response to a current available I/O concurrency number of the first RAID being less than the expected I/O concurrency number, increasing the available I/O concurrency number of the first RAID based on a reserved I/O concurrency number of the storage system; and performing the access request using the first RAID having the increased available I/O concurrency number.

Abstract: Disclosed are a method and a system for forwarding data, as well as a virtual load balancer and a readable storage medium. The method for forwarding data includes: sending the pending response data packet to the real server RS through a rear terminal sub interface, when the virtual load balancer VLB receives a pending response data packet sent by the Linux virtual server LVS from a front terminal sub interface, wherein the forward network port of the VLB corresponds to at least one front terminal sub interface, and a front terminal sub interface corresponds to a carrier's data interface; and the RS receives and responds to the pending response data packet, getting a response data packet and sending the response data packet to the VLB from the rear terminal sub interface; and the VLB receives the response data packet.

Abstract: A system and method for monitoring a plurality of servers by a monitoring server in a computer network. A list of servers and a plurality of services to monitor in the computer network is generated at the monitoring server. A status query is transmitted sequentially by the monitoring server to each of the plurality of servers, the status query including the plurality of services to monitor at each server. A status message report is received from each of the plurality of servers in response to each status query. An event is reported in an event log for each server that has an abnormal service status. The transmission of the status query to each server is performed by the monitoring server at a specified service time interval.

Abstract: A method is provided for improving a hit ratio of a buffer cache in a system in which vertices of a DAG have tasks that generate intermediate data stored in the buffer cache. The method tracks (i) a buffer cache usage by vertices that have finished running and (ii) a current available buffer cache space. Responsive to a new task being runnable and having dependent parent vertices, the method estimates a total buffer cache usage of current running vertices based on a partial result of the current running vertices. Responsive to the estimate exceeding current available buffer cache space, the method (i) selects a vertex having a most amount of intermediate data stored in the buffer cache for its dependent parent vertices, and (ii) increases a priority of the tasks in the selected vertex to obtain prioritized tasks. The method executes the prioritized tasks earlier than other remaining runnable tasks.

Abstract: A method for communication in an operating system and related products are provided. The method may include the following. An application layer of a terminal device obtains a feature sequence via applying a hash algorithm to a character string. The application layer of the terminal device transmits the feature sequence to a kernel of an operating system of the terminal device. The kernel of the operating system of the terminal device determines an operation specified by the character string according to the feature sequence and a correspondence relationship between feature sequences and operations specified by character strings.

Abstract: The storage system is capable of creating one or more virtual storage subsystems to which virtual resources having logically divided a processing capacity of the physical resources are allocated, and upon creating a virtual volume for receiving I/O requests from the host within the virtual storage subsystem, the virtual storage subsystem allocates the virtual resource to the virtual volume, and when an I/O request to the virtual volume is received from the host, performs processing related to the I/O request using the virtual resource having been allocated. According further to the storage system, after allocating the virtual resource to the virtual volume, the storage system raises a utilization rate of the virtual resource allocated to the virtual volume in a stepwise manner.

Abstract: A system facilitates access to data in a network and includes a cache that stores instructions. A processor executes the instructions including: caching processing configured to integrate caching into a local cluster file system, and cache local file data in the cache based on fetching file data on demand from a remote cluster file system. The cache is visible to file system clients as a Portable Operating System Interface (POSIX) compliant file system. Applications execute on a multi-node cache cluster using POSIX semantics via a POSIX compliant file system interface. Data cache is locally and remotely consistent for updates.

Abstract: Information on a tier comprising given resources operationally connected to a set of remote radio heads and configured to process traffic to and from the remote radio heads is gathered and maintained (300). The usage of the tier resources on different connections and services is controlled (302). Communication (304) is maintained with respective apparatuses controlling other tiers regarding the use of resources of the tiers.

Abstract: A semiconductor device may include a task controller configured to generate a target share for a plurality of task generators according to respective target states and respective measured states of the plurality of task generators, a task scheduler configured to schedule the plurality of tasks according to an allocated share, the plurality of tasks being provided from the plurality of task generators, and a share controller configured to determine the allocated share according to the target share and a measured share of the plurality of task generators.

Abstract: A distributed storage network includes a method of receiving data and a corresponding task, selecting one or more storage units for the task based on a capability level associated with each of the storage units, identifying a plurality of data groups of the data, determining a chunk size based on the plurality of data groups, determining processing parameters of the data based on the chunk size, generating a set of chunksets from the plurality of data groups in accordance with the chunk size and processing parameters and encoding the set of chunksets in accordance with the processing parameters to produce slice groupings. The method further includes determining task partitioning based on the storage units and the processing parameters, partitioning the task based on the task partitioning to produce partial tasks and sending the slice groupings and corresponding partial tasks to the storage units.

Abstract: A management system includes a transmission/reception unit configured to receive transmission terminal identification information of a plurality of transmission terminals used for transmitting/receiving content data, a relay device extracting unit configured to specify relay device identification information of a relay device that can be used to be common to the plurality of transmission terminals among the relay device identification information managed by a relay device selection managing unit based on the received transmission terminal identification information, and a selection unit configured to select a relay device based on relay device identification information for which acceptability/unacceptability information managed by the relay device managing unit represents being acceptable among specified relay device identification information as a relay device relaying transmission/reception of the content data.

Abstract: A transaction processing system includes an engine to process transactions in accordance with rules and data. Changes can be made to the rules and data, transactions, and other parameters that have retroactive affects. The transaction processing system includes a reprocessing system to submit reprocessing requests that prompt a transaction processing engine to efficiently reprocess data to generate accurate output data. In addition to helping ensure accurate output results, the reprocessing operation selectively reprocesses information to avoid unnecessarily reprocessing every transaction. Additionally, embodiment of the compensation system allow parallel processing of current transactions and reprocessing operations using batch processing mechanisms. The transaction processing system can be implemented to perform a variety of transaction processing operations, such as processing of compensation related data.

Abstract: A system may include embedded storage devices, each including an addressable non-volatile random-access memory (NVRAM) portion and storage system controllers operatively coupled to the embedded storage devices via a full-duplex switched network. The storage system controllers may be configured to instruct a first embedded storage device of the plurality of embedded storage devices to: receive first data to be stored in a first NVRAM portion of the embedded storage device, store the first data in the first NVRAM portion of the first embedded storage device, and send second data to a second NVRAM portion of a second embedded storage device directly via the full-duplex switched network.

Abstract: An apparatus, a computer program product and a method for hybrid genetic concolic co-verification of hardware and software. The method comprises repeatedly obtaining a test input for a system comprising a software and a hardware; performing a symbolic co-simulation of the system executing the test input to generate a symbolic co-simulation constraint and utilizing the symbolic co-simulation constraint to generate a new test input. The symbolic co-simulation comprises iteratively performing concolic execution of the software and symbolic simulation of the hardware. The concolic execution is guided using the test input and monitors software symbols.

Abstract: A comprehensive approach to streaming backups for virtual machines (“VMs”) in a storage management system comprises improvements to the assignment of data agent proxies for VM secondary copy operations. New considerations in performing a VM streaming backup job include without limitation: determining and enforcing a system-wide per-proxy limit of concurrent data streams; generating an ordered priority list of the VMs to be backed up as a basis for choosing which proxies will back up the respective VM, though the illustrative system may not strictly adhere to the priority list based on further considerations; identifying a next available proxy based on data stream utilization at the proxy; and dynamically re-generating the priority list and re-evaluating considerations if some VMs become “stranded” due to a failure to be backed up. Secondary copy operations are distributed to proxies in ways that improve the chances of successfully completing VM streaming backups.