Abstract: A state of a first architectural register in a processing system is changed from a first state to a second state that indicates that the first architectural register is to be monitored during speculative execution. A second architectural register in the processing system is associated with a third state in response to the first architectural register being a source register for a memory load instruction that loads data from a memory into the second architectural register during speculative execution. Use of data in the second architectural register is constrained during speculative operations while the second architectural register is in the third state. In some cases, a “set taint” instruction is executed to change the state of the first architectural register from the first state to the second state.

Abstract: Provided are embodiments including a computer-implemented method, system and computer program product for determining precise operand-store-compare (OSC) predictions to avoid false dependencies. Some embodiments include detecting an instruction causing an OSC event, wherein the OSC event is at least one of a store-hit-load event or a load-hit-store event, marking an entry in a queue for the instruction based on the detected OSC event, wherein marking the entry comprises setting a bit and saving a tag in the entry in the queue. Some embodiments also include installing an address for the instruction and the tag in the history table responsive to completing the instruction.

Abstract: An apparatus and method for efficient matrix alignment in a systolic array.

Abstract: A computer system, processor, and method for processing information is disclosed that includes determining whether an instruction is a designated instruction, determining whether an instruction following the designated instruction is a subsequent store instruction, speculatively releasing the subsequent store instruction while the designated instruction is pending and before the subsequent store instruction is complete. Preferably, in response to determining that an instruction is the designated instruction, initiating or advancing a speculative tail pointer in an instruction completion table (ICT) to look through the instructions in the ICT following the designated instruction.

Abstract: Novel instructions, their format, and support thereof are described. For example, an instruction including a field for an opcode to indicate a reduction-based mask generation operation is to be performed, a field to identify a first packed data source operand, a field to identify a second packed data source operand, and a field to identify a destination operand to store reduction-based generated mask and its hardware support is described.

Abstract: An embodiment of a semiconductor package apparatus may include technology to determine respective priority levels for one or more boot time events, determine an amount of execution time for the one or more boot time events, and automatically adjust a timer based on the amount of execution time and the priority levels for the one or more boot time events. Other embodiments are disclosed and claimed.

Abstract: A computing environment includes multiple client devices that may each be configured to serve a particular function within the computing environment. The client devices are each coupled to a client management server that communicates with and manages functions of the client devices. When a client device first boots, the client management server communicates with the client device over a network in order to provision the client device with an enrollment image. Using the enrollment image, a client device can become enrolled with the client management server. Once enrolled, the client management server can provision the client device with a functional operating system image. The functional operating system image can support device applications that require a restricted number of runtime states within the client device. A new functional operating system image is downloaded from the client management server and installed on the client device each time the device is rebooted.

Abstract: Example embodiments relate to executing services in containers. The examples disclosed herein include a computing device comprising instructions to load an inner portion of an operating system kernel in an inner region of a kernel space and an outer portion of the operating system kernel in an outer region of the kernel space. The example computing device may execute a service in a container in a user space. The container may be communicatively coupled with the outer region of the operating system kernel but divided from the inner portion of the operating system kernel.

Abstract: An example method of updating firmware includes receiving a memory map of a memory. The method also includes determining, based on the memory map, a set of memory regions storing a bundle of drivers in the memory, the bundle of drivers residing in firmware and being in an executable format. The method further includes for one or more drivers in the bundle of drivers (i) building, based on the memory map, a header that describes the respective driver, and (ii) creating an object file including the header and the respective driver, where the object file is in the executable format. The method also includes storing one or more of the object files in non-volatile memory.

Abstract: An optical line terminal and a method for upgrading a primary device and a secondary device of the optical line terminal are provided. The secondary device receives a stepwise reset notification sent by the primary device; the secondary device resets a control chip according to the received stepwise reset notification, and sends a request message to the primary device after the control chip is reset, where the request message is used to request the primary device to deliver new configuration data; the secondary device obtains the new configuration data delivered by the primary device; and the secondary device restores data of the control chip by using the new configuration data delivered by the primary device. In the embodiments of the present disclosure, only the control chip of the secondary device needs to be reset and upgraded, and other hardware structures of the secondary device do not need to be reset.

Abstract: The present invention relates to a computer-implemented method for replacing a data string by a placeholder in a replacement device and, when necessary, for reconstituting the data string from the placeholder in the replacement device. There is a need for a central system for replacing a data string by a placeholder for a whole company which enables all applications to be protected and, when necessary, to have controlled access to sensitive data strings. It is necessary to make possible a central administration but at the same time to offer application-related access points throughout the company without long network communication paths.

Abstract: A system is disclosed that comprises a field programmable gate array (FPGA), a network interface, and a plurality of hardware templates. The FPGA comprises configurable hardware logic, and the hardware templates define a plurality of different pipelined processing operations. The FPGA can be accessible over a network via the network interface for commanding the FPGA to load a hardware template from among the hardware templates onto the FPGA to thereby configure hardware logic on the FPGA to perform the pipelined processing operation defined by the loaded hardware template, and wherein the FPGA is configured to (1) receive streaming data and (2) process the streaming data through the configured hardware logic to perform the pipelined processing operation defined by the loaded hardware template on the streaming data.

Abstract: Embodiments provide bidirectional signature protection for packaged apps by verifying an authored app as executable and downloadable from a trusted marketplace service in response to determining that a (first) unique signature embedded within binary code defining the authored app matches an original trusted marketplace service signature acquired from the trusted marketplace service. Embodiments store another (second) signature acquired from the binary code defining the authored app into a storage item of the trusted marketplace service, wherein the second signature is unique to the authored app and different from the first signature; and offer the verified, authored app for download from the trusted marketplace service, wherein the first signature and the second signature are embedded in binary code defining the authored app.

Abstract: State machine engines are disclosed, including those having an inter-rank bus control system, which may include a register. The state machine engine may include a plurality of configurable elements, such that each of the plurality of configurable elements comprises a plurality of memory cells. These cells may analyze data and output a result of the analysis. The IR bus control system may halt a write operation of data to be analyzed by the cells based, at least in part, on one or more conditions.

Abstract: Embodiments of the present disclosure provide methods, systems, apparatuses, and computer program products for building an rendering a message user interface (UI) within a group-based communication interface of a group-based communication system, where the message UI is rendered to a client device based on a customizable block configuration and on customizable block data that is received from an external application.

Abstract: A computing system can detect initiation data from a computing device of a user, which can indicate initiation of a client application on the computing device of the user. In response to detecting the initiation data, the system can perform a search to determine one or more likely destinations of the user before the computing system receives any specified destination from the user. Based on current contextual information of the user and each of the one or more likely destinations, the computing system may then generate data for a set of user interface features for each of the one or more likely destinations for subsequent display on the computing device of the user before the computing system receives any specified destination from the user.

Abstract: Examples may include a determining a policy for primary and secondary virtual machines based on output-packet-similarities. The output-packet-similarities may be based on a comparison of time intervals via which content matched for packets outputted from the primary and secondary virtual machines. A mode may then be selected based, at least in part, on the determined policy.

Abstract: A device configured to link correlithm objects in a correlithm object processing system, includes a link node and a memory. The link node receives a first string correlithm object comprising a first plurality of sub-string correlithm objects and a second string correlithm object comprising a second plurality of sub-string correlithm objects. Each of the second plurality of sub-string correlithm objects are unrelated to each of the first plurality of sub-string correlithm objects in n-dimensional space. The memory is communicatively coupled to the link node and stores a node table that associates at least one of the first plurality of sub-string correlithm objects with at least one of the second plurality of sub-string correlithm objects.

Abstract: A memory stores an environment file. A hardware processor receives a video file comprising a first frame and a second frame. The hardware processor determines a first object in the first frame and a first user action performed in the first frame. The hardware processor determines a second object in the second frame and a second user action performed in the second frame. The hardware processor determines a first keyword for the first user action and a second keyword for the second user action. The hardware processor determines, based on the first and second keywords, a first script and a second script from the environment file. The hardware processor then combines the first script and the second script to generate an automation script that, when executed, performs the first user action on the first object and the second user action on the second object.

Abstract: Systems and methods for just-in-time compilation are disclosed. The systems and methods can be used to generate composite blocks, reducing program execution time. The systems and methods can include generating single-trace blocks during program execution. Upon satisfaction of a trigger criterion, single-trace blocks can be selected for compilation into a composite block. The trigger criterion can be a number of executions of a trigger block. Selecting the single-trace blocks can include identifying blocks reachable from the trigger block, selecting a subset of the reachable blocks, and selecting an entry point for the composite block. The composite block can be generated from the single-trace blocks and incorporated into the program control flow, such that the composite block is executed in place of the selected single-trace blocks.

Abstract: A method, computer program product, and system includes a processor(s) obtaining, during runtime, from a compiler, two versions of a data parallel loop for an operation. The host computing system comprises includes a CPU and a GPU is accessible to the host. The processor(s) online profiles the two versions by asynchronously executing the first version, in a profile mode, with the GPU and executing the second version, in the profile mode, with the CPU. The processor(s) generates execution times for the first version and the second version. The processor(s) stores the executions times and performance data in a storage, where the performance data comprises a size of the data parallel loop for the operation. The processor(s) update a regression model(s) to predict performance numbers for a process of an unknown loop size. The processor(s) execute the operation with the CPU or the GPU based on the performance data.

Abstract: A computer implemented method manages execution of applications within a memory space of a multi-tenant virtual machine (MVM). The method includes instantiating a container for an application. The container has a thin client and a name space that is part of a memory space of the MVM. Threads of the application are moved from the MVM to the container. The threads are executed using the thin client in the name space of the container.

Abstract: The disclosed embodiments relate to a system for monitoring a virtual-machine environment. During operation, the system identifies a parent and a set of two or more child components that are related to the parent component in the virtual-machine environment. Next, the system determines a performance metric for each child component in the set of two or more child components. The system then determines a child-component performance state for each child component in the set of two or more child components based on the performance metric for the child component and a child-component state criterion. Finally, the system determines a parent state for the parent component based on the child-component performance state for each child component in the set of two or more child components and a parent-component state criterion, wherein the parent-component state criterion includes a threshold percentage or number of child components that have a specified state.

Abstract: Systems and methods for enabling a hypervisor to more efficiently determine the instruction executed by the virtual machine that causes a transition event. An example method may comprise: determining, by a processing device executing a hypervisor, a data storage location of a particular instruction of a guest operating system; detecting, by the hypervisor, a transition event between a virtual machine executing the guest operating system and the hypervisor, wherein the virtual machine comprises a virtual processor; comparing, by the hypervisor, an instruction pointer of the virtual processor and the data storage location of the particular instruction to determine a cause of the transition event; and executing, by the hypervisor, an operation corresponding to the cause of the transition event.

Abstract: A system and method for dynamically adjusting the amount of memory allocated to a virtual machine includes generating, by a memory resizing system, a current memory usage profile for the virtual machine. The memory resizing system and the virtual machine are part of a virtual computing system and the current memory usage profile is generated by mapping, as a function of time, memory usage information from the virtual machine. The system and method also include computing an upper baseline based upon a peak memory usage in the current memory profile, updating an initial memory allocation of the virtual machine based upon the upper baseline and a predetermined threshold for obtaining an initial revised memory allocation, determining a moving average of memory usage from a historical memory usage profile, and updating the initial revised memory allocation based upon the moving average of memory usage for obtaining a final revised memory allocation.

Abstract: Described herein are systems, methods, and software to enhance the management of virtual nodes in a computing environment. In one example, a method includes identifying a transition event for a first version of a virtual node executing on a first host, identifying a second host to support a second version of the virtual node, and initiating execution of the second version of the virtual node on the second host. In some implementations, the virtual node comprises a non-persistent portion on the executing host and a persistent portion on a second storage element.

Abstract: Communicating a low-latency event across a virtual machine boundary. Based on an event signaling request by a first process running at a first virtual machine, the first virtual machine updates a shared register that is accessible by a second virtual machine. Updating the shared register includes updating a signal stored in the shared register. The first virtual machine sends an event signal message, which includes a register identifier, through a virtualization fabric to the second virtual machine. The second virtual machine receives the event signaling message and identifies the register identifier from the message. Based on the register identifier, the second virtual machine reads the shared register, identifying a value of the signal stored in the shared register. Based at least on the value of the signal comprising a first value, the second virtual machine signals a second process running at the second virtual machine.

Abstract: Described herein are systems, methods, and software to enhance the management of virtual nodes in a computing environment. In one example, a method includes identifying a transition event for a first version of a virtual node executing on a first host, identifying a second host to support a second version of the virtual node, and initiating execution of the second version of the virtual node on the second host. In some implementations, the virtual node comprises a non-persistent portion on the executing host and a persistent portion on a second storage element.

Abstract: The disclosure provides an approach for dynamically reprogramming network and network infrastructure in response to VM mobility. The approach provides a hypervisor layer that can observe changes in VM-host relationships and reprogram the associated network and network infrastructure to maintain network communication. The hypervisor layer notifies a controller of a data center to migrate an ENI of the migrated VM to the same destination host as the migrated VM, in response to VM migration.

Abstract: Some embodiments provide novel methods for performing services for machines operating in one or more datacenters. For instance, for a group of related guest machines (e.g., a group of tenant machines), some embodiments define two different forwarding planes: (1) a guest forwarding plane and (2) a service forwarding plane. The guest forwarding plane connects to the machines in the group and performs L2 and/or L3 forwarding for these machines. The service forwarding plane (1) connects to the service nodes that perform services on data messages sent to and from these machines, and (2) forwards these data messages to the service nodes. In some embodiments, the guest machines do not connect directly with the service forwarding plane. For instance, in some embodiments, each forwarding plane connects to a machine or service node through a port that receives data messages from, or supplies data messages to, the machine or service node.

Abstract: Novel tools and techniques might provide for implementing applications management, based at least in part on operations, administration, and management (“OAM”) information. A host computing system might comprise a dedicated OAM management agent. While normal application frame flow might be sent or received by VMs running on the host computing system, OAM frame flow might be sent or received by the OAM management agent, which might also serve as an OAM frame generator. Alternatively, or additionally, based on a determination that at least one OAM frame has changed (in response to a change in address of far-end and/or near-end OAM server functions), the OAM management agent might update a list associating the at least one OAM frame that has changed with corresponding at least one VM of the one or more VMs, without restarting any of the at least one VM, the OAM management agent, and/or the host computing system.

Abstract: Techniques are disclosed for inferring design-time information based on run-time artifacts generated by services operating in a distributed computing cluster. In an embodiment, a metadata system extracts metadata including run-time artifacts generated by services in a distributed computing cluster while processing a workflow including multiple jobs. The extracted metadata is processed to identify entities and entity relationships which can then be used to generate lineage information. Using the lineage information, the metadata system can infer design-time information associated with the workflow. The inferred design-time information can then be utilized to, for example, recreate the workflow, recreate previous versions of the workflow, optimize the workflow, etc.

Abstract: A distributed memory system including a plurality of chips, a plurality of nodes that are distributed across the plurality of chips such that each node is comprised within a chip, each node includes a dedicated local memory and a processor core, and each local memory is configured to be accessible over network communication, a network interface for each node, the network interface configured such that a corresponding network interface of each node is integrated in a coherence domain of the chip of the corresponding node, wherein each of the network interfaces are configured to support a one-sided operation, the network interface directly reading or writing in the dedicated local memory of the corresponding node without involving a processor core, and the one-sided operation is configured such that the processor core of a corresponding node uses a protocol to directly inject a remote memory access for read or write request to the network interface of the node, the remote memory access request allowing to read

Abstract: This disclosure describes techniques that include establishing a service chain of operations that are performed on a network packet as a sequence of operations. In one example, this disclosure describes a method that includes storing, by a data processing unit integrated circuit, a plurality of work unit frames in a work unit stack representing a plurality of service chain operations, including a first service chain operation, a second service chain operation, and a third service chain operation; executing, by the data processing unit integrated circuit, the first service chain operation, wherein executing the first service chain operation generates operation data; determining, by the data processing unit integrated circuit and based on the operation data, whether to perform the second service chain operation; and executing, by the data processing unit integrated circuit, the third service chain operation after skipping the second service chain operation.

Abstract: In an embodiment, a system and method for supporting a seeding process with suspend and resume capabilities are described. A resumable seeding component in a data seeding module can be used to move data from a source tier to a target tier. A resumption context including a perfect hash function (PHF) and a perfect hash vector (PHV) persists a state of a seeding process at the end of each operation in the seeding process. The PHV represents data segments of the data using the PHF. The resumption context is loaded into memory upon resumption of the seeding process after it is suspended. Information in the resumable context is used to determine a last successfully completed operation, and a last copied container. The seeding process is resumed by executing an operation following the completed operation in the resumable context.

Abstract: A computer-implemented method of managing resources for multiple trial distributed processing tasks is presented. The method includes estimating an expected time needed to process each of a set of mask patterns which can be independently processed. The method further includes allocating each of the set of mask patterns to a set of processing cores in accordance with the expected time, and processing the mask patterns in accordance with the allocation, when the computer in invoked to estimate, allocate, and process.

Abstract: In an embodiment, an operating system for a computer system assigns each independently-schedulable code sequence to an activity. An activity may thus be associated with a group of related code sequences, such as threads that communicate with each other (whether or not they are part of the same program). When a code sequence is ready to be scheduled and it is not part of the current activity, it may preempt the current activity if the activity for the code sequence is not enabled and is not masked by the enabled activities. Each activity may define which other activities it masks. A flexible scheduling scheme may be devised based on the mask assignments for each activity.

Abstract: An electronic device monitors a volume of data processed by the electronic device within a first monitoring time segment, where a processor of the electronic device is configured to be in a first working mode, and the processor processes data in a poll mode driver (PMD) manner in the first working mode. The electronic device switches the processor from the first working mode to a second working mode when it is determined, according to the volume of data processed by the electronic device within the first monitoring time segment, that the processor is idle within the first monitoring time segment, where the processor processes data in the PMD manner and a sleep manner in the second working mode.

Abstract: Embodiments of the preset disclosure provide a task scheduling method, an apparatus, an electronic device, and a storage medium. The method comprises traversing tasks in a current queue, and obtaining current values of current state information and a frequency parameter for each task that has been traversed, wherein the frequency parameter is a preset parameter for indicating a scheduled frequency of a corresponding task; selecting a task with the minimum scheduled frequency in the tasks having the current state information indicating an executable state as a target task according to the current values of the current state information and the frequency parameter for each task; and executing the selected target task, and updating the current value of the frequency parameter corresponding to the target task after the target task is executed.

Abstract: The present disclosure relates generally to a method of executing application code developed using a simplified programming interface. I/O tasks and processing intensive tasks are designated as event callbacks in a single event loop runtime environment. The I/O tasks and processing intensive tasks are generated in association with a user request. Tasks associated with event callbacks are offloaded for execution using a resource based multithreading module to allocate the tasks between a plurality of processors based on the current utilization of each of the plurality of processors and an estimation of computing resources for execution of the tasks. The tasks are executed at the allocated processors of the plurality of processors and the user request is fulfilled using results of the executed tasks.

Abstract: System and method is provided for scheduling of a set of non-preemptive tasks by partitioning, the set of non-preemptive tasks either as a set of schedulable tasks or as a set of non-schedulable tasks; sorting, by a scheduling technique, the set of non-preemptive tasks partitioned; determining, by the scheduling technique, a possibility of execution of each of the set of schedulable tasks; and scheduling the set of schedulable tasks and the set of non-schedulable tasks upon determining the possibility of execution of each of the set of schedulable tasks.

Abstract: A method and associated system. Expected problems in a workload plan are predicted in response to any current occurrences of impacting system events according to the workload plan and corresponding expected impacts of the impacting system events of system events on execution of impacted work units of work units. Predicting the expected problems includes: identifying workload deadlines relating to the impacted work units in the workload plan; estimating intervention times for addressing the expected problems before missing the corresponding workload deadlines; determining corresponding minimum times required to fulfill the workload deadlines according to a progress of the workload plan; and estimating each of the intervention times further according to the minimum time of the corresponding workload deadline. An intervention program of system interventions on the computing system is established.

Abstract: An application workload is scheduled for execution by each of one or more processing cores operating in a first mode. Performance metrics for the each of the one or more processing cores and a memory component are monitored, wherein the memory component stores data necessary for the one or more processing cores to carry out instructions to complete the scheduled workload. If performance metrics are greater than a specified threshold, a number of the one or more processing cores handling the scheduled workload is reduced. If the performance metrics are not greater than the specified threshold, whether each of the processing cores of the processor is currently handling a scheduled workload is determined. If each of the processing cores of the processor is currently handling the scheduled workload, the processor is configured to operate in a second mode.

Abstract: Placing workloads in a multi-array system comprising a plurality of storage arrays, including: determining, for each of a plurality of storage arrays, a current system activity level trend of the storage array; receiving a performance profile of a workload to be executed on one of the storage arrays; generating, for each of the plurality of storage arrays in dependence upon the current system activity level trend of the storage array and the performance profile of the workload, a projected system activity level trend for the storage array; identifying, in dependence upon the projected system activity level trend for each of the plurality of storage arrays, an optimal storage array for receiving the workload; and placing the workload on the optimal storage array.

Abstract: The present approach relates to systems and methods for facilitating an interrupt or change in automated tasks in progress, and using a control token (e.g., flag) to modify the progress of the automated task. In contrast to current automated tasks that may not be modified once the request for the automated task has been sent, the presently disclosed techniques allow for controlling and/or changing an automated task by using the control token and an associated status in conjunction with logical checkpoints defined for a thread at which the thread can be paused and the status changed.

Abstract: A processing system includes a core, at least one accelerator function unit (AFU) and an accelerator interface. The core is utilized to develop at least one task. The AFU is utilized to execute the task. The accelerator interface is arranged between the core and the AFU to receive an accelerator interface instruction transmitted by the processing core and instruct the AFU to execute the task according to the accelerator interface instruction.

Abstract: One or more processors provide selective and piecemeal data loading and utilization. One or more processors prioritize, for loading, a data of a first data type and a data of a second data type. One or more processors generate a partially loaded data table by partially loading the data of the first data type and the data of the second data type into a table within a relational database. One or more processors utilize the partially loaded data table to execute a plurality of computing tasks.

Abstract: Embodiments of a system and method for dynamic hardware acceleration are generally described herein. A method may include identifying a candidate task from a plurality of tasks executing in an operating environment, the operating environment within a hardware enclosure, the candidate task amenable to hardware optimization, instantiating, in response to identifying the candidate task, a hardware component in the operating environment to perform hardware optimization for the task, the hardware component being previously inaccessible to the operating environment, and executing, by the operating environment, a class of tasks amenable to the hardware optimization on the hardware component.

Abstract: A heterogeneous resource reservation (HRR) manager configured to classify historical application requests from a past time interval for a first workload to generate labeled historical application requests. The HRR manager further configured to generate a forecast based on the labeled historical application requests and for predicting future application requests for the first workload for a future time interval and calculate a joint plan based on the forecast. The joint plan including a set of virtual resources, a set of billing contracts, and a set of load balancer weights. The HRR manager further configured to implement the joint plan for a distributed computing workload during the future time interval.

Abstract: This disclosure relates to model loading. In one aspect, a method includes determining, based on a preset execution script and resource information of multiple execution nodes, loading-tasks corresponding to the execution nodes. Each execution node is deployed on a corresponding cluster node. Loading requests are sent to the execution nodes, thereby causing the execution nodes to start execution processes based on the corresponding loading requests. The execution processes start multiple model service frameworks on each cluster node. Multiple models are loaded onto each of the model service frameworks. Each loading request includes loading-tasks corresponding to the execution node to which the loading request was sent. The execution processes include a respective execution process for each model service framework.