Abstract: A container that manages access to protected resources using rules to intelligently manage them includes an environment having a set of software and configurations that are to be managed. A rule engine, which executes the rules, may be called reactively when software accesses protected resources. The engine uses a combination of embedded and configurable rules. It may be desirable to assign and manage rules per process, per resource (e.g. file, registry, etc.), and per user. Access rules may be altitude-specific access rules.

Abstract: Efficient use of channel bandwidth response, response timing, along with the ability to acquire the most accurate and up to date response are provided for management of virtual assistant search queries within a communication system (100). Improved management is obtained using an artificial intelligence (AI) server (104) controlling response activity to a query communication device (102) by incorporating one or more of: adjusting verbosity of responses (158), redirecting queries from the AI server to alternate resources (412), and/or prioritizing of a response (506) based on wait time.

Abstract: For a first device participating in a video communications session with a second device, some embodiments provide a method that receives sets of encoding features supported by each of one or more decoders of the second device. The method selects an encoder for the video communication session from several encoders available to the first device. The method selects a set of encoding features of the selected encoder based on the sets of encoding features received from the second device. The method transmits an encoded video bitstream to the second device along with information identifying the selected features in order for the second device to select a decoder to decode the bitstream.

Abstract: Systems and methods to increase battery life in and identify misuse of a wireless device using environmental sensors are provided. Some methods can include identifying times during which at least one of a transceiver or a sensing device in the wireless device is operating outside of a low power sleep state, instructing a thermal sensing device in the wireless device to measure ambient temperatures of the wireless device during the identified times, recording the measured ambient temperatures and the identified times in a memory device of the wireless device, identifying a service time of the wireless device corresponding to the identified times, and using the recorded ambient temperatures or the identified service time to optimize the battery life of the wireless device or to identify the misuse of the wireless device.

Abstract: Task context information is transferred concurrently from a processor core to an accelerator and to a context memory. The accelerator performs an operation based on the task context information and the context memory saves the task context information. The order of transfer between the processor core is based upon a programmable indicator. During a context restore operation information is concurrently provided to data bus from both the accelerator and the processor core.

Abstract: A processor system includes at least two processor cores and an interrupt controller including interrupt priority registers configured for registering interrupt priorities of the respective processor cores. The processor system further includes at least two task timers associated with respective processor cores. Each task timer includes a counter configured for producing a counter value, a timeout value register configured for storing a timeout value and a tidemark value register configured for storing a tidemark value smaller than the timeout value. Each task timer is configured for producing a timeout signal when the counter value equals the timeout value and for producing a tidemark signal when the counter value equals the tidemark value. The interrupt controller is configured for increasing the interrupt priority of a processor core in response to a tidemark signal and for decreasing the interrupt priority of a processor core in response to a timeout signal.

Abstract: The present disclosure provides modular electronic devices that are capable of managing task performance based on a particular context of computing resources currently available from the ad hoc combination of devices.

Abstract: Message prioritization may be provided. First, a message may be received and a priority level may be calculated for the message. If the message is not rejected for having a priority lower than a predetermined threshold, the message may be placed in a first priority queue. Next, the message may be de-queued from the first priority queue based upon the calculated priority level for the message. Distribution group recipients corresponding to the message may then be expanded and the priority level for the message may be re-calculated based upon the expanded distribution group recipients. Next, the message may be placed in a second priority queue. The message may then be de-queued from the second priority queue based upon the re-calculated priority level for the message and delivered.

Abstract: An accelerator controller comprises a detector and a loader. The detector detects runtime features of an application or a virtual machine and identifies an accelerator logic associated with the application or the virtual machine corresponding to the detected runtime features. The loader loads the identified accelerator logic into at least one dynamic random access memory (DRAM). The at least one DRAM array is selectively reconfigurable to behave like a look-up table (LUT) or to behave like a DRAM memory array based on the identified accelerator logic, and the at least one DRAM array is in a cache-coherent address space of the operating system environment. The accelerator logic may comprise a look-up table (LUT).

Abstract: In some implementations, a method includes, at a latency reduction system configured to reduce latency in writing data to one or more storage entities that are each configured to store data on an object-basis, receiving a scheduling request associated with a write operation. The method also includes determining a wait period for the write operation, where the wait period is less than or equal to the difference between a client-defined operation threshold and an operation completion time of the write operation and determining an operation start time for the write operation, based in part on the wait period.

Abstract: A system and methods are disclosed for configuring a virtualized system for real-time response from virtual machines (VMs). In accordance with one embodiment, a VM request is received, where the request specifies a number N of virtual processors for executing real-time tasks, and where N is a positive integer. In response to the VM request, a plurality of physical processors are partitioned into a first subset dedicated to real-time tasks and a second subset dedicated to non-real-time tasks, the first subset having at least N physical processors, and one or more commands are submitted to one or both of a hypervisor and a guest OS of a first VM to configure the first VM to have N virtual processors dedicated to real-time tasks and a set of additional virtual processors dedicated to non-real-time tasks.

Abstract: A method, computer program product, and computer system for updating progression of performing computer system management. A computer system receives a log-on of a change implementer onto a managed computer system and searches a change request on a managing computer system. In response to that the change request is found, the computer system receives from the change implementer a command with a current date and time and matches the command to one or more tasks within the change request. In response to determining that the command matches the one or more tasks, the computer system updates start dates and times of the one or more tasks. And, in response to that the one or more tasks are completed, the computer system updates stop dates and times of the one or more tasks.

Abstract: In an embodiment, an apparatus includes multiple memory resources, and a resource table that includes entries that correspond to respective memory resources of the multiple memory resources. The apparatus also includes a circuit configured to receive a first memory command. The first memory command is associated with a subset of the multiple memory resources. For each memory resource of the subset, the circuit is also configured to set a respective indicator associated with the first memory command, and to store a first value in a first entry of the resource table in response to a determination that the respective memory resource is unavailable. The circuit is also configured to store a second value in each entry of the resource table that corresponds to a memory resource of the subset in response to a determination that an entry corresponding to a given memory resource of the subset includes the first value.

Abstract: In an approach for parallelizing document processing in an information handling system, a processor receives a document, wherein the document includes text content. A processor extracts information from the text content, utilizing natural language processing and semantic analysis, to form tokenized semantic partitions, comprising a plurality of sub-documents. A processor schedules a plurality of concurrently executing threads to process the plurality of sub-documents.

Abstract: In an approach for parallelizing document processing in an information handling system, a processor receives a document, wherein the document includes text content. A processor extracts information from the text content, utilizing natural language processing and semantic analysis, to form tokenized semantic partitions, comprising a plurality of sub-documents. A processor schedules a plurality of concurrently executing threads to process the plurality of sub-documents.

Abstract: Read-copy update (RCU) grace period initialization and CPU hotplugging are synchronized without a sleeplock. Periodic RCU grace period initialization includes, for each node of a combining tree, copying a first bitmask indicating online/offline status of a set of CPUs to a second bitmask indicating RCU quiescent state status of the CPUs. Periodic CPU hotplug operations include indicating CPU online/offline status to leaf nodes associated with the CPUs. This status is indicated without manipulating any bits in the first bitmask of the leaf nodes. Prior to each RCU grace period initialization, RCU grace period pre-initialization is performed at each leaf node. The RCU grace period pre-initialization includes (1) updating the first bitmask to account for the CPU hotplug operations, and (2) if this results in the first bitmask transitioning between fully cleared and not-fully cleared states, the state change is conditionally propagated to a higher level node.

Abstract: The disclosure provides a computer-implemented method of processing information to use when producing a mission plan to accomplish a mission. The example method includes obtaining one or more mission goals to be achieved during execution of the mission and obtaining information relating to one or more resources to be used during execution of the mission. The information relating to at least one of the resources includes uncertainty. The example method also includes obtaining user preferences relating to how the uncertainty is to be handled, transforming the information relating to the one or more resources according to the user preferences to reduce the uncertainty in the information and providing the transformed information to a smart process manager, for use by the smart process manager to identify one or more of the resources that are to be used to execute at least one mission step as part of at least one mission plan to achieve the one or more mission goals and accomplish the mission.

Abstract: A method comprises receiving a list of steps with a step associated with a first work unit and a step associated with a second work unit, the first work unit is operative to process the list of steps by determining whether a first step in the list of steps is associated with the first work unit, determining whether a step sequentially listed prior to the first step has been completed responsive to determining that the first step in the list of steps is associated with the first work unit, processing the first step and designating the first step complete responsive to determining that the step sequentially listed immediately prior to the first step has been completed, determining whether a second step in the list of steps is associated with the first work unit.

Abstract: Read-copy update (RCU) grace period initialization and CPU hotplugging are synchronized without a sleeplock. Periodic RCU grace period initialization includes, for each node of a combining tree, copying a first bitmask indicating online/offline status of a set of CPUs to a second bitmask indicating RCU quiescent state status of the CPUs. Periodic CPU hotplug operations include indicating CPU online/offline status to leaf nodes associated with the CPUs. This status is indicated without manipulating any bits in the first bitmask of the leaf nodes. Prior to each RCU grace period initialization, RCU grace period pre-initialization is performed at each leaf node. The RCU grace period pre-initialization includes (1) updating the first bitmask to account for the CPU hotplug operations, and (2) if this results in the first bitmask transitioning between fully cleared and not-fully cleared states, the state change is conditionally propagated to a higher level node.

Abstract: A method and apparatus to provide a scheduler comprising determining a current use characteristic for the device based on motion information and active applications, and scheduling a future task.

Abstract: The method for managing a plurality of windows of a browser application on an electronic device includes assigning a priority level to each process, including the browser application, running on the device, and distributing computing resources based on priority level. In response to receiving an action to open a window, the browser application starts the execution of a process for opening the window, associates the process with the window, and assigns a priority level to the process associated with the window. The browser application then monitors an activity level of each process associated with its windows. If the activity level decreases, the browser application assigns the process with the decreased activity level to a lower priority level. If requested computing resources exceed a maximum threshold, a process is selected from the lowest priority level processes, and the selected process is suspended.

Abstract: Ubiquitous computing methods and apparatus are disclosed. An example method includes determining a first setting to control an actuator; setting a first record in a record list, the first record including the first setting, a first immediacy of the first setting, and a first priority of the first setting; determining a second setting; setting a second record in the record list, the second record including the second setting, a second immediacy of the second setting, and a second priority of the second setting, the second priority being lower than the first priority; selecting the first record from the record list based on the first priority being higher than the second priority; deleting the second record from the record list based on the second immediacy; and outputting the first setting to control the actuator when a current setting of the actuator is different than the first setting.

Abstract: A system may include a memory to store an enhancer to identify a branch instruction, having a miss-prediction rate above a threshold, in an executing thread. The system may additionally include an instruction update unit to modify an operation code (opcode) of the branch instruction, where a modified opcode of a branch instruction indicates an instruction fetch priority for an executing thread. The system may further include a processor, having an instruction decode unit to set a modified instruction fetch priority of the first executing thread based on the modified opcode of the branch instruction, and an instruction fetch unit to retrieve instructions for the first executing thread from the instruction cache at a first rate, the first rate indicated by the modified instruction fetch priority of the first executing thread.

Abstract: An objective of the present invention is to construct a system in which a plurality of software components having dependencies are deployed dispersedly on a plurality of processing devices. The information system includes a deployment device (100) and a plurality of processing devices (200). A scheduler (210) of the processing device (200) determine whether there is a deployment task satisfying an execution condition in task information (231) on the basis of a termination event of a deployment task. When there is a deployment task satisfying the execution condition, the scheduler (210) executes the deployment task and transmits a termination event of the deployment task to the deployment device (100). An event processing unit (130) of the deployment device (100) transmits the termination event of the deployment task to a notification destination processing device (200) referring to event information (141).

Abstract: A method is performed at an electronic device with a display, one or more processors, volatile memory, and non-volatile memory that stores one or more programs for execution by the one or more processors. The method includes periodically comparing an amount of free volatile memory to a threshold level. The amount of free volatile memory is compared to the threshold level with a first periodicity when the display is off and with a second periodicity that is shorter than the first periodicity when the display is on. The method also includes, in response to a determination that the amount of free volatile memory does not satisfy the threshold level, deallocating volatile memory by terminating one or more processes based on priority levels of the one or more processes.

Abstract: Additional workloads are assigned among servers in a power-efficient manner. For each of a plurality of servers, a stored power efficiency/capacity utilization relationship is accessed, current component power consumption values are obtained, and a current power consumption efficiency is calculated. An amount of capacity utilization necessary to perform an additional workload is obtained, and a predicted power consumption efficiency is determined for each server. The predicted efficiency is determined using the current power consumption efficiency of the server and the stored relationship. The workload is then assigned to the server identified as having the greatest predicted power consumption efficiency. Alternatively, the workload may be assigned to the server identified as having the greatest improvement in power consumption efficiency.

Abstract: According to one embodiment of the present invention, the scheduling method includes an acquisition step of acquiring operation state information on a virtual CPU (vCPU) and lock information on an OS in the operation of the vCPU and of a virtual machine (VM) driving the vCPU and including the OS, and a determination step for determining whether the vCPU is in a lock holder preemption (LHP) state on the basis of the operation state information and the lock information. According to one embodiment of the present invention, the LHP can be easily and precisely known on a system using the VM. Also, even with an increase in the number of cores, scalability can be supported in a system by adjusting the pCPU to which operations of the vCPU are allocated through a scheduling scheme.

Abstract: Technologies for integrated thread scheduling include a computing device having a network interface controller (NIC). The NIC is configured to detect and suspend a thread that is being blocked by one or more communication operations. A thread scheduling engine of the NIC is configured to move the suspended thread from a running queue of the system thread scheduler to a pending queue of the thread scheduling engine. The thread scheduling engine is further configured to move the suspended thread from the pending queue to a ready queue of the thread scheduling engine upon determining any dependencies and/or blocking communications operations have completed. Other embodiments are described and claimed.

Abstract: An application-level thread dispatcher that operates in a main full-weight thread allocated to an application is established. The application-level thread dispatcher initializes a group of application-level pseudo threads that operate as application-controlled threads within the main full-weight thread allocated to the application. The application-level thread dispatcher evaluates run-time performance of the application.

Abstract: A resource management system for a network device is described. A resource management system includes a resource manager configured to generate a sequence of a plurality of access time slots for a plurality of candidate entities and to redistribute access to one or more of the plurality of access time slots in the sequence based on availability and eligibility. The resource management system also includes a resource monitor configured to detect usage of each of the access time slots by each of the plurality of candidate entities.

Abstract: A task scheduling method is applied to a heterogeneous multi-core processor system. The heterogeneous multi-core processor system has at least one first processor core and at least one second processor core. The task scheduling method includes: referring to task priorities of tasks of the heterogeneous processor cores to identify at least one first task of the tasks that belongs to a first priority task group, wherein each first task belonging to the first priority task group has a task priority not lower than task priorities of other tasks not belonging to the first priority task group; and dispatching at least one of the at least one first task to at least one run queue of at least one of the at least one first processor core.

Abstract: Methods for optimizing utilization of workload-consumed resources for time-inflexible workloads are disclosed. By sorting workload-consumed resource profiles representing individual workloads in one system according to an order of standard deviation or descending volume, two workload-consumed resource profiles can be combined to check if combination criteria are fulfilled. If any combination satisfies the combination criteria, corresponding workloads can be combined to share the same resource from the system. Thus, optimizing utilization of the workload-consumed resource can be achieved.

Abstract: An e-mail firewall applies policies to e-mail messages between a first site and second sites in accordance with administrator selectable policies. The firewall includes a simple mail transfer protocol relay for causing the e-mail messages to be transmitted between the first site and selected ones of the second sites. Policy managers enforce-administrator selectable policies relative to one or more of encryption and decryption, signature, source/destination, content and viruses.

Abstract: A method of scheduling and controlling asynchronous tasks to provide deterministic behavior in time-partitioned operating systems, such as an ARINC 653 partitioned operating environment. The asynchronous tasks are allocated CPU time in a deterministic but dynamically decreasing manner. In one embodiment, the asynchronous tasks may occur in any order within a major time frame (that is, their sequencing is not statically deterministic); however, the dynamic time allotment prevents any task from overrunning its allotment and prevents any task from interfering with other tasks (whether synchronous or asynchronous).

Abstract: In accordance with some embodiments, a continuous thread is operated on the graphics processing unit. A continuous thread is launched one time from the central processing unit and then it runs continuously until an application on the central processing unit decides to terminate the thread. For example, the application may decide to terminate the thread in one of a variety of situations which may be programmed in advance. For example, upon error detection, a desire to change the way that the thread on the graphics processing unit operates, or in power off, the thread may terminate. But unless actively terminated by the central processing unit, the continuous thread generally runs uninterrupted.

Abstract: In accordance with an example embodiment of the present invention, disclosed is a method and an apparatus thereof for handling a conflict resolution between storage requirements of multiple applications sharing the same data. A conflict resolution function resolves the conflicts in several steps and the result is either a coordinated merge of the different applications' storage requirements in multiple groups according to their needs and/or a controlled reduction of the relevance of some of the storage requirements for some applications.

Abstract: A container that manages access to protected resources using rules to intelligently manage them includes an environment having a set of software and configurations that are to be managed. A rule engine, which executes the rules, may be called reactively when software accesses protected resources. The engine uses a combination of embedded and configurable rules. It may be desirable to assign and manage rules per process, per resource (e.g. file, registry, etc.), and per user. Access rules may be altitude-specific access rules.

Abstract: Embodiments of the present invention provide a method, system and computer program product for concurrent workload simulation for application performance testing. In an embodiment of the invention, a method for concurrent workload simulation for application performance testing is provided. The method includes loading a list of recorded workloads for different tasks of a computing application under test in a workload simulator executing in memory by at least one processor of a host computer. The method also includes grouping the recorded workloads by common task in a corresponding block. Finally, the method includes generating loads for simulating performance of the computing application under test from the grouped workloads so as to require serial execution of workloads in a common block in order of appearance in the common block, but to allow concurrent execution of workloads in different blocks.

Abstract: In one embodiment, a computer system receives an indication of a power state of a client device, identifies messages to be sent to the client device, determines a transmit cost and a value of each of the messages, and stores at least one of the messages in a queue based on the transmit cost and value of the message.

Abstract: A virtualization apparatus is provided. The virtualization apparatus includes a plurality of virtual machines (VMs), a process scheduler configured to schedule processes to be executed on the respective virtual machines, a virtual machine monitor (VMM) configured to provide each of the virtual machine with a virtualized execution environment, a virtual machine scheduler configured to schedule the virtual machines to run in the virtual machine monitor, and a synchronization unit configured to synchronize a process schedule time which is scheduled by the process scheduler and a virtual machine schedule time which is scheduled by the virtual machine scheduler, or to change the virtual machine schedule time in consideration of the process schedule time.

Abstract: Systems, methods, and computer programs are disclosed for method for reducing memory subsystem power. In an exemplary method, a system resource manager provides memory performance requirements for a plurality of memory clients to a double data rate (DDR) subsystem. The DDR subsystem and the system resource manager reside on a system on chip (SoC) electrically coupled to a dynamic random access memory (DRAM). A cache hit rate is determined of each of the plurality of memory clients associated with a system cache residing on the DDR subsystem. The DDR subsystem adjusts access to the DRAM based on the memory performance requirements received from the system resource manager and the cache hit rates of the plurality of memory clients.

Abstract: A technique for handling queued interrupts includes accumulating respective backlog counts for respective event paths. The background counts track a number of events received but not delivered as interrupts to associated virtual processor (VP) threads. In response to a lowering of an operating priority (OP) of a VP thread (VPT), a scan backlog (SB) message is received that identifies the VPT and specifies a current operating priority for the VPT. In response to receiving the SB message, a linked list of event paths associated with the VPT is scanned to search for backlog events that have a higher priority than the current OP for the VPT. In response to a backlog event being located that has a higher priority than the current OP of the VPT, an interrupt to the VPT is initiated starting with a highest priority event path and the backlog count for the VPT is decremented.

Abstract: Systems, methods, and computer programs are disclosed for method for reducing memory subsystem power. In an exemplary method, a system resource manager provides memory performance requirements for a plurality of memory clients to a double data rate (DDR) subsystem. The DDR subsystem and the system resource manager reside on a system on chip (SoC) electrically coupled to a dynamic random access memory (DRAM). A cache hit rate is determined of each of the plurality of memory clients associated with a system cache residing on the DDR subsystem. The DDR subsystem controls a DDR clock frequency based on the memory performance requirements received from the system resource manager and the cache hit rates of the plurality of memory clients.

Abstract: In a method for determining a time to deploy and install patches one or more processors receive a request to deploy a patch by a target deployment time and install the patch by a target installation time, for at least one computing device of a plurality of computing devices on a network. The one or more processors determine a time frame to deploy the patch based on the target deployment time and availability of bandwidth on the network. The one or more processors determine a time to install the patch based on the target installation time and usage of the at least one computing device. The one or more processors cause the patch to be deployed within the determined time frame to deploy the patch. The one or more processors send an instruction to install the patch at the determined time to install the patch.

Abstract: Techniques for enhancing a throttle management system are disclosed. A throttle management system can be configured to scale down a number of permits available for connections to a data source. The throttle configuration parameters can be viewed by an administrator and modified during the runtime operation of the computer system effecting the throttle.

Abstract: One embodiment of the present disclosure sets forth an effective way to maintain fairness and order in the scheduling of common resource access requests related to replay operations. Specifically, a streaming multiprocessor (SM) includes a total order queue (TOQ) configured to schedule the access requests over one or more execution cycles. Access requests are allowed to make forward progress when needed common resources have been allocated to the request. Where multiple access requests require the same common resource, priority is given to the older access request. Access requests may be placed in a sleep state pending availability of certain common resources. Deadlock may be avoided by allowing an older access request to steal resources from a younger resource request. One advantage of the disclosed technique is that older common resource access requests are not repeatedly blocked from making forward progress by newer access requests.

Abstract: An electronic device with volatile memory repeatedly compares an amount of free volatile memory to a first predetermined threshold level of free volatile memory. When the device determines that the amount of free volatile memory is less than the first predetermined threshold level, the device deallocates volatile memory by terminating one or more processes based on predetermined priority levels of the one or more processes.

Abstract: An approach for cloud provisioning of consumer services based on requested services. The approach uses customer request for services and current network utilization patterns to most efficiently and effectively provision network resources. For example, a network manager establishes one or more terms for a cloud provider based on one or more provider network provisions. The network manager further determines a customer profile subscription based on customer credentials, cloud provider credentials, and a combination thereof. Then, the network manager delivers one or more credentials based on the cloud provider, and generates a routing path to the cloud provider based on the subscription and/or service request.

Abstract: An information processing system includes: a memory configured to store job requests each of which is to be assigned to one of computing resources based on a priority which is determined by an allocation ratio assigned for each of a plurality of users; and processing circuitry configured to: assign first job request to the one of the computing resources; determine, when the first job request is assigned, a decrease degree of the priority of a first user corresponding to the first job request based on an allocation ratio of the first user and allocation ratio of other users whose job requests are stored in the memory; modify the priority of the first user based on the determined decrease degree of the priority; and assign second job request to one of the computing resources, based on the modified priority of the first user and priority of remaining plurality of users.

Abstract: A method is provided of monitoring the level of computing capacity allocated to a hardware platform for executing a software application by identifying situations for which it is possible to limit the energy consumption of a processor during the execution of applications. Various uses of the method are also provided.