Abstract: Embodiments of the present invention relate to the field of communications network technologies and provide a method and an apparatus for synchronization processing based on a multi-core system, which can improve efficiency in system scheduling and consume fewer resources. According to the solutions provided in the present invention, an initialization setting is sent by any processing device in a first group of processing devices that synchronously process a same current task and initialization is performed; then a notification message sent by any processing device in the first group of processing devices is received and 1 is subtracted from a value of a counting semaphore; and when the value of the counting semaphore is 0, a control message is sent to a second group of processing devices through a message sending interface. The solutions provided in the present invention are applicable to processing synchronization and communication between multiple modules.

Abstract: An apparatus for dynamically controlling a preemption section includes a preemption manager configured to monitor whether a system context has changed, and if the system context has changed, set a current preemptive mode according to the changed system context to dynamically control a preemption section of a kernel. Therefore, even when an application requiring real-time processing, such as a health-care application, co-exists with a normal application, optimal performance may be ensured.

Abstract: A virtual machine monitor and a scheduling method thereof is provided. The virtual machine monitor may operate at least two domains. The virtual machine monitor may include at least one run queue and a plurality of schedulers, at least two of the plurality of schedulers comprising different scheduling characteristics. The virtual machine monitor may insert a task received from the domain into the run queue and may select a scheduler for scheduling the task, which may be inserted into the run queue, from the schedulers, according to an event type.

Abstract: A computer manages methods for determining workload placement in a computing environment. The computer receives a plurality of workloads with associated information, wherein the associated information for each workload contains at least: contract information, billing information, and resource availability information. The computer determines a profitability factor for each workload of the plurality of workloads, wherein the profitability factor is at least based on the billing information. The computer determines a penalty factor for each workload of the plurality of workloads, wherein the penalty factor is at least based on the contract information. The computer determines a preference factor for each workload of the plurality of workloads, wherein the preference factor is at least based on the resource availability information. The computer assigns a priority ordering for each of the workloads from the plurality of workloads.

Abstract: A computer identifies a location that is associated with a task, included in a first list of tasks, based on a first information. The computer determines a first travel time from a second location that is associated with a mobile device to the first location based on a second information. The second information indicates an amount of travel time that is associated with a route from the second location to the first location. The computer generates a plurality of permutations of the tasks included in the first list of tasks. The computer selects a permutation from the plurality of permutations based on the first travel time. The computer generates a second list of tasks using the selected permutation. The organization of the tasks included in the second list of tasks reduces the travel time that is required to complete those tasks.

Abstract: A resource allocation method adapted to a mobile device having a multi-core central processing unit (CPU) is provided. The CPU executes at least one application. The method includes steps as follows. A usage status of each of the at least one application is obtained according to a level of concern of a user for each of the at least one application. A sensitivity of at least one thread of each of the at least one application is determined according to the usage status of each of the at least one application. Resources of the CPU are allocated according to the sensitivity of the at least one thread run by the cores.

Abstract: An approach is provided for providing group context sensing and inference. The group context platform determines at least one group of one or more devices that have one or more group contexts that are at least substantially similar, at least substantially correlated, or a combination thereof. Next, the group context platform causes, at least in part, a distribution of one or more context sensing tasks among the one or more devices of the at least one group. Then, the group context platform processes and/or facilitates a processing of one or more results of the one or more context sensing tasks to (a) modify the one or more group contexts; (b) enhance the one or more group contexts; (c) determine one or more other group contexts; or (d) a combination thereof.

Abstract: A task scheduling method is disclosed, where each processor core is programmed with a short list of priorities, each associated with a minimum response time. The minimum response times for adjacent priorities are different by at least one order of magnitude. Each process is assigned a priority based on how its expected response time compares with the minimum response times of the priorities. Lower priorities may be assigned a timeslice period that is a fraction of the minimum response time. Also disclosed is a task division method of dividing a complex task into multiple tasks is; one of the tasks is an input gathering authority task having a higher priority, and it provides inputs to the other tasks which have a lower priority. A method that permits orderly shutdown or scaling back of task activities in case of resource emergencies is also described.

Abstract: The invention provides a system and method for analyzing a collection of communication messages. The communication messages may be any one of a collection of electronic mail messages, voicemail messages, instant messaging dialogs and other forms of communications. The collections of communications, such as electronic mail messages, may be selected by a user and then subsequently processed to determine the identity of any of the user's contacts within the communications. The contacts may then be arranged in a relative priority arrangement whereby contacts which have been identified as engaging in prior reciprocal communications with the user are given higher priority. Higher priority may also be given to contacts which engage in more recent communications with the user. Specific contact relationships may be inferred from the communications depending on whether specific contacts are repeatedly mentioned within the communication messages.

Abstract: Disclosed are systems and methods of performing a power cap processing in a compute environment. The method includes determining of one of committed resources and dedicated resources in a compute environment exceed a threshold value for a job. If a determination is yes that the threshold value is exceeded, then the method includes preempting processing of the job in the compute environment by performing one of migrating the job to a new compute resources and performing a power reduction action associated with the job, such as slowing down a processor associated with a job or cancelling the job. When such a power state reduction action is taken, reservations associated with other jobs may also be adjusted.

Abstract: A data processing system includes multiple data processing apparatuses; a peripheral apparatus; memory that is shared by the data processing apparatuses and the peripheral apparatus; peripheral memory provided corresponding to the peripheral apparatus; and a memory managing unit that secures in any one among the memory and the peripheral memory, an area for a thread that is based on thread information, the area being secured based on the thread information that is read out from a heap area that sequentially stores the thread information that is executed at any one among the data processing apparatuses and the peripheral apparatus.

Abstract: In a parallel computing method performed by a parallel computing system comprising a plurality of central processing units (CPUs), a main process executes. Tasks are executed in parallel with the main process on CPUs not used in executing the main process. Results of completed tasks are stored in a cache, from which the main process retrieves completed task results when needed. The initiation of task execution is controlled by a priority ranking of tasks based on at least probabilities that task results will be needed by the main process and time limits for executing the tasks. The priority ranking of tasks is from the vantage point of a current execution point in the main process and is updated as the main process executes. An executing task may be pre-empted by a task having higher priority if no idle CPU is available.

Abstract: Systems, methods, and machine-readable and executable instructions are provided for dynamically ranking and scheduling monitoring tasks. Dynamically ranking and scheduling monitoring tasks can include determining an updated ranking for each of a number of monitoring tasks, where the updated ranking can include analyzing historical measurements of each of the number of monitoring tasks. An order of execution can be scheduled for each of the number of monitoring tasks based on the updated ranking for each of the number of monitoring tasks.

Abstract: Example systems and methods of providing an indicator of execution progress of a computer task are presented. In one example, a command to perform a computer task is received. The command is compared to a log of commands for computer tasks previously performed on the computer system and their associated execution times. At least one execution time is retrieved from the log based on the comparison. An indicator indicating an estimated execution time for the computer task is provided for presentation to a user of the computer system based on the at least one retrieved execution time.

Abstract: A multi-core processor system includes a core configured to detect among multiple cores, a state of migration of first software from a first core to the core whose specific processing capacity value is lower than that of the first core; and set the processing capacity value of the first core at a time of the detection to be a processing capacity value that is lower than that before the migration when detecting the state of migration.

Abstract: A method for publishing the web sites on remote server using shared hosting in cases of unexpected server timeouts. A list of elements (work items) to be published is generated. The list is sorted out according to dependencies of elements from one another. Then, the work items are sorted out by the priority. The work item from the top of the list (with the highest priority) is processed first. After the work is performed with this work item, the work item is marked as closed if the process has executed successfully. Then, the process moves to the next work item and so on. The process has a library of the work items. Thus, in case of a server timeout, the process knows exactly which work items have been processed prior to the timeout and can start the processing from the next work item.

Abstract: An approach is provided for managing processes for enabling execution of applications within a user device. One or more characteristics of an application are determined by a process monitor module. A process management module then determines a process of the device for execution the application based, at least in part, on the one or more characteristics. A process allocation policy is executed for enabling process allocation decisions.

Abstract: A system and method can support cooperative concurrency in a priority queue. The priority queue, which includes a calendar ring and a fast lane, can detect one or more threads that contend to claim one or more requests in the priority queue. Then, a victim thread can place a request in the fast lane in the priority queue, and release a contending thread, which proceeds to consume the request in the fast lane.

Abstract: In some examples, an electronic device includes a download manager that is configured to determine an order in which to download elements of a file based at least in part on: (i) element priorities of the respective elements of the files, and (ii) application priorities of the respective applications requesting the files.

Abstract: An apparatus schedules execution of a plurality of tasks by a processor. Each task has an associated periodicity and an associated priority based upon the associated periodicity. The processor executes each of the plurality of tasks periodically according to the associated periodicity of the task. A scheduler, at each of a series of scheduling time points updates the priorities of the plurality of tasks and schedules the tasks that need to be executed in accordance with their priorities. The scheduler identifies an unexecuted task which, at a preceding scheduling time point, was scheduled for execution but which, since that preceding scheduling time point, has not been executed. The scheduler sets the priority of the unexecuted task as greater than the priority of other tasks that have the same periodicity as the unexecuted task and that are not themselves unexecuted tasks.

Abstract: An embodiment of the present invention provides a resource management method for a virtual machine system, where the method includes: obtaining, by a virtual resource management platform, a QoS constraint parameter of a virtual machine cluster and a current operating status statistical indicator of the virtual machine cluster, and according to the QoS constraint parameter of the virtual machine cluster and the current operating status statistical indicator of the virtual machine cluster, adjusting physical resources scheduling policy of a physical device platform or performing physical resource scheduling on the physical device platform. The method may ensure QoS of a cloud application.

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: An automation system without any of the devices in the system being required to have knowledge of each other or of the topology of the network. The automation system comprises sensor nodes and actor nodes. The sensor nodes transmit information via a wireless network based on changes that are sensed by the sensors, such as a button being pushed or motion being detected. The actor nodes detect the information that is transmitted over the wireless network and control appliance functions based on the information detected. After the sensor and actor nodes are initialized, the sensor nodes transmit packets into the network based on changes that are detected in their environment. Meanwhile, the actor nodes monitor the network for packets that contain information of scenes that are relevant to each node. Based on the information contained in each such packet, the node acts on the information by controlling its appliance function.

Abstract: Tracking data transfers in an input/output adapter card system to determine whether the adapter cards are well-placed with respect to the components (for example dynamic random access memories) with which the adapter cards respectively are observed to communicate data. Some embodiments use a heuristic value for each adapter card in the system based on inter node transfers and intra node transfers, which are separately weighted and summed over some predetermined time interval in order to obtain the heuristic value.

Abstract: An adaptive partition scheduler is a priority-based scheduler that also provides execution time guarantees (fair-share). Execution time guarantees apply to threads or groups of threads when the system is overloaded. When the system is not overloaded, threads are scheduled based strictly on priority, maintaining strict real-time behavior. When the system is overloaded, threads are scheduled based priority of threads that are in a ready state and based on the available guaranteed processor time budget of the adaptive partition associated with each thread.

Abstract: Embodiments of the present invention include a job scheduling system configured to schedule job execution timings in a computing system; the job scheduling system comprising: a job information receiving module configured to receive job information defining a job pending execution in the computing system, the job information including an indication of computing hardware resources required to execute the job, and an indication of an allocation of application licenses required to execute the job; and a job execution scheduler configured to schedule execution of the job at a timing determined in dependence upon the availability of both the indicated computing hardware resources and the indicated application licenses.

Abstract: Application actions are optimized by receiving actions from one or more distributed applications, translating the received actions into one or more network operation primitives, processing the network operation primitives to determine an optimized set of network operation primitives, determining an optimal execution sequence for the optimized set of network operation primitives, and executing the optimized set of network operation primitives based on the optimal execution sequence.

Abstract: A computer-implemented method for allocating threads includes: receiving a registration of a workload, the registration including a workload classification and a workload priority; monitoring statuses of a plurality of resources; identifying, by a computing device, a thread of a resource from the plurality of resources, the thread being programmed to execute a task associated with the workload; evaluating, by the computing device, the workload classification and the workload priority of the workload with workload classifications and workload priorities of other workloads requesting the thread; and allocating the thread to one of the workloads based on evaluation of the workload classification and the workload priority.

Abstract: A message control program of an embodiment causes a monitoring apparatus to further function as a plurality of message control unit configured to individually controlling a communication method of a message transmitted from each internal application unit. Each message control unit receives a message containing a message type and service name from the internal application unit. Each message control unit specifies communication method identification information from a file based on the message type and service name in the received message. Each message control unit changes the communication method of the received message based on the specified communication method identification information, and sends the message to a common bus.

Abstract: A method is provided herein for managing a plurality of computing entities. The method includes sending a dynamic attribute dependency to one or more of the computing entities. The dynamic attribute dependency specifies a constraint for performing the management operation based on a dynamic attribute of each of the one or more computing entities. Additionally, the method includes scheduling, based on the plan, an atomic task configured to perform the management operation on each of the one or more a computing entities based on whether the constraint is resolved. The method further includes performing the atomic task if the constraint is resolved.

Abstract: A system and method of deploying software provides for comparing a current software topology of a deployment site to a software deployment topology of an application, wherein the software deployment topology is required to deploy the application. One or more mismatches between the current software topology and the software deployment topology may be identified.

Abstract: In an embodiment, a multi-processor mobile communications device includes a first processor system executing a concurrency manager server application (CMSA) and a second processor system executing a concurrency manager client application (CMCA). The CMSA determines priority levels related to access to resources for a first set of applications that are configured for execution on the first processor system and a second set of applications that are configured for execution on the second processor system. The CMSA notifies the CMCA of the determined priorities. The CMSA and the CMCA each then selectively grant or reject access to the resources for the first and second sets of applications, respectively, based on the determined priorities levels. In another embodiment, if the CMSA or CMCA rejects an application's request to access resources, the CMSA or CMCA can determine availability of alternative resources by which the requesting application can achieve its goal.

Abstract: A multi-core processor system includes multiple cores and memory accessible from the cores, where a given core is configured to detect among the cores, first cores having a highest execution priority level; identify among the detected first cores, a second core that caused access conflict of the memory; and control a third core that is among the cores, excluding the first cores and the identified second core, the third core being controlled to execute for a given interval during an interval when the access conflict occurs, a thread that does not access the memory.

Abstract: A method, non-transitory computer readable medium, and apparatus for configuring a scheduling a job request in a data processing platform are disclosed. The method receives a new job request having a priority selected by a user, submits the new job request to an online job queue comprising a plurality of jobs, wherein each one of the plurality of jobs comprises a respective priority selected by a respective user and schedules the new job request and the plurality of jobs in the online job queue to one or more available worker nodes in a unit time slot based upon a comparison of the priority of the new job and the respective priority of the plurality of jobs in the online job queue, wherein the scheduling algorithm is based on one of: blocks having a variable size and a static processing time or blocks having a static size and a variable processing time.

Abstract: Embodiments relate to a computer system comprising a service layer controller. The computer system comprises a ring interface unit configured to provide access to a host system that enables access to a plurality of virtual machines (VMs). The computer system comprises a hardware application configured to be encapsulated by the service layer controller such that the hardware application communicates to the host system via interfaces controlled by the ring interface unit and service layer controller.

Abstract: Priorities of an application and/or processes associated with an application executing on a computer is determined according to user-specific usage patterns of the application and stored for subsequent use, analysis and distribution.

Abstract: A method for publishing the web sites on remote server using shared hosting in cases of unexpected server timeouts. A list of elements (work items) to be published is generated. The list is sorted out according to dependencies of elements from one another. Then, the work items are sorted out by the priority. The work item from the top of the list (with the highest priority) is processed first. After the work is performed with this work item, the work item is marked as closed if the process has executed successfully. Then, the process moves to the next work item and so on. The process has a library of the work items. Thus, in case of a server timeout, the process knows exactly which work items have been processed prior to the timeout and can start the processing from the next work item.

Abstract: A method and system for parsing and analyzing incoming electronic mail messages to determine a confidence factor indicative of whether or not the messages are junk e-mail. The method and system utilize message services which attempt to contact the purported sender in order to verify that the identified host computer actually exists and accepts outgoing mail services for the specified user. The routing history is also examined to ensure that identified intermediate sites are also valid. Likewise, seed addresses can alert an e-mail provider to potential mass mailings by reporting when mail is received for ghost or non-existent accounts.

Abstract: A method for performing thread scheduling in an electronic device having a hardware processor configured for executing an operating system is provided. The operating system includes a thread scheduler and a queue manager. The method includes the following steps. In response to one of a plurality of predefined conditions is met, enable a virtual manager executed by the hardware processor. Receive a request by the thread scheduler for scheduling a thread to be executed. Mask the scheduler by the virtual manager from accessing a first queue including a plurality of first threads in a runnable state. Direct the scheduler to a first virtual queue including a first portion of the plurality of first threads in the first queue for selecting the thread to be executed. The first portion of the first threads associated with at least one application currently running. Schedule execution of the selected thread by the hardware processor.

Abstract: A mechanism for priority build execution in a continuous integration system is disclosed. A method includes executing, by a computing device in a continuous integration system, a low priority job of the continuous integrations system using a resource of the computing device. The method also includes receiving a high priority job to be executed by the computing device and identifying a conflict at the resource when the high priority job is assigned to execute using the same resource that is currently being used for executing the low priority job. When the conflict is identified, the method further includes suspending the execution of the low priority job, recording a state of the low priority job at a time of the suspension of the execution and executing the high priority job using the resource.

Abstract: A method for scheduling tasks from a program executed by a multi-processor core system is disclosed. The method includes a scheduler that groups a plurality of tasks, each having an assigned priority, by priority in a task group. The task group is assembled with other task groups having identical priorities in a task group queue. A hierarchy of task group queues is established based on priority levels of the assigned tasks. Task groups are assigned to one of a plurality of worker threads based on the hierarchy of task group queues. Each of the worker threads is associated with a processor in the multi-processor system. The tasks of the task groups are executed via the worker threads according to the order in the hierarchy.

Abstract: A system and method for selecting the number of machines from a cloud cluster needed for performing identical tasks with different inputs and outputs are disclosed. An example method receives an administrative task request from a user and determines the number of computing devices necessary to perform the request. The request may then be sharded into tasks across clusters of computing devices and the tasks may be run. The results from each computing device may be combined into a single result output and the output may be provided to a user.

Abstract: In a data processing system that is executing a parent execution entity of an application, the parent execution entity has a first affinity setting. The data processing system enables the parent execution entity to create a worker execution entity that has a second affinity setting without changing the affinity setting of the parent execution entity. Workload for the application may then be performed in parallel by the parent execution entity and the worker execution entity. In one embodiment, to create the worker execution entity with the second affinity setting, the system first creates a delegate execution entity that has the first affinity setting. The system then changes the affinity setting of the delegate execution entity to the second affinity setting. The delegate execution entity then creates the worker execution entity with the second affinity setting. Another embodiment involves a super-delegate execution entity. Other embodiments are described and claimed.

Abstract: A methods and device for accessing virtual machine (VM) data are described. A computing device for accessing virtual machine comprises an access request process module, a data transfer proxy module and a virtual disk. The access request process module receives a data access request sent by a VM and adds the data access request to a request array. The data transfer proxy module obtains the data access request from the request array, maps the obtained data access request to a corresponding virtual storage unit, and maps the virtual storage unit to a corresponding physical storage unit of a distributed storage system. A corresponding data access operation may be performed based on a type of the data access request.

Abstract: A processor unit removes, responsive to obtaining a new address, an entry from a memory of a type of memory based on a comparison of a performance of the type of memory to different performances, each of the different performances associated with a number of other types of memory.

Abstract: A processor unit removes, responsive to obtaining a new address, an entry from a memory of a type of memory based on a comparison of a performance of the type of memory to different performances, each of the different performances associated with a number of other types of memory.

Abstract: The embodiments described herein provide a controller and method for performing a background commands or operations. In one embodiment, a controller is provided with interfaces through which to communicate with a host and a plurality of flash memory devices. The controller contains a processor operative to perform a foreground command received from the host, wherein the processor performs the foreground command to completion without interruption. The processor is also operative to perform a background commands or operations stored in the controller's memory, wherein the processor performs the background command until completed or preempted by a foreground command. If the background command is preempted, the processor can resume performing the background command at a later time until completed.

Abstract: An apparatus includes an input/output (I/O) interface configured to couple a controller to an I/O buffer of a memory device. The controller includes an erase module coupled to the I/O interface. The erase module is configured to issue an instruction to the memory device to erase data from the memory device. The controller includes an erase suspend module coupled to the I/O interface. The erase suspend module is configured to determine that an erase operation executing within the electronic memory device satisfies a suspend policy in response to receiving a memory access request to perform an operation on the memory device on which the erase operation is executing. The erase suspend module is further configured to issue a suspend command to the memory device to suspend the erase operation.

Abstract: Embodiments are directed towards a system and method for a cloud-based front end that may abstract and enable access to the underlying cloud-hosted elements and objects that may be part of a multi-tenant application, such as a search application. Search objects may be employed to access indexed objects. An amount of indexed data accessible to a user may be based on an index storage limit selected by the user, such that data that exceeds the index storage limit may continue to be indexed. Also, one or more projects can be elastically scaled for a user to provide resources that may meet the specific needs of each project.

Abstract: Embodiments of the present invention provide an approach to prioritize jobs (e.g., within a cloud computing environment) so as to maximize positive financial impacts (or to minimize negative financial impacts) for cloud service providers, while not exceeding processing capacity or failing to meet terms of applicable Service Level Agreements (SLAs). Specifically, under the present invention a respective income (i.e., a cost to the customer), a processing need, and set of SLA terms (e.g., predetermined priorities, time constraints, etc.) will be determined for each of a plurality of jobs to be performed. The jobs will then be prioritized in a way that: maximizes cumulative/collective income; stays within the total processing capacity of the cloud computing environment; and meets the SLA terms.