242 results about "Task group" patented technology

A task scheduling device specifies tasks to be executed one at a time. The device performs priority level scheduling in task group units on a round-robin basis, and selects one of the task groups. Then, on a round-robin basis using a timeslice period set for each of the tasks, the device performs priority level scheduling on all the tasks included in the selected task group, and specifies one of the tasks as the execution target. If the timeslice period of a task being executed has yet to elapse when another task group is selected, then next time the task is specified as the execution target, the device executes the task for the remainder of the timeslice period rather than the full timeslice period. In this way, the task scheduling device is able to effectively allocate and control the time period distributed for the execution of each of the tasks.

The Fibre. Channel standard was created by the American National Standard for Information Systems (ANSI) X3T11 task group to define a serial I/O channel for interconnecting a number of heterogeneous peripheral devices to computer systems as well as interconnecting the computer systems themselves through optical fiber and copper media at gigabit speeds (i.e., one billion bits per second). Multiple protocols such as SCSI (Small Computer Serial Interface), IP (Internet Protocol), HIPPI, ATM (Asynchronous Transfer Mode) among others can concurrently utilize the same media when mapped over Fibre Channel. A Fibre Channel Fabric is an entity which transmits Fibre Channel frames between connected Node Ports. The Fibre Channel fabric routes the frames based on the destination address as well as other information embedded in the Fibre Channel frame header. Node Ports are attached to the Fibre Channel Fabric through links.

A method and apparatus for allowing for the exchange of tasks, over an instant messenger (“IM”) infrastructure, are disclosed. An IM application, running on an electronic device, may allow creation, assigning, tracking, viewing, exporting, importing and managing tasks. IM applications may include, but not be limited to, stand-alone applications, browser plug-ins, on-screen widgets and gadgets, PDA and cellular phone modules, server-sided applications rendered on a client machine, etc. Personal Information Management (“PIM”) applications may use IM infrastructures to exchange of tasks or task information. Project management applications (“PMA”) may be used to define projects, containing tasks with complex sets of rules and inter-dependencies, and leverage IM networks for disseminating these projects and tasks among users. Tasks exchanged on an IM network may be imported into PMAs and PIMs. Tasks may be exchanged in a peer-to-peer IM network, which may span multiple IM service providers. Tasks may be transported in XML data structures which may contain data pertaining to users for whom tasks are intended, the progress made on tasks, documents attached to tasks, etc. User roles and privileges may be defined within tasks structures such that some users are the assignees of a task, while other users may only view task progress and be notified of milestones as tasks are worked on. Users may create task groups and communities, allowing them to control who may assign tasks to members of the group.

LDPC (Low Density Parity Check) coding and interleaving implemented in multiple-input-multiple-output (MIMO) communication systems. Initially, a novel approach is presented by which a wide variety of irregular LDPC codes may be generated using GRS or RS codes. These irregular LDPC codes can provide better overall performance than regular LDPC codes in terms of providing for lower BER (Bit Error Rate) as a function of SNR (Signal to Noise Ratio). A variety of communication device types are also presented that may employ the error correcting coding using a GRS-based irregular LDPC code, along with appropriately selected interleaving, to provide for even better performance. These communication devices may be implemented to in wireless communication systems including those that comply with the recommendation practices and standards being developed by the IEEE 802.11n Task Group (i.e., the Task Group that is working to develop a standard for 802.11 TGn (High Throughput)).

An apparatus and method capable of reducing idle resources in a multicore device and improving the use of available resources in the multicore device are provided. The apparatus includes a static scheduling unit configured to generate one or more task groups, and to allocate the task groups to virtual cores by dividing or combining the tasks included in the task groups based on the execution time estimates of the task groups. The apparatus also includes a dynamic scheduling unit configured to map the virtual cores to physical cores.

Aspects of the invention include methods and systems for a vehicle insurance claim management application which improves communication and streamline tasks between a vehicle repair shop and an insurance company system in three general task groups: assignment (comprising work requests, estimates/photos, and reinspections), financial management, and performance measurement. Aspects of the invention also provide interoperability with different types of estimating systems that do not necessarily follow an industry standard. This interoperability is provided through an adapter module with a claim processing system to communicate with the insurance company system and the vehicle insurance claim management application. The invention is preferably accessed by a user over a computer network such as the Internet, from a remote location such as a vehicle repair shop.

A method for executing processing tasks in a distributed processing framework system is provided. The method includes identifying a main task of a tasklist and identifying a subtask of the main task. Also included is allocating computing resources for each of the main task and the subtask. The method further includes deploying the main task to a first computing system that is part of the distributed processing framework system. A code of the main task is executed on the first computing system. The code of the main task has program instructions for requesting loading of code for the subtask to a second computing system. The second computing system is part of the allocated computing resources. The code for the subtask is in client-server communication with the code for the main task, such that the code for the main task receives processing results directly from the code for the subtask.

An information processing system periodically performs a real-time operation including a plurality of chained tasks. The system includes a plurality of processors, a unit for dividing the chained tasks into a first task group and a second task group based on a relationship in order of execution among the tasks, the second task group being executed after the first task group, and a unit for performing a scheduling operation of periodically assigning each of the first task group and the second task group to at least one of the processors to periodically execute the first task group at regular time intervals and periodically execute the second task group at the regular time intervals with a one-period delay relative to the first task group.

The invention belongs to the technical field of multiple unmanned aerial vehicles, and particularly relates to a method for achieving coordinated flight of multiple unmanned aerial vehicles, wherein the method can be used for target tracking, flight path optimization, coordinated management, coordinated flight and task distribution of the multiple unmanned aerial vehicles. The method includes the steps of determining the number of flight task objects, determining operating parameters of the leading aerial vehicles and the following aerial vehicles in the multiple unmanned aerial vehicles, determining whether the following aerial vehicles in each task group should follow and fly to task objects or not by setting navigation marks, setting the flying states of the leading aerial vehicles, and enabling the leading aerial vehicles to fly to the task destinations respectively and to return to the starting places respectively after arriving at the destinations, wherein for the following aerial vehicles, 0 stands for that the leading aerial vehicles have not returned, 1 stands for that the leading aerial vehicles have returned and can start following flight, for the leading aerial vehicles, 0 stands for that the leading aerial vehicles are in the process of searching for targets, 1 stands for that the leading aerial vehicles are in the process of returning to the starting places, and 2 stands for that the leading aerial vehicles are in the process of leading the following aerial vehicles to fly to the task destinations. Information is shared, and therefore the multiple unmanned aerial vehicles is made to have higher autonomy, flexibility and safety in coordinated flight, and the efficiency is improved when the multiple unmanned aerial vehicles are used in cooperation for executing the task.

The invention discloses a method and device for planning a distribution path based on standard box orders. Received multiple store orders are divided into task groups to be distributed, and distributed by target distribution equipment in a unified manner; according to the store geographical positions and the store order distribution sequence corresponding to store orders in the task groups to be distributed, an initial distribution path is generated; the initial distribution path includes multiple nodes; then, according to the freight volume of the store orders based on standard boxes, the retention time of the target distribution equipment is determined, so that the practical distribution starting time of a store order corresponding to the next node can be determined; if the practical distribution starting time is lagged behind the planned distribution starting time, the distribution path is re-planned; and thus, an optimal distribution path is obtained. By means of the method provided in the invention, frequently congested road sections and currently constructed road sections in roads can be evaded; therefore, the congestion condition does not exist or is as little as possible on the whole distribution path; the distribution efficiency of the distribution equipment is increased; and delayed delivery of the store order corresponding to the next node can be avoided.

Execution of tasks on accelerator units is managed. The managing includes multi-level grouping of tasks into groups based on defined criteria, including start time of tasks and/or deadline of tasks. The task groups and possibly individual tasks are mapped to accelerator units to be executed. During execution, redistribution of a task group and/or an individual task may occur to optimize a defined energy profile.

A method for processing a computer software process including a task file is provided. The method includes designating a group of available processing resources to execute the task file that includes task groups with each task group including a plurality of tasks. The method also includes scheduling the task groups in the task file for execution with a plurality of remaining processing resources, each running a client controller component code. Further included is obtaining access to a set of free remaining processing resources of the plurality of remaining processing resources, each having a set of criteria matching a set of requirements of each task in a particular task group. The method also includes executing tasks in the particular task group when access to all the free remaining resources in the set of the free remaining processing resources have been granted. Also included is generating an execution result report.

The invention provides a task scheduling method and system in a distributed data warehouse. The method comprises the following steps of: A, dividing tasks into a plurality of task groups according to types, and respectively setting the proportion of resources required to be allocated for the task groups; and B, allocating the resources to the plurality of task groups according to the proportion of the resources. The system comprises a grouping module and a resource allocation module, wherein the grouping module is used for dividing tasks into a plurality of task groups according to types and respectively setting the proportion of resources required to be allocated for the task groups, and the resource allocation module is used for allocating the resources to the plurality of task groups according to the proportion of the resources. By adopting the task scheduling method and system in the distributed data warehouse, provided by the invention, the resources can be reasonably allocated, the requirements for calculating small tasks in real time can be met, and the requirements for calculating large tasks not in real time can also be met.

The invention discloses a method and a device for server task scheduling. According to the type of tasks, the tasks are distributed to a pre-bound task group, and a preset task scheduling algorithm corresponding to the pre-bound task group is used for scheduling the tasks, wherein the pre-bound task group comprises a first preset quantity of CPUs (Central Processing Units), and is bound with a memory bank which contains a preset second quantity of memory nodes. Different types of tasks are distributed to different task groups, the task group contains a corresponding quantity of CPUs and memory nodes, and the CPUs and the memory nodes are grouped to execute of different types of tasks; and when task scheduling is carried out, the characteristics of the task are considered, and the hardware characteristics of the CPU and the memory node of the server are also considered. During task scheduling, the hardware characteristics of the server are considered, and performance loss brought by task switching can be reduced so as to improve the resource use ratio of the server and improve server performance. Obviously, the method is favorable for improving the server performance.

According to a method for managing a task, attributions of first to nth function task groups for executing one function respectively are stored in an attribution storage unit of the function task group, and according to the attribution stored in the attribution storage unit of the function task group, a function task group managing unit assigns a resource to the task belonging to the first to nth function task groups and executes the operation with related to an interruption caused during execution of the task belonging to the first to nth function task groups.