Abstract: Techniques for decoupling compute and storage resources in a hyper-converged infrastructure (HCI) are provided. In one set of embodiments, a control plane of the HCI deployment can provision a host from a host platform of an infrastructure on which the HCI deployment is implemented and can provision one or more storage volumes from a storage platform of the infrastructure, where the storage platform runs on physical server resources in the infrastructure that are separate from the host platform. The control plane can then cause the one or more storage volumes to be network-attached to the host in a manner that enables a hypervisor of the host to make the one or more storage volumes available, as part of a virtual storage pool, to one or more virtual machines in the HCI deployment for data storage.

Abstract: In one embodiment, a method for scheduling tasks comprises, at a task scheduler of a processing node of a plurality of processing nodes: retrieving a first task descriptor from a local memory of the task scheduler, the task descriptor corresponding to a task scheduled for execution at the current time and comprising at least a task execution time, a frequency for performing the task, and a task identifier; determining whether the task descriptor is assigned to the task scheduler for execution; if it is determined that the task descriptor is assigned to the task scheduler for execution: executing the task; updating the task execution time based on the current task execution time and the frequency for performing the task; and re-queuing the task descriptor in the local memory.

Abstract: Methods that can access a shared computing resource are provided. One method includes determining, by a processor, a level of stress for a shared computing resource during each increment of time in a predetermined period of time, determining an optimized block of time within the predetermined period of time to perform a set of background operations on the shared computing resource based on the determined level of stress, and performing the set of background operations during the optimized block of time. Apparatus and computer program products that can include, perform, and/or implement the methods are also provided.

Abstract: This application discloses an event processing method and apparatus. A first communication request is received by a server system from a first terminal device. A second communication request is received by the server system from one or more second terminal devices. The first terminal device and the one or more second terminal devices are added to a same communication group by processing circuitry of the server system. A task to be executed at the one or more second terminal devices is sent to the one or more second terminal devices via the same communication group. A task execution result is received that is associated with task execution by the one or more second terminal devices that execute the task. An event object associated with the task is sent by the server system to the one or more second terminal devices that execute the task when the task execution result satisfies a predetermined condition.

Abstract: An apparatus selects services to be used by a user from a plurality of candidates for services used to execute a program. The apparatus acquires a constraint condition and the program. When executing the acquired program, the apparatus specifies a set of services satisfying the constraint condition from the plurality of candidates based on a code pattern included in the program, and uses the specified set of services to execute the program.

Abstract: Techniques for reducing the startup latency of functions in a Functions-as-a-Service (FaaS) infrastructure are provided. In one set of embodiments, a function manager of the FaaS infrastructure can receive a request to invoke a function uploaded to the infrastructure and can retrieve information associated with the function. The retrieved information can include an indicator of whether instances of the function may be sticky (i.e., kept in host system primary memory after function execution is complete), and a list of zero or more host systems in the FaaS infrastructure that currently have an unused sticky instance of the function in their respective primary memories. If the indicator indicates that instances of the function may be sticky and if the list identifies at least one host system with an unused sticky instance of the function in its primary memory, the function manager can select the at least one host system for executing the function.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for allocating a number of first containers to implement one primary segment instance each and a number of second containers to implement one mirror segment instance each. In one example system, the second containers are configured to have less computing resources than the first containers. The containers are distributed among a number of physical computers. The system receives an indication of a failure of a physical computer hosting a particular first container implementing a first primary segment instance. In response to receiving the indication, the system promotes a second mirror segment instance that is a mirror of the first primary segment instance to be a new primary segment instance. The system allocates additional resources to the particular second container implementing the promoted mirror segment instance.

Abstract: A task deployment method executed by a processor of a task development apparatus, the task development method includes acquiring, at a predetermined interval, a number of processes in a queue that stores the processes executed by a plurality of calculation devices included in at least one of one or more nodes; determining, for each of the plurality of calculation devices, a process execution rate for a new process; calculating, for each of the plurality of calculation devices, an execution completion point for the new process based on the acquired number of processes in the queue and the determined process execution rate for each of the respective calculation devices; and determining, from among the plurality of calculation devices, a calculation device to execute the new process based on the calculated execution completion point for each of the plurality of calculation devices.

Abstract: In various embodiments, methods and systems for implementing hash-based partitioning in distributed computing systems are provided. At a high level, a distributed computing system having an underlying range-based partitioning architecture for storage may be configured as a hash-based partitioning system, for example, a hybrid range-hash table storage. An operations engine of the hash-based partitioning system receives a tenant request to provision input/output operations per second (IOPS). The tenant request comprises a requested number of IOPS. Based on the tenant request, a provisioning operation to provision IOPS in a hybrid range-hash table storage with hash-based partitioning is determined. The provisioning operation is selected from one of the following: a table creation provisioning operation, an IOPS increase provisioning operation, and an IOPS decrease provisioning operation. The selected provisioning operation is executed for a corresponding table.

Abstract: Techniques are provided for dataflow execution time estimation for distributed processing frameworks. An exemplary method comprises: obtaining an input dataset for a dataflow for execution; determining a substantially minimal data unit for a given operation of the dataflow processed by the given operation; estimating a number of rounds required to execute a number of data units in the input dataset using nodes assigned to execute the given operation; determining an execution time spent by the given operation to process one data unit; estimating the execution time for the given operation based on the execution time spent by the given operation to process one data unit and the number of rounds required to execute the number of data units in the input dataset; and executing the given operation with the input dataset. A persistent cost model is optionally employed to record the execution times of known dataflow operations.

Abstract: Managing virtual machines includes determining an operating parameter of a device during operation of the device as part of a cluster of devices while the device hosts a virtual machine and comparing, using a processor, a requirement for the virtual machine with the operating parameter. A view of the virtual machine operating within the device of the cluster can be displayed. A result of the comparison can be indicated through application of a visualization technique to an identifier representing the virtual machine within the view.

Abstract: Activation policies for workflows are described. Some implementations support the configuring of a workflow such that an activity in the workflow can start processing items on which a prior activity's processing is completed, but before the prior activity has completed processing all the items. In addition, this activity can be configured to group the items received so far into a subset and process it according to the action of the activity and then send it to a next activity; and the activity can be configured to repeat this process multiple times using the items that have been received since the previous subset. In some implementations, an input set of items for a workflow is generated from a set of one or more sources, and the workflow is generated by splitting the input set into subsets via a recurring catch and release mechanism that is responsive to activation policies of the activities of the workflow.

Abstract: Disclosed herein are techniques for identifying sources of software-based malfunctions. Techniques include identifying a potential software malfunction in a system, the system having multiple code sets associated with a plurality of different software sources; accessing a line-of-code behavior and relation model representing execution of functions of the code sets; identifying, based on the line-of-code behavior and relation model, a code set determined to have the potential to cause, a least in part, the potential software malfunction; and determining a source identifier of the identified code set.

Abstract: The present disclosure involves systems, software, and computer implemented methods for resource allocation and management. One example method includes receiving a request to run a first task for a first application, the request including a first application priority. At least one second application priority of at least one currently running application is identified. A dispatching algorithm is executed, to dispatch the first task to a first application server based on the first application priority and the at least one second application priority. Destination information is returned, in response to the request, for the first application server, for execution of the first task for the first application, at the first application server, using the first resources.

Abstract: In an embodiment, a method for scheduling tasks comprises at a task scheduler of a processing node, the processing node being a part of a processing group of a plurality of processing groups: retrieving a first task descriptor from a local memory, the task descriptor corresponding to a task scheduled for execution at the current time and comprising at least a task execution time, a frequency for performing the task, and a task identifier; determining whether the task descriptor is assigned to the processing group associated with the task scheduler for execution; if it is determined that the task descriptor is assigned to the processing group associated with the task scheduler for execution: determining whether the task descriptor is assigned to the task scheduler for execution; if it is determined that the task descriptor is assigned to task scheduler for execution: executing the task: updating the task execution time based on the current task execution time and the frequency for performing the task; and re-q

Abstract: A workflow scheduling system includes a first processor configured to schedule a plurality of workflows each including a plurality of tasks; a plurality of second processors configured to form a predetermined number of logical computation units and execute the scheduled workflows in parallel; and a memory that stores information about a plurality of task groups each of which includes one or more tasks from one or more of the workflows. The first processor is configured to, based on the stored information, instruct the second processors to execute the scheduled workflows while limiting a total number of the workflows simultaneously executed by the second processors to the predetermined number for each of the task groups.

Abstract: Disclosed are non-limiting examples of systems, apparatus, methods and computer program products for dynamically configuring a process associated with an application based on environmental characteristics monitored by a mobile device. In some implementations, the process includes stages and decision nodes. There is a configurable flow along a path defined by a subset of the stages controlled by a subset of the decision nodes. Contextual data is provided by the mobile device on which the application is usable. The contextual data indicates one or more environmental characteristics associated with a physical environment in which the mobile device is or has been located. The contextual data can be provided as a control input to a decision node associated with a current stage of the process. The process can be configured accordingly.

Abstract: A communication processing apparatus includes: an application unit that causes application software to be executed; and a real-time communication unit that receives communication requests from the application software and performs transmission and reception of data based on the communication requests. The real time unit includes: a request buffer that temporarily stores the communication requests received from the application software; a real-time communication-unit interface unit that, when the communication requests are data transmission requests, extracts the data transmission requests from the request buffer and performs transmission processing; and a self-diagnostic unit that detects a diagnostic index related to processing of the real-time communication unit, and transmits a notification of operation status of the real-time communication unit to the real-time communication-unit interface unit when the diagnostic index is within a predetermined range.

Abstract: A method of coordinating operation of a number of different modules in a computing system that includes: receiving, at a state machine of a module, publication of an occurrence of a number of triggering states at modules of the computing system to which a current state of the state machine is subscribed; in response to receiving publication of the occurrence the number of triggering states at modules of the computing system to which a current state of the state machine is subscribed, sending a request to a central supervisor for authorization to advance to a next state; and in response to receiving authorization from the central supervisor, advancing the state machine to the next state corresponding to the number of triggering states that have occurred.

Abstract: Data processing systems and methods, according to various embodiments, are adapted for efficiently processing data to allow for the streamlined assessment of risk ratings for one or more vendors. In various embodiments, the systems/methods may use one or more particular vendor attributes (e.g., as determined from scanning one or more webpages associated with the particular vendor) and the contents of one or more completed privacy templates for the vendor to determine a vendor risk rating for the particular vendor. As a particular example, the system may scan a website associated with the vendor to automatically determine one or more security certifications associated with the vendor and use that information, along with information from a completed privacy template for the vendor, to calculate a vendor risk rating that indicates the risk of doing business with the vendor.