Abstract: A method of workload aware dynamic CPU processor core allocation includes the steps of predicting estimated individual workloads for each emulation in a set of emulations for each decision period of a set of decision periods over a predictive time span. The method includes using, by a Mixed Integer Programming (MIP) engine, the predicted estimated individual workloads for each emulation in the set of emulations, a set of constraints, and an optimization function, to determine sets of CPU processor cores to be allocated to each emulation during each decision period over the predictive time span. The method further includes dynamically allocating, by the host computer system, the sets of CPU processor cores to each emulation during each decision period over the predictive time span based on the output from the MIP engine.

Abstract: An apparatus and method for determining whether data needed for one or more operations is stored in a cache and scheduling the operations for execution based on the determination. For example, one embodiment of a processor comprises: a hierarchy of cache levels for caching data including at least a level 1 (L1) cache; cache occupancy determination logic to determine whether data associated with one or more subsequent operations is stored in one of the cache levels; and scheduling logic to schedule execution of the subsequent operations based on the determination of whether data associated with the subsequent operations is stored in the cache levels.

Abstract: A method of data processing, the method comprising receiving, at a graphics processing unit (GPU), a command stream, the command stream including one or more commands to be performed by the GPU and at least one command stream marker, the at least one command stream marker indicating a workload type of the command stream, determining, by the GPU, an operation algorithm for the GPU based on the at least one command stream marker prior to executing the command stream, and executing, by the GPU, the command stream based on the operation algorithm.

Abstract: Processes, machines, and manufactures involving adaptable containers that can be built and torn down more efficiently than VMs, may support various processes, and may be maintained without the presence of an active process. These adaptable containers may also be configured to support a process type and may support various processes at the same time as well. Other features and aspects are provided and taught.

Abstract: An adaptive contention-aware thread scheduler may place software threads for pairs of applications on the same socket of a multi-socket machine for execution in parallel. Initial placements may be based on profile data that characterizes the machine and its behavior when multiple applications execute on the same socket. The profile data may be collected during execution of other applications. It may identify performance counters within the cores of the processor sockets whose values are suitable for predicting whether the performance of a pair of applications will suffer when executed together on the same socket (e.g., values indicative of their demands for particular shared resources). During execution, the scheduler may examine the performance counters (or performance metrics derived therefrom) and determine different placement decisions (e.g., placing an application with high demand for resources of one type together with an application with low demand for those resources).

Abstract: Mechanisms for improving computing system performance by a processor device. System resources are organized into a plurality of groups. Each of the plurality of groups is assigned one of a plurality of predetermined task pools. Each of the predetermined task pools has a plurality of tasks. Each of the plurality of groups corresponds to at least one physical boundary of the system resources such that a speed of an execution of those of the plurality of tasks for a particular one of the plurality of predetermined task pools is optimized by a placement of an association with the at least one physical boundary and the plurality of groups.

Abstract: A method, computer readable medium, and system are disclosed for generating and utilizing infinite resolution texture acceleration data structures. The method for generating an infinite resolution texture acceleration data structure includes the steps of receiving an image; generating an infinite resolution texture acceleration data structure associated with the image that includes a texture map, a curve index map, and a curve data map; and storing the infinite resolution texture acceleration data structure in a memory. The texture map is a two-dimensional array of texels, each texel encoding a color value based on the image. The curve data map encodes parameters for at least one curve segment associated with the image. The curve index map associates each texel in the texture map with zero or more curve segments corresponding with the texel.

Abstract: A method and system for executing a query in parallel is disclosed. A master node may receive a query from a client and develop query plans from that query. The query plans may be forwarded to worker nodes for execution, and each query plan may be accompanied by query metadata. The metadata may be stored in a catalog on the master node.

Abstract: A method for notifying a host to manage background activities in a data storage device is disclosed. The method includes: receiving a query from a host operation system (OS); sending to the host OS, in response to the query, a list of background tasks to be performed in a data storage device; receiving a threshold value for one or more of the background tasks from the host OS; setting a timeout value associated with the threshold value; determining and notifying the timeout value to the host OS; determining that the threshold value is reached for a background task; and notifying the host OS that the SSD may perform the background task in the data storage device after the timeout value expires.

Abstract: Performing autocomplete of content is disclosed, including: generating a status lock configured to control sending requests to a server; generating a first suggestion request that includes a user input character; in response to an indication that the status lock is available, acquiring the status lock for the first suggestion request and sending the first suggestion request to the server; and in response to receipt of suggested content corresponding to the character from the server, releasing the status lock.

Abstract: Techniques are described in which to determine as separate values the active time and the stall time of a processing unit at different operating frequencies of the processing unit and bus bandwidths of a bus that interconnects the processing unit to system memory. The techniques may adjust the operating frequency of the processing unit and/or bus bandwidth based on the determined active times and stall times.

Abstract: Methods and systems for scheduling jobs in a distributed computing environment include: obtaining a set of task identifiers, each task identifier identifying a corresponding data processing task included in one of a plurality of jobs to be scheduled for execution at one of a plurality of data processing locations; and selecting and scheduling a data processing task of the identified job having a longest optimal completion time to the data processing location corresponding to the optimal completion time of the selected data processing task.

Abstract: Methods and a system for consumer progress monitoring are provided. A third-party consumer application executing on a Self-Service Terminal (SST) is monitored, without modifying the third-party consumer application, for progress updates. The progress updates are sent to a server and pushed to a device of clerk for monitoring a communication session between a consumer operating the SST and a host system.

Abstract: A remote procedure call channel for interprocess communication in a managed code environment ensures thread-affinity on both sides of an interprocess communication. Using the channel, calls from a first process to a second process are guaranteed to run on a same thread in a target process. Furthermore, calls from the second process back to the first process will also always execute on the same thread. An interprocess communication manager that allows thread affinity and reentrancy is able to correctly keep track of the logical thread of execution so calls are not blocked in unmanaged hosts. Furthermore, both unmanaged and managed hosts are able to make use of transparent remote call functionality provided by an interprocess communication manager for the managed code environment.

Abstract: System and methods for creating and configuring virtual machines (VMs) are provided. The method may include receiving, a first VM configuration and a second VM configuration. The second VM configuration is related to the first VM configuration. The method may include creating a first plurality of VMs in a first VM group based on the first VM configuration and creating a second plurality of VMs in the first VM group based on the second VM configuration. The method may further include applying the affinity rule in the first VM configuration to the first plurality of VMs and the second plurality of VMs. The method may further include configuring the first plurality of VMs based on the set of VM services in the first VM configuration and the second plurality of VMs based on the set of VM services in the second VM configuration.

Abstract: An embodiment of the disclosure provides a method, performed by a resource management server, for resource allocation in a virtualization environment. The resource management server includes a non-transient computer readable medium and a processor to execute computer executable instructions stored on the non-transient computer readable medium, so that when the instructions are executed, the resource management server performs the method of: (a) determining an average service rate for each virtual machine (VM) pool running an application; (b) predicting a workload of the application; (c) determining a set of collaborative VMs to serve the application in order to satisfy a service level requirement, the set of collaborative VMs comprising a number of selected VMs from the VM pools running the application; and (d) distributing incoming application requests of the application among the VMs in the set of collaborative VMs.

Abstract: Provided are a computer program product, system, and method for using send buffers and receive buffers for sending messages among nodes in a network. A send buffer is provided for each of at least one receiving node comprising one of the nodes to which messages are sent. Each of the receiving nodes includes at least one receive buffer to receive messages from the send buffer at the sending node. A determination is made of a buffer entry for a send buffer and receive buffer pair that is available for use. Indication is made of the message in the determined buffer entry of the send buffer. The message is sent from the send buffer to the receiving node indicating the determined buffer entry in which the message is indicated to cause the receiving node to include the message in the indicated buffer entry in the receive buffer.

Abstract: Measurements comprising time-series stimuli and time-series responses of a computing platform that has executed a first set of jobs are collected over a first time period. The measurements are used to form a query-able predictive model pertaining to resource usage demand predictions for the first set of jobs. A second set of job records describe a second set of jobs to be invoked in a second time period. The predictive model is queried to determine a likelihood to complete by the predicted finish time based on resource usage demand predictions for the first set of jobs. A weighting factor related to a likelihood to complete the second set of jobs by a particular time is calculated. A reward value based on the weighting factor is assigned to respective jobs in the second set of jobs. Some of the second set of jobs are rescheduled, based on a then-current reward value.

Abstract: A method, system, and computer program product for executing divergent threads using a convergence barrier are disclosed. A first instruction in a program is executed by a plurality of threads, where the first instruction, when executed by a particular thread, indicates to a scheduler unit that the thread participates in a convergence barrier. A first path through the program is executed by a first divergent portion of the participating threads and a second path through the program is executed by a second divergent portion of the participating threads. The first divergent portion of the participating threads executes a second instruction in the program and transitions to a blocked state at the convergence barrier. The scheduler unit determines that all of the participating threads are synchronized at the convergence barrier and the convergence barrier is cleared.

Abstract: Information representative of a graph-based program specification has a plurality of components, each of which corresponds to a task, and directed links between ports of said components. A program corresponding to said graph-based program specification is executed. A first component includes a first data port, a first control port, and a second control port. Said first data port is configured to receive data to be processed by a first task corresponding to said first component, or configured to provide data that was processed by said first task corresponding to said first component. Executing a program corresponding to said graph-based program specification includes: receiving said first control information at said first control port, in response to receiving said first control information, determining whether or not to invoke said first task, and after receiving said first control information, providing said second control information from said second control port.

Abstract: An example method for processing a batch job that includes a plurality of sequentially ordered tasks includes obtaining a message that includes inputs of a plurality of tasks included in a batch job. The plurality of tasks includes a first task that is sequentially ordered before a second task. The method also includes assigning tasks of the plurality of tasks to different computing nodes. The first task is assigned to a first computing node associated with a first public key, and the second task is assigned to a second computing node associated with a second public key.

Abstract: A method, system and program product for remote scheduling of at least one job to run on a plurality of computers in a computer network. The job scheduler enables selection of a domain that includes at least a subset of the computers on which the job is to run. A list of computers in the selected domain is automatically generated. The computers on which the job is to run can be selected from the generated list of computers. A configuration file is created for storing an identification of the selected domain and the job to be run on the selected computers in the domain.

Abstract: A method for executing program builds comprising: analyzing file dependency information and job duration information associated with jobs of the program build; scheduling jobs for a current program build based on the analysis of the dependency information and the job duration data; executing the jobs according to the schedule; collecting file usage information and new job duration information from each of the jobs; supplementing the file dependency information with the file usage information; and storing the new job duration information to be used for scheduling jobs in subsequent program builds.

Abstract: Examples relate to managing data processing resources. In one example, a computing device may: determine, for each of a plurality of data processing jobs, that the job is independent or dependent; allocate data processing resources to an independent job processing pool or a dependent job processing pool based on an initial resource share value indicating how resources are to be allocated between job processing pools; determine a first policy for scheduling data to be processed by processing resources allocated to the independent job processing pool; determine a second policy for scheduling data to be processed by processing resources allocated to the dependent job processing pool; determine an initial parallelism value that specifies a number of concurrently processing jobs; and provide a processing device with instructions to process batches of data using the allocation of data processing resources, the first policy, the second policy, and the initial parallelism value.

Abstract: Methods are disclosed for managing configuration variables and settings within a note-taking application such that application features are adjusted globally across an entire note-taking application regardless of the particular device from which application content is accessed. The configuration variables and settings may pertain to any or all of a variety of application features such as but not limited to adjustment of client, user and content-specific configuration options.

Abstract: Disclosed aspects relate to managing a set of development data for operator fusion management in a stream computing environment having a plurality of stream operators. A set of operator attributes of the plurality of stream operators may be collected by an operator fusion management engine in the stream computing environment. A set of candidate operator fusion management operations may be determined with respect to the plurality of stream operators. The set of candidate operator fusion management operations may be determined by the operator fusion management engine based on the set of operator attributes. At least one of the set of candidate operator fusion management operations may be performed in the stream computing environment with respect to the plurality of stream operators.

Abstract: A system according to certain aspects improves the process of managing jobs and allocating resources to those jobs. The system can include a job manager that processes and generates resource allocation requests for a plurality of jobs and a resource allocator that allocates computing resources for the plurality of jobs based on the resource allocation requests. The process of allocating resources may involve locking one or more resource objects before allocating the computing resources for the plurality of jobs and unlocking the locked resource objects after the computing resources have been allocated for the plurality of jobs.

Abstract: Systems and methods for waking up waiting processing streams in a manner that reduces the number of spurious wakeups. An example method may comprise: assigning a first identifier of a sequence of identifiers to a processing stream in a waiting state; receiving a wakeup signal associated with a second identifier of the sequence of identifiers; comparing, by a processing device, the first identifier with the second identifier; and waking the processing stream responsive to determining, in view of comparing, that the processing stream began waiting prior to an initiation of the wakeup signal.

Abstract: Complex devices, software systems, and/or networks may comprise one or more subsystems that perform periodic tasks. A first task may be assigned a first execution frequency and a second task may be assigned a second execution frequency that is not an alias of the first execution frequency (e.g., assignment of execution intervals that are non-overlapping harmonics of each other, such as non-repeating frequencies). A first resource utilization by the first task may be distinguished from a second resource utilization of the second task based upon the first resource utilization corresponding to resource utilization (e.g., network usage, processor usage, power consumption, user access, etc.) associated with the first execution frequency and the second resource utilization corresponding to resource utilization associated with the second execution frequency. Thus, resource utilization of individual tasks of various subsystems and/or networks may be determined.

Abstract: A system and a method are disclosed for providing for non-uniform memory access (NUMA) resource assignment and re-evaluation. In one example, the method includes receiving, by a processing device, a request to launch a first process in a system having a plurality of Non-Uniform Memory Access (NUMA) nodes, determining, by the processing device, a resource requirement of the first process, determining, based on resources available on the plurality of NUMA nodes, a preferred NUMA node of the plurality of NUMA nodes to execute the first process, the preferred NUMA node being determined by the processing device without user input, and binding, by the processing device, the first process to the preferred NUMA node.

Abstract: A messaging system implements messaging among application servers and databases, utilizing other servers that implement messaging brokers. A large flood of incoming messages can bring down messaging brokers by overflowing the message queues, negatively impacting performance of the overall system. This disclosure in some embodiments detects and identifies “flooders” in a timely manner and isolates their message traffic to dedicated queues to avoid impacting other system users. Subsequently, a preferred system de-allocates the queues and returns the messaging system to normal operation when flooding conditions subside, and “sweeps” up any remaining orphan messages.

Abstract: In an embodiment, a request is received for a first partition to execute on a first virtual processor. If the first physical processor is available at a first node, the first virtual processor is dispatched to execute at the first physical processor at the first node that is the home node of the first virtual processor. If the first physical processor is not available, a determination is made whether the first physical processor is assigned to a second virtual processor and a home node of the second virtual processor is not the first node. If the first physical processor is assigned to a second virtual processor and the home node of the second virtual processor is not the first node, execution of the second virtual processor is stopped on the first physical processor and the first virtual processor is dispatched to the first physical processor.

Abstract: Techniques for an exponential moving maximum (EMM) filter for predictive analytics in network reporting are disclosed. In some embodiments, a process for predictive analytics in network reporting using an EMM filter includes pre-processing network-related data by performing exponential moving maximum (EMM) filtering on the network-related data; and determining predictive analytics based on the EMM filtered network-related data.

Abstract: A controller analyzes a tuple in an operator graph. The controller determines that the tuple includes one or more selected characteristics. These characteristics signify preferred data. The controller determines operations of the operator graph which can be suppressed. The controller suppresses the one or more operations. The controller suppresses those operations in response to the tuple including one or more of the selected characteristics.

Abstract: A transaction descriptor associated with a vertical chain of row versions is received. The vertical chain of row versions is traversed. The vertical chain is part of a grid structure formed by a number of vertical chains intersected with a number of horizontal chains. A link to a current row version is terminated. A link from the current row version to an older row version in a horizontal chain is locally stored and terminated. The older row version is set as ready for garbage collection. The current row version is set as ready for garbage collection. A link from the current row version to a next row version in the horizontal chain is locally stored and terminated. The next row version is appointed as current.

Abstract: An electronic device comprises one or more control inputs to receive a control signal indicating the beginning of a first critical program section of a program that is running in a system; a counter to be incremented from an initial counter value in response to receipt of the control signal; one or more output signal generators to generate the signal for disabling program interrupts; and an output to output the signal for disabling program interrupts.

Abstract: A trusted threat-aware microvisor may be deployed as a module of a trusted computing base (TCB). The microvisor is illustratively configured to enforce a security policy of the TCB, which may be implemented as a security property of the microvisor. The microvisor may manifest (i.e., demonstrate) the security property in a manner that enforces the security policy. Trustedness denotes a predetermined level of confidence that the security property is demonstrated by the microvisor. The predetermined level of confidence is based on an assurance (i.e., grounds) that the microvisor demonstrates the security property. Trustedness of the microvisor may be verified by subjecting the TCB to enhanced verification analysis configured to ensure that the TCB conforms to an operational model with an appropriate level of confidence over an appropriate range of activity. The operational model may then be configured to analyze conformance of the microvisor to the security property.

Abstract: Embodiments of the present disclosure provide a method and apparatus for assigning lock resources to objects by obtaining a first alternative lock for the object, and determining first correlations between the object and each of one or more other objects when the first alternative lock has been assigned to the one or more other objects, wherein in response to determining that each of the first correlations is lower than a predetermined threshold, assign the first alternative lock to the object, and may maximize the possibility of parallel execution and reduce the time waiting for lock resources, thereby avoiding lock contention.

Abstract: An apparatus comprises at least one processing platform having one or more processing devices. The processing platform is configured to generate a plurality of workload capsules for transmission to a broker device over a network. A given one of the workload capsules comprises a self-contained and independent workload to be performed by another processing platform as determined by the broker device in accordance with one or more attributes specified in the workload capsule and one or more criteria specified in the workload capsule. The given workload capsule further comprises a process description identifying at least one of server resources, storage resources, network resources and physical security resources to be utilized by the other processing platform in performing the workload. The broker device may be part of a central compute depository platform that receives workload capsules from multiple source devices over the network.

Abstract: Concepts and technologies are disclosed herein for relocation of applications to optimize resource utilization. A processor executing a relocation management application can receive a request to relocate an application. The processor can identify a utilization associated with the application, identify prospective host resources capable of hosting the application, determine utilizations associated with the prospective host resources, and project prospective host resource utilizations based upon the utilization associated with the application and the utilizations associated with the prospective host resources. The processor can select a prospective host resource from the prospective host resources by selecting a resource that offers a most consistent projected utilization.

Abstract: Technologies for managing cache memory of a processor in a distributed shared memory system includes managing a distance value and an age value associated with each cache line of the cache memory. The distance value is indicative of a distance of a memory resource, relative to the processor, from which data stored in the corresponding chance line originates. The age value is based on the distance value and the number of times for which the corresponding cache line has been considered for eviction since a previous eviction of the corresponding cache line. Initially, the age value is set to the distance value. Additionally, every time a cache line is accessed, the age value associated with the accessed cache line is reset to the corresponding distance value. During a cache eviction operation, the cache line for eviction is selected based on the age value associated with each cache line.

Abstract: A multi-cluster system having processor cores of different energy efficiency characteristics is configured to operate with high efficiency such that performance and power requirements can be satisfied. The system includes multiple processor cores in a hierarchy of groups. The hierarchy of groups includes: multiple level-1 groups, each level-1 group including one or more of processor cores having identical energy efficiency characteristics, and each level-1 group configured to be assigned tasks by a level-1 scheduler; one or more level-2 groups, each level-2 group including respective level-1 groups, the processor cores in different level-1 groups of the same level-2 group having different energy efficiency characteristics, and each level-2 group configured to be assigned tasks by a respective level-2 scheduler; and a level-3 group including the one or more level-2 groups and configured to be assigned tasks by a level-3 scheduler.

Abstract: An isolation method for a management virtual machine and an apparatus, which resolves problems that performance of communication between service components is deteriorated, more resources are required for running a virtual machine, and security of the service components is relatively low. The method includes: acquiring a guest identifier; searching, according to the guest identifier, the management virtual machine for a kernel virtual machine; when the kernel virtual machine is not found in the management virtual machine, creating the kernel virtual machine in the management virtual machine; dividing a service provided for a guest virtual machine by the kernel virtual machine into multiple service components; and running the multiple service components in execution environments corresponding to permission of the service components, where the kernel virtual machine includes the multiple execution environments, and the multiple execution environment have different permission.

Abstract: A method of assessing energy efficiency of a High-performance computing (HPC) system, including: selecting a plurality of HPC workloads to run on a system under test (SUT) with one or more power constraints, wherein the SUT includes a plurality of HPC nodes in the HPC system, executing the plurality of HPC workloads on the SUT, and generating a benchmark metric for the SUT based on a baseline configuration for each selected HPC workload and a plurality of measured performance per power values for each executed workload at each selected power constraint is shown.

Abstract: A multiprocessor computer system and method for use therein are provided for assigning processes to processor nodes. The system can determine a first pair of processes and a second pair of processes, each process of the first pair of processes executing on different nodes and each process of the second pair of processes executing on different nodes. The system can determine a first priority value of the first pair of processes, based at least in part on a first resource access rate of the first pair of processes; and determine a second priority value of the second pair of processes, based at least in part on a second resource access rate of the second pair of processes. The system can determine the first priority value is greater than the second priority value; and determine to reassign a first process of the first pair of processes to a first node, wherein a second process of the first pair of processes is executing on the first node.

Abstract: A computer-implemented method processes a simple object access protocol (SOAP) command. The method includes interpreting an XML script to perform a function contained in the XML script, the XML script containing the SOAP command, parsing the SOAP command from the XML script, and passing the SOAP command to a SOAP interpreter for execution.

Abstract: A distributed processing system includes a plurality of task nodes each configured to have a capability of processing a task using a reconfigurable processor, and having a capability of processing the task using a non-reconfigurable processor if the task is not processed using the reconfigurable processor, and a scheduler node configured to select a task node that is to process the task from the plurality of task nodes.

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: Provided is a highly convenient and downsizable terminal device, which realizes, even when more than two contactless information communication units, each utilizing a different frequency band, are mounted on a single IC tag, good communication in each of the different frequency bands. The terminal device has two contactless information communication parts (circuit units, such as an inlay, inlet, chip or the like), which utilizes different frequency bands (for example, the HF band and the UHF band, which is higher than the HF band) performs transmission and reception of signals with two antennae being electric-field-coupled to each other.

Abstract: System, method and apparatus to manage services in a network are provided. The system includes at least one administration node and a plurality of application nodes, which are connected to each other. A first application node from the plurality of application nodes upon receiving at least one instruction from one of the at least one administration node initializing a first process, and the first application node retrieves configuration information from one of the at least one administration node. The configuration information includes a group name, a cluster name, and a service name related to the first process from a database of one of the at least one administration node. After retrieving the configuration information from said corresponding administration node, the first application node assigns, a name which includes the group name, the cluster name, the service name along with a process name, to the first process.