WO2008047757A1 - élément de traitement, unité de commande, système de traitement obtenu avec ceux-ci, et procédé de traitement de distribution - Google Patents

élément de traitement, unité de commande, système de traitement obtenu avec ceux-ci, et procédé de traitement de distribution Download PDF

Info

Publication number
WO2008047757A1
WO2008047757A1 PCT/JP2007/070072 JP2007070072W WO2008047757A1 WO 2008047757 A1 WO2008047757 A1 WO 2008047757A1 JP 2007070072 W JP2007070072 W JP 2007070072W WO 2008047757 A1 WO2008047757 A1 WO 2008047757A1
Authority
WO
WIPO (PCT)
Prior art keywords
processing
control unit
unit
service
information
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/JP2007/070072
Other languages
English (en)
French (fr)
Japanese (ja)
Inventor
Mitsunori Kubo
Arata Shinozaki
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Olympus Corp
Original Assignee
Olympus Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Olympus Corp filed Critical Olympus Corp
Priority to US12/442,276 priority Critical patent/US20090249341A1/en
Publication of WO2008047757A1 publication Critical patent/WO2008047757A1/ja
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/465Distributed object oriented systems
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00Indexing scheme relating to G06F9/00
    • G06F2209/46Indexing scheme relating to G06F9/46
    • G06F2209/462Lookup

Definitions

  • Processing element control unit, processing system including these, distributed processing method
  • the present invention relates to a processing element, a control unit, a processing system including these, and a distributed processing method.
  • each step is described as software on a general-purpose CPU.
  • Each step can be realized as a subroutine or thread in one program, or it can be realized as a separate program for interprocess communication.
  • Patent Document 1 Japanese Patent Laid-Open No. 10-334055
  • processing element client 'processing. Element
  • client 'processing. Element that requests process A consisting of step 1, step 2, step 3, and step 4.
  • the processing element that receives the request is referred to as a sano processing element. If the sano 'processing' element knows all the processing element information on the network, the location of the processing element specialized for the processing of steps 1 to 4 may be notified.
  • the present invention has been made in view of the above, and has a highly scalable processing system that can be realized at low cost, a processing 'element, a controller' unit used in this system, and a distributed system.
  • An object is to provide a processing method. Means for solving the problem
  • a processing unit that performs a specific function and functional information related to the specific function according to an external request are output to the outside.
  • a processing element characterized by having a communication unit and a data holding unit holding function information can be provided.
  • the communication unit asks the other control unit about the function information of the processing element connected to the other control unit. ! /, Power to match S power to be able to S
  • a processing system having a processing 'element and a control unit, wherein the processing' element is adapted to a processing unit for performing a specific function and an external request.
  • the processing unit has a communication unit that outputs function information related to a specific function to the outside and a data holding unit that holds function information.
  • the control unit is connected in response to an external request. Function information Desirable to have a communication part to power.
  • control unit obtains the function information of the processing element connected to the control unit via the communication unit, and holds the data. It is desirable to have a holding part.
  • the control unit detects the connected or disconnected processing 'element, and manages at least the function information of the processing' element connected to the control 'unit. 'Create or update element connection information, receive execution requests for specific services, get information on tasks that make up the service, refer to processing element connection information, and control' Uses the processing 'element connected to the unit to determine service execution, and based on the service execution determination result, obtains task execution transition information for executing the tasks that make up the service. Processing connected to the control unit 'It is desirable that the element performs a function according to the task execution transition information.
  • the communication unit of the control unit is configured to check the function information held in another control unit based on the determination result regarding the execution of the service. It is desirable that the processing elements that are connected to other control units be functioned according to task execution transition information.
  • a processing method using a processing 'element for performing a specific function and a control unit wherein the function information relating to the specific function is stored in the processing element.
  • In-element data retention step and processing; output functional information to the outside in response to requests from outside the element; processing to output functional information in response to requests from the outside of the element communication step and control 'unit It is possible to provide a distributed processing method characterized by comprising a control unit communication step.
  • the processing 'element function information connected to the control unit is further acquired and held in the control' unit. It is desirable.
  • a processing 'element detecting step for detecting a processing' element connected or disconnected to the control unit; and at least one of the processing elements connected to the control unit Processing to manage functional information 'Process to acquire or update element connection information; Element connection information acquisition step, service execution request reception step to receive execution request for specific service, and task to configure service Processing related to the control 'processing connected to the unit' element by referring to the service task correspondence information acquisition step and information representing the task that constitutes the service.
  • a service execution determination step that determines whether to execute the service based on the function information, and a task for executing a task constituting the service based on the determination result of the service execution determination step It is desirable to have a task execution transition information acquisition step for acquiring execution transition information and a processing 'element execution step in which the element connected to the control unit performs a function according to the task execution transition information.
  • the processing element connection information acquisition step another control unit within a predetermined range connected to the control unit is processed. It is desirable to obtain or update element connection information.
  • control unit within a predetermined range connected to the control unit is determined based on a communication distance.
  • the processing to execute the tasks constituting the service 'processing to secure the element' to secure the element It is desirable to further include steps.
  • the invention's effect it is possible to provide a processing system that can be realized at high cost / expandability at low cost, a processing 'element, a control' unit, and a distributed processing method used in this system! /.
  • FIG. 1A is a diagram showing a schematic configuration of a processing element in the present invention.
  • FIG. 1B is a diagram showing a schematic configuration of a control unit in the present invention.
  • FIG. 2 is a diagram showing a connection between a processing 'element and a control' unit in the present invention.
  • FIG. 3 is a diagram showing another connection between the processing 'element and control' unit in the present invention.
  • FIG. 4 is a diagram showing still another connection between the processing “element” and the “control” unit in the present invention.
  • FIG. 5 is a diagram showing another connection of the processing 'element and control' unit in the present invention.
  • FIG. 6 is a diagram showing a schematic configuration of a processing system in the present invention.
  • FIG. 7 is a diagram showing a schematic configuration of another processing system in the present invention.
  • FIG. 8 is a flowchart showing JJPEG decoding processing.
  • FIG. 9A is a diagram showing a processing model in Example 1.
  • FIG. 9B is another diagram showing a processing model in the first embodiment.
  • FIG. 10 is a diagram showing a configuration of a processing element connection table in the first embodiment.
  • FIG. 11 is a diagram showing a structure of a task execution transition table in the first embodiment.
  • FIG. 12 is a diagram showing the structure of a service task correspondence table in Example 1.
  • FIG. 13 is a flowchart showing the processing procedure of the control unit in the first embodiment.
  • FIG. 14 is a flowchart showing a flow of JPEG decoding processing in the first embodiment.
  • FIG. 15A is another flowchart showing the flow of JPEG decoding processing in the first embodiment.
  • FIG. 15B is another flowchart showing the flow of JPEG decoding in the first embodiment. is there.
  • FIG. 16 is still another flowchart showing the flow of JPEG decoding processing in the first embodiment.
  • FIG. 17 is another flowchart showing the flow of JPEG decoding in the first embodiment.
  • FIG. 18 is still another flowchart showing the flow of JPEG decoding processing in the first embodiment.
  • FIG. 19 is a flowchart showing the processing procedure of the control unit in Embodiment 2 of the present invention.
  • FIG. 20 is another flowchart showing the processing procedure of the control unit in the second embodiment.
  • FIG. 21 is still another flow chart showing the processing procedure of the control unit in the second embodiment.
  • FIGS. 1A and IB show schematic configurations of the processing element and the control unit in the first embodiment of the present invention, respectively.
  • a processing element 100 includes a processing unit 101, a data holding unit 102, and a communication unit 103.
  • a “processing 'element” is a system building block that implements one or more of the four functions of data input / output, processing, transmission, and storage.
  • the processing unit 101 performs a specific function.
  • the communication unit 103 outputs function information regarding a specific function to the outside in response to a request from the outside. Further, the data holding unit 102 holds function information.
  • the processing unit 101 may have a function of simply passing through data, that is, transmitting the data without processing.
  • the data holding unit 102 can use a rewritable configuration, for example, a configuration written as hardware logic, a configuration of a hexadecimal Dip switch, or the like.
  • one processing element has a processing function for performing one or more “tasks”, and a data input / output function and a data storage function necessary for this processing.
  • “task” refers to a unit of execution of a certain function.
  • FIG. 1B shows a schematic configuration of the control unit 200.
  • control unit 200 only needs to include at least the communication unit 202. More preferably, the control unit 200 also includes a processing unit 201.
  • the control unit 200 is configured so that the processing element 100 having the above-described configuration can be connected!
  • the control unit is the assignment (assignment) of “tasks” to each processing element and the management of task execution transitions for “services”. Refers to the control unit.
  • the communication unit 202 of the control 'unit 200 outputs functional information related to a specific function performed by the processing element connected to the control' unit 200 in response to an external request.
  • the detailed functions of the processing element 100 and the control unit 200 will be described later.
  • a “service” is a collection of tasks that have one or more relationships. “Service” realizes more meaningful processing than “task”.
  • Figure 2 shows a network configuration that uses processing elements and control units.
  • One processing 'element 100 and one controller' unit 200 are connected via a force network. This is an example of a minimum network configuration.
  • the processing element 100 and the control unit 200 need only be connected via a communication path capable of information communication.
  • FIG. 3 shows another configuration example.
  • the mother board 301 On the mother board 301, one control 'unit CU and three processing' elements PE1, PE2, PE3 are mounted.
  • the controller 'unit CU and the processing' elements PE1, PE2, PE3 are connected via the system bus 302! /, Respectively.
  • FIG. 4 shows still another configuration.
  • the mother board 401 is equipped with a control unit CU1 and a processing element PE1.
  • the I / O board 402 includes a control unit CU2 and a processing element PE2.
  • the control 'units CU 1 and CU 2 and the processing' elements PE 1 and PE 2 are connected by a peripheral bus 403.
  • a peripheral nose 403 As the peripheral nose 403, a US B or a PCI bus can be used.
  • FIG. 5 shows another configuration. On one LAN 501a, processing 'elements PE1, PE2, PE3 and control unit CU1 are connected.
  • the other LAN501b has the processing elements PE4, PE5, PE6 and the control unit CU2 and force S. It is connected.
  • the LAN 501a and the LAN 501b are connected via the Internet 502.
  • the combination of the processing element of the present invention and the controller 'unit can encompass the minimum configuration shown in FIG. 1A and IB to the global configuration via the Internet shown in FIG. it can.
  • FIG. 6 shows a schematic configuration of the distributed processing system of the present invention.
  • a “service” that performs steps;! Specifically, “Step 1,” “Step 2,” “Step 3,” and “Step 4” correspond to tasks. A set of processes from Step 1 to Step 4 corresponds to “service”.
  • a specific computer is connected to the Internet! /, It has information of all computers! /, Not!
  • a routing terminal called a router manages only subnetwork information and neighboring subnetwork information. And if necessary, it becomes a system that matches information necessary for neighboring networks!
  • a processing 'control' unit (corresponding to a router) that manages only sub-network information of elements and neighboring sub-network information is provided.
  • Some processing elements on the network are connected to the control unit.
  • control unit 'CU10 has four processing elements P
  • processing element PE1 of the function performing "Step 1" processing element PE2 of the function performing "Step 2"
  • Step 1 processing element PE2 of the function performing "Step 2”
  • Step 2 processing element PE2 of the function performing "Step 2”
  • steps 1 to 4 can be executed by the processing 'elements PE 1 to PE 4 connected to the control' unit CU10 '.
  • FIG. 6 shows a case where a particular service can be executed within a single network! /.
  • step 1 'Element PE1 is connected to control unit CU102.
  • the processing 'element PE2 for carrying out step 2 is connected to the control' unit CU45.
  • the processing element PE3 for performing step 3 is connected to the control unit CU102. Furthermore, the processing 'element PE4 for performing step 4 is connected to the control' unit CU27.
  • Processing element PE0 client 'processing' element
  • the control unit CU45 searches for a processing element suitable for the processing content. Then assemble the processing order (routing order).
  • processing is performed according to the routing order and the processing result is returned to processing 'element 0. Thereby, Step 1 to Step 4 can be performed. Detailed procedures will be described later.
  • connection between the processing elements may be any of the following (1) to (3).
  • connection method is not limited to wired, but may be a wireless method.
  • Network cable (Ethernet (registered trademark), InfiniBand, Myrinet, etc.)
  • Peripheral connection bus USB, PCI, etc.
  • FIG. 8 is a flowchart showing a processing procedure for performing JPEG decoding.
  • step S201 of Fig. 8 the JPEG file is analyzed.
  • step S202 entropy decoding is performed.
  • step S203 inverse quantization is performed.
  • step S204 IDCT (Inverse Discrete Cosine Transform) is performed.
  • step S205 the color signal is converted.
  • step S206 the result is displayed. Then, the JPEG decoding process ends.
  • each JPEG decoding step consists of one task.
  • “inverse quantization” is one task.
  • Each task has an identification number called a task identifier (hereinafter referred to as “TID” where appropriate). And the function that the task realizes and the TID correspond one-on-one! /.
  • Service refers to a set of tasks having one or more associations as described above.
  • the JPEG decoding process is an example of a service.
  • the service has a service identifier (hereinafter
  • SID unique identification number
  • the processing 'element for requesting execution of a service is particularly called a service execution request processing. Element.
  • one task may be one service.
  • IDCT processing when IDCT processing is requested as a service, the result of IDCT processing for the input is returned.
  • the service execution request processing element need not receive the result data.
  • Other processing 'elements may display and store data and the service may end.
  • FIG. 9A shows an outline of a processing model.
  • the processing model consists of one control unit CU1, one service execution request processing 'element PE0, and two or more task processing processing' elements including PE1 and PE2.
  • the service execution request processing “element PE0” is a task execution processing “element”.
  • FIG. 9B shows the structure of information that the processing unit CU1 has and the processing 'elements PE0, PE1, PE2 (hereinafter referred to as' processing 'element PE0 etc.' as appropriate!) And control unit CU1. is doing.
  • “Type” indicates a separate control 'unit' or 'processing' element.
  • “Body I River”, “Execute task”, “Assign task”, “Request task execution”, etc. are shown.
  • the task identifier is assigned to “inverse quantization”, “64-bit high precision IDCT”, etc.
  • control unit CU1 When the control unit CU1 detects the connection of the processing 'element PE0 etc., the control unit CU1 inquires the processing' element PE0 etc. about the information of the processing 'element PE0 etc. Then, the processing 'element PE0 etc. information is acquired and a list for managing the processing element PE0 etc. connected to itself (control unit CU1) is created. This is called processing 'element connection table'.
  • the processing and element connection table shown in Fig. 10 describes information such as "connection start time”, “IP address”, “processor 'type”, “processing capability”, “memory”, and “task identifier”. ing.
  • the processing element connection table creation timing will be described later.
  • the task execution transition table shown in FIG. 11 is a list in which processing elements PE0 and the like that perform input and output, and IP addresses and task identifiers of processing 'element PE0 and the like that execute tasks are arranged in the order of execution. .
  • Control 'unit CU1 assigns tasks to processing' element PE0 etc. based on the task execution transition table.
  • the information described in each row of the above task execution transition table that is, the execution order, TID, input IP, execution IP, output IP, is executed. As a request, it is sent from the control unit CU1 to each processing element PE0.
  • the processing 'element that executes the first task in the execution order starts executing the task when it receives the task execution request.
  • Other processing elements are my own Wait until the execution of the processing element that executes the task immediately before.
  • the processing element that executes the task corresponding to the end of the service sends the task execution completion to the control unit CU1 when the execution of the task is completed.
  • the control 'unit CU1 After receiving the task execution completion, the control 'unit CU1 sends the service execution request processing' element PE0 that the execution of the service has been completed, and enters the request waiting state again.
  • the service task correspondence table is a table that lists the correspondence between services and tasks that constitute the service using identifiers.
  • Figure 12 shows an overview of the service task mapping table.
  • the control unit CU1 is serviced when the control unit CU1 is initialized.
  • SID service identifier
  • TID task identifier
  • FIG. 13 is a flowchart showing the processing procedure of the control unit CU1.
  • the control unit CU1 performs the following processes (1), (2), (3), and (4) according to the flow chart procedure shown in Fig. 13.
  • step S701 the control unit CU1 initializes the above-described processing element connection table, for example, when the power is turned on. In addition, the control unit CU1 initializes the task execution transition table.
  • step S702 the control unit CU1 obtains the service task correspondence table from the server managing the service task correspondence table.
  • step S703 the control unit 'CU1 is the processing' element PE The force at which a connection such as 0 is detected is determined.
  • step S704 the judgment result at step S703 is true (Yes)
  • step S704 it is determined whether or not the processing element PE0 or the like has been cut.
  • the determination result of step S704 is true (Yes)
  • the process proceeds to step S705.
  • the determination result in step S703 is true, the process proceeds to step S705.
  • step S705 the control unit CU1 confirms information on the connected processing element PE0, etc., in particular function information.
  • step S706 the processing 'element connection table is updated. Then go back to step S703
  • step S707 the control unit CU1 determines whether or not a service execution request has been received from the service execution request processing element PE0. When the judgment result at step S707 is true, the process advances to step S708.
  • step S708 the control unit CU1 searches the service task correspondence table.
  • step S709 it is determined whether or not the service execution request can be accepted. When the judgment result at step S709 is true, the process proceeds to step S710.
  • step S708 is not limited to searching for a service task correspondence table. For example, what is necessary is to know what tasks constitute a service.
  • the data structure is not necessarily a table. There may be no need to search the service task correspondence table. For example, it is a case where information on tasks constituting a service is also acquired (received) at the time of service request in advance.
  • step S710 the processing element PE0 or the like necessary for executing the JPEG decoding process is secured (locked).
  • step S711 a service request acceptance signal is transmitted to the service execution request processing 'element PE0.
  • step S712 the control unit CU1 creates the task execution transition table described above.
  • step S713 the control unit CU1 sends a task execution request to each processing element PE0 that executes the task. Note that it is only necessary that information regarding task execution transitions can be acquired in step S712. Therefore, the task execution transition table is not necessarily created. For example, when the task information that constitutes the service is acquired, the data structure is such that the execution order is also divided.
  • step S709 If the judgment result at step S709 is negative, the process proceeds to step S716. In step S716, since the control unit CU1 cannot accept the service, it sends a service acceptance rejection notice to the service execution request processing element PEO. Then, the process returns to step S703.
  • step S707 determines whether or not the power received from each processing element PE0 or the like that executes the task is completed. When the determination result at step S717 is true, the process proceeds to step S718.
  • step S718 the control unit CU1 releases (releases) the processing element PE0 etc. that executed the task.
  • step S719 the control unit CU1 transmits the completion of service execution to the service execution request processing element PE0. Then, the process returns to step S703.
  • step S720 the control unit CU1 determines whether or not an execution completion request is made, for example, the power turned off.
  • the processing 'element connection table' corresponds to the processing 'element connection information.
  • the task execution transition table corresponds to task execution transition information.
  • the service task correspondence table corresponds to the service task correspondence information.
  • the task execution transition table corresponds to task execution transition information.
  • the data structure when each processing element PE0 holds information may be any structure.
  • JPEG decoding processing in the processing model shown in FIG. 8 will be described in time series based on FIGS.
  • user U is on mobile device 300
  • JPEG image “image.jpg” is displayed.
  • JPEG decoding is distributed on the processing 'element' network, and the result is displayed on the mobile terminal 300.
  • Control unit CU1 knows that it is possible to execute all processes other than ⁇ inverse quantization '' and ⁇ IDCT '' on element PE0 by some means of processing installed in the mobile terminal.
  • the mobile terminal determines that JPEG file decoding processing is necessary. As a result, a service execution request for JPEG decoding processing is transmitted to control unit CU1.
  • control unit CU1 When the control unit CU1 receives the service execution request, it refers to the service-task correspondence table 802 based on the service identifier (ID) 801 representing the JPEG decoder. Then, the control unit CU1 obtains the tasks necessary for the service and the execution order 803 from the service identifier 801.
  • ID service identifier
  • the control unit CU1 obtains the tasks necessary for the service and the execution order 803 from the service identifier 801.
  • control unit “CU 1” refers to the processing “element (PE) connection table 901. Then, as shown in Fig. 15B, (4) using the processing element PE0 connected to the control unit CU1, it is determined whether the requested service can be executed.
  • PE processing element
  • Control unit CU1 secures (locks) the necessary processing element elements when it determines that the service can be executed. As a result, as many computing resources as the service can execute can be secured. Then, a service request acceptance signal is transmitted to the service execution request processing element PE0. As shown in FIG. 16, (6) the control unit CU1 creates a task execution transition table 1001 that describes the assignment and execution order of the processing elements PE0 etc. that execute each task.
  • Control unit CU1 sends task execution requests in order from the late execution order, from the processing element to early! /, In accordance with the task assignment in the task execution transition table.
  • the processing to input or output data 'the IP address of element PE0 etc. and the processing to be executed; if the IP address of element PE0 etc. is equal, processing' wait the task execution inside the element and the same processing. Tasks shall be executed continuously within the element.
  • control unit CU1 When the control unit CU1 receives the task execution completion, it releases the processing element resource that has been secured (locked). This returns to the state where other services are available. Then, the service execution completion is returned to the service execution request processing element PE0. (11) Control unit CU1 waits until it receives the next service execution request.
  • 21 is a flowchart illustrating the procedure of the distributed processing method according to the present embodiment.
  • step S1900 the control 'unit CU1 initializes the processing' element connection table described above.
  • the hierarchy represents a communication distance from the self-control 'unit to the other control' unit until information arrives.
  • the communication distance may be defined by an arbitrary index, but it is most commonly expressed by the time until the information arrives (response speed).
  • Classification can also be based on the power of classification based on response speed and the communication range, for example, the power in the subnetwork to which the user belongs when considering the subnetwork by the control unit.
  • Task assignment or service search is performed in order from the control unit with 0 hierarchy level to the control unit with higher hierarchy level. If there are multiple applicable conditions, assign the minimum number of hierarchies.
  • Control unit with response speed of 200 ms or less 3 units
  • the number of layers may be determined by a combination of these. In this case, for example, it is expressed as the sum of the number of hierarchies determined by the two categories. It is in the same sub-network, and the response speed is the fastest.
  • step S1901 the control unit CU1 obtains a service-task correspondence table from a server or the like that manages the service task correspondence table.
  • step S1902 the controller 'unit CU1 is processing' element P
  • step S 1902 Determine the force, power failure, etc., for which connection such as E0 is detected.
  • control 'unit CU1 confirms information, particularly function information, of connected processing' element PE0.
  • step S 1904 Update the 'things' element connection table.
  • the predetermined number of hierarchies can be freely set.
  • step S 1905 it is determined whether or not the processing element PE0 or the like has been cut.
  • step S1906 the control 'unit CU1 confirms information, particularly function information, of the disconnected processing' element PE0.
  • step S 1908 the control unit CU 1 determines whether a service execution request has been received from the service actual fi request processing “element PE 0 or the like. When the judgment result at step S 1908 is true, the process advances to step S 1909.
  • control unit CU1 searches the service-task correspondence table.
  • step S1910 it is determined whether the task search has timed out.
  • task search is to search for a processing 'element capable of task processing. First, it is determined whether or not task processing can be assigned to the processing 'element PE0 etc. connected to the own control' unit CU1 '. Self-control. Processing element connected to unit C U1 If task processing cannot be assigned to PE0, etc., search whether other processing 'processing capable of task processing' element is connected. Specifically, a task search request is sent to another control unit.
  • Timeout is a time limit for a certain process. For example, (1) execute Two types of timeouts can be set: timeout for the middle task, and (2) timeout for task search for other control units.
  • step S1910 When the judgment result at step S1910 is negative, the process advances to step S1911. In step S 1911, it is determined whether or not it is the power to search all the tasks constituting the service. If the half IJ disconnection result of step S1911 is true, the process proceeds to step S1912. In step S 1912, it is determined whether all tasks can be executed.
  • step S1912 If the half IJ disconnection result of step S1912 is true, the process proceeds to step S1913.
  • step S 1913 a service request acceptance signal is sent to the service request processing 'element.
  • step S 1914 the control unit CU1 creates the task execution transition table described above.
  • step S1915 control unit CU1 sends a task execution request. Then, the process returns to step S1902.
  • step S 1912 If the determination result at step S 1912 is negative, the process returns to step S 1910.
  • step S1923 determines whether or not an execution completion request, for example, a power supply is turned off.
  • step S 1923 When the judgment result is true, the execution processing of the control unit CU1 ends.
  • the judgment result at step S 1923 is negative, the process advances to step S1927.
  • step S1910 If the determination result of step S1910 is true, the process proceeds to step S1924. In step S1 924, since the control unit CU1 cannot accept the service, it sends a service acceptance rejection notice to the service request PE. Then, the process returns to step S 1902. [0120] As described above, when the determination result of step S1911 is false, the process proceeds to step S1916. In step S 1916, the control unit CU1 searches the processing element connection table described above.
  • step S1917 the control unit CU1 determines whether or not the task can be executed.
  • the judgment result at step S 1917 is negative, the process advances to step S1918.
  • step S1918 the control unit CU1 decreases (decrements) the number of search layers.
  • the “number of search hierarchies” is synonymous with the number of hierarchies determined by the communication distance described above, and is the total number of hierarchies required for task search.
  • the number of search layers is limited.
  • the search is set to end when the search hierarchy number reaches the upper limit. For example, if the number of layers from control unit CU1 to control unit CU2 and control unit Unit CU2 to control unit CU3 is 1, control unit unit CU1 ⁇ control unit unit CU2 to control unit The route “unit CU3” has 2 search layers.
  • step S1919 it is determined whether or not the number of search layers is 0. When the judgment result at step S 1919 is negative, the process advances to step S1922.
  • step S1922 a task search request is transmitted to the external control unit. Then, the process returns to step S 1910.
  • external means a control unit having a number of search hierarchies greater than a predetermined number of search hierarchies.
  • step S1925 for example, in the above example, the processing element PE 0 or the like necessary for executing the JPEG decoding process is secured (locked).
  • step S1926 control unit CU1 cannot accept the service. This is because when the upper limit of the search hierarchy number is 1, the search element (PE) connection table is searched and the upper limit of the search hierarchy number is reached. Therefore, a service acceptance refusal notification is sent to the service request PE. Then, the process returns to step S1902.
  • PE search element
  • step S1923 it is determined whether or not the task search request has been received. Refused.
  • step S1928 the control unit CU1 searches the processing 'element connection table.
  • step S1929 it is determined whether or not the task can be executed.
  • step S1930 for example, in the above example, JPE
  • step S1931 a response indicating that the task can be executed is transmitted to the request control unit. Then, the process returns to step S1902.
  • step S1929 When the determination result in step S1929 is false, the number of search layers is reduced (decremented) in step S1932. Then, the process proceeds to step S 1933.
  • step S1933 it is determined whether or not the number of search layers is 0.
  • step S 1933 it is determined whether or not the control unit that does not exist in the route history is connected.
  • step S1935 the control unit CU1 updates the route history.
  • update the route history for example, write the IP address of the own control unit!
  • step S1936 a task search request is transmitted to the control unit that has not been searched. Then, the process returns to step S1902.
  • step S1933 If the determination result in step S1933 is true, the search is interrupted because the upper limit of the number of search layers has been reached. If the determination result in step S1934 is false, it is determined that all CUs have been searched, and the search is interrupted. In either case, the process returns to step S 1902.
  • step S1939 the control unit CU1 determines whether or not task execution completion has been received.
  • the judgment result at step S 1939 is true, the process advances to step S 1940.
  • step S1940 control unit CU1 releases (releases) the processing element PE0 etc. that executed the task.
  • step S1941 the controller The Nole unit CU1 sends the service request PE that the service execution has been completed. Then, the process returns to step S1902.
  • step S 1939 If the judgment result at step S 1939 is negative, the process returns to step S 1902.
  • the processing element function realization method in the present invention can use hardware accelerator or software on a general-purpose processor.
  • a so-called reconfigurable processor that can dynamically reconfigure the hardware configuration may also be used.
  • path information in software and reconfigurable processors includes information that is downloaded dynamically during execution.
  • the processing system according to the present invention is particularly useful for a distributed processing system.

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Multi Processors (AREA)
  • Information Transfer Between Computers (AREA)
PCT/JP2007/070072 2006-10-16 2007-10-15 élément de traitement, unité de commande, système de traitement obtenu avec ceux-ci, et procédé de traitement de distribution Ceased WO2008047757A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US12/442,276 US20090249341A1 (en) 2006-10-16 2007-10-15 Processing element, control unit, processing system including processing element and control unit, and distributed processing method

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2006281236A JP2008097498A (ja) 2006-10-16 2006-10-16 プロセッシング・エレメント、コントロール・ユニット、及びこれらを備える処理システム、分散処理方法
JP2006-281236 2006-10-16

Publications (1)

Publication Number Publication Date
WO2008047757A1 true WO2008047757A1 (fr) 2008-04-24

Family

ID=39313984

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2007/070072 Ceased WO2008047757A1 (fr) 2006-10-16 2007-10-15 élément de traitement, unité de commande, système de traitement obtenu avec ceux-ci, et procédé de traitement de distribution

Country Status (4)

Country Link
US (1) US20090249341A1 (https=)
JP (1) JP2008097498A (https=)
CN (1) CN101517538A (https=)
WO (1) WO2008047757A1 (https=)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101847136A (zh) * 2009-03-24 2010-09-29 奥林巴斯株式会社 处理部件和分布式处理单元

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2010033555A (ja) * 2008-06-30 2010-02-12 Olympus Corp コントロール・ユニット、分散処理システム及び分散処理方法
KR102699111B1 (ko) 2010-04-13 2024-08-27 지이 비디오 컴프레션, 엘엘씨 이미지들의 멀티-트리 서브-디비젼을 이용한 비디오 코딩
JP5653865B2 (ja) * 2011-08-23 2015-01-14 日本電信電話株式会社 データ処理システム

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH10334055A (ja) * 1997-06-03 1998-12-18 Sony Corp マルチプロセッサ・システム
JPH1115799A (ja) * 1997-06-26 1999-01-22 Hitachi Ltd 並列処理システム
JP2002091843A (ja) * 2000-09-11 2002-03-29 Nippon Telegr & Teleph Corp <Ntt> サーバ選択装置、サーバ選択方法、及びサーバ選択プログラムを記録した記録媒体
JP2005275476A (ja) * 2004-03-22 2005-10-06 Fuji Xerox Co Ltd 管理装置、サービス処理装置、サービス処理システム、管理プログラム、及びサービス処理プログラム

Family Cites Families (37)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0353819B1 (en) * 1988-08-02 1997-04-09 Koninklijke Philips Electronics N.V. Method and apparatus for synchronizing parallel processors using a fuzzy barrier
US6112017A (en) * 1992-06-30 2000-08-29 Discovision Associates Pipeline processing machine having a plurality of reconfigurable processing stages interconnected by a two-wire interface bus
JPH07234842A (ja) * 1994-02-22 1995-09-05 Fujitsu Ltd 並列データ処理システム
US5970510A (en) * 1996-04-10 1999-10-19 Northrop Grumman Corporation Distributed memory addressing system
US5909368A (en) * 1996-04-12 1999-06-01 Fisher-Rosemount Systems, Inc. Process control system using a process control strategy distributed among multiple control elements
JP2882475B2 (ja) * 1996-07-12 1999-04-12 日本電気株式会社 スレッド実行方法
JPH10232875A (ja) * 1997-02-19 1998-09-02 Hitachi Ltd データベース管理方法および並列データベース管理システム
US6188381B1 (en) * 1997-09-08 2001-02-13 Sarnoff Corporation Modular parallel-pipelined vision system for real-time video processing
JP3636871B2 (ja) * 1997-09-16 2005-04-06 株式会社日立製作所 並列プロセッサシステム
US6088370A (en) * 1997-09-22 2000-07-11 Intel Corporation Fast 16 bit, split transaction I/O bus
US6581089B1 (en) * 1998-04-16 2003-06-17 Sony Corporation Parallel processing apparatus and method of the same
JP2000132529A (ja) * 1998-10-23 2000-05-12 Sony Corp 並列処理装置、並列処理方法および記録媒体
US6581102B1 (en) * 1999-05-27 2003-06-17 International Business Machines Corporation System and method for integrating arbitrary isochronous processing algorithms in general media processing systems
US20020107903A1 (en) * 2000-11-07 2002-08-08 Richter Roger K. Methods and systems for the order serialization of information in a network processing environment
US6671747B1 (en) * 2000-08-03 2003-12-30 Apple Computer, Inc. System, apparatus, method, and computer program for execution-order preserving uncached write combine operation
JP3783608B2 (ja) * 2001-10-31 2006-06-07 ソニー株式会社 通信方法、通信システム、データ処理装置、サーバ装置およびプログラム
US7418703B2 (en) * 2002-03-20 2008-08-26 Nec Corporation Parallel processing system by OS for single processor
JP2004102934A (ja) * 2002-09-12 2004-04-02 Dainippon Printing Co Ltd 自動処理汎用制御システム、ジョブ入力装置、自動処理汎用制御装置、自動処理汎用制御方法、プログラム、及び、記録媒体
US7571303B2 (en) * 2002-10-16 2009-08-04 Akya (Holdings) Limited Reconfigurable integrated circuit
US7330768B2 (en) * 2003-01-28 2008-02-12 Fisher-Rosemount Systems, Inc. Integrated configuration in a process plant having a process control system and a safety system
US7437726B2 (en) * 2003-04-23 2008-10-14 Micron Technology, Inc. Method for rounding values for a plurality of parallel processing elements
US7472392B2 (en) * 2003-04-23 2008-12-30 Micron Technology, Inc. Method for load balancing an n-dimensional array of parallel processing elements
US7437729B2 (en) * 2003-04-23 2008-10-14 Micron Technology, Inc. Method for load balancing a loop of parallel processing elements
US20050022173A1 (en) * 2003-05-30 2005-01-27 Codito Technologies Private Limited Method and system for allocation of special purpose computing resources in a multiprocessor system
US7603542B2 (en) * 2003-06-25 2009-10-13 Nec Corporation Reconfigurable electric computer, semiconductor integrated circuit and control method, program generation method, and program for creating a logic circuit from an application program
JP4062441B2 (ja) * 2003-07-18 2008-03-19 日本電気株式会社 並列処理システム及び並列処理プログラム
JP2005242994A (ja) * 2004-01-27 2005-09-08 Ricoh Co Ltd サービス提供装置、情報処理装置、サービス提供方法、情報処理方法、サービス提供プログラム、情報処理プログラム及び記録媒体
JP2005316957A (ja) * 2004-03-31 2005-11-10 Seiko Epson Corp 情報処理システム、第1の情報処理装置、第1の情報処理装置制御プログラム及び第1の情報処理装置制御方法
JP4296421B2 (ja) * 2004-06-09 2009-07-15 ソニー株式会社 信号処理装置
GB2417105B (en) * 2004-08-13 2008-04-09 Clearspeed Technology Plc Processor memory system
TWI251171B (en) * 2004-09-21 2006-03-11 Univ Tsinghua Task scheduling method with low power consumption and a SOC using the method
JP2006163482A (ja) * 2004-12-02 2006-06-22 Hitachi Ltd 情報処理装置の制御方法、情報処理装置、及びプログラム
JP2006236310A (ja) * 2005-01-28 2006-09-07 Dainippon Screen Mfg Co Ltd 制作管理装置、制作管理方法、プログラム、およびドキュメント制作システム
WO2006110952A1 (en) * 2005-04-19 2006-10-26 Fairlight.Au Pty Ltd Media processing system and method
US8510329B2 (en) * 2005-05-25 2013-08-13 Experian Marketing Solutions, Inc. Distributed and interactive database architecture for parallel and asynchronous data processing of complex data and for real-time query processing
US8600960B2 (en) * 2005-11-22 2013-12-03 Sap Ag Processing proposed changes to data
JP4871598B2 (ja) * 2006-01-19 2012-02-08 キヤノン株式会社 画像処理装置および画像処理装置の起動方法およびプログラム

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH10334055A (ja) * 1997-06-03 1998-12-18 Sony Corp マルチプロセッサ・システム
JPH1115799A (ja) * 1997-06-26 1999-01-22 Hitachi Ltd 並列処理システム
JP2002091843A (ja) * 2000-09-11 2002-03-29 Nippon Telegr & Teleph Corp <Ntt> サーバ選択装置、サーバ選択方法、及びサーバ選択プログラムを記録した記録媒体
JP2005275476A (ja) * 2004-03-22 2005-10-06 Fuji Xerox Co Ltd 管理装置、サービス処理装置、サービス処理システム、管理プログラム、及びサービス処理プログラム

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101847136A (zh) * 2009-03-24 2010-09-29 奥林巴斯株式会社 处理部件和分布式处理单元

Also Published As

Publication number Publication date
JP2008097498A (ja) 2008-04-24
US20090249341A1 (en) 2009-10-01
CN101517538A (zh) 2009-08-26

Similar Documents

Publication Publication Date Title
CN112055091B (zh) 车载微服务架构、车载模块的通信方法和装置
US8001283B2 (en) Efficient, scalable and high performance mechanism for handling IO requests
WO2019042110A1 (zh) 一种订阅发布方法及服务器
US7831734B2 (en) Method and system for remote configuration of network devices
EP1517486A2 (en) Metaspace: communication middleware for partially connected mobile ad hoc networks
US12430186B2 (en) Hardware accelerator service aggregation
CN112492060B (zh) 一种服务资源处理方法及系统、代理设备、请求设备
US20110138381A1 (en) System and method for requesting resources into a virtual machine using connection information
US20170264460A1 (en) On-premise and off-premise communication
CN111352716A (zh) 一种基于大数据的任务请求方法、装置、系统及存储介质
WO2008047757A1 (fr) élément de traitement, unité de commande, système de traitement obtenu avec ceux-ci, et procédé de traitement de distribution
CN108027739A (zh) 共享iot资源的异构分布式运行时代码
CN115168162B (zh) 容器环境基于ingress控制器多灰度发布方法、设备及存储介质
US9098354B2 (en) Management of application to I/O device communication requests between data processing systems
CN105453058A (zh) 目录服务发现和/或学习
US10630528B2 (en) Method and apparatus in a web service system
CN107077429A (zh) 数据读取方法、设备和系统
CN119341992B (zh) 基于dpu服务网格分布式限流方法、装置、设备及介质
US8521895B2 (en) Management of application to application communication requests between data processing systems
CN120416128A (zh) 流量路由方法、装置、计算机设备、可读存储介质和程序产品
US20120304201A1 (en) Management of Process-to-Process Communication Requests
US20140079067A1 (en) Information centric network (icn) node based on switch and network process using the node
CN113282341A (zh) 一种业务控制方法、装置、设备和介质
US20130227066A1 (en) Data transfer apparatus and data transfer method
CN116028202A (zh) 一种在soa架构下的车载中央计算机系统

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 200780035282.7

Country of ref document: CN

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 07829806

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 12442276

Country of ref document: US

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 07829806

Country of ref document: EP

Kind code of ref document: A1