Parallel processing system in which use efficiency of CPU is improved and parallel processing method for the same
Claim Score by NHIP
Abstract
A parallel processing system includes a network and a plurality of nodes which communicates asynchronously between the plurality of nodes through the network. Each of the plurality of nodes may include a plurality of CPUs and a communication control unit. Each of the plurality of CPUs as an issuing CPU generates and transmits an asynchronous communication request, retransmits the asynchronous communication request in response to a non-acceptance reply, and executes a subsequent process in response to an acceptance replay. The communication control unit determines whether the asynchronous communication request is acceptable, returns the acceptance reply to the issuing CPU when the asynchronous communication request is acceptable, and the non-acceptance reply to the issuing CPU when the asynchronous communication request is not acceptable, and executes the asynchronous communication request.

Term
Term ended
Projected expiry passed 21 September 2022, 4 years ago.
- Priority
- Filed
- Published
- Projected expiry
- Today
15 claims: 2 independent, 13 dependent
- 1Broadest claimClaim Score 61, broad(NHIP)A parallel processing system comprising:a network;and a plurality of nodes which communicates asynchronously between said plurality of nodes through said network, and wherein each of said plurality of nodes comprises: a plurality of CPUs, each of which as an issuing CPU generates and transmits an asynchronous communication request, retransmits said asynchronous communication request in response to an non-acceptance reply, and executes a subsequent process in response to an acceptance replay;and a communication control unit which determines whether said asynchronous communication request is acceptable, returns said acceptance reply to said issuing CPU when said asynchronous communication request is acceptable, and said non-acceptance reply to said issuing CPU when said asynchronous communication request is not acceptable, and executes said asynchronous communication request.
- 10A parallel processing method comprising a plurality of node, each of which comprises a plurality of CPUs and a communication control unit, said parallel processing method comprising the steps of:(a) issuing an asynchronous communication request from one of said plurality of CPUs as an issuing CPU;(b) setting said issuing CPU to a waiting state such that process change is prohibited, after the issuance;(c) determining, in said communication control unit, whether said asynchronous communication request is acceptable;(d) returning an acceptance reply from said communication control unit to said issuing CPU when said asynchronous communication request is acceptable;and (e) releasing said issuing CPU from said waiting state in response to said acceptance reply.
Independent claims2
50 paragraphs in 4 sections, as filed
BACKGROUND OF THE INVENTION
[0001] 1. Field of the Invention
[0002] The present invention relates to a parallel processing system and a parallel processing method. 2. Description of the Related Art
[0003] As a high speed operation computer system like a supercomputer, a high speed parallel computer system is known in which one job is divided into a plurality of processes (tasks), and a plurality of processors cooperate and execute the tasks in parallel. Thus, a limit of performance improvement of a single processor can be overcome. A conventional parallel computer system called a perfectly distributed memory parallel computer system is composed of nodes connected by a dedicated network. Each of the nodes is composed of processors or CPUs, a memory, and a communication control unit (CCU). Communication between nodes is carried out via the network. Also, in recent years, a distributed sharing memory type parallel computer system (cluster type parallel computer system) is known in which the overhead for the parallel processing is less such as the easiness of the programming and internode data transfer. In such a parallel computer system, the node is composed of SMP (Symmetric Multiple Processor) and a communication control unit, and a memory is shared by a plurality of processors in the range with appropriate implementing cost.
[0004] In these distributed memory type parallel computer systems, the internode communication processing time is large, compared with a calculation processing time in the node. Therefore, the internode communication processing time transfer and the calculation processing are overlapped in the CPU, and an asynchronous communication instruction is completed when a CPU issues the asynchronous communication instruction. Thus, the communication processing time is concealed and the subsequent process and interrupt process can be executed without waiting for the completion of the asynchronous communication instruction.
[0005] Conventionally, a coprocessor is provided separately from a CPU, and communication processing is requested from a user program to an operating system (OS) by a system call from the viewpoint of hardware resource control, as in input/output processing. Thus, the communication processing is executed asynchronously from the CPU. However, this system call requires large software overhead so that the performance improvement of the parallel processing system is hindered.
[0006] For this reason, the technique is often adopted in which an asynchronous transfer instruction can be issued directly from the user program. When only the OS controls the asynchronous communication instruction, it is possible to ask the OS to control the asynchronous communication instructions such that the hardware resources are not fully consumed. However, when the asynchronous transfer instructions is issued directly from the user program, a flow control of the asynchronous transfer instructions is necessary to protect the system from the system performance degradation due to the hardware resource control overhead.
[0007] Conventionally, as such a flow control, a hand-shaking system is known in which when the CCU receives an asynchronous communication request from the CPU, the CCU notifies the reception of the request to the CPU. When a hand-shaking reply is notified, the CPU interprets the hand-shaking reply as the completion of the asynchronous communication instruction and starts the issuance of a subsequent instruction and an interruption process.
[0008] In the hand-shaking system, as shown in FIGS. 8 and 9, when a request buffer of the CCU <b>101</b> is full, the CCU <b>101</b> does not return the hand-shaking reply to the CPU <b>102</b> until the entry is ensured in the request buffer (Steps S<b>102</b>, <b>103</b> and <b>104</b>). Since the asynchronous communication instruction does not complete, the CPU cannot release an interrupt prohibition state. Therefore, there is a problem that the use efficiency of the CPU is reduced remarkably. Especially, in the parallel computer system which several hundreds of nodes are connected via an interconnection network, it is expected that it takes a very long time until an entry is ensured in the request buffer depending on the communication state on the interconnection network.
[0009] In conjunction with the above description, a communication control apparatus is disclosed in Japanese Laid Open Patent application (JP-A-Heisei 2-64838). In this reference, a plurality of communication control apparatuses are connected to a host apparatus. The communication control apparatus is composed of a reception buffer receiving and temporarily storing data in accordance with an instruction from the host apparatus. A first section sets a reception buffer full notice flag when reception data are stored in the reception buffer more than a first predetermined quantity, and resets the reception buffer full notice flag when the reception data are stored in the reception buffer less than a first predetermined quantity which is less than the first predetermined quantity. A flag setting section checks the reception buffer full notice flag when transmitting a transmission frame in response to a transmission instruction from the host apparatus, sets a predetermined bit to “1” of a control section of the transmission frame when the flag is set, and to “0” when the flag is reset, and transmits the transmission frame. A second section receives the transmission frame, sets the reception buffer full notice flag when the predetermined bit of the control section is set to “1”, and resets the reception buffer full notice flag when the predetermined bit of the control section is set to “0”. A report section checks the reception buffer full notice flag when a transmission instruction is received from the host apparatus, do not receive transmission data from the host apparatus when the flag is set, and reports that the data are stored in the reception buffer more than the first predetermined quantity.
[0010] Also, a communication control system is disclosed in Japanese Laid Open Patent Application (JP-A-Heisei 4-18500). In this reference, the communication control system is composed of a plurality of communication units communicating with each other. The control unit is composed of a communication control section connected to a transmission path and a main control section communicating with the other communication units via the communication control unit. A first reception buffer is provided to store reception data to the main control section, and a second reception buffer is provided to store reception data to the communication control section. A common memory is provided for the main control section and the communication control section. The main control section sets a reception stop flag to the common memory when the first reception buffer is full. The communication control section stores the reception data in the second reception buffer depending on the reception stop flag. The communication control section transmits a transmission stop signal when the second reception buffer is full and sets a transmission stop signal transmission flag. The transmission control section sets a first transmission stop flag to the common memory when the transmission buffer is full. The main control section stops sending of the transmission data to the communication control section depending on the first transmission stop flag. The main control section resets the reception stop flag when the first reception buffer is not full, and sends an interrupt signal to the communication control section. The communication control section transfers the data from the second reception buffer to the first reception buffer in response to the interrupt signal. The communication control section transmits a transmission permission signal when the reception stop flag is reset and the transmission stop signal transmission flag is set. When a transmission stop signal is received from another unit, the communication control section is sets the second transmission stop flag and stops the transmission of the transmission data to the other unit. When the transmission permission signal is received from another unit, the communication control section resets the second transmission stop flag and restarts the transmission.
[0011] Also, a broadcast communication system is disclosed in Japanese Laid Open Patent application (JP-A-Heisei 5-327705). In this reference, data is transmitted from a host computer to a channel via at least two data buffers. A queue buffer (an area in which the host computer registers a communication processing request) is provided in the channel control module to control the nearest data buffer to a channel. For broadcasting of same data (broadcasting data) from the host computer to a plurality of terminals, in a CPU of the host computer are provided a section for detecting an empty state of the queue buffer, a section for stopping registration of a broadcasting data transmission instruction in the queue buffer when the queue buffer is full, a section for notifying a terminal to an application program, the registration of the broadcasting data transmission instruction for the terminal being stopped.
[0012] Also, a communication buffer control apparatus is disclosed in Japanese Laid Open Patent application (JP-A-Heisei 7-93170). In this reference, the communication buffer control apparatus is composed of a buffer remaining quantity table which stores an available remaining buffer quantity, and a task use buffer quantity table which stores a task use buffer quantity which is allocated to every task based on the remaining buffer quantity. When the remaining buffer quantity becomes smaller than a predetermined minimum value or a buffer quantity used by a task becomes larger than another upper limit value, the use of the above remaining buffer is stopped and it is notified to a requesting task. When the remaining buffer quantity becomes larger than a predetermined minimum value and the buffer quantity used by each task becomes smaller than the upper limit value, the use of the remaining buffer is restarted. Thus, fair communication service is given to a plurality of communications links which require processing at the same time. The reception is restarted after a temporal reception stop due to fullness of the buffer. Moreover, the detection of the buffer control fault due to a fault of a communication control system gets easy.
SUMMARY OF THE INVENTION
[0013] An object of the present invention is to provide a parallel processing system and a parallel processing method in which the use efficiency of a CPU can be improved.
[0014] In an aspect of the present invention, a parallel processing system includes a network and a plurality of nodes which communicates asynchronously between the plurality of nodes through the network. Each of the plurality of nodes may include a plurality of CPUs and a communication control unit. Each of the plurality of CPUs as an issuing CPU generates and transmits an asynchronous communication request, retransmits the asynchronous communication request in response to a non-acceptance reply, and executes a subsequent process in response to an acceptance replay. The communication control unit determines whether the asynchronous communication request is acceptable, returns the acceptance reply to the issuing CPU when the asynchronous communication request is acceptable, and the non-acceptance reply to the issuing CPU when the asynchronous communication request is not acceptable, and executes the asynchronous communication request.
[0015] Here, the communication control unit has a request buffer, and the communication control unit determines that the asynchronous communication request is acceptable, when the request buffer is not full, and determines that the asynchronous communication request is not acceptable, when the request buffer is full.
[0016] In this case, the communication control unit may store the asynchronous communication request in the request buffer when the asynchronous communication request is acceptable. Also, the communication control unit may discard the asynchronous communication request when the asynchronous communication request is not acceptable.
[0017] Also, the issuing CPU enters a waiting mode after transmitting the asynchronous communication request to the communication control unit, and the issuing CPU is in an interrupt prohibition state in the waiting mode.
[0018] Also, the issuing CPU may include an instruction issuing control section which generates and transmits the asynchronous transfer request to the communication control unit, and a reply receiving register which receives the acceptance replay or the non-acceptance replay from the communication control unit. In this case, the instruction issuing control section of the issuing CPU sets the issuing CPU to a waiting mode in which reception of an interrupt is prohibited, after transmitting the asynchronous communication request to the communication control unit. The reply receiving register releases the waiting mode when the acceptance replay is received from the communication control unit.
[0019] Also, the communication control unit may include a request control section and a communication executing section. The request control section determines whether the asynchronous communication request is acceptable, and returns the acceptance reply to the issuing CPU when the asynchronous communication request is acceptable, and the nonacceptance reply to the issuing CPU when the asynchronous communication request is not acceptable. The communication executing section receives the asynchronous communication request and executes the asynchronous communication request.
[0020] In this case, the request control section may include a request receiving section which receives the asynchronous transfer request from the issuing CPU; a determining section which determines whether the asynchronous transfer request is acceptable; and a request control section which has the request buffer, and stores the asynchronous transfer request in the request buffer when the asynchronous transfer request is determined to be acceptable by the determining section.
[0021] In another aspect of the present invention, a parallel processing method may include a plurality of node, each of which may include a plurality of CPUs and a communication control unit, the parallel processing method may be attained by (a) issuing an asynchronous communication request from one of the plurality of CPUs as an issuing CPU; by (b) setting the issuing CPU to a waiting state such that process change is prohibited, after the issuance; by (c) determining, in the communication control unit, whether the asynchronous communication request is acceptable; by (d) returning an acceptance reply from the communication control unit to the issuing CPU when the asynchronous communication request is acceptable; and by (e) releasing the issuing CPU from the waiting state in response to the acceptance reply.
[0022] Here, the parallel processing method may further include (f) executing a subsequent process in response to the acceptance replay.
[0023] Also, the parallel processing method may further includes (g) returning a non-acceptance reply from the communication control unit to the issuing CPU when the asynchronous communication request is not acceptable; and (h) reissuing the asynchronous communication request from the issuing CPU to the communication control unit in response to the non-acceptance reply.
[0024] Also, the parallel processing method may further include (i) executing the asynchronous communication request.
[0025] Also, the (c) determining step may be attained by determining that the asynchronous communication request is acceptable, when a request buffer in the communication control unit is not full; and by storing the asynchronous communication request in the request buffer when the request buffer is not full.
[0026] Also, the (c) determining step may be attained by determining that the asynchronous communication request is not acceptable, when a request buffer in the communication control unit is full; and by discarding the asynchronous communication request when a request buffer in the communication control unit is full.
BRIEF DESCRIPTION OF THE DRAWINGS
[0027]FIG. 1 is a sequence diagram showing an operation of a conventional parallel processing system;
[0028]FIG. 2 is an operation flow showing asynchronous communication in the conventional parallel processing system;
[0029]FIG. 3 is a circuit block diagram showing the structure of a parallel processing system according to an embodiment of the present invention;
[0030]FIG. 4 is a circuit block showing the structure of a CPU and a communication control unit in the parallel processing system according to the embodiment of the present invention;
[0031]FIG. 5 is a circuit block diagram showing the structure of the communication control unit in the parallel processing system according to the embodiment of the present invention;
[0032]FIG. 6 is a sequence diagram showing permission and prohibition of the asynchronous communication in the parallel processing system according to the embodiment of the present invention;
[0033]FIG. 7 is an operation flow diagram showing an operation of the parallel processing system according to the embodiment of the present invention;
[0034]FIGS. 8A and 8B are an acceptance replay and a non-acceptance replay, respectively; and
[0035]FIG. 9 is an operation flow diagram showing the parallel processing system according to the embodiment of the present invention.
DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0036] Hereinafter, a parallel processing system of the present invention will be described below in detail with reference to the attached drawings.
[0037]FIG. 3 is a block diagram showing the structure of the parallel processing system according to the embodiment of the present invention. The parallel processing system is composed of a plurality of nodes <b>1</b> connected to each other via a communication network. The node <b>1</b> is composed of one or more CPUs <b>3</b>, a main memory <b>4</b> shared by the CPUs <b>3</b> and a communication control unit (CCU) <b>5</b> for controlling communication between the nodes.
[0038]FIG. 4 shows a relation between an optional CPU <b>3</b> and the CCU <b>5</b> in the node <b>1</b>. The CPU <b>3</b> is composed of an instruction issuing control section <b>6</b> which decodes a usual operation instruction and an internode communication instruction and controls the issuance of the instruction, and a reply receiving register <b>7</b> which stores replies received from the CCU <b>5</b>. As the reply receiving register <b>7</b>, a general purpose register can be used. The CCU <b>5</b> is composed of a request control section <b>8</b> and an internode communication executing section <b>9</b> which executes internode communication. The request control section <b>8</b> receives an asynchronous communication request <b>11</b> from each CPU in the node. Then, the request control section <b>8</b> returns an acceptance reply or a nonacceptance reply <b>12</b> to the CPU <b>3</b> as the issuing source of the asynchronous communication request based on the state of the asynchronous communication request buffer <b>15</b>-<b>1</b> in the CCU <b>5</b> to indicate whether the request is accepted or non-accepted.
[0039]FIG. 5 shows the request control section <b>8</b> of the CCU <b>5</b> in detail. The request control section <b>8</b> is composed of an asynchronous communication request receiving section <b>13</b> to receive asynchronous communication requests <b>11</b> from the plurality of CPUs <b>3</b>-<b>0</b> to <b>3</b>-n, respectively, and a request acceptance determining section <b>14</b>, a request control section <b>15</b>, and a reply return section <b>16</b>.
[0040] The asynchronous communication request receiving section <b>13</b> has a function to receive the asynchronous communication request <b>11</b> from each CPU <b>3</b> in the node <b>1</b>, and a function to transmit the asynchronous communication request <b>11</b> to the request acceptance determining section <b>14</b>. When receiving the asynchronous communication requests <b>11</b> from the plurality of CPUs <b>3</b> at the same time, the asynchronous communication request receiving section <b>13</b> selects one of them in order and transmits to the request determining section <b>14</b>.
[0041] The request acceptance determining section <b>14</b> determines whether or not it is possible to receive the asynchronous communication request <b>11</b> transmitted from the asynchronous communication request receiving section <b>13</b>, based on request hold data of the request control section <b>15</b>. The request acceptance determining section <b>14</b> transmits an acceptance signal to the reply return section <b>16</b> to notify the acceptance, when determining that the asynchronous communication request <b>11</b> is acceptable. When determining that the asynchronous communication request <b>11</b> is not acceptable, the request acceptance determining section <b>14</b> transmits a non-acceptance signal to the reply return section <b>16</b> to notify the non-acceptance. Also, the request acceptance determining section <b>14</b> discards the asynchronous communication request <b>11</b>.
[0042] The request control section <b>15</b> receives the asynchronous communication request <b>11</b> determined to be acceptable by the request acceptance determining section <b>14</b> from the request acceptance determining section <b>14</b>. The request control section <b>15</b> has a function to hold the request in the asynchronous communication request buffer <b>15</b>-<b>1</b> of the request control section <b>15</b> until the request control section <b>15</b> receives a request transmission request <b>17</b> from the internode communication executing section <b>9</b>. Also, the request control section <b>15</b> has a function to notify that the request buffer <b>15</b>-<b>1</b> is full, to the request acceptance determining section <b>14</b> when the asynchronous communication request buffer <b>15</b>-<b>1</b> is full.
[0043] The request control section <b>15</b> takes out one of the asynchronous communication requests from the request buffer <b>15</b>-<b>1</b> in response to the request transmission request from the internode communication executing section <b>9</b> and outputs to the internode communication executing section <b>9</b>. The internode communication executing section <b>9</b> executes the taken out asynchronous communication request. For example, the internode communication executing section <b>9</b> reads out data specified by the asynchronous communication request from the main memory <b>4</b> and transmits the read out data to another node.
[0044] The reply return section <b>16</b> has a function to return the acceptance signal or the non-acceptance signal notified from the request acceptance determining section <b>14</b> to the issuing CPU <b>3</b> as an acceptance reply or a non-acceptance reply <b>12</b>.
[0045] As shown in FIG. 6, when issuing an asynchronous communication request <b>11</b> and sending out the asynchronous communication instruction to the CCU <b>5</b>, the instruction issuing control section <b>6</b> of the CPU <b>3</b> enters a completion waiting state of the asynchronous communication instruction until a reply is returned from the CCU <b>5</b> to the reply receiving register <b>7</b>. In this completion waiting state, it is necessary to restrain a process change on the CPU. Therefore, an interrupt prohibition state is set. The asynchronous communication request <b>11</b> sent out from the CPU is received by the asynchronous communication request receiving section <b>13</b> of the request control section <b>8</b> of the CCU <b>5</b>, as shown in the step S<b>1</b> of FIG. 7.
[0046] The asynchronous communication request receiving section <b>13</b> receives the asynchronous communication request <b>11</b> from each CPU in the node, and sends out them in order with the issuing CPU number to the request acceptance determining section <b>14</b>. The request acceptance determining section <b>14</b> sends the asynchronous communication requests sent from the asynchronous communication request receiving section <b>13</b> to the request control section <b>15</b>. The request acceptance determining section <b>14</b> determines whether or not the asynchronous communication request buffer <b>15</b>-<b>1</b> in the request control section <b>15</b> is full, based on request holding data. Thus, the request acceptance determining section <b>14</b> determines whether or not it is possible to accept the asynchronous communication request (Step S<b>2</b>). When the asynchronous communication request buffer <b>15</b>-<b>1</b> is not full, it is determined to be acceptable. The request acceptance determining section <b>14</b> notifies the issuing CPU number and the acceptance signal to the reply return section <b>16</b>. When the asynchronous communication request buffer <b>15</b>-<b>1</b> is full, it is determined as non-acceptance and the issuing CPU number and the non-acceptance signal are notified to the reply return section <b>16</b> and the asynchronous communication request <b>11</b> is discarded (Step S<b>3</b>).
[0047] The request control section <b>15</b> receives the asynchronous communication request <b>11</b> determined to be acceptable by the request acceptance determining section <b>14</b> from the request acceptance determining section <b>14</b> (Step S<b>5</b>). Then, the request control section <b>15</b> holds the request in the asynchronous communication request buffer <b>15</b>-<b>1</b> until the request control section <b>15</b> receives the request transmission request <b>17</b> from the internode communication executing section <b>9</b>. The request control section <b>14</b> notifies to the request acceptance determining section <b>14</b> that the buffer <b>15</b>-<b>1</b> is full, when the asynchronous communication request buffer <b>15</b>-<b>1</b> becomes full.
[0048] The reply return section <b>16</b> returns the reply <b>12</b> indicating the acceptance or non-acceptance notified from the request acceptance determining section <b>14</b> to the issuing CPU (Step S<b>4</b> or step S<b>6</b>). The reply <b>12</b> is returned to the issuing CPU is received by the reply receiving register <b>7</b>. The instruction issuing control section <b>6</b> interprets the replay as the asynchronous communication instruction completion as shown in FIG. 9 (Step S<b>11</b>). Thus, the completion waiting state is released. As the subsequent process, a software process to have issued an asynchronous communication instruction checks based on the returned value stored in the reply receiving register whether the replay is an acceptance reply or a non-acceptance reply (Step S<b>12</b>).
[0049]FIGS. 8A and 8B exemplifies the acceptance reply <b>21</b> and the non-acceptance reply <b>22</b>. When the returned value is the acceptance reply, the software process executes a subsequent program process (Step S<b>13</b>). In case of being the non-acceptance reply, the asynchronous communication instruction <b>11</b> is reissued (Step S<b>11</b>). As shown in FIG. 9, until the acceptance reply is returned, an asynchronous communication instruction sequence of the software process on the CPU is repeated. In this way, the problem of the hand-shaking system is solved that the flow control of the hand-shaking reply is not returned when the request buffer <b>15</b>-<b>1</b> in the request receiving end is full.
[0050] In the parallel processing system and the parallel processing method of the present invention, the problem of the hand-shaking system is solved that the flow control of the hand-shaking reply is not returned when the request buffer <b>15</b>-<b>1</b> in the request receiving end is full, and the use efficiency of the CPU is improved.
Contents4
9 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| US9292860B2 | Cited by | United States of America | Applicant |
| US8626834B2 | Cited by | United States of America | Applicant |
| US2008189254A1 | Cited by | United States of America | Pre-grant |
| US7890451B2 | Cited by | United States of America | Applicant |
| US2008183717A1 | Cited by | United States of America | Pre-grant |
| US8954580B2 | Cited by | United States of America | Applicant |
| US9900395B2 | Cited by | United States of America | Applicant |
| US8356097B2 | Cited by | United States of America | Applicant |
| US8099496B2 | Cited by | United States of America | Search report |
| US2008183870A1 | Cited by | United States of America | Pre-grant |
| US2011015982A1 | Cited by | United States of America | Pre-grant |
| US8095621B2 | Cited by | United States of America | Search report |
| US10360587B2 | Cited by | United States of America | Applicant |
| US10013702B2 | Cited by | United States of America | Applicant |
| US2008183867A1 | Cited by | United States of America | Pre-grant |
| US2008183868A1 | Cited by | United States of America | Pre-grant |
| US10296919B2 | Cited by | United States of America | Applicant |
| US8135833B2 | Cited by | United States of America | Applicant |
| US7797371B2 | Cited by | United States of America | Applicant |
| US7814139B2 | Cited by | United States of America | Applicant |
| US2008183869A1 | Cited by | United States of America | Pre-grant |
| US9123056B2 | Cited by | United States of America | Applicant |
| US9501781B2 | Cited by | United States of America | Applicant |
| US8055709B2 | Cited by | United States of America | Search report |
| US5907485A | Cites | United States of America | Pre-grant |
| US6347361B1 | Cites | United States of America | Pre-grant |
| US6546429B1 | Cites | United States of America | Pre-grant |
5 members in 3 offices
Priority claims4
| Document | Office | Kind | Date |
|---|---|---|---|
| 2000203173 | Japan | A | |
| 2000203173 | Japan | A | |
| 2000203173 | – | – | – |
| JP20000203173 | – | – | – |
Members5
| Document | Office | Kind | |
|---|---|---|---|
| EP1170670A2 | European Patent Office (EPO) | A2 | |
| US2002004868A1 | United States of America | A1 | |
| JP2002024195A | Japan | A | |
| US6810457B2 | United States of America | B2 | |
| EP1170670A3 | European Patent Office (EPO) | A3 |
35 transactions on the USPTO file
Allowed after 1 non-final rejection.
- Non-final rejections
- 1
- Final rejections
- 0
- RCEs
- 0
- Appeals
- 0
Over time
Point at a mark for the transactionTransactions
| Event | |
|---|---|
| Expire Patent | |
| Recordation of Patent Grant Mailed | |
| Patent Issue Date Used in PTA CalculationAllowed | |
| Issue Notification MailedAllowed | |
| Receipt into Pubs | |
| Dispatch to FDC | |
| Application Is Considered Ready for Issue | |
| Issue Fee Payment Verified | |
| Issue Fee Payment Received | |
| Receipt into Pubs | |
| Receipt into Pubs | |
| Workflow - File Sent to Contractor | |
| Receipt into Pubs | |
| Dispatch to Publications | |
| Mail Notice of AllowanceAllowed | |
| Notice of Allowance Data Verification CompletedAllowed | |
| Case Docketed to Examiner in GAU | |
| Date Forwarded to Examiner | |
| Response after Non-Final Action | |
| Request for Extension of Time - Granted | |
| Workflow incoming amendment IFW | |
| Mail Non-Final RejectionNon-final rejection | |
| Case Docketed to Examiner in GAU | |
| Non-Final RejectionNon-final rejection | |
| Case Docketed to Examiner in GAU | |
| Case Docketed to Examiner in GAU | |
| Case Docketed to Examiner in GAU | |
| Case Docketed to Examiner in GAU | |
| Application Dispatched from OIPE | |
| Correspondence Address Change | |
| IFW Scan & PACR Auto Security Review | |
| Information Disclosure Statement (IDS) Filed | |
| Information Disclosure Statement (IDS) Filed | |
| Request for Foreign Priority (Priority Papers May Be Included) | |
| Initial Exam Team nn |
7 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| Lapsed due to failure to pay maintenance feeLapsedFP | FP | |
| Information on status: patent discontinuationPATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362STCH | STCH | |
| Lapse for failure to pay maintenance feesLapsedLAPS | LAPS | |
| Maintenance fee reminder mailedREMI | REMI | |
| Fee paymentFPAY | FPAY | |
| Fee payment procedurePAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITYFEPP | FEPP | |
| AssignmentAS | AS |
Numbers
- Publication, DOCDB
- 2002004868
- Publication, EPODOC
- US2002004868
- Application
- 9897885
- Application, DOCDB
- 89788501
- Application, EPODOC
- US20010897885
Titles
- English
- Parallel processing system in which use efficiency of CPU is improved and parallel processing method for the same
Patent term adjustment
- A delay
- +469 daysthe office missed an examination deadline
- Applicant delay
- −26 days
- Net adjustment
- 443 days
Classification
- CPC, 1
- G06F15/17381
- IPC, 2
- G06F13 00
- G06F15 173
- USPC, 3
- 710240000
- 709210000
- 709237000