Electrical computers and digital processing systems: virtual mac – Task management or control – Process scheduling
Reexamination Certificate
2008-05-06
2008-05-06
Bullock, Jr., Lewis A. (Department: 2195)
Electrical computers and digital processing systems: virtual mac
Task management or control
Process scheduling
C718S102000, C709S224000
Reexamination Certificate
active
10257913
ABSTRACT:
When parallel processing is executed by parallel computers composed of a host computer and a plurality of processors connected to the host computer through a common bus, there is provided a method of assigning jobs to respective processors with high efficiency. A job in which a ratio between a communication time and a calculation time is larger than a predetermined value or larger than a fraction of processors and a job in which a ratio between a communication time and a calculation time is smaller than a predetermined value or smaller than a fraction of processors can be alternately assigned to respective processors. Alternatively, jobs are assigned to respective processors in such a manner that a plurality of processors and a plurality of jobs are divided into a plurality of groups in a one-to-one relation, jobs in which sizes comprising communication time and calculation time and ratios between the communication times and the calculation times approximate to each other may belong to different job groups and the order in which the jobs in which the sizes comprising the communication time and the calculation time and the ratios between the communication times and the calculation times approximate to each other are assigned within respective job groups may differ from each other among a plurality of job groups.
REFERENCES:
patent: 5381534 (1995-01-01), Shi
patent: 5587922 (1996-12-01), Hendrickson et al.
patent: 5692193 (1997-11-01), Jagannathan et al.
patent: 5845116 (1998-12-01), Saito et al.
patent: 5889989 (1999-03-01), Robertazzi et al.
patent: 5951634 (1999-09-01), Sitbon et al.
patent: 5987468 (1999-11-01), Singh et al.
patent: 6370560 (2002-04-01), Robertazzi et al.
patent: 6578064 (2003-06-01), Saito et al.
patent: A 5-324581 (1993-12-01), None
patent: A 6-35870 (1994-02-01), None
patent: A 6-243112 (1994-09-01), None
patent: A 7-295942 (1995-11-01), None
patent: A 8-185377 (1996-07-01), None
patent: A 2000-298658 (2000-10-01), None
patent: A 2000-305923 (2000-11-01), None
Takashima et al., “A Novel Algorithm for Large-Scale Fock Matrix Generation with Small Local Distributed Memory Parallel Architecture” Journal of Chemical Software, vol. 6 No. 3, pp. 85-103 (Apr. 10, 2003).
Nagashima et al., “Development of a Special Purpose Computer for Molecular Orbital Calculation: MOE—Integral Cutoff and Fock Matrix Generation by RT Parallelization,” 2000 nen Kinen Heiretsu Shori Symposium, JSPP2000 Ronbunshuu, p. 170 (Jun. 2000), document cited on International Search Report filed Dec. 11, 2002.
Ickikawa, Shuichi, “Mathematical Programming Approach for Static Load Balancing of Parallel PDE Solver,” Proc. of the 16th IASTED Int. Conference on Applied Informatics, pp. 112-114 (Feb. 1998), document cited on Int'l Srch. Rpt filed on Dec. 11, 2002.
Shirakawa et al., “The Architecture of a Molecular Orbital calculation Engine (MOE)”, Technical Report of IEICE, CPSY96-46 (May 1996), pp. 45-50. (w/abstract).
Inabata et al., “PPRAM-MOE: A Processing Node LSI of The Molecular Orbital Calculation Engine (MOE)”, Technical Report of IEICE, ICD98-21, CPSY98-21, FTS98-21 (Apr. 1998), pp. 77-84. (w/abstract).
Cypher, R., et al., “Architectural Requirements of Parallel Scientific Applications with Explicit Communication,” Computer Architecture News, ACM, vol. 21, No. 2, New York, US, May 1, 1993, pp. 2-13.
Gibbons, R., “A Historical Application Profiler for Use by Parallel Schedulers,” Proceedings of Workshop on Job Scheduling Strategies for Parallel Processing, Springer Verlag, Berlin, Germany, No. 3rdConf., Apr. 5, 1997, pp. 58-77.
Shirsat, R.N., et al., “Development of a Restricted Hartree-Fock program INDMOL on PARAM: a highly parallel computer,” Journal of Computational Chemistry USA, vol. 14, No. 4, Apr. 1993, pp. 445-451.
Muller, H.L., et al., “Multitasking and multithreading on a multiprocessor with virtual shared memory,” High-Performance Computer Architecture, 1996. Proceedings, Second International Symposium on San Jose, CA, USA Feb. 3-7, 1996, Los Alamitos, CA, USA IEEE Comput. Soc., U.S., Feb. 3, 1996, pp. 212-221.
Chasman, D., et al., “Parallel pseudospectral electronic structure: I. Hartree-Fock calculations,” Journal of Computational Chemistry Wiley USA, vol. 19, No. 9, Jul. 15, 1998, pp. 1017-1029.
Takashima, H., et al., “A novel parallel algorithm for large-scale Fock matrix construction with small locally distributed memory architectures: RT parallel algorithm,” Journal of Computational Chemistry Wiley USA, vol. 23, No. 14, Nov. 15, 2002, pp. 1337-1346.
Takashima, Hajime, et al., “A Novel Algorithm for Large-Scale Fock Matrix Generation with Small Local Distributed Memory Parallel Architecture.—Relation to the Integral Cutoff,” The Journal of Chemical Software, [Online] vol. 6, No. 3, Apr. 10, 2000.
Inabata Shinjiro
Kitamura Kunihiro
Miyakawa Nobuaki
Nagashima Unpei
Takashima Hajime
Bullock, Jr. Lewis A.
Honda Motor Co. Ltd.
Taisho Pharmaceutical Co. Ltd.
LandOfFree
Method for assigning job in parallel processing method and... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for assigning job in parallel processing method and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for assigning job in parallel processing method and... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3959867