Source: http://www.google.com/patents/US6665716?dq=6233389
Timestamp: 2017-07-23 19:25:14
Document Index: 463976963

Matched Legal Cases: ['art 115', 'art 115', 'art 103', 'art 103', 'art 180', 'art 103', 'art 180', 'art 103', 'art 103', 'art 103', 'art 103', 'art 180']

Patent US6665716 - Method of analyzing delay factor in job system - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inPatentsA delay factor in a processing in a job system in which an ordered series of jobs are executed in computers assigned to respective jobs, is efficiently detected, and the delay factor is analyzed in detail by associating it with load information of the computers and a network. An administrative manager...http://www.google.com/patents/US6665716?utm_source=gb-gplus-sharePatent US6665716 - Method of analyzing delay factor in job systemAdvanced Patent SearchTry the new Google Patents, with machine-classified Google Scholar results, and Japanese and South Korean patents.Publication numberUS6665716 B1Publication typeGrantApplication numberUS 09/386,439Publication dateDec 16, 2003Filing dateAug 31, 1999Priority dateDec 9, 1998Fee statusPaidAlso published asEP1008938A2, EP1008938A3, US20040093254Publication number09386439, 386439, US 6665716 B1, US 6665716B1, US-B1-6665716, US6665716 B1, US6665716B1InventorsToshiaki Hirata, Yasuo Takenaka, Eiji Matsumura, Shigeru Miyake, Satoshi Miyazaki, Akihiro UranoOriginal AssigneeHitachi, Ltd.Export CitationBiBTeX, EndNote, RefManPatent Citations (14), Referenced by (44), Classifications (20), Legal Events (4) External Links: USPTO, USPTO Assignment, EspacenetMethod of analyzing delay factor in job system
US 6665716 B1Abstract
A delay factor in a processing in a job system in which an ordered series of jobs are executed in computers assigned to respective jobs, is efficiently detected, and the delay factor is analyzed in detail by associating it with load information of the computers and a network. An administrative manager computer 201 collects a history of executing a job from each job executing computer 202, and refers to a history of each job, one by one from a job executed later to a job executed earlier, until no delay is detected in a job, for judging a cause of delay in each job. Further, with respect to a job in which delay is detected, load statuses of the other jobs or applications in the computer in which said job is in execution are compared with said job and displayed.
Accordingly, an object of the present invention is to effectively detect a causative location, in relation to loads of the computers, network traffic, and the jobs.
FIG. 1 is a block diagram showing a configuration of a job system relating to an embodiment of the present invention;
Namely, for each job net, there are defined “Operational Definition Identifier” for identifying the definition, “Job Net Name” for identifying a job net, “Starting Day of the Week/Starting Day” and “Start time” specifying a planned start of execution of the job net, and “Component Jobs Definition” defining execution sequence of jobs in the job net, those jobs constituting the job net. For example, “Component Jobs Definition” shown in FIG. 4A shows that the job net A consists of the jobs 1-5, the job 1 is executed, then, the jobs 2 and 3 are executed in parallel from the viewpoint of order, then, at the time of finishing both jobs 2 and 3, the job 4 is executed, and finally, the job 5 is executed. Also, it shows that the job net B consists of the jobs 1-3, and the jobs 1-3 are executed in turn.
Namely, for each job, there are defined “Job Name” for identifying the job, “Planned Start time”, i.e., planned start of executing the job, “Planned End Time”, i.e., planned end of executing the job, “Operational Definition Identifier” for identifying the definition, “Computer Name” specifying a job executing computer 202 for executing the job in question, and “Executable File Name” specifying an executable file for executing the job in question. In addition, for each job, there are defined “Port Number” specifying a communication port used for communication by the job in question when an executable file specified by “Executable File Name” is executed, and “Alternative Candidate Name” specifying a job executing computer 202 if that job executing computer 202, which is different from the job executing computer 202 specified by “Computer Name”, can serve as a job executing computer executing the job in question. Further, as “Operational Definition Identifier” among the definitions of a job, is used “Operational Definition Identifier” of the job net to which the job in question belongs, being added with a branch number, so that the definition of the job and the definition of the job net to which the job in question belongs can be easily associated with each other.
Out of the job executing computers 202, a job execution control part 115 of one specific job executing computer 202 performs control of execution of a job net in a centralized manner. The job execution control part 115 of that one specific job executing computer 202 holds the definition information shown in FIG. 4 as job definition information. However, “Operational Definition Identifier” of each job is held by a job executing computer 202 to which that job is assigned, in order to give notice of log information described below.
Each line indicates log information corresponding to a single event. In each piece of log information, “Event Log Identifier” stands for an identifier of an event log generated, “Computer Name” for a name of a job executing computer 202 that gave the log information, “Time” for a time when the event was generated, “Event Log Class” for a class of the event generated, “Operational Definition Identifier” for “Operational Definition Identifier” specified in the definition of FIG. 4 when the generated event is an event of a job or a job net, and “Detailed Information” for contents of the event. “Event Log Class” includes at least a start or end of a job. When “Event Log Class” is a start of a job, “Time” of that log information indicates a time when execution of the job indicated by “Operational Definition Identifier” of that log information is started in a computer assigned to that job in the definition of FIG. 4, i.e., a job executing computer 202 indicated by “Computer Name”. When “Event Log Class” is an end of a job, “Time” of that log information indicates a time when execution of the job indicated by “Operational Definition Identifier” of that log information is ended in a computer assigned to that job in the definition of FIG. 4, i.e., a job executing computer 202 indicated by “Computer Name”.
The performance information analysis part 103 monitors the log information of FIG. 7 stored in the database 104, and performs the procedures shown in FIGS. 10 and 11 when it detects an event, “a real end time of the job net is delayed from the planned end time for prescribed time or more”, for example.
As shown in FIG. 10, when the event “a real end time of the job net is delayed from the planned end time for prescribed time or more” is detected, the performance information analysis part 103 decides the last job of the job net in which the delay has been detected, from the definition of the job net in FIG. 4A, and sets that last job as a first job. Then, it stores the fact that the last job is set as the first job, into history information, and inspects this first job.
Then, in Step 805, when there exist a plurality of jobs G, the first job is stored into an array “Branch Point”, and the procedure goes to Step 806.
In Step 814, it is investigated if the array “Branch Point” stores a job, and when no job is stored, the process is ended. On the other hand, when the array “Branch Point” stores a job or jobs, a job that was stored last among the jobs stored in the array “Branch Point” is set as the first job, the procedure returns to Step 804, and the job that is set as the first job is deleted from the array “Branch Point”.
When the execution start time of the job 5 is delayed from the planned start time (Step 813), the job 4, which is just prior to the job 5, is set as the job G. Here, only job 4 is classified as the job G, and thus, it is not stored into the array “Branch Point” in Step 805. Further, since only job 4 is classified as the job G, this job 4 is set as the second job in Step 806, and it is examined if there is delay from the end of the job 4 till the start of the job 5 in Steps 807, 808, 810, and 812.
When the execution start time of the job 4 is delayed from its planned start time (step 813), the job 3 and the job 2, which are just prior to the job 4, are set as the jobs G. Here, as the jobs G, are classified a plurality of jobs, the job 3 and the job 2, and accordingly, the job 4 as the first job is stored into the array “Branch Point”. Next, assuming that, between the job 2 and job 3, both set as the jobs G, the job 2 is later in its execution end time, the job 2 is set as the second job in Step 806. It is stored that this job 2 is set as the second job in relation to the job 4 as the first job. Then, it is examined if there is delay from the end of the job 2 till the start of the job 4 in Steps 807, 808, 810, and 812.
When the execution start time of the job 2 is delayed from its planned time (Step 813), the job 1 is set as a job G. Here, only job 1 is set as the job G, and accordingly, storing into the array “Branch Point” is not performed in Step 805. Next, the job 1, only which has been set as the job G, is set as the second job in Step 806, and it is examined if there is delay from the end of the job 1 till the start of the job 2 in Steps 807, 808, 810, and 812.
Thus, when the execution start time of the job 1 is delayed from its planned start time (Step 813), jobs G are inspected. Here, since there is no job G, it is investigated if a job is stored in the array “Branch Point”. Here, the job 4 is stored. This job 4 is the job stored last, and accordingly, this job 4 is set as the first job, and the job 4 is deleted from the array “Branch Point”.
This job 4 is set as the first job, and it is investigated if there is a job G just prior to the job 4. Among the jobs just prior to the job 4, only job 3 is a job that has not been set as the second job in relation to the job 4 as the first job. Accordingly, here, storing into the array “Branch Point” is not performed in Step 805. Further, the job 3, only which is set as the job G, is set as the second job in Step 806. Here, since the job 3 is not the job that is latest in its execution end time among the jobs just prior to the first job, it is not examined if there is delay from the end of the job 3 till the start of the job 4 in Steps 807, 808, 810, and 812.
When the execution start time of the job 3 is delayed from the planned start time (Step 813), the job 1, which has not been set as the second job in relation to the job 3, is set as a job G. Here, only job 1 is set as the job G, storing into the array “Branch Point” is not performed in Step 805. Next, the job 1, only which has been set as the job G, is set as the second job in Step 806, and it is examined if there is delay from the end of the job 1 till the start of the job 3 in Steps 807, 808, 810, and 812.
Next, since the job 1 as the second job has already been set as the first job and examined (Step 850), it is investigated, in Step 814, if a job is stored in the array “Branch Point”. Since no job is stored, all process is ended.
In the above description, if, for example, the execution start time of the job 4 is not delayed from its planned start time, then, after performing the above-described (1-2)-(2-1), it is investigated, in Step 814, if a job is stored in the array “Branch Point”. Since no job is stored in this case, all process is ended.
Further, when, in the above description, n is 1 in Step 804 for example, then, in the above (2-2), only the job 2 having the latest execution end time is set as the job G. Accordingly, in Step 805, the job 4 as the first job is not stored into the array “Branch Point”. Accordingly, after performing the above (1-1)-(4-1), it is detected in (4-2) that no job is stored in the array “Branch Point”, and the process is ended. Thus, in this example, since delay of the execution start time of the job 4 depends in greater degree on the job having later execution end time between the job 3 and job 2, only the execution sequence leading to the job 4 via the job 2 is examined, without investigating the execution sequence leading to the job 4 via the job 3.
FIG. 17 shows the computer information displayed in Step 1603 of FIG. 16. In the figure, under “Computer Name”, is shown the name of the job executing computer 202 highlighted in the display screen shown in FIG. 13 as the delay source. “Display Class” indicates if the displayed contents are CPU load or memory utilization factor. An operator can select a display class setting button 1701 via the input part 180, to set the display class to either CPU load or memory utilization factor. Under “Executable File Name” is shown a list of the names of the executable files specified in the above-described Steps 1601, 1602. Under “Job Net/Job Names”, are shown names of job net/job, if there are such names corresponding to each executable file shown in the column of “Executable File Name”.
Under “Maximum Load”, are shown the maximum CPU loads due to the respective executable files shown in the column of “Executable File Name”, and under “Average Load”, the average CPU loads due to those respective executable files are shown. These columns “Maximum Load” and “Average Load” are changed to “Maximum Utilization Factor” and “Average Utilization Factor”, when “Display Class” is set to the memory utilization factor. Under “Maximum Utilization Factor”, are shown the maximum memory utilization factors due to respective executable files shown in the column of “Executable File Name”, and under “Average Utilization Factor”, the average memory utilization factors due to those respective executable files.
Further, under “Graph”, is displayed a graph showing changes of a CPU load for each of the executable files specified in the above Steps 1601, 1602, with CPU loads being shown by the ordinate and times by the abscissa. When the “Display Class” is the memory utilization factor, changes of a memory utilization factor for each of the executable files specified in the above Steps 1601, 1602 are shown in a graph, with the ordinate showing memory utilization factors and the abscissa showing times.
It is preferable that the names of the executable files listed under “Executable File Name” are displayed being arranged in descending order of value shown under “Average Load” when “Display Class” is the CPU load, and in descending order of value shown under “Average Utilization Factor” when “Display Class” is the memory utilization factor.
FIG. 20 shows the list of logical channels displayed in Step 2102 of FIG. 19. In this figure, under “Job Net/Job Names”, are shown the name of the job which was highlighted as the delay source in the display screen shown in FIG. 13 and the name of the job nets including that job. Under “Logical Channel Name”, are shown combinations of each two communication port numbers terminating a logical channel. Under “Source Destination”, are shown combinations of each two names of computers indicating a part (a communication medium (communication line or LAN) between two computers) of the network, to which is set a logical channel specified by two communication port numbers displayed under “Logical Channel Name”. Further, under “Network Name”, are shown names of lines or segments of LAN, each line or segment connecting two computers specified under “Source—Destination”. The administrative manager computer 201 stores a table describing correspondence of a communication port number with a job executing computer 202 and jobs to which that communication port number is assigned, into the database 104. The performance information analysis part 103 of the administrative manager computer 201 can use this table to specify to which part of the network, and to which part of a running process associated with a job, each logical channel corresponds.
Next, when an operator selects any one logical channel (or, source—destination, or network name) in the display screen shown in FIG. 20 via the input part 180, the performance information analysis part 103 of the administrative manager computer 201 obtains information indicating traffic of the selected logical channel (or, logical channel corresponding to the selected source—destination or network name) in a period of executing the job highlighted as the delay source in the display screen shown in FIG. 13, from the network information stored in the database 104 (Step 2103). Further, the performance information analysis part 103 searches the network information stored in the database 104, to investigate if other logical channels are set at the network part (communication medium between two computers) at which the selected logical channel is set. In the case that other logical channels are set, it obtains information indicating traffic of those other logical channels in the period of executing the job highlighted in the display screen shown in FIG. 13 as the delay source (Step 2104). As described above, the administrative manager computer 201 stores the table describing correspondence of a communication port number with a job executing computer 202 and jobs to which that communication port number is assigned, into the database 104. Accordingly, the performance information analysis part 103 of the administrative manager computer 201 uses this table to specify to which part of the network, each logical channel corresponds to. In that case, when, with respect to each of the obtained other logical channels, either of two communication port numbers specifying the logical channel in question is set as one used by a job in the definitions shown in FIG. 4, the performance information analysis part 103 of the administrative manager computer 201 associates the name of that job and the name of the job net including that job with the logical channel in question.
FIG. 21 shows the network information displayed in Step 2105 of FIG. 19. In the figure, “Network Name” shows a name specifying a network part at which the logical channel selected in the display screen shown in FIG. 20 is set. “Display Class” indicates if the displayed contents are the number of packets or the number of bytes per unit time. An operator can select a display class setting button 2201 via the input part 180, to set the display class to either the number of packets per unit time or the number of bytes per unit time. Under the “Logical Channel Name”, are shown, in a list, names of the logical channel selected in the above Step 2103 and of the other logical channels specified in the above Step 2104. Under “Job Net/Job Names”, are shown names of job net/job, if there are such names corresponding to each logical channel displayed in the column of “Logical Channel Name”.
Under “Average Packet Number”, are shown the average numbers of packets per unit time in the respective corresponding logical channels shown in the column of “Logical Channel Name”, and under “Maximum Packet Number”, the maximum numbers of packets per unit time in those respective logical channels. These columns “Average Packet Number” and “Maximum Packet Number” are changed to “Average Byte Number” and “Maximum Byte Number” when “Display Class” is the number of bytes per unit time. Under “Average Byte Number”, are shown the average numbers of bytes per unit time in the respective corresponding logical channels shown in the column of “Logical Channel Name”, and under “Maximum Byte Number”, are shown the maximum numbers of bytes per unit time in those respective logical channels.
Further, under “Graph”, is displayed a graph showing changes of the number of packets per unit time in the logical channel selected in the above Step 2103 and in the other logical channels specified in the above Step 2104, with numbers of packets per each time unit shown by the ordinate and times by the abscissa. When the “Display Class” is the number of bytes per unit time, changes of the number of bytes per unit time in the logical channel selected in the above Step 2103 and in the other logical channels specified in the above Step 2104 are shown in a graph, with the ordinate showing numbers of bytes per unit time and the abscissa showing times.
It is preferable that the names of the logical channels listed under “Logical Channel Name” are displayed being arranged in descending order of value shown under “Average Packet Number” when “Display Class” is the number of packets, and in descending order of value shown under “Average Byte Number” when “Display Class” is the number of bytes.
In the flow shown in FIG. 19, when the job highlighted as the delay source is selected in the display screen shown in FIG. 13, the logical channels used by that job, the source—destination of those logical channels, and the names of the network parts at which those logical channels are set are displayed in a list as shown in FIG. 20. When one logical channel is selected in this list display screen, the network information as shown in FIG. 21 is displayed with respect to the network part at which the selected logical channel is set. However, it is possible that, when the job highlighted as the delay source in the display screen shown in FIG. 13 is selected, the network information as shown in FIG. 21 is directly displayed with respect to network parts at which logical channels used by that job are set respectively. For that purpose, the following design, for example, will be sufficient. Namely, when an operator uses a cursor to point to the column of the network name shown in FIG. 21, there is displayed a list of the network names indicating the network parts at which the logical channels used by the job selected in the display screen shown in FIG. 13 are set, respectively. Then, the operator designates a network name in the list using the cursor, so that the network information relating to that network name is displayed.
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS5353422 *Oct 1, 1990Oct 4, 1994Hitachi, Ltd.Method and system for storing and managing a plurality of information media used by recording/reproducing unitsUS5442730 *Oct 8, 1993Aug 15, 1995International Business Machines CorporationAdaptive job scheduling using neural network priority functionsUS5465354 *Mar 15, 1993Nov 7, 1995Hitachi, Ltd.Method and apparatus for job execution prediction and control and method for job execution situation displayUS6041425 *Sep 2, 1997Mar 21, 2000Hitachi, Ltd.Error recovery method and apparatus in a computer systemUS6076174 *Feb 19, 1998Jun 13, 2000United States Of AmericaScheduling framework for a heterogeneous computer networkUS6170010 *Nov 9, 1998Jan 2, 2001Hitachi, Ltd.Computer operation management systemUS6219701 *Oct 27, 1998Apr 17, 2001Hitachi, Ltd.Method for controlling managing computer, medium for storing control program, and managing computerUS6263359 *May 22, 1997Jul 17, 2001International Business Machines CorporationComputer resource proportional utilization and response time schedulingUS6289368 *Dec 24, 1996Sep 11, 2001First Data CorporationMethod and apparatus for indicating the status of one or more computer processesUS6345351 *Nov 12, 1999Feb 5, 2002Telefonaktiebolaget Lm Ericsson(Publ)Maintenance of speculative state of parallel executed jobs in an information processing systemJPH1011406A Title not availableJPH08137810A Title not availableJPH09311795A Title not availableJPH10161987A Title not available* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS6823346 *Apr 30, 2003Nov 23, 2004International Business Machines CorporationCollaborative workload management responsive to a late running work unitUS6986139 *Oct 6, 2000Jan 10, 2006Nec CorporationLoad balancing method and system based on estimated elongation ratesUS7016063 *Dec 14, 2000Mar 21, 2006Minolta Co., Ltd.Printing apparatus, printing system, and print job controlling method and program productUS7020797 *Apr 25, 2002Mar 28, 2006Optimyz Software, Inc.Automated software testing management systemUS7127456 *Dec 5, 2002Oct 24, 2006Ncr Corp.System and method for logging database queriesUS7162516 *Mar 19, 2002Jan 9, 2007Minolta Co., Ltd.Information processing apparatus, information distribution apparatus, information processing system, network monitoring apparatus and network monitoring programUS7197700Aug 26, 2003Mar 27, 2007Hitachi, Ltd.Method and system for job managementUS7260596 *Sep 7, 2000Aug 21, 2007Sony United Kingdom LimitedDistributed service providerUS7302478 *Mar 2, 2001Nov 27, 2007Hewlett-Packard Development Company, L.P.System for self-monitoring of SNMP data collection processUS7350100 *May 5, 2004Mar 25, 2008Hitachi, Ltd.Method and apparatus for monitoring data-processing systemUS7454752 *Mar 26, 2004Nov 18, 2008Hitachi, Ltd.Method for generating policy rules and method for controlling jobs using the policy rulesUS7500241 *Oct 10, 2003Mar 3, 2009Avaya Inc.Method and apparatus for scheduling tasksUS7552212Oct 22, 2004Jun 23, 2009International Business Machines CorporationIntelligent performance monitoring based on user transactionsUS8095649 *Apr 1, 2008Jan 10, 2012Opnet Technologies, Inc.Network delay analysis including parallel delay effectsUS8250205Feb 7, 2008Aug 21, 2012Hitachi, Ltd.Business process management system, method thereof, process management computer and program thereofUS8250400Mar 10, 2008Aug 21, 2012Hitachi, Ltd.Method and apparatus for monitoring data-processing systemUS8255422 *May 28, 2004Aug 28, 2012Microsoft CorporationHighly reliable and scalable architecture for data centersUS8266622 *Dec 8, 2008Sep 11, 2012International Business Machines CorporationDynamic critical path update facilityUS8521783Aug 23, 2012Aug 27, 2013Microsoft CorporationHighly reliable and scalable architecture for data centersUS8544005 *Oct 28, 2003Sep 24, 2013International Business Machines CorporationAutonomic method, system and program product for managing processesUS8612991Nov 24, 2008Dec 17, 2013International Business Machines CorporationDynamic critical-path recalculation facilityUS8825833Mar 30, 2005Sep 2, 2014International Business Machines CorporationTracking computer system configuration changes with corresponding message responsesUS8954968 *Aug 3, 2011Feb 10, 2015Juniper Networks, Inc.Measuring by the kernel the amount of time a monitored thread spends in a queue in order to monitor scheduler delays in a computing deviceUS9032406 *Jul 1, 2010May 12, 2015Sap SeCooperative batch scheduling in multitenancy system based on estimated execution time and generating a load distribution chartUS20020051171 *Dec 14, 2000May 2, 2002Kenro HamaPrinting apparatus, printing system, and print job controlling method and program productUS20020124078 *Mar 2, 2001Sep 5, 2002Jeff ConradSystem for self-monitoring of SNMP data collection processUS20020138597 *Mar 19, 2002Sep 26, 2002Hideyuki HashimotoInformation processing apparatus, information distribution apparatus, information processing system, network monitoring apparatus and network monitoring programUS20030051188 *Apr 25, 2002Mar 13, 2003Narendra PatilAutomated software testing management systemUS20030208470 *Apr 30, 2003Nov 6, 2003International Business Machines CorporationCollaborative workload management responsive to a late running work unitUS20040172634 *Aug 26, 2003Sep 2, 2004Hitachi, Ltd.Method and system for job managementUS20040194107 *Mar 26, 2004Sep 30, 2004Yoshimasa MasuokaMethod for generating policy rules and method for controlling jobs using the policy rulesUS20050022190 *May 5, 2004Jan 27, 2005Hidekazu TachiharaMethod and apparatus for monitoring data-processing systemUS20050091654 *Oct 28, 2003Apr 28, 2005International Business Machines CorporationAutonomic method, system and program product for managing processesUS20050278415 *May 28, 2004Dec 15, 2005Microsoft CorporationHighly reliable and scalable architecture for data centersUS20060059489 *Sep 16, 2005Mar 16, 2006Nec CorporationParallel processing system, interconnection network, node and network control method, and program thereforUS20060107255 *Oct 22, 2004May 18, 2006International Business Machines CorporationIntelligent performance monitoring based on user transactionsUS20060253553 *Mar 30, 2005Nov 9, 2006International Business Machines CorporationMethod, system and program product for tracking computer system configuration changes with corresponding message responsesUS20080168442 *Mar 10, 2008Jul 10, 2008Hidekazu TachiharaMethod and apparatus for monitoring data-processing systemUS20080281961 *Apr 1, 2008Nov 13, 2008Steven NiemczykNetwork delay analysis including parallel delay effectsUS20090031321 *Feb 7, 2008Jan 29, 2009Hitachi, Ltd.Business process management system, method thereof, process management computer and program thereofUS20090158287 *Dec 8, 2008Jun 18, 2009International Business Machines CorporationDynamic critical path update facilityUS20090158294 *Nov 24, 2008Jun 18, 2009International Business Machines CorporationDynamic critical-path recalculation facilityUS20120005597 *Jul 1, 2010Jan 5, 2012Peter EberleinCooperative batch scheduling in multitenancy systemsUS20120117576 *Nov 4, 2011May 10, 2012Sony CorporationMethod and apparatus for obtaining feedback from a device* Cited by examinerClassifications U.S. Classification709/224, 714/E11.204, 714/E11.192, 709/223, 714/37, 718/103, 718/101, 709/225, 711/170, 711/203, 714/47.2International ClassificationG06F15/177, G06F11/34Cooperative ClassificationG06F11/3409, G06F11/3419, G06F11/3476, G06F2201/86, G06F11/3452European ClassificationG06F11/34T4, G06F11/34CLegal EventsDateCodeEventDescriptionAug 31, 1999ASAssignmentOwner name: HITACHI, LTD., JAPANFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:HIRATA, TOSHIAKI;TAKENAKA, YASUO;MATSUMURA, EIJI;AND OTHERS;REEL/FRAME:010218/0298Effective date: 19990823May 23, 2007FPAYFee paymentYear of fee payment: 4May 18, 2011FPAYFee paymentYear of fee payment: 8Jun 3, 2015FPAYFee paymentYear of fee payment: 12RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services