Abstract: Disclosed are methods, devices and systems for all-in-one signal processing, linear and non-linear vector arithmetic accelerator. The accelerator, which in some implementations can operate as a companion co-processor and accelerator to a main system, can be configured to perform various linear and non-linear arithmetic operations, and is customized to provide shorter execution times and fewer task operations for corresponding arithmetic vector operation, thereby providing an overall energy saving. The compact accelerator can be implemented in devices in which energy consumption and footprint of the electronic circuits are important, such as in Internet of Things (IoT) devices, in sensors and as part of artificial intelligence systems.

Abstract: Methods and System for use on a memory controller are disclosed which provides atomic compute operations of any size using an asynchronous, pipelined message passing interface between clients and the memory controller.

Abstract: Fast unaligned memory access. hi accordance with a first embodiment of the present invention, a computing device includes a load queue memory structure configured to queue load operations and a store queue memory structure configured to queue store operations. The computing device includes also includes at least one bit configured to indicate the presence of an unaligned address component for an entry of said load queue memory structure, and at least one bit configured to indicate the presence of an unaligned address component for an entry of said store queue memory structure. The load queue memory may also include memory configured to indicate data forwarding of an unaligned address component from said store queue memory structure to said load queue memory structure.

Abstract: An instruction to perform a conditional branch to an indirectly specified location is executed. A branch address is obtained from a location in memory, the location in memory designated by the instruction. A determination is made, based on a condition code of another instruction, whether a branch is to occur, and a branch to the branch address is performed, based on determining the branch is to occur.

Abstract: A processor including a stunt box with an intermediate storage, including a plurality of registers, configured to store a plurality of execution pipe results as a plurality of intermediate results; a storage, communicatively coupled to the intermediate storage, configured to store a plurality of storage results which may include one or more of the plurality of intermediate results; and an arbiter, communicatively coupled to the intermediate storage and the storage, configured to receive the plurality of execution pipe results, the plurality of intermediate results, and the plurality of storage results and to select an output to retire from of the plurality of results, the plurality of intermediate results, and the plurality of storage results.

Abstract: Table of Contents (TOC)-setting instructions are replaced in code with TOC predicting instructions. A determination is made as to whether code includes an instruction sequence to compute a value of a pointer to a reference data structure, such as a TOC. Based on determining the code includes the instruction sequence, the instruction sequence in the code is replaced with a set instruction. The set instruction predicts the value of the pointer to the reference data structure.

Abstract: Table of Contents (TOC)-setting instructions are replaced in code with TOC predicting instructions. A determination is made as to whether code includes an instruction sequence to compute a value of a pointer to a reference data structure, such as a TOC. Based on determining the code includes the instruction sequence, the instruction sequence in the code is replaced with a set instruction. The set instruction predicts the value of the pointer to the reference data structure.

Abstract: Disclosed embodiments relate to a prefetcher for delinquent irregular loads. In one example, a processor includes a cache memory, fetch and decode circuitry to fetch and decode instructions from a memory; and execution circuitry including a binary translator (BT) to respond to the decoded instructions by storing a plurality of decoded instructions in a BT cache, identifying a delinquent irregular load (DIRRL) among the plurality of decoded instructions, determining whether the DIRRL is prefetchable, and, if so, generating a custom prefetcher to cause the processor to prefetch a region of instructions leading up to the prefetchable DIRRL.

Abstract: An apparatus and method for adaptive spatial accelerated prefetching. For example, one embodiment of an apparatus comprises: execution circuitry to execute instructions and process data; a Level 2 (L2) cache to store at least a portion of the data; and a prefetcher to prefetch data from a memory subsystem to the L2 cache in anticipation of the data being needed by the execution unit to execute one or more of the instructions, the prefetcher comprising a buffer to store one or more prefetched memory pages or portions thereof, and signature data indicating detected patterns of access to the one or more prefetched memory pages; wherein the prefetcher is to prefetch one or more cache lines based on the signature data.

Abstract: A processor includes two or more branch target buffer (BTB) tables for branch prediction, each BTB table storing entries of a different target size or width or storing entries of a different branch type. Each BTB entry includes at least a tag and a target address. For certain branch types that only require a few target address bits, the respective BTB tables are narrower thereby allowing for more BTB entries in the processor separated into respective BTB tables by branch instruction type. An increased number of available BTB entries are stored in a same or a less space in the processor thereby increasing a speed of instruction processing. BTB tables can be defined that do not store any target address and rely on a decode unit to provide it. High value BTB entries have dedicated storage and are therefore less likely to be evicted than low value BTB entries.

Abstract: A method for parallelization of a numeric optimizer includes detecting an initialization of a numeric optimization process of a given function. The method computes a vector-distance between an input vector and a first neighbor vector of a set of neighbor vectors. The method predicts, using the computed vector-distance, a subset of the set of neighbor vectors. The method pre-computes, in a parallel processing system, a set of evaluation values in parallel, each evaluation value corresponding to one of the subset of the set of neighbor vectors. The method detects a computation request from the numeric optimization process, the computation request involving at least one of the set of evaluation values. The method supplies, in response to receiving the computation request, and without performing a computation of the computation request, a parallelly pre-computed evaluation value from the set of evaluation values to the numeric optimization process.

Abstract: A non-limiting example of a computer-implemented method for implementing wide vector execution for an out-of-order processor includes entering, by the out-of-order processor, a single thread mode. The method further includes partitioning, by the out-of-order processor, a vector register file into a plurality of register files, each of the plurality of register files being associated with a vector execution unit, the vector execution units forming a wide vector execution unit. The method further includes receiving, by a vector scalar register of the out-of-order processor, a wide vector instruction. The method further includes processing, by the wide vector execution unit, the wide vector instruction.

Abstract: Method and apparatus for stopping completions using stop codes in an instruction completion table are provided by during a first clock cycle, in response to determining that a given entry in an Instruction Completion Table (ICT) is finalized and is associated with a stop code, completing, according to a program order, instructions included in one or more finalized entries of the ICT located in the ICT before the given entry; during a second clock cycle, after completing the instructions, performing exception processing for a special instruction included in the given entry; and during a third clock cycle, after processing the special instruction, completing, according to the program order, additional instructions in one or more finalized entries located in the ICT after the given entry.

Abstract: A compute unit configured to execute multiple threads in parallel is presented. The compute unit includes one or more single instruction multiple data (SIMD) units and a fetch and decode logic. The SIMD units have differing numbers of arithmetic logic units (ALUs), such that each SIMD unit can execute a different number of threads. The fetch and decode logic is in communication with each of the SIMD units, and is configured to assign the threads to the SIMD units for execution based on such differing numbers of ALUs.

Abstract: An example apparatus can include a host device and an apparatus including a memory device and a controller coupled to the memory device, wherein the host device is configured to send a command to read an image to configure the host to boot from the memory device to the controller and wherein a base address register is configured to receive the command, indicate the size of the image, and redirect the command to a first image in memory using a first register that indicates a size of the first image and a second register that indicates a location of the first image.

Abstract: An information handling system includes a storage device and a processor. The storage device includes a boot image for the information handling system. The processor determines an architectural location for a boot device for the information handling system, determines that the storage device is located at the architectural location of the information handling system, determines a unique identifier for the storage device, determines from a basic input/output system (BIOS) of the information handling system a BIOS identifier associated with the unique identifier, and places the BIOS identifier at the top of a BIOS boot order list.

Abstract: A peer configuration system provides a configuration file via peer-to-peer networking. A master device stores a peer configuration. Whenever any peer device requires configuration, the peer device assumes a slave role and queries the master device to retrieve the peer configuration. The peer configuration is thus propagated via peer-to-peer networking to the peer device. The peer device boots-up using the peer configuration retrieved from the master device.

Abstract: A method for improving performance of a computer procurement application includes using the procurement control system computer, determining a peer group associated with a first entity, the peer group including entities that have one or more attribute values in common with the first entity; using a procurement control system computer, obtaining, from client computers respectively associated with the entities, configurations that instruct a procurement application how to perform procurement tasks for the respective entities of the entities in the peer group; using a procurement control system computer, obtaining, from a first client computer associated with the first entity, a first configurations that instruct the procurement application how to perform procurement tasks for the first entity; using the procurement control system computer, determining, from Key Performance Indicators (KPI values) of the entities in the peer group and of the first entity, one or more KPI values of the first entity that are relat

Abstract: A method displays a user interface including an activation entry for the activation entry and receives a first value that is input for the activation entry. In response to receiving the first value, the method determines an activator entry that is linked to the activation entry via linking information. The activator entry includes an activator value. The first value is compared to the activator value to calculate a visibility status for the activator entry. The user interface is altered based on the visibility status of the activator entry.

Abstract: A method for providing fishing tournament management service may include steps of transmitting data to a plurality of mobile devices, wherein the data may display a fishing tournament-related display including information on fishing tournaments being prepared for opening and a registration menu; receiving applications through the registration menu and transmitting information on application receipts to the mobile devices through which applicants have registered; receiving information on captured fish when a fishing tournament is started, from the mobile devices, to check the species and length thereof; analyzing the information on captured fish, generating ranking information if the analyzed information on captured fish corresponds to the predetermined reference and then transmitting the ranking information to the mobile devices through which applicants have registered; and determining winners according to the ranking information when the fishing tournament is over and transmitting information including winne

Abstract: Disclosed are examples of systems, apparatus, methods, and computer program products for generating content objects using an integrated development environment. In some implementations, an integrated development environment is displayed. A request to generate or update an educational content object can be processed, and a presentation including metadata selection options can be provided. After a selection of one of the metadata selection options is received, the presentation can be updated. A different request is received from a rich text editor provided in a new presentation, and the new presentation can be updated.

Abstract: A method, system and product for improving acquisition process of GUI elements using user input. A method comprises obtaining a digital representation of a first version of a GUI that includes a GUI element, obtaining a digital representation of a second version of the GUI, obtaining an identified element that was identified, using an acquisition process operated on the second version of the GUI, as being estimated to correspond to the GUI element in the first version of the GUI. The first version of the GUI and the second version of the GUI may be displayed in parallel to a user. User input indicative of whether the identified element corresponds to the GUI element, based on the display, may be obtained. The acquisition process may be updated based on the user input.

Abstract: A method to emulate a system represented by one or more of hardware portions and software portions is described. The method comprises determining whether a subset of the one or more hardware portions and software portions have been tested, and identifying whether the system has performed to a specification based on the testing. The method further comprising, when the system has not performed to the specification, determining one or more of the hardware and software portions to update for retesting.

Abstract: Systems and methods are disclosed for providing visualizations across devices of user interactions with a data analytics service. User interactions with a data analytics user interface on a first device are detected. Device agnostic commands are generated for performing the user interactions on a second device. The device agnostic commands are transmitted to a second device for replicating the user interactions on the second device.

Abstract: A method and an apparatus for network function virtualization, which may allow services of VNF components logically and physically distributed in a VNF instance to be shared with another VNF instance in a NFV environment without any separate component such as a load balancer. The method for network function virtualization includes: configuring one or plural virtual network function (VNF) instances including one or plural shared virtual network function (VNF) components and one or plural VNF instances including one or plural non-shared VNF components, generating a descriptor including attribute information of the one or plural shared VNF components, and providing the descriptor to a VNF instance which is to use the shared VNF component.

Abstract: Systems and methods permit customers of a service provider network to specify various constraints on a desired fleet of virtual machine instances without having to specify the hardware types of instances to be included in the fleet. Instead, the customer can specify per-instance hardware constraints (number of CPUs, amount of memory, etc.) and job constraints (e.g., deadline, budget, application type, etc.). A provisioning service accesses an internal database containing instance cost data, instance availability data, and mappings between application type and fleet configurations to propose a fleet of instances that complies with the customer-specified per-instance hardware and job constraints, thereby freeing the customer from having to be conversant in the particular instances offered by the service provider.

Abstract: Provided are methods and systems for facilitating selection of a cloud configuration for deploying an application program with high accuracy, low overhead, and automatic adaptivity to a broad spectrum of applications and cloud configurations. The methods and systems are designed for building a performance model of cloud configurations, where the performance model is capable of distinguishing an optimal cloud configuration or a near-optimal cloud configuration from other possible configurations, but without requiring the model to be accurate for every cloud configuration. By tolerating the inaccuracy of the model for some configurations (but keeping the accuracy of the final result) it is possible to achieve both low overhead and automatic adaptivity: only a small number of samples may be needed and there is no need to embed application-specific insights into the modeling.

Abstract: A method, an apparatus, and a system for accessing a storage device. The method includes: acquiring, by an I/O adapter, an access request from a virtual machine, where the access request carries virtual address information of a to-be-accessed storage area; generating an access instruction according to the access request, where the access instruction carries the virtual address information and an identifier of a virtual channel of the virtual machine, where the virtual channel corresponds to the virtual machine on a one-to-one basis and is used to connect the corresponding virtual machine to a storage device target, and the storage device target is configured to manage access to the storage device; and sending the access instruction to the storage device target.

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: When the physical network is transitioned into a virtual network, functionality provided by physical ports are no longer available in the virtual machine (“VM”) environments. Physical to virtual network transport function abstraction may be implemented to provide software applications running in the VM with state information or similar information necessary for the software applications to continue running, without the physical ports that would provide such information in a physical system. In some embodiments, a virtual machine manager might send first information to a virtual infrastructure manager, which might send second information to a virtualized application manager or orchestrator. The virtualized application manager or orchestrator might in turn send third information to a virtualized application running in a virtual machine or container. The first, second, and/or third information might include state information (e.g.

Abstract: Apparatus and methods are described herein for multiple single level security (MSLS) domains including, but not limited to, a secure kernel hypervisor (SKH). The SKH configures a single multi-tenant cloud to host the MSLS domains. A cloud orchestration system (COS) configures the single multi-tenant cloud to set up a plurality of separate virtual work packages (VWPs) for the MSLS domains. A key management system (KMS) is configured to manage security objects associated with the MSLS domains.

Abstract: A method for accessing non-functional host capabilities and services of a host operating system, by a guest operating system, is provided. The method includes receiving a function code and additional data from an application of a guest operating system, wherein the function code corresponds to a non-functional service request on a host operating system. The method further includes creating a parameter control block using the function code and the additional data in memory of the guest operating system, wherein the parameter control block is accessible by a hypervisor of the host operating system. The method further includes issuing a hardware instruction by the guest operating system, wherein the hypervisor of the host operating system receives control. The method further includes receiving a notification from the hypervisor that the execution of the non-functional service request is complete.

Abstract: A system and method include determining, by a telemetry control system of a telemetry system that an agent associated with the telemetry control system terminated during operation. The agent collects telemetry data from data sources associated with the telemetry system. The system and method also include determining that a number of times the agent has terminated is greater than a predetermined threshold, restarting the agent after a first predetermined delay in response to exceeding the predetermined threshold, and determining that the agent terminated again within a predetermined time period upon restarting. The system and method further include updating a configuration file of the agent in response to the termination within the predetermined time period and restarting the agent with the updated configuration file. The updating is based upon an agent termination record of the agent.

Abstract: Systems and methods are described for selectively transitioning execution environments in an on-demand code execution system based on a timing of a next request to execute code within such environments. The system can predict, from a history of requests to the system, when a next call to execute code in an environment, such as a virtual machine instance, will occur. The system can then calculate and compare the relative costs of maintaining the environment in an executing state or of halting the environment and moving the environment to a lower tier of memory, each of which can be based on the predicted next call to execute code within the environment. If the relative cost of maintaining the environment in an executing state exceeds that of halting the environment and moving the environment to a lower tier of memory, the virtual machine is halted and transitioned to secondary memory.

Abstract: Secure and efficient memory sharing for guests is disclosed. For example, a host has a host memory storing first and second guests whose memory access is managed by a hypervisor. A request to map an IOVA of the first guest to the second guest is received, where the IOVA is mapped to a GPA of the first guest, which is is mapped to an HPA of the host memory. The HPA is mapped to a second GPA of the second guest, where the hypervisor controls access permissions of the HPA. The second GPA is mapped in a second page table of the second guest to a GVA of the second guest, where a supervisor of the second guest controls access permissions of the second GPA. The hypervisor enables a program executing on the second guest to access contents of the HPA based on the access permissions of the HPA.

Abstract: A method and system including two or more virtual machines; a load balancer module; a load balancer processor in communication with the load balancer module and operative to execute processor-executable process steps to cause the system to: initiate an application integration component; create a set of one or more integration steps to transfer data between a cloud-based application and a second application; receive selection of an element of a virtual machine; broadcast a current state of each virtual machine to the other virtual machines; determine which of the two or more virtual machines has a pre-set amount of the selected element; retrieve a mutual exclusion component, wherein the mutual exclusion component is retrieved by the virtual machine determined to have the pre-set amount of the selected element; and execute the integration steps at the virtual machine that retrieved the mutual exclusion component. Numerous other aspects are provided.

Abstract: A method includes using a network interface controller to monitor a transmit ring, wherein the transmit ring comprises a circular ring data structure that stores descriptors, wherein a descriptor describes data and comprises a guest bus address that provides a virtual memory location of the data. The method also includes using the network interface controller to determine that a descriptor has been written to the transmit ring. The method further includes using the network interface controller to attempt to retrieve a translation for the guest bus address. The method includes using the network interface controller to read the descriptor from the transmit ring.

Abstract: Technical solutions are described for machine-assisted workflow execution. An example method includes selecting a workflow for interactive execution, the workflow including a sequence of workflow steps. The method further includes pulling a preliminary update for the workflow from a data source and modifying the workflow dynamically. The method further includes selecting a workflow step from the workflow for execution, and pulling updated information for the workflow step from the data source. The method further includes executing the workflow step using the pulled updated information, the execution includes changing a target system. The method further includes accumulating execution information including attributes associated with execution of the workflow step, and pushing the execution information to the data source upon completion of the workflow step.

Abstract: The described technology provides a system and method for sequential execution of one or more operation segments in an asynchronous event driven architecture. One or more operation segments may be associated and grouped into an activity of operation segments. The operation segments of an activity may be sequentially executed based on a queue structure of references to operation segments stored in a context memory associated with the activity. Any initiated operation segment may be placed on the queue structure upon completion of an associated I/O action.

Abstract: A distributed transaction network for processing and verifying transactions asynchronously between transaction parties comprising a transferor and a transferee, the transferor having an obligation to transfer control of assets to the transferee. Each transaction party is randomly assigned a verifier upon it joining the network, which verifies the transaction of its transaction party by ensuring the asset of the transferor satisfies the transaction obligation and no fork condition exists. The transaction is executed only upon every verifier verifying and signing the transaction. The distributed transaction network further has a directed acyclic transaction map comprising topologically sorted transactions forming a single transaction path of sequentially executed transactions for each transaction party, to prevent the occurrence of race conditions, double spend, or fork conditions.

Abstract: Methods, systems, computer-readable media, and apparatuses for providing mobile application management (MAM) functionalities are presented. In some embodiments, a mobile device may initialize a partially managed application associated with a first managed user account and an unmanaged user account. The mobile device may execute first managed tasks associated with the first managed user account in accordance with a first set of MAM policies provided by a first MAM service provider. The mobile device may execute unmanaged tasks associated with the unmanaged account independent of the first set of MAM policies. In some embodiments, the mobile device may initialize the multi-account managed application associated with a second managed user account.

Abstract: Methods, systems, and computer-readable media for event-driven scheduling using directed acyclic graphs are disclosed. A directed acyclic graph is generated that comprises a plurality of nodes and a plurality of edges. The nodes represent jobs, and the edges represent dependency relationships between individual jobs. Based (at least in part) on one or more events, a job scheduler determines that one of the nodes represents a runnable job. One or more of the dependency relationships for the runnable job are satisfied by the one or more events. An execution schedule is determined for the runnable job. Based (at least in part) on the execution schedule, execution of the runnable job is initiated using one or more computing resources.

Abstract: Method and system embodying the method for load balancing of scheduled jobs among a plurality of engines encompassing determining a number of cluster credits for each of a plurality of clusters that comprise at least one engine capable of processing a scheduled job; determining a number of engine credits for each of the plurality of engines comprising each of the at least one engine in accordance with a number of jobs assigned to each of the plurality of engines; evaluating the determined number of cluster credits and the determined number of engine credits in accordance with a credit evaluation policy; and assigning the job to one of the plurality of engines in accordance with the evaluation, is disclosed.

Abstract: Systems and methods for allocating jobs in a distributed file system queue are provided. The system may receive a job request and intelligently divide the job request into one or more logical job stages. Each job stage may be assigned a stage weight based on historical data corresponding to each job stage, such as job stage computing requirements, job stage data outputs, and the like. The system may assign each job stage to a job queue n the distributed file system based on the stage weight and the current computing availability of each job queue. The system may execute each job stage in the assigned job queue to complete the job request.

Abstract: A streaming program execution method of an intelligent terminal is provided. The intelligent terminal does not store a program package of a program before the program is executed. The program package of the program includes a code segment, a read-only data segment, an uninitialized data segment, and a readable/writable data segment and is stored and managed by a server. The intelligent terminal obtains a program execution instruction, downloads the uninitialized data segment, the readable/writable data segment and the code segment of the program package from the server, loads the same into a local storage space and starts the execution of the program. During the execution process, according to a call request of the program on data of the code segment and the read-only data segment, the intelligent terminal downloads the requested data from the server and loads the data into the local storage space for the call of the program.

Abstract: Systems and methods for resource management for multi-tenant applications in a Hadoop cluster are disclosed. In one embodiment, in an information processing device comprising at least one computer processor, a method for resource management for multi-tenant applications in a Hadoop cluster may include: (1) allocating an initial allocation of a resource in a resource pool to a plurality of tenants, each tenant having a workload; (2) determining a memory requirement for each of the plurality of tenants; (3) determining a maximum number of concurrent queries or jobs for each of the plurality of tenants; (4) determining a memory and vcore requirement for each of the plurality of tenants based on the memory requirement and maximum number of concurrent queries or jobs; and (5) allocating the resources to each of the plurality of tenants.

Abstract: An online system maintains a plurality of content items. The online system selects and provides content items to users of the online system in response to impression opportunities to provide content items to users. A plurality of segments of the impression opportunities are determined. Each segment categorizes the impression opportunities. A relationship between a value metric and computing resources used in the selection process are determined for each segment. Each relationship provides a rate of increase of the value metric given an increase in computing resources used. An allocation of computing resources used per impression opportunity for each of segment is determined based on the rates. A plurality of impression opportunities are identified. In response, one or more content items are selected for each impression opportunity using computing resources according to the determined allocation for the segment to which each impression opportunity belongs.

Abstract: A method of controlling a multi-core processor includes allocating at least one core of the multi-core processor to at least one process for execution; generating a translation table with respect to the at least one process to translate a logical ID of the at least one core allocated to the at least one process to a physical ID; and controlling the at least one process based on the translation table generated with respect to the at least one process.

Abstract: A system for handling data skew includes a cluster of computing nodes and a processor. The cluster includes one or more first nodes, each of which has a storage, and one or more second nodes, each of which has a storage. The storage of the respective second nodes has a higher access speed than the storage of the respective first nodes. The processor is configured to split input data into partitions of the input data, to detect if any of the partitions has data skew, and to assign ones of the partitions, which are detected as having no data skew, to the first nodes, and ones of the partitions, which are detected as having the data skew, to the second nodes, for parallel processing.

Abstract: An aspect includes the automatic generation of blueprints for orchestration engines from discovered workload representations. A computer-implemented method includes receiving, using a processor, a description of a workload executing in a source computing environment. The description of the workload is mapped, using the processor, to one or more resource descriptors located in a repository of resource descriptors describing resources available in a target computing environment. A declarative representation of the workload in the target computing environment is generated, using the processor, based at least in part on the mapping and the description of the workload. The declarative representation includes a specification of resources required by the workload in the target environment.