Abstract: The invention relates to a network of equipment interconnected by switches incorporating routing tables, comprising a routing table manager implementing two modes of operation, an off-line mode of operation in which all the routing tables are calculated initially, then loaded subsequently into the switches, at least when booting up the network, an on-line mode of operation in which, in case of an event rendering an element of the network not usable or operational, only the routing tables impacted by said event are recomputed and loaded into the switches, said routing tables being recomputed by a computer of the routing table manager, said recomputed routing tables being loaded by several loaders of routing tables of the routing table manager into their groups of respective switches.

Abstract: A read time-out manager may include a counter and a plurality of timers. The counter may generate a counter output signal based on a first cycle time. The plurality of timers may be each configured to be assigned a read identification to measure a time-out period corresponding to the read identification. Each of the plurality of timers may operate in synchronization with the counter output signal to generate a time-out signal based on a second cycle time different from the first cycle time.

Abstract: A method includes receiving, by a data processing apparatus, a plurality of file operation requests, each file operation request including a priority, a deadline, and an operation type and representing a request to perform an operation on at least one file maintained in a distributed file system; identifying, by the data processing apparatus, a group of file operation requests to be executed together from the plurality of file operation requests, the identification based at least in part on at least one of: the file operations in the group of file operations being directed to a same storage system, or file operations in the group of file operations sharing a common operation type; and sending a request to execute the group of file operation requests to a system configured to perform the group of file operation requests.

Abstract: Embodiments include method, systems and computer program products for operating a computer system using a workload manager to control a dynamic thread mode switch. The method includes receiving a plurality of workloads. A workload manager determines which of the plurality of workloads are eligible to use a processor core operating in a multi-threaded mode and which workloads are response sensitive and use a processor core operating in a single-thread mode. A hypervisor determines a state of operation for one or more cores of one or more processors and causes a core switch for at least one or more cores in response to a determination that workloads eligible to use a processor core operating in a multi-threaded mode exist or workloads that are response sensitive and a determination that the state of operation for one or more cores of one or more processors should change to facilitate handling the associated workloads.

Abstract: A computer-implemented method and system involve providing a script-driven framework to monitor performance of operations on two or more sets of objects to be executed on a target system in parallel on separate threads according to a test scenario with user-defined language stipulations from a script file, and executing the script file through the framework to implement the test scenario on the target system. The language stipulations include an operation hierarchy for each of the two or more sets of objects and at least one synchronization point corresponding to a point in time at which operations on the separate threads are to be synchronized. The framework can be XML-compliant.

Abstract: Computational apparatus including multiple processing cores, which concurrently execute tasks that are respectively assigned to them. A central scheduling unit (CSU) including a CSU memory holding one or more look-up tables (LUTs) listing tasks for allocation to the processing cores and respective conditions for enabling of each of the tasks. The CSU receives indications of termination of the tasks by the processing cores, and selects, responsively to the indications, enabled tasks from the one or more LUTs for allocation to the processing cores. A network of distribution units are connected between the CSU and the processing cores. The distribution units allocate selected tasks from the CSU to the processing cores for execution and report the termination of the tasks from the processing cores to the CSU.

Abstract: An ordering server apparatus includes a controller circuit configured to receive remaining amount information from an image forming apparatus, determine to order a consumable product to be used in the image forming apparatus on a basis of the remaining amount information, obtain image forming apparatus location information, the image forming apparatus location information indicating location information of the image forming apparatus, obtain stock manager server location information, the stock manager server location information indicating location information of each of one or more stock manager server apparatuses, determine, on a basis of the image forming apparatus location information and the stock manager server location information, one stock manager server apparatus having a smallest distance from the image forming apparatus, and send, to the determined stock manager server apparatus, an order request to order the consumable product.

Abstract: Disclosed in embodiments of the present disclosure are a processor and an instruction operation method. The method includes obtaining criticality information of an instruction, wherein the criticality information of the instruction indicates importance degree of the instructions in a running process of a program; determining an operation sequence of the instruction based on the criticality information; and performing operations for the instruction based on the determined operation sequence of the instruction.

Abstract: A method of processing media content in Moving Picture Experts Group (MPEG) Network Based Media Processing (NBMP), includes obtaining multiple tasks for processing the media content, each of the multiple tasks having an envelope descriptor indicating, for a respective one among the multiple tasks, a message identifier (ID), a message priority and a sender ID of a sender, determining whether repeated tasks exist among the obtained multiple tasks, based on the message ID and the sender ID of each of the obtained multiple tasks, based on the repeated tasks being determined to exist, processing the media content, using one among the repeated tasks that has a highest priority among the message priority of each of the repeated tasks, and based on the repeated tasks being determined to not exist, processing the media content, using the obtained multiple tasks.

Abstract: An element manager (EM) of a virtualized network for a wireless communication system processes a suspend measurement job request received from a network manager (NM). The request is to suspend a measurement job to provide network function (NF) performance measurements related to a virtualized resource (VR). In response to the suspend measurement job request, the EM stops reports reporting measurement result data for the measurement job and determines whether to instruct a virtualized network function manager (VNFM) to delete one or more performance management (PM) jobs used to support the measurement job. The EM then generates a suspend measurement job response to indicate to the NM a result of the request to suspend the measurement job.

Abstract: In some embodiments, techniques include identifying a plurality of tasks associated with an identifier corresponding to an electronic device. A task series is generated so as to include the plurality of tasks, where each task in the series is associated with a performance time. When it is determined that the task has not been completed by the performance time, the task series is updated.

Abstract: Automatic clustering of a database table is disclosed. A method for automatic clustering of a database table includes receiving an indication that a data modification task has been executed on a table and determining whether the table is sufficiently clustered. The method includes, in response to determining the table is not sufficiently clustered, selecting one or more micro-partitions of the table to be reclustered. The method includes assigning each of the one or more micro-partitions to an execution node to be reclustered.

Abstract: In a Boundaryless Control High Availability (“BCHA”) system (e.g., industrial control system) comprising multiple computing resources (or computational engines) running on multiple machines, technology for computing in real time the overall system availability based upon the capabilities/characteristics of the available computing resources, applications to execute and the distribution of the applications across those resources is disclosed. In some embodiments, the disclosed technology can dynamically manage, coordinate recommend certain actions to system operators to maintain availability of the overall system at a desired level. High Availability features may be implemented across a variety of different computing resources distributed across various aspects of a BCHA system and/or computing resources. Two example implementations of BCHA systems described involve an M:N working configuration and M:N+R working configuration.

Abstract: Systems and methods for provisioning system components to execute jobs are provided. In one embodiment, receiving a request to provision system components of computing units for executing a job. An aggregate latency may be calculated for each of the computing units based on a startup latency for each job executing on the computing units. A computing unit with a lowest aggregate latency may be identified, and system components may be provisioned from the computing unit with the lowest aggregate latency.

Abstract: A hybrid scheduler for and a method of scheduler I/O operations for execution are disclosed. The hybrid scheduler has a first a second scheduler. The method includes receiving I/O operations from a first and second I/O source and executing, by the first scheduler, a first algorithm to determine a scheduling order of the I/O operations based on the bandwidth of a memory drive. The method also includes transmitting this order of I/O operations to the second scheduler that executes a second algorithm to determine a rescheduled order of I/O operations based on respective execution deadlines. The method also includes monitoring whether execution of the I/O operations respects the respective execution deadlines. In response to determining that the execution of at least one I/O operation does not respect the respective execution deadline, the method includes pausing accepting additional I/O operations by the second scheduler from the first scheduler.

Abstract: Systems and methods to reserve resources is provided. In exemplary embodiments, a selection of a profile from a user is received. A dynamic graphical user interface is generated, using one or more processors. The dynamic graphical user interface allows the user to configure a topology based on the selected profile. The dynamic graphical user interface provides input fields in which the user may select a resource. An indication of the selected applicable topology property for configuring the topology is received. A topology is automatically generating based in part on the selected applicable topology property.

Abstract: Systems and methods for the execution and operation of compute instances and tasks to perform batch jobs on behalf of customers of a computing resource service provider. Batch jobs can be subdivided into job fragments that can be concurrently executed by compute resources instantiated by the computing resource service provider. The computing resource service provider utilizes control mechanisms in the form of a maximum concurrent job fragment thresholds to mitigate the potential impact of resource constraints associated with larger batch jobs.

Abstract: The present disclosure provides a method and apparatus for processing a heterogeneous cluster-oriented task. The method comprises: receiving a task request and a basic execution environment; scheduling a heterogeneous device according to the task request; compiling the basic execution environment into an execution environment corresponding to the scheduled heterogeneous device, and deploying on the scheduled heterogeneous device; triggering the scheduled heterogeneous device to execute the task request. It is only necessary for the user to provide the basic execution environment with respect to the task, and unnecessary for the user to respectively write a version of execution environment for each type of hardware platform, thereby implementing quick development of the heterogeneous device code and reducing the development and maintenance costs.

Abstract: A computer-implemented method, system, and computer program product are provided to reduce stealing in a processor. The method includes allocating a private space for a first thread in a memory. The method also includes generating a plurality of child tasks by the first thread responsive to processing a first task. The method additionally includes storing a portion of the plurality of child tasks in the private space removing the ability of other threads from popping the portion of the plurality of child tasks, with a remainder of the plurality of child tasks being stored in a public space. The method further includes popping the portion of the plurality of child tasks from the private space by the first thread.

Abstract: An arithmetic processing apparatus includes a shift register configured to store a plurality of transactions each having one or more destinations; and a processor coupled to the shift register and configured to: select a first transaction among the transactions stored in the shift register based on a state of a destination of each of the transactions, determine whether or not the first transaction is issuable, select a second transaction based on destinations of the first transaction when it is determined that the first transaction is not issuable, issue the first transaction when it is determined that the first transaction is issuable, and issue the second transaction when it is determined that the first transaction is not issuable.

Abstract: In some implementations, a user device can schedule tasks based on user behavior. For example, the user device can receive a task request that includes a time window and user/device context parameters for performing the task. The user device can predict a time when the user/device context is optimal for performing the task during the time window based on historical context data. For example, the user device can generate an optimal context score for the task based on the context parameters and the historical context data. The user device can execute the requested task at a current time within the time window when a context score for the current context exceeds a threshold determined based on the optimal context score.

Abstract: Techniques for scheduling processing tasks in a device having multiple computing elements are disclosed. A network interface controller of the device receives processing tasks, for execution on the computing elements, from a network that is external to the device. The network interface controller schedules the tasks for execution on the computing devices based on policy data available to the network interface controller. A scheduler within the network interface controller, which can be implemented as a standalone processing unit (such as a microcontroller, a programmable processing core, or an application specific integrated circuit), performs such scheduling, thereby freeing the central processing unit of the device from the burden of performing scheduling operations. The scheduler schedules the tasks according to any technically feasible scheduling technique.

Abstract: A method for scheduling tasks includes receiving input that was acquired using one or more data collection devices, and scheduling one or more input tasks on one or more computing resources of a network, predicting one or more first tasks based in part on the input, assigning one or more placeholder tasks for the one or more predicted first tasks to the one or more computing resources based in part on a topology of the network, receiving one or more updates including an attribute of the one or more first tasks to be executed as input tasks are executed, modifying the one or more placeholder tasks based on the attribute of the one or more first tasks to be executed, and scheduling the one or more first tasks on the one or more computing resources by matching the one or more first tasks to the one or more placeholder tasks.

Abstract: A method and device for processing a memory, and a computer-readable storage medium are provided. In the method, reclaimable memory pages occupied by an application to be processed are determined, a reclaiming proportion corresponding to the application to be processed is determined, a reclaiming number is determined according to the reclaimable memory pages and the reclaiming proportion, and the reclaiming number of memory pages from the reclaimable memory pages are selected and reclaimed.

Abstract: A processor comprising: an execution unit for executing a respective thread in each of a repeating sequence of time slots; and a plurality of context register sets, each comprising a respective set of registers for representing a state of a respective thread. The context register sets comprise a respective worker context register set for each of the number of time slots the execution unit is operable to interleave, and at least one extra context register set. The worker context register sets represent the respective states of worker threads and the extra context register set being represents the state of a supervisor thread. The processor is configured to begin running the supervisor thread in each of the time slots, and to enable the supervisor thread to then individually relinquish each of the time slots in which it is running to a respective one of the worker threads.

Abstract: The present invention is directed to a computer cluster arrangement and a method for operation of the introduced computer cluster arrangement. The computer cluster arrangement comprises computation nodes CN, which dynamically outsource specific computation tasks to boosters B. Therefore, an assignment technique of boosters B to computation nodes CN is introduced. The assignment takes dynamically place at runtime. The present invention finds application in high performance cluster technology.

Abstract: This disclosure describes techniques implemented by an event scheduling system for using an ensemble of event schedulers to achieve higher precision when generating a tick at a desired time at which an event is scheduled to occur. Event scheduling systems that schedule events at scale may utilize event schedulers that have relatively low precision in order to provide the scheduling services at scale. By utilizing an ensemble, or group, of event schedulers to generate a tick at a particular time for a scheduled event, the ticks generated by the ensemble of event schedulers may be distributed throughout jitter delay such that likelihood that one of the ticks is close to the scheduled time for the event is increased. Thus, the techniques described herein may provide higher precision scheduling techniques for use by event scheduling systems.

Abstract: In a load balancing environment, a method, system, and computer program product may balance workloads by deploying one or more applications, defining a priority for a first application of the one or more applications, assigning a set of dynamic resources to the first application, configuring a set of burst reserves for the first application, configuring a schedule for the priority for the first application, configuring an elastic load balancer to manage the workload of the first application according to the priority and scheduling using the set of dynamic resources and burst reserves, and executing the one or more applications.

Abstract: A method and system for dispatching jobs for execution in a computing system containing multiple processors that include one or more processors that retrieve an indication of a last processor of the processors of a current class to which a last job of jobs of the current class has been submitted for execution. A new job of multiple jobs has been assigned to the current class. The one or more processors retrieve an indication of a delta number of the jobs being submitted for execution to the last processor of the current class. The one or more processors submit the new job for execution to a submission processor of the multiple processors. The submission processor is set to a selected processor of the multiple processors according to a comparison between the delta number and the queue size of the last processor of the current class.

Abstract: Disclosed herein is method and system for providing domain-specific response to user query. The user query is split into one or more sub-queries and domain of each of the sub-queries is determined based on domain-specific keywords present in each of the sub-queries. One or more responses to each of the sub-queries is retrieved from corresponding Domain-specific Query Handlers (DQHs). Finally, each of the one or more responses are collated for providing the domain-specific query to the user. In an embodiment, the DQHs are hierarchically arranged based on their importance and relevance to the user query. Further, the resources are allocated to each of the DQHs based on their hierarchy, thereby optimally distributing the resources among the DQHs. In an embodiment, the method of present disclosure ensures completeness/sufficiency in the response, before collating the one or more responses and providing the domain-specific response to the user.

Abstract: Techniques are disclosed relating to synchronizing access to pixel resources. Examples of pixel resources include color attachments, a stencil buffer, and a depth buffer. In some embodiments, hardware registers are used to track status of assigned pixel resources and pixel wait and pixel release instruction are used to synchronize access to the pixel resources. In some embodiments, other accesses to the pixel resources may occur out of program order. Relative to tracking and ordering pass groups, this weak ordering and explicit synchronization may improve performance and reduce power consumption. Disclosed techniques may also facilitate coordination between fragment rendering threads and auxiliary mid-render compute tasks.

Abstract: A system management device connected with a plurality of computation nodes includes a memory including a program instruction and a processor connected with the memory. The processor creates a list of computation nodes in which update of software is to be performed, in accordance with an input software update request, and detects a computation node in an idle state satisfying a condition for power saving, in accordance with an input power-saving operation request. When the computation node detected by the processor is on the list, the processor deactivates the detected computation node for power saving after the software thereof is updated.

Abstract: Methods and systems for performing memory garbage collection include determining a size of N double-ended queues (“deques”) associated with N respective garbage collection threads, where N is three or greater. A task is popped from a deque out of the N deques having a largest size. Garbage collection is performed on the popped task.

Abstract: At a first electronic device with a display and a microphone: sampling audio input using the first microphone; in accordance with the sampling of audio input using the first microphone, sending stop instructions to a second electronic device with a second microphone, the second electronic device external to the first electronic device, wherein the second electronic device is configured to respond to audio input received using the second microphone, and wherein the stop instructions instruct the second electronic device to forgo responding to audio input received using the second microphone, wherein responding to audio input received using the second microphone comprises providing perceptible output.

Abstract: A method and device for processing a memory, and a computer-readable storage medium are provided. In the method, reclaimable memory pages occupied by an application to be processed are determined, a reclaiming proportion corresponding to the application to be processed is determined, a reclaiming number is determined according to the reclaimable memory pages and the reclaiming proportion, and the reclaiming number of memory pages from the reclaimable memory pages are selected and reclaimed.

Abstract: Embodiments of the present disclosure relate to software application performance regression analysis. Other embodiments may be described and/or claimed.

Abstract: Methods, systems, and computer-readable storage media for detecting and managing events from data of an Internet-of-Things (IoT) network, and actions can include receiving a first call from a first application, the first call including timeseries data from one or more IoT devices in a first IoT network, retrieving a rule set for processing the timeseries data, and determining that an anomaly is represented in the timeseries data based on the rule set, and in response, generating an event, the event having a configuration that is customized by an enterprise associated with the first application, executing an event workflow to transition the event between states, and transmitting an event response to the first application.

Abstract: Apparatuses, methods and storage medium for computing including determination of work placement on processor cores are disclosed herein. In embodiments, an apparatus may include one or more processors, devices, and/or circuitry to identify a favored core of the processor cores. The one or more processors, devices, and/or circuitry may be configured to determine whether to migrate a thread to or from the favored core. In some embodiments, the determination may be by a process executed by a driver and/or by an algorithm executed by a power control unit of the processor.

Abstract: Embodiments for managing data in a large-scale computer network coupling one or more client computer to a server and having multiple clusters having respective applications, by: encoding web-based data of services to a web browser of a client computer; forwarding requests from the web browser to a cluster access subsystem that wraps the requests in a security protocol interaction that preserves an identity of a user of the client computer; deploying to deploy the applications using an application descriptor for each application of the deployed applications; and storing data about how each application can be accessed through service endpoints including a network address and port identifier for access by queries by any other component, application, or service in the network.

Abstract: A method for conserving resources in a distributed system includes receiving an event-criteria list from a resource controller. The event-criteria list includes one or more events watched by the resource controller and the resource controller controls at least one target resource and is configured to respond to events from the event-criteria list that occur. The method also includes determining whether the resource controller is idle. When the resource controller is idle, the method includes terminating the resource controller, determining whether any event from the event-criteria list occurs after terminating the resource controller, and, when at least one event from the event-criteria list occurs after terminating the resource controller, recreating the resource controller.

Abstract: A mechanism is provided for programmatic implicit multithreading. A first operation is executed on a first thread in a processor, where the first operation is from a set of operations within a block of code of an application that are distinct and process unrelated data. A determination is made as to whether a time limit associated with executing the first operation has been exceeded. Responsive to the time limit being exceeded, a determination is made as to whether there is one or more unexecuted operations in the set of operations. Responsive to one or more unexecuted operations existing in the set of operations, a new thread is spawned off on the processor to execute a next unexecuted operation of the one or more unexecuted operations.

Abstract: System for redirecting input/output, which performs, on a CPU, interrupting an execution of a first process with a first object descriptor table associated with the first process, the first object descriptor table including a reference for the first process to a first system resource; loading parasite code into memory, wherein the parasite code provides access to a second system resource under control of a second process; the second process forcing a switch of execution from the first process to the parasite code, and replacing in the first object descriptor table the reference for the first process to the system resource by a reference to the second system resource, thereby causing the input/output to go through the second system resource instead of the first system resource; and restoring the execution of the first process after the execution of the parasite code is complete.

Abstract: Systems, methods, and other embodiments associated with managing instances of services are described. In one embodiment, a method includes constructing pre-provisioned instances of a service within a first pool and constructing pre-orchestrated instances of the service within a second pool. In response to receiving a request for the service, the method executes executable code of a first pre-orchestrated instance as an executing instance and removing the pre-orchestrated instance from the second pool. A pre-provisioned instance is selected from the first pool to create a second pre-orchestrated instance within the second pool, and the pre-provisioned instance is removed from the first pool.

Abstract: Methods, systems, and computer storage media storing instructions for managing processing system efficiency. One of the methods includes obtaining data splitting a plurality of general-purpose processing units in a processing system into a high-priority domain and a low-priority domain, wherein the general-purpose processing units in the high-priority domain are assigned to perform one or more tasks comprising one or more high-priority tasks, and the general-purpose processing units in the low-priority domain are assigned to perform one or more low-priority tasks; and during runtime of the processing system, obtaining memory usage measurements that characterize usage of system memory by the high-priority domain and the low-priority domain; and adjusting, based on the memory usage measurements, a configuration of (i) the high-priority domain, (ii) the low-priority domain, or (iii) both to adjust utilization of the system memory by the general-purpose processing units.

Abstract: In an embodiment, a method is provided. In an embodiment, the method includes implementing a virtual remote direct memory access (RDMA) component in a virtualization layer on the computer system, the virtual RDMA component having an interface implementing RDMA semantics. An RDMA send request from a send queue associated with a first application running on the first VM is read using the virtual RDMA component, the RDMA send request referencing a send buffer in an application memory space for the first application. The virtual RDMA component then copies or transfers a message in the send buffer to a receive buffer in the second VM. A host computing system configured to implement the method and instructions configured to be executed on a host computing system is also provided.

Abstract: A method, a computer program product, and a computer system for a lightweight framework with dynamic self-organizing coordination capacity for clustered applications are provided. The lightweight framework provides a means for managing tasks that require coordination between application nodes. A node receives a task and determines whether one of other nodes is processing the task. The node runs as an active node to process the task, in response to determining that none of the other nodes is processing the task. The node runs as one of one or more passive nodes that monitor processing of the task, in response to determining that the one of the other node is processing the task.

Abstract: A workload scheduling method, system, and computer program product include analyzing a resource scheduling requirement for processes of a workload including the communication patterns among CPUs and accelerators, creating feasible resources based on static resource information of the resources for the processes of the workload, and selecting an available resource of the feasible resources to assign the workload based on the resource scheduling requirement, such that the CPU and GPU connection topology of the selection matches the communication patterns of the workload.

Abstract: Usage and performance data from a plurality of installed appliances is received via a network, a different corresponding subset of said appliances being associated with each of a plurality of customers. Said usage and performance data across customers is analyzed to identify capacity utilization related trends. A targeted offer is determined for a given customer, based at least in part on said analysis across customers and the given customer's own usage and performance data.

Abstract: Systems and methods for version control of pipelined enterprise software are disclosed. Exemplary implementations may: store information for executable code of software applications that are installed and executable by users, receive first user input from a first user that represents selection by the first user of a first software pipeline for execution; receive second user input from a second user that represents a second selection by the second user of a second software pipeline for execution, wherein the second software pipeline includes different versions of software applications that are included in the first software pipeline; facilitate execution of the first software pipeline for the first user; and facilitate execution of the second software pipeline for the second user at the same time as the execution of the first software pipeline for the first user.

Abstract: The invention enables digital music content to be downloaded to and used on a portable wireless computing device. An application running on the wireless device has been automatically adapted to parameters associated with the wireless device without end-user input (e.g. the application has been configured in dependence on the device OS and firmware, related bugs, screen size, pixel number, security models, connection handling, memory etc. This application enables an end-user to browse and search music content on a remote server using a wireless network; to download music content from that remote server using the wireless network and to playback and manage that downloaded music content. The application also includes a digital rights management system that enables unlimited legal downloads of different music tracks to the device and also enables any of those tracks stored on the device to be played so long as a subscription service has not terminated.