# US 2014/0157280 A1 · Scheduling method and scheduling system > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2014/0157280 A1 - Document ID: US20140157280A1 - Status: Published application - Kind: A1 - Application number: 14/175,248 - Filed: 2014-02-07 - Published: 2014-06-05 - Earliest claimed: 2011-08-09 - Assignees: Fujitsu Limited - Applicants: Fujitsu Limited - Inventors: Hiromasa Yamauchi; Koichiro Yamashita; Takahisa Suzuki; Koji Kurihara; Toshiya Otomo - Web page: https://patentgrep.com/patent/US20140157280A1 ## CPC - G06F 9/46: Multiprogramming arrangements - G06F 9/5061: {Partitioning or combining of resources} - G06F 9/5088: {involving task migration} - G06F 9/5094: {where the allocation takes into account power or heat criteria (power management in computers in general G06F1/3203; thermal management in computers in general G06F1/206)} - G06F 2209/505: Clust - Y02D 10/00: Energy efficient computing, e.g. low power processors, power management or thermal management - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) - Y02D: CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE ## Abstract A scheduling method includes determining whether priority of an application to be activated is of a given priority, the determining being performed by a first data processing apparatus that is included in a first group having at least one data processing apparatus; transferring to a second data processing apparatus that is included in any one among a second group and the first group, a predetermined function of the first data processing apparatus so as to execute the application by the first data processing apparatus, the transferring being performed when the priority of the application is of the given priority, and the first and the second groups being among a plurality of groups that each includes at least one data processing apparatus; and placing the application in an execution queue of the first data processing apparatus, when the priority of the application is not the given priority. ## Claims ### Claim 1 A scheduling method comprising: determining whether priority of an application to be activated is of a given priority, the determining being performed by a first data processing apparatus that is included in a first group having at least one data processing apparatus; transferring to a second data processing apparatus that is included in any one among a second group and the first group, a predetermined function of the first data processing apparatus so as to execute the application by the first data processing apparatus, the transferring being performed when the priority of the application is of the given priority, and the first and the second groups being among a plurality of groups that each includes at least one data processing apparatus; and placing the application in an execution queue of the first data processing apparatus, when the priority of the application is not the given priority. ### Claim 2 (depends on 1) The scheduling method according to claim 1, comprising deleting data that is stored in a first area of the first data processing apparatus and shared between data processing apparatuses of the first group and the groups; and saving data that is stored in a second area of the first data processing apparatus and shared between data processing apparatuses of the second group. ### Claim 3 (depends on 1) The scheduling method according to claim 1, comprising assigning the application to a third data processing apparatus included in any one among the first group and the groups, when the priority of the application is not the given priority and a load amount of the first data processing apparatus exceeds a threshold value. ### Claim 4 (depends on 1) The scheduling method according to claim 1, comprising giving to a predetermined data processing apparatus of each of the groups, notification of a transfer of the predetermined function from the first data processing apparatus to the second data processing apparatus. ### Claim 5 (depends on 1) The scheduling method according to claim 1, comprising selecting from the groups, groups that include a data processing apparatus that has a load amount that is at most a predetermined value; and selecting as the second group and from among the selected groups, a group having a highest communication speed. ### Claim 6 (depends on 1) The scheduling method according to claim 1, comprising; selecting from among the groups and based on a request for scheduling from one group of the groups, groups that include a data processing apparatus that has a load amount that is at most a predetermined value, the selecting being performed by the first data processing apparatus; and requesting a group having the highest communication speed among the selected groups to perform the scheduling, the requesting being performed by the first data processing apparatus. ### Claim 7 (depends on 1) The scheduling method according to claim 1, wherein the transferring includes transferring the predetermined function of the first data processing apparatus to a fourth processing apparatus that is included in any one among the first group and the groups, the transferring being performed based on a comparison result of a threshold value and any one among communication signal strength with a base station and a remaining battery amount of the first data processing apparatus. ### Claim 8 (depends on 1) The scheduling method according to claim 1, comprising excluding the first data processing apparatus from the first group, based on a comparison result of a threshold value and any one among communication signal strength with a base station and a remaining battery amount of the first data processing apparatus. ### Claim 9 (depends on 1) The scheduling method according to claim 1, comprising analyzing by the first data processing apparatus, load amounts of the data processing apparatuses in the first group based on a request for scheduling from one data processing apparatus of the first group; and requesting a predetermined data processing apparatus of one group of the groups to perform the scheduling, the first data processing apparatus requesting the scheduling when the load amounts exceed a threshold value. ### Claim 10 (depends on 1) The scheduling method according to claim 1, comprising selecting based on a request for transfer of data from one data processing apparatus of the first group, a data processing apparatus that is to transfer the data, the data processing apparatus being selected based on any one among a remaining battery amount of another data processing apparatus of the first group, communication signal strength with a base station, and a size of an area shared between data processing apparatuses of the first group. ### Claim 11 (depends on 10) The scheduling method according to claim 10, comprising requesting based on a dependence relationship between the data and data related to a process executed by a data processing apparatus of the first group, transfer any one among the data and the related data, a data processing apparatus of one group of the groups being requested to transfer any one among the data and the related data. ### Claim 12 A scheduling system comprising: a first data processing apparatus that is included in a first group; and a second data processing apparatus that is included in a second group, wherein the first data processing apparatus includes a processor that is configured to: determine whether priority of an application to be activated is of a given priority, select based on the priority of the application, a data processing apparatus to which a predetermined function of the first data processing apparatus is to be transferred, and place the application into an execution queue, based on the priority of the application. ### Claim 13 (depends on 12) The scheduling system according to claim 12, wherein the processor is configured to analyze load amounts of data processing apparatuses included in the first group and the second group. ### Claim 14 (depends on 12) The scheduling system according to claim 12, wherein the first data processing apparatus includes memory that has a first area for storing data shared between data processing apparatuses of the first group and the second group and a second area for storing data shared between data processing apparatuses of the first group, and the second data processing apparatus includes memory that has a first area for storing data shared between the data processing apparatuses of the first group and the second group and a second area for storing data shared between data processing apparatuses of the second group.