Source: http://www.google.ca/patents/US9189278
Timestamp: 2017-11-24 20:39:52
Document Index: 270116373

Matched Legal Cases: ['Application No. 2', 'Application No. 2', 'Application No. 2', 'Application No. 2', 'Application No. 08', 'Application No. 10', 'Application No. 10', 'Application No. 10', 'Application No. 05', 'Application No. 05', 'Application No. 07', 'Application No. 05', 'Application No. 05', 'Application No. 05', 'Application No. 05', 'Application No. 05', 'Application No. 05', 'Application No. 05', 'Application No. 05', 'Application No. 2005', 'Application No. 2007', 'Application No. 10', 'Application No. 10', 'Application No. 2003', 'Application No. 2005', 'Application No. 2005', 'Application No. 2005', 'Application No. 2005', 'Application No. 2005', 'Application No. 10', 'Application No. 10']

Patent US9189278 - System and method for topology-aware job scheduling and backfilling in an ... - Google Patents
A method for job management in an HPC environment includes determining an unallocated subset from a plurality of HPC nodes, with each of the unallocated HPC nodes comprising an integrated fabric. An HPC job is selected from a job queue and executed using at least a portion of the unallocated subset of...http://www.google.ca/patents/US9189278?utm_source=gb-gplus-sharePatent US9189278 - System and method for topology-aware job scheduling and backfilling in an HPC environment
Publication number US9189278 B2
Application number US 14/052,127
Also published as CA2503777A1, CA2503777C, CN1770109A, CN100562852C, EP1582981A1, US8336040, US8910175, US8984525, US9189275, US9594600, US20050235286, US20130104138, US20130304895, US20130311998, US20140040912, US20140047092, US20140047449, US20160132361, US20170177418, WO2005106663A1, WO2005106663A8
Publication number 052127, 14052127, US 9189278 B2, US 9189278B2, US-B2-9189278, US9189278 B2, US9189278B2
Inventors Shannon V. Davidson, Anthony N. Richoux
Patent Citations (213), Non-Patent Citations (200), Referenced by (1), Classifications (18), Legal Events (2)
US 9189278 B2
determining, using one or more computers, a failure of a node included in a virtual cluster of a plurality of communicatively coupled nodes of a computing environment, the virtual cluster comprising a logical grouping of nodes configured to process a job having a plurality of tasks;
removing the failed node from the virtual cluster;
determining whether the job is associated with the failed node;
responsive to a determination that the job is associated with the failed node, determining other operational nodes in the virtual cluster associated with the job;
terminating the plurality of tasks of the job on each of the other operational nodes in the virtual cluster currently executing the plurality of tasks of the job;
deallocating the other operational nodes associated with the job;
determining an optimum subset of nodes other than the deallocated nodes and the failed node from the virtual cluster to re-execute the job, wherein the optimum subset of nodes is determined according to a specific topology that allows cooperating tasks of the job to communicate with any other tasks by minimizing distance between any two nodes;
allocating the optimum subset of nodes; and
re-executing the job on the optimum subset of nodes.
2. The method of claim 1, wherein determining the optimum subset of nodes further comprises:
retrieving one or more administrative policies for the job, the one or more policies storing processing and management information including one or more of: problem size, problem run time, timeslots, and users' allocation of nodes or virtual clusters; and
selecting the subset of nodes based on the retrieved administrative policies and parameters of the job.
3. The method of claim 2, wherein the determined optimum subset of nodes is a completely different subset of nodes than an original subset of nodes initially selected to execute the job.
4. The method of claim 1, wherein the plurality of communicatively coupled nodes included in the computing environment is arranged in a three dimensional node structure.
5. The method of claim 1, wherein each node comprises at least two first processors operable to communicate with each other, and a first switch, the first processors communicably coupled to the first switch, the first switch operable to communicably couple the first processors to at least six second nodes.
6. The method of claim 1, wherein determining the failure of the node comprises one of: determining that a repeating communication has not been received from the failed node; and polling of the failed node.
a management node, comprising at least one processing device, configured to:
determine a failure of a node included in a virtual cluster of the plurality of communicatively coupled nodes of the computing environment, the virtual cluster comprising a logical grouping of nodes configured to process a job having a plurality of tasks;
remove the failed node from the virtual cluster;
determine whether the job is associated with the failed node;
responsive to a determination that the job is associated with the failed node, determine other operational nodes in the virtual cluster associated with the job;
terminate the plurality of tasks of the job on each of the other operational nodes in the virtual cluster currently executing the plurality of tasks of the job;
deallocate the other operational nodes associated with the job;
determine an optimum subset of nodes other than the deallocated nodes and the failed node from the virtual cluster to re-execute the job, wherein the optimum subset of nodes is determined according to a specific topology that allows cooperating tasks of the job to communicate with any other tasks by minimizing distance between any two nodes;
allocate the optimum subset of nodes; and
re-execute the job on the optimum subset of nodes.
8. The system of claim 7, wherein the management node is further configured to:
retrieve one or more administrative policies for the job, the one or more policies storing processing and management information including one or more of: problem size, problem run time, timeslots, and users' allocation of nodes or virtual clusters; and
select the subset of nodes based on the retrieved administrative policies and parameters of the job.
9. The system of claim 8, wherein the determined optimum subset of nodes is a completely different subset of nodes than an original subset of nodes initially selected to execute the job.
10. The system of claim 7, wherein the plurality of communicatively coupled nodes included in the computing environment is arranged in a three dimensional node structure.
11. The system of claim 7, wherein each node comprises at least two first processors operable to communicate with each other, and a first switch, the first processors communicably coupled to the first switch, the first switch operable to communicably couple the first processors to at least six second nodes.
12. The system of claim 7, wherein determining the failure of the node comprises one of: determining that a repeating communication has not been received from the failed node; and polling of the failed node.
13. A non-transitory computer readable storage medium having computer readable instructions stored thereon that, when executed by a computer, implement a method, the method comprising:
14. The storage medium of claim 13, wherein determining the optimum subset of nodes further comprises:
15. The storage medium of claim 14, wherein the determined optimum subset of nodes is a completely different subset of nodes than an original subset of nodes initially selected to execute the job.
16. The storage medium of claim 13, wherein the plurality of communicatively coupled nodes included in the computing environment is arranged in a three dimensional node structure.
17. The storage medium of claim 13, wherein each node comprises at least two first processors operable to communicate with each other, and a first switch, the first processors communicably coupled to the first switch, the first switch operable to communicably couple the first processors to at least six second nodes.
18. The storage medium of claim 13, wherein determining the failure of the node comprises one of: determining that a repeating communication has not been received from the failed node; and polling of the failed node.
This application is a continuation of U.S. patent application Ser. No. 13/947,702, filed Jul. 22, 2013, which is a continuation of U.S. patent application Ser. No. 13/712,423, filed Dec. 12, 2012, which is a continuation of U.S. patent application Ser. No. 10/825,021, filed Apr. 15, 2004, now U.S. Pat. No. 8,366,040, the disclosures of which are incorporated by reference herein in their entirety.
US4885770 4 Sep 1987 5 Dec 1989 Digital Equipment Corporation Boot system for distributed digital data processing system
US5280607 28 Jun 1991 18 Jan 1994 International Business Machines Corporation Method and apparatus for tolerating faults in mesh architectures
US5301104 7 Aug 1990 5 Apr 1994 Honeywell Inc. Method for allocating processing elements interconnected in a hypercube topology
US5450578 23 Dec 1993 12 Sep 1995 Unisys Corporation Method and apparatus for automatically routing around faults within an interconnect system
US5710935 6 Jun 1995 20 Jan 1998 International Business Machines Corporation Advanced parallel array processor (APAP)
US5926619 5 Jan 1998 20 Jul 1999 International Business Machines Corporation Apparatus and program product for recovery of a name server managing membership of a domain of processors in a distributed computing environment
US5933631 17 Mar 1997 3 Aug 1999 International Business Machines Corporation Dynamic boot filesystem selection
US6408326 20 Apr 1999 18 Jun 2002 Microsoft Corporation Method and system for applying a policy to binary data
US6460149 11 Apr 2000 1 Oct 2002 International Business Machines Corporation Suicide among well-mannered cluster nodes experiencing heartbeat failure
US6468112 11 Jan 1999 22 Oct 2002 Adc Telecommunications, Inc. Vertical cable management system with ribcage structure
US6477663 7 Apr 1999 5 Nov 2002 Compaq Computer Corporation Method and apparatus for providing process pair protection for complex applications
US6480927 31 Dec 1997 12 Nov 2002 Unisys Corporation High-performance modular memory system with crossbar connections
US6480972 24 Feb 1999 12 Nov 2002 International Business Machines Corporation Data processing system and method for permitting a server to remotely perform diagnostics on a malfunctioning client computer system
US6496941 21 May 1999 17 Dec 2002 At&T Corp. Network disaster recovery and analysis tool
US6643764 20 Jul 2000 4 Nov 2003 Silicon Graphics, Inc. Multiprocessor system utilizing multiple links to improve point to point bandwidth
US6646984 15 Mar 1999 11 Nov 2003 Hewlett-Packard Development Company, L.P. Network topology with asymmetric fabrics
US6658504 30 Aug 2000 2 Dec 2003 Eurologic Systems Storage apparatus
US6675264 7 May 2001 6 Jan 2004 International Business Machines Corporation Method and apparatus for improving write performance in a cluster-based file system
US6683696 27 Oct 1998 27 Jan 2004 Hewlett-Packard Development Company, L.P. Filter based data imaging method for an image forming device
US6718486 24 Jul 2000 6 Apr 2004 David E. Lovejoy Fault monitor for restarting failed instances of the fault monitor
US6853388 22 Oct 2001 8 Feb 2005 Kabushiki Kaisha Toshiba Network management equipment and communication path setting method
US6865157 26 May 2000 8 Mar 2005 Emc Corporation Fault tolerant shared system resource with communications passthrough providing high availability communications
US6918063 4 Feb 2002 12 Jul 2005 International Business Machines Corporation System and method for fault tolerance in multi-node system
US6996674 7 May 2001 7 Feb 2006 International Business Machines Corporation Method and apparatus for a global cache directory in a storage cluster
US7016299 27 Jul 2001 21 Mar 2006 International Business Machines Corporation Network node failover using path rerouting by manager component or switch port remapping
US7043539 29 Mar 2002 9 May 2006 Terraspring, Inc. Generating a description of a configuration for a virtual network system
US7046687 16 Jan 2002 16 May 2006 Tau Networks Configurable virtual output queues in a scalable switching system
US7055148 7 Dec 2000 30 May 2006 Hewlett-Packard Development Company, L.P. System and method for updating firmware
US7061907 26 Sep 2000 13 Jun 2006 Dell Products L.P. System and method for field upgradeable switches built from routing components
US7065764 20 Jul 2001 20 Jun 2006 Netrendered, Inc. Dynamically allocated cluster system
US7073053 11 Oct 2001 4 Jul 2006 Cisco Technology, Inc. Method and apparatus for a boot progression scheme for reliably initializing a system
US7107337 7 Jun 2001 12 Sep 2006 Emc Corporation Data storage system with integrated switching
US7127597 24 Sep 2002 24 Oct 2006 Novell, Inc. Mechanism for controlling boot decisions from a network policy directory based on client profile information
US7231430 4 Jan 2002 12 Jun 2007 Egenera, Inc. Reconfigurable, virtual processing system, cluster, network and method
US7287179 15 May 2003 23 Oct 2007 International Business Machines Corporation Autonomic failover of grid-based services
US7299334 7 Jul 2004 20 Nov 2007 Xiv Ltd. Storage system configurations
US7299377 19 Feb 2003 20 Nov 2007 Richard S. Norman Fault tolerant cell array architecture
US7379983 25 Jun 2003 27 May 2008 International Business Machines Corporation Merging scalable nodes into single-partition merged system using service processors of nodes
US7386662 20 Jun 2005 10 Jun 2008 Symantec Operating Corporation Coordination of caching and I/O management in a multi-layer virtualized storage environment
US7644153 31 Jul 2003 5 Jan 2010 Hewlett-Packard Development Company, L.P. Resource allocation management in interactive grid computing systems
US7685597 20 Feb 2004 23 Mar 2010 Sun Microsystems, Inc. System and method for management of characterized resources
US8160061 29 Dec 2006 17 Apr 2012 Raytheon Company Redundant network shared switch
US20020093950 15 Jun 2001 18 Jul 2002 Li Shuo-Yen Robert Physical implementation of switching fabrics constructed from recursive 2-stage interconnection
US20020159437 26 Oct 2001 31 Oct 2002 Foster Michael S. Method and system for network configuration discovery in a network manager
US20020161902 * 25 Apr 2001 31 Oct 2002 Mcmahan Larry N. Allocating computer resources for efficient use by a program
US20030005276 28 Jun 2001 2 Jan 2003 Ibm Corporation Method and system for booting of a target device in a network environment based on automatic client discovery and scan
US20030046529 1 Aug 2002 6 Mar 2003 Francois Loison Boot process for a computer, a boot ROM and a computer having a boot ROM
US20030084100 31 Oct 2002 1 May 2003 Gahan Richard A. Server monitoring and failover mechanism
US20030188071 27 Sep 2002 2 Oct 2003 Thomas Kunjan On-chip high speed data interface
US20030233427 29 May 2002 18 Dec 2003 Hitachi, Ltd. System and method for storage network management
US20030237018 11 Dec 2002 25 Dec 2003 Hitachi, Ltd. Server takeover system and method
US20040024949 1 Nov 2002 5 Feb 2004 Joerg Winkler Retry mechanism for blocking interfaces
US20040085897 14 Nov 2002 6 May 2004 Shimshon Jacobi Method and apparatus for high performance single block scheduling in distributed systems
US20040117792 * 17 Dec 2002 17 Jun 2004 Maly John W. System and method for terminating processes in a distributed computing system
US20040123033 19 Dec 2002 24 Jun 2004 Rudelic John C. Mitigating access penalty of a semiconductor nonvolatile memory
US20040186920 30 Jan 2004 23 Sep 2004 Birdwell John D. Parallel data processing architecture
US20040205414 * 5 Apr 2004 14 Oct 2004 Roselli Drew Schaffer Fault-tolerance framework for an extendable computer architecture
US20040210656 16 Apr 2003 21 Oct 2004 Silicon Graphics, Inc. Failsafe operation of storage area network
US20040268000 24 Jun 2003 30 Dec 2004 Barker John Howard Pass through circuit for reduced memory latency in a multiprocessor system
US20050015384 17 Jul 2003 20 Jan 2005 Silicon Graphics, Inc. Relocation of metadata server with outstanding DMAPI requests
US20050149924 24 Dec 2003 7 Jul 2005 Komarla Eshwari P. Secure booting and provisioning
US20050173357 11 Feb 2004 11 Aug 2005 Mcclain Brian R. Apparatus and system for vertically storing computing devices
US20050177670 7 Apr 2004 11 Aug 2005 Hitachi, Ltd. Storage system
US20060013207 20 Sep 2005 19 Jan 2006 Mcmillen Robert J Reconfigurable, fault tolerant, multistage interconnect network and protocol
US20060031940 7 Aug 2004 9 Feb 2006 Rozman Allen F System and method for protecting a computer system from malicious software
US20060117208 17 Nov 2004 1 Jun 2006 Raytheon Company On-demand instantiation in a high-performance computing (HPC) system
US20060182440 18 Apr 2006 17 Aug 2006 Boris Stefanov Fault isolation of individual switch modules using robust switch architecture
US20060195508 11 Oct 2005 31 Aug 2006 James Bernardin Distributed computing
US20070038749 28 Oct 2005 15 Feb 2007 Broadcom Corporation Combined local and network storage interface
US20070172235 23 Jan 2006 26 Jul 2007 Snider Gregory S Compute clusters employing photonic interconnections for transmitting optical signals between compute cluster nodes
US20070253437 28 Apr 2006 1 Nov 2007 Ramesh Radhakrishnan System and method for intelligent information handling system cluster switches
US20070299995 7 Sep 2007 27 Dec 2007 Crossroads Systems, Inc. Storage Router and Method for Providing Virtual Local Storage
US20080101395 30 Oct 2006 1 May 2008 Raytheon Company System and Method for Networking Computer Clusters
US20080162732 29 Dec 2006 3 Jul 2008 Raytheon Company Redundant Network Shared Switch
US20130104138 12 Dec 2012 25 Apr 2013 Raytheon Company System and method for topology-aware job scheduling and backfilling in an hpc environment
US20130304895 22 Jul 2013 14 Nov 2013 Raytheon Company System and method for topology-aware job scheduling and backfilling in an hpc environment
US20130311998 22 Jul 2013 21 Nov 2013 Raytheon Company System and method for topology-aware job scheduling and backfilling in an hpc environment
EP0981089A2 12 Jul 1999 23 Feb 2000 Academia Sinica Method and apparatus for providing failure detection and recovery with predetermined degree of replication for distributed applications in a network
EP1737253A1 20 Jun 2005 27 Dec 2006 Alcatel Alsthom Compagnie Generale D'electricite Fault tolerant single plane switch fabric for a telecommunication system
JP7200496A Title not available
JP8227356A Title not available
JP2003099412A Title not available
JP2003237423A Title not available
JP2004126968A Title not available
JP2004242337A Title not available
JP2004532447A Title not available
JP2006065697A Title not available
JP2006190039A Title not available
JP2007141305A Title not available
JPH05274178A Title not available
JPH10116261A Title not available
JPH10222475A Title not available
JPH11341042A Title not available
JPS6224358U Title not available
KR20010000624A Title not available
WO2002084509A1 25 Feb 2002 24 Oct 2002 International Business Machines Corporation A novel massively parrallel supercomputer
WO2002095580A1 23 May 2002 28 Nov 2002 Tekelec Methods and systems for automatically configuring network monitoring system
WO2003005192A1 4 Jul 2002 16 Jan 2003 Idékapital Ab A system and a method for selecting a preconfigured operating system for a server
1 "Installation Guide for Dolphin PCI-SCI Adapters," Dolphin Interconnect Solutions, XP-02480479; Sep. 6, 2006; 20 pages.
2 "MS-8X; 8-Port Modular SCL Switch; For clustering, SANs, networking and bus bridging," Dolphin Interconnect Solutions, XP-002480478, Jan. 2002, 2 pages.
3 Advanced Micro Devices et al.; "Hypertransport Technology I/O Link-A High-Bandwidth I/O Architecture," Jul. 20, 2001, pp. 1-25.
4 Allen et al.; "The Cactus Worm: Experiments with Dynamic Resource Discovery and Allocation in a Grid Environment," 16 pages, Jan. 8, 2001.
5 Anonymous, "HP AlphaServer SC User Guide;" Internet Article, Online, XP002336777; retrieved from the internet on Jul. 12, 2004 from: web1.quadrics.com/onlinedocs/AlphaServer/Eagle/html/AlphaServerUserGuide.
6 Anonymous, "Message Passing Interface (MPI);" retreived on Jul. 18, 2005; from Internet webarchive.org/web/20040102194825 / .llnl.gov.computing/tutorials/mpi/>, pp. 1-33, 103, 25 & 26.
7 Axel Keller et al.; Anatomy of a Resource Management System for HPC Clusters; Annual Review of Scalable Computing; vol. 3 pp. 1-23, 2001.
8 Baraglia et al; RsdEditor: A Graphical User Interface for Specifying Metacomputer Components, Heterogeneous Computing Workshop, 2000, pp. 336-345.
9 Bhanot et al; "The BlueGene/L Supercomputer," 20th International Symposium on Lattice Field Theory, vol. 119, Jun. 2002, 8 pages.
10 Canadian Intellectual Property Office, Office Action for Appl. No. 2,503,773; mailed Jun. 4, 2009; 3 pages.
11 Canadian Intellectual Property Office; Office Action for Application No. 2,503,773; mailed Aug. 9, 2011; 2 pages.
12 Canadian Intellectual Property Office; Office Action for Application No. 2,503,775; mailed Jan. 8, 2009; 5 pages.
13 Canadian Intellectual Property Office; Office Action for Application No. 2,503,781; mailed Jan. 8, 2009; 4 pages.
14 Canadian Intellectual Property Office; Office Action for Application No. 2,503,781; mailed Jun. 6, 2011; 2 pages.
15 Chang et al.; "Performance Improvement of Allocation Schemes for Mesh-Connected Computers;" Journal of Parallel and Distributed Computing, Academic Press, Duluth, MN, vol. 52, No. 1, Jul. 10, 1998; pp. 40-68.
16 Choo et al.; "Processor Scheduling and Allocation for 3D Torus Muticomputer Systems," IEEE Transactions on Parallel and Distributed Systems; vol. 11, No. 5, May 2000, pp. 475-484.
17 CISCO Systems; CISCO 12012 Gigabit Switch Router Switch Fabric Cards Replacement Instructions; Doc. No. 78-4343-02; 14 pages, 2002.
18 Communication from the EPO, Communication pursuant to Article 94(3) EPC; Application No. EP 07 007 897.7-2211, mailed Jul. 5, 2012, 7 pages.
19 Communication from the EPO, European Search Report for Appl. EP 05 25 2235, mailed Jul. 22, 2005, 3 pages.
20 Communication from the EPO, European Search Report for Appl. PCT/US2005/012242 and Written Opinion of the International Search Authority, mailed Sep. 19, 2005, 16 pages.
21 Communication from the EPO, European Search Report for Appl. PCT/US2005/012313 and Written Opinion of the International Search Authority, mailed Sep. 20, 2005, 14 pages.
22 Communication from the EPO, European Search Report for Appl. PCT/US2005/012316 and Written Opinion of the International Search Authority, mailed Sep. 14, 2005, 11 pages.
23 Communication from the EPO, European Search Report for Appl. PCT/US2005/012489 and Written Opinion of the International Search Authority, mailed Nov. 18, 2005, 14 pages.
24 Communication from the EPO, European Search Report for Appl. PCT/US2005/012643 and Written Opinion of the International Search Authority, mailed Apr. 19, 2006, 11 pages.
25 Communication Pursuant to Article 94(3) EPC for Application No. 08 713 443.3-2224 from EPO dated Nov. 5, 2009; 9 pages.
26 Cukier, M. et al.; "AQUA: an Adaptive architecture that provides dependable distributed objects;" 1998 Reliable Distributed Systems. Proceedings. 17th IEEE Symposium on West Lafayette, USA Oct. 20, 1998, pp. 245-253, XP010319083, DOI: DOI: 10.1109/RELDIS. 1998.740506 ISBN: 978-0-8186-9218.
27 Culler et al.; "Parallel Computer Architecture-A Hardware/Software Approach, Interconnection Network Design," Morgan Kaufmann, 1999, 30 pages.
28 Di Santo et al.; "Kernel Implementation of Locality-Aware Dispatching Techniques for Web Server Clusters," Cluster Computing, 2003 Proceedings, pp. 154-162.
29 English Translation of the Korean Notice of Final Rejection for Application No. 10-2006-7023880; 5 pages.
30 English Translation of the Korean Notice of Last Preliminary Rejection for Application No. 10-2006-7023880; mailed May 28, 2009; 4 pages.
31 English Translation of the Korean Office Action Re: Notice of Preliminary Rejection; Examination Results Summary Ref: Notification of Reason for Refusal for Application No. 10-2006-7023881; 7 pages.
32 EPO Communicaiton, Netherlands Communications re: Summons to attend oral proceedings in accordance with Rule 115(1) EPC for Application No. 05 252 240.6; mailed Aug. 5, 2011; 8 pages.
33 EPO Communication for Appl. No. 07007897.1; mailed Mar. 26, 2006; 12 pages.
34 EPO Communication Pursuant to Article 94(3) EPC for Application 05 252 234.9; mailed Aug. 14, 2009; 3 pages.
35 EPO Communication Pursuant to Article 94(3) EPC for Application 07 007 897.7; mailed Feb. 2, 2011; 7 pages.
36 EPO Communication Pursuant to Article 94(3) EPC for Application 07 007 897.7; mailed Sep. 18, 2009; 1 page.
37 EPO Registered Letter, Application No. 05 252 239.8-1243, 6 pages; mailed Feb. 2, 2007.
38 EPO, Communication Pursuant to Article 34(3)EPC, Mailed Dec. 16, 2010, Application No. 07 865 807.7-1249, 7 pages.
39 European Patent Office Communication Re: Decision to Refuse European Patent Application, No. 05 252 239.8-1243, at the oral proceedings date Mar. 11, 2010, Ref. JL 5105, and copy of the minutes in accordance with Rule 124(4) EPC (63 pages).
40 European Patent Office Communication re: Summons to Attend Oral Proceedings Pursuant to Rule 115(1) EPC for Application No. 05 252 239.8-1243 / 1580661, Ref JL5105 (6 pages).
41 European Patent Office Communication Re: Summons to attend oral proceedings with Rule 115(1)EPC, for Application No. 05 732 940.1, mailed Jan. 27, 2011; 7 pages.
42 European Patent Office Communication, Communication Pursuant to Article 94(3)EPC, for Application No. 05 732 940.1, mailed Jan. 15, 2010; 4 pages.
43 European Patent Office Communication, Munich Germany: Communication re: Minnutes of oral proceedings in Accordance with Rule 124(4)EPC, for Application No. 05 732 940.1, mailed Jul. 13, 2011; 14 pages.
44 European Patent Office, Communications Pursuant to Article 94(3) EPC for Application No. 05 737 440.7; mailed Nov. 12, 2009; 4 pages.
45 European Patent Office, Munich, Germany; Communications re: Summons to attend oral proceedings in accordance to Rule 115(1) EPC for Application No. 05 742 298.2; mailed May 13, 2011; 7 pages.
46 European Patent Office, Netherlands, Communication pursuant to Article 94(3) EPC Office Action for Application No. 05 252 237.2; 6 pages.
47 European Patent Office, Netherlands, Communications re: Summons to attend oral proceedings in accordance to Rule 115(1) EPC for Application No. 05 737 440.7; mailed Aug. 4, 2011; 7 pages.
48 Falck et al.; Swedish Patent No. 102405; 4 pages; Aug. 26, 1941.
49 Feitelson, "Job Scheduling in Multiprogrammed Parallel Systems," IBM Research Report, Aug. 1997, pp. 1-90.
50 Geunmo Kim et al.; On Submes Allocation for Mesh Multicomputers: A Best-Fil Allocation and a Virtual Submesh Allocation for Faulty Meshes; IEEE Transactions on Parallel and Distributed Systems; vol. 9; No. 2; Feb. 1998; XP-000736328; pp. 175-185.
51 Government of India Patent Office; First Examination Report for Application 6020/DELNP/2006; mailed Oct. 30, 2013; 2 pages.
52 Government of India Patent Office; First Examination Report for Application 632/DELNP/2006; mailed Oct. 4, 2013; 2 pages.
53 Government of India Patent Office; First Examination Report for Application 6323/DELNP/2006; mailed Oct. 4, 2013; 2 pages.
54 Government of India Patent Office; First Examination Report for Application 6368/DELNP/2006; mailed Nov. 4, 2013; 2 pages.
55 H. Fuchi; "Parallel Linux Cluster Express 5800 / Paralle PC-Cluster;" NEC Research & Development, Japan, NEC Corp., Jul. 25, 2002, vol. 55, No. 7 (No. 401 throughout the volume), pp. 42-43.
56 Hans-Ulrich Heiss, "Processor Management in Two-Dimensional Grid Architecutres," Interner Bericht Nr. 12/92, XP002416087, Dec. 1992, 51 pages.
57 Haynes et al.; "A Visualization Todd for Analyzing Cluster Performance Data," 42 Annual Symposium on Foundations of Computer Science, (FOCS 2001), Las Vegas, Oct. 14-17, 2001, 8 pages.
58 Hee Yong Youn et al.; Dynamic Task Scheduling and Allocation for 3D Torus Multicomputer Systems; 1996 International Conference on Parallel Processing; XP-9113574; pp. III-199-III-206.
59 Hsing-Lung Chen et al.; Distributed Submesh Determination in Faulty Tori and Meshes; XP-10216762; 1997; pp. 65-70.
60 Intellectual Property Corporation of Malaysia; Substantive Examination Adverse Report for Application PI 20051527; mailed Jan. 31, 2013; 4 pages.
61 International Search Report and Written Opinion; International Application No. PCT/US2005/012500; Date of mailing: Aug. 1, 2005; 12 pages.
62 International Search Report and Written Opinion; International Application No. PCT/US2007/0081722; Date of mailing: May 30, 2008; 13 pages.
63 IP Office of Singapore, Examination Report, Appl. No. 200607088-2, mailed Apr. 13, 2009, 7 pages.
64 Israel Patent Office Communication Re: Brief Translation of the Office Action, Re: Notice of Deficiencies in Patent No. 178607, mailed Sep. 13, 2010; 4 pages.
65 Israel Patent Office Communication Re: Brief Translation of the Office Action, Re: Notice of Deficiencies in Patent No. 178608, mailed Sep. 20, 2010, 4 pages.
66 Israel Patent Office Communication Re: Brief Translation of the Office Action, Re: Notice of Deficiencies in Patent No. 178610, mailed Sep. 20, 2010, 4 pages.
67 Israel Patent Office Communication Re: Hebrew version and brief English Translation of Office Action, for Patent No. 178606, mailed Sep. 19, 2010; 3 pages.
68 Israel Patent Office Communication Re: Hebrew version and brief English Translation of Office Action, ref: Patent Appl. No. 179827 (3 pages).
69 Jackson et al.; "Core Algorithms of Maui Scheduler," 2001; Springer-Verlad, Berlin Heidelberg, pp. 89-102.
70 Japanes Office Action and English Translation for Japanese Patent Application No. 2005-117404, 6 pages, Mailed Dec. 7, 2010.
71 Japanes Office Action and English Translation for Japanese Patent Application No. 2007-543012, 15 pages, Mailed Dec. 24, 2013.
72 Japanese Office Action and English Translation for Appl. No. 2007-508456, dated Aug. 10, 2010; 6 pages.
73 Japanese Office Action and English Translation for Appl. No. 2007-508520, dated Jun. 17, 2011; 6 pages.
74 Japanese Patent Office Communication, Japanes Office Action and Translation of Office Action for Appl. No. 2007-508457, dated Sep. 29, 2010, 12 pages.
75 John P. Hayes et al.; Hypercube Supercomputers; Proceedings of the IEEE; vol. 77, No. 12; Dec. 1989; XP009113537; pp. 1829-1271.
76 Jonsson et al.; "Comparative Performance of InfiniBand Architecture and Gigabit Ethernet Interconnects on Intel Itanium 2 Microarchitecture-basd Clusters;" May 2003, 4th European LS-DYNA Users Conference, 10 pages.
77 JP Publication 2005-241804 Abstract; Kimitaka et al.; Liquid Crystal Display Device; 2 pages.
78 JP Publication 2007-141305 Abstract; Hidenori et al.; Magnetic Disk Drive; 2 pages.
79 JP Publication No. 2007-200496 Abstract; Koichiro et al.; Semiconductor Storage Device and Its Test Method; 2 pages.
80 Juin-Sheng et al., "Network Topology Structure on Board of Computer Cluster," Publication No. TW532011B, 1 page, received Dec. 18, 2006.
81 Kandlur et al.; "Hypercube Management in the Presence of Node Failures," Third Conference on Hypercube Concurrent Computers and Applications ACM New York, vol. 1; 1988, pp. 328-336.
82 Keller et al.; "Scheduling in HPC Resource Management Systems: Queing vs. Planning;" Jun. 2003, Proceedings of the 9th Workshop on Job Scheduling Strategies for Parallel Processing, Seattle, WA, pp. 1-19.
83 Korean Notice of Last Preliminary Rejection for Application No. 10-2006-7023880; mailed May 25, 2009; 5 pages.
84 Korean Office Action and English Translation for Application No. 10-2006-7023882, mailed 7/18/201; 4 pages.
85 Korean Patent Office Communication, OA and English Translation re: Notice of Preliminary Rejection; KIPO Examination Results Summary, Ref: Detailed Grounds for Rejection for Appl. No. 10-2007-7013503 (6 pgs).
86 Korean Patent Office Communication; Korean OA and Translation for Appl. No. 10-2006-7021323, dated Jul. 14, 2011; 8 pages.
87 Krevat et al.; "Job Scheduling for the BlueGene/LSystem," Lecture Notes in Computer Science, vol. 2537, pp. 38-54, XP00233643, Jul. 24, 2002.
88 Kurt Windisch et al.; ProcSimity: An Experimental Tool for Processor Allocation and Scheduling in Highly Parallel Systems; XP-101-30254; 1995; pp. 414-412.
89 L. G. Harbaugh et al.; "Building High-Performance Linux Clusters, Sponsored by Appro," XP-002480128; Jun. 2004; 23 pages.
90 Liu et al.; "Non-Contiguous Processor Allocation Algorithms for Distributed Memory Multicomputers;" Supercomputing '94, Proceedings, Washington D.C., Nov. 144-18, 1994; pp. 227-236.
91 Look up Tech Terms-Switching Fabric; SearchStorage.com; search.techtarget.com; retreived Oct. 6, 2009; 4 pages.
92 Ma et al.; E-Kernal: An Embedding Kernel on the IBM Victor V256, Multiprocessor for Program Mapping and Network Reconfiguration, IEEE Transactions on Paralle and Distributed Systems, IEEE Service Center, vol. 5, No. 9, Sep. 5, 1994, pp. 977-994.
93 Malaysia Patent Office Communication re: Substantive Examination Adverse Report (Section 30(01)/30(2)) for Appl. No. PI 20051525, Filing Date Apr. 5, 2005, mailed Aug. 30, 2010, 2 pages.
94 Masaaki et al.; Abstract of JP8227356, 1 page, published Sep. 3, 1996.
95 Matthias Hovestadt et al; Scheduling in HPC Resource Mangement Systems: Queing vs. Planning; Proceedings of the 9th Workshop on Job Scheduling Strategies for Parallel Processing, Seattle, WA, 2003; pp. 1-19.
96 Moonsoo Kang et al; Job-Based Queue Delay Modeling in a Space-Shared Hypercube; XP-10356056; 1999; pp. 313-318.
97 Moore et al.; "Managing Mixed-Use Clusters with Clusters-onDemand," Internet Article, Nov. 2002.
98 Notice of Allowance for U.S. Appl. No. 10/991,598; mailed Apr. 18, 2008.
99 Notice of Allowance for U.S. Appl. No. 10/991,598; mailed Jan. 22, 2008.
100 Notice of Allowance for U.S. Appl. No. 11/107,4467; mailed Jul. 28, 2008.
101 Notice of Allowance; U.S. Appl. No. 12/246,786; Date of mailing: Apr. 12, 2012.
102 Notice of Allowance; U.S. Appl. No. 12/246,786; Date of mailing: Oct. 17, 2011.
103 Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for the International Application No. PCT.US2007087947; mailed May 7. 2008; 11 pages.
104 Offical Letter received Apr. 15, 2010, re: ROC (Taiwanese) Appl. No. 94111492, notifying of contents of forthcoming second (final) Office Action and indicating opportunity to respond, and Search Report of the EP corresponding application (EP 1566738 A3), 7 pages.
105 Office Action for U.S. Appl. No. 11/107,4467; mailed Mar. 7, 2008.
106 Office Action for U.S. Appl. No. 12/246,783; mailed May 11, 2011.
107 Panagiotis et al.; "inetd-Internet Services Daemon," pp. 1-4, 1994 Man-cgi 1.158, 1995 Modified for Solaris 2.3.
108 Patel et al.; "Sage: An Application Development Toold Suite for High Performance Computing Systems," Aerospace Conference Proceedings, 2000, IEEE Mar. 18-25, 2000' pp. 491-500.
109 PCT; International Search Report and Written Opininion; for PCT/US2008/050086; mailed Jan. 3, 2008; 15 pages.
110 Perbadanan Harat Intelek Malaysia; Malaysia Patent Office Communication re: Substantive Examination Adverse Report (Section 30(1)130(2)) for Appl. No. PI 20051526, mailed Jan. 31, 2011, 3 pages.
111 Perbadanan Harta Intelek Malaysia; Office Action for Application No. PI 20051531; mailed Oct. 31, 2008; 4 pages.
112 Pinkston et al.; "InfiniBand: The "De Facto" Future Standard for System and Local Area Networks or Just a Scalable Replacement for PCI Buses?;" Clustering Computing-Kluwer Academic Publishers, vol. 6, No. 2, 2003, pp. 95-104.
113 Qiao et al.; "Efficient Processor Allocation for 3D Tori," Paralle Processing Sysmposium 1995, Proceedings, 9th International, Apr. 25-28, 1995, IEEE Comput. Soc., pp. 466-471, 921.
114 Ross et al.; "3.3 Connectionless Transport;" Feb. 22, 2001; pp. 1-4; retrieved on Nov. 1, 2005.
115 Rzymianowicz et al.; "Clustering SMP Nodes with the ATOLL Network: A Look into the Future of System Area Networks;" Proceedings of High Performance Computing, 8th International Conference, May 8, 2000, 10 pages.
116 Shiraishi et al.; Parallel Job Execution Tool: ParaJET; Institute of Electronics, Information and Communication Engineers, Technical Report of IEICE, CPSY95-60 Aug. 1996; 9 Pages.
117 Stefanie Meier; "Konzept eines Accounting-und Kontingetierungssystems fur den Einsatz in einem wissenschaftlichen Rechenzentrum;" Jun. 11, 2002; XP55031256; [retrieved from the internet].fz-juelich.de/zam/docs/printable/ib/ib-02/ib-2002-08.pdf; 64 pages.
118 The Intellectual Property Bureau Ministry of Economic Affairs, Office Action for Appl. No. 94111492, 2 pages.
119 The Patent Office of the State Intellectual Property Office of the People's Republic of China, Office Action for Appl. No. 200510081719.3, mailed Apr. 20, 2007; 11 pages.
120 The Patent Office of the State Intellectual Property Office of the People's Republic of China, Office Action for Appl. No. 200510087855.3, mailed Aug. 3, 2012; 8 pages. (with Translation).
121 The Patent Office of the State Intellectual Property Office of the People's Republic of China, Office Action for Appl. No. 200510087855.3, mailed Nov. 20, 2012; 8 pages. (with Translation).
122 The Patent Office of the State Intellectual Property Office of the People's Republic of China; Decision on Rejection for Appl. No. 200510087855.3; 7 pages.
123 Translated Japanese Patent Application No. 2003-531412, 4 pages.
124 Translation of an Office Action of Japanese Patent Office, Appl. No. 2005/117402. mailed Jan. 15, 2008, 6 pages.
125 Translation of Japanes Office Action for Appl. No. 2007-508457, dated Aug. 12, 2009, 3 pages.
126 Translation of Office Action, Japanese Patent Application No. 2005-117403, 1 page, Mailed Jun. 26, 2009.
127 Translation of Office Action, Japanese Patent Application No. 2005-117403, 4 pages, Mailed Dec. 28, 2007.
128 Translation of Office Action, Japanese Patent Application No. 2005-117404, 1 page, Mailed Jun. 26, 2009.
129 Translation of Office Action, Japanese Patent Application No. 2005-117406, 1 page, Mailed Jun. 26, 2009.
130 Translation of Office Action, Japanese Patent Application No. 2005-117406, 6 pages, Mailed Dec. 28, 2007.
131 U.S. Appl. No. 10/825,539; Final Office Action; Date Filed: Apr. 15, 2004; Date Mailed: Dec. 26, 2013; pp. 1-12.
132 U.S. Appl. No. 10/825,539; Non-Final Office Action; Date Filed: Apr. 15, 2004; Date Mailed: May 28, 2013; pp. 1-27.
133 U.S. Appl. No. 13/712,451; Non-Final Office Action; Date Filed: Dec. 12, 2012; Date Mailed: May 29, 2013; pp. 1-9.
134 Unknown, "CISCO Local Director Configuration and Command Reference Guide," Internet Article, Online, Apr. 4, 2001.
135 USPTO Ex Parte OA for U.S. Appl. No. 10/824,874, filed Apr. 15, 2004, mailed Sep. 4, 2009, 5 pages.
136 USPTO FOA for U.S. Appl. No. 13/712,451, filed Dec. 12, 2012, mailed Dec. 19, 2013, 13 pages.
137 USPTO Notice of Allowance for U.S. Appl. No. 10/824,874, filed Apr. 15, 2004, mailed Aug. 2, 2011, 7 pages.
138 USPTO Notice of Allowance for U.S. Appl. No. 10/824,874, filed Apr. 15, 2004, mailed Feb. 8, 2010, 5 pages.
139 USPTO Notice of Allowance for U.S. Appl. No. 10/824,874, filed Apr. 15, 2004, mailed May 5, 2011, 5 pages.
140 USPTO Notice of Allowance for U.S. Appl. No. 10/824,874, filed Apr. 15, 2004, mailed Sep. 20, 2010, 10 pages.
141 USPTO Notice of Allowance for U.S. Appl. No. 10/825,345, filed Apr. 15, 2004, mailed Oct. 27, 2011, 10 pages.
142 USPTO Notice of Allowance for U.S. Appl. No. 10/826,959, filed Apr. 15, 2004, mailed Aug. 29, 2009, 5 pages.
143 USPTO Notice of Allowance for U.S. Appl. No. 10/826,959, filed Apr. 15, 2004, mailed Dec. 17, 2009, 5 pages.
144 USPTO Notice of Allowance for U.S. Appl. No. 10/826,959, filed Apr. 15, 2004, mailed Feb. 11, 2009, 5 pages.
145 USPTO Notice of Allowance for U.S. Appl. No. 10/826,959, filed Apr. 15, 2004, mailed May 12, 2009, 4 pages.
146 USPTO Notice of Allowance for U.S. Appl. No. 10/991,754, filed Nov. 17, 2004, mailed Sep. 9, 2008, 8 pages.
147 USPTO OA for Application No. 10/991,994, filed Nov. 17, 2004, mailed Aug. 4, 2010, 11 pages.
148 USPTO OA for Application No. 10/991,994, filed Nov. 17, 2004, mailed Mar. 20, 2008, 16 pages.
149 USPTO OA for U.S. Appl. No. 10/824,873, filed Apr. 15, 2004, mailed Dec. 4, 2007, 10 pages.
150 USPTO OA for U.S. Appl. No. 10/824,873, filed Apr. 15, 2004, mailed Jan. 14, 2010, 13 pages.
151 USPTO OA for U.S. Appl. No. 10/824,873, filed Apr. 15, 2004, mailed Jun. 25, 2009, 11 pages.
152 USPTO OA for U.S. Appl. No. 10/824,873, filed Apr. 15, 2004, mailed Nov. 17, 2008, 14 pages.
153 USPTO OA for U.S. Appl. No. 10/824,873, filed Apr. 15, 2004, mailed Nov. 18, 2011, 14 pages.
154 USPTO OA for U.S. Appl. No. 10/824,874, filed Apr. 15, 2004, mailed Feb. 26, 2007, 13 pages.
155 USPTO OA for U.S. Appl. No. 10/824,874, filed Apr. 15, 2004, mailed Jul, 31, 2007, 13 pages.
156 USPTO OA for U.S. Appl. No. 10/824,874, filed Apr. 15, 2004, mailed Jul. 11, 2008, 13 pages.
157 USPTO OA for U.S. Appl. No. 10/824,874, filed Apr. 15, 2004, mailed Jun. 5, 2006, 17 pages.
158 USPTO OA for U.S. Appl. No. 10/825,021 filed Apr. 15, 2004, mailed Apr. 15, 2009, 10 pages.
159 USPTO OA for U.S. Appl. No. 10/825,021, filed Apr. 15, 2004, mailed Apr. 30, 2010, 9 pages.
160 USPTO OA for U.S. Appl. No. 10/825,021, filed Apr. 15, 2004, mailed Feb. 11, 2008, 10 pages.
161 USPTO OA for U.S. Appl. No. 10/825,021, filed Apr. 15, 2004, mailed May 25, 2011, 10 pages.
162 USPTO OA for U.S. Appl. No. 10/825,021, filed Apr. 15, 2004, mailed May 7, 2007, 9 pages.
163 USPTO OA for U.S. Appl. No. 10/825,021, filed Apr. 15, 2004, mailed Nov. 10, 2011, 10 pages.
164 USPTO OA for U.S. Appl. No. 10/825,021, filed Apr. 15, 2004, mailed Oct. 13, 2008, 9 pages.
165 USPTO OA for U.S. Appl. No. 10/825,021, filed Apr. 15, 2004, mailed Oct. 15, 2005, 12 pages.
166 USPTO OA for U.S. Appl. No. 10/825,021, filed Apr. 15, 2004, mailed Oct. 15, 2010, 13 pages.
167 USPTO OA for U.S. Appl. No. 10/825,345, filed Apr. 15, 2004, mailed Apr. 15, 2011, 22 pages.
168 USPTO OA for U.S. Appl. No. 10/825,345, filed Apr. 15, 2004, mailed Apr. 17, 2009, 13 pages.
169 USPTO OA for U.S. Appl. No. 10/825,345, filed Apr. 15, 2004, mailed Jul. 23, 2008, 12 pages.
170 USPTO OA for U.S. Appl. No. 10/825,345, filed Apr. 15, 2004, mailed Mar. 19, 2010, 22 pages.
171 USPTO OA for U.S. Appl. No. 10/825,345, filed Apr. 15, 2004, mailed Oct. 27, 2010, 18 pages.
172 USPTO OA for U.S. Appl. No. 10/825,345, filed Apr. 15, 2004, mailed Sep. 16, 2009, 15 pages.
173 USPTO OA for U.S. Appl. No. 10/825,539, filed Apr. 15, 2004, mailed Aug. 9, 2010, 22 pages.
174 USPTO OA for U.S. Appl. No. 10/825,539, filed Apr. 15, 2004, mailed Jan. 10, 2008, 18 pages.
175 USPTO OA for U.S. Appl. No. 10/825,539, filed Apr. 15, 2004, mailed Jan. 28, 2010, 19 pages.
176 USPTO OA for U.S. Appl. No. 10/825,539, filed Apr. 15, 2004, mailed Jun. 25, 2009, 11 pages.
177 USPTO OA for U.S. Appl. No. 10/825,539, filed Apr. 15, 2004, mailed Mar. 17, 2011, 22 pages.
178 USPTO OA for U.S. Appl. No. 10/825,539, filed Apr. 15, 2004, mailed Nov. 13, 2008, 16 pages.
179 USPTO OA for U.S. Appl. No. 10/826,959, filed Apr. 15, 2004, mailed Jan. 29, 2008, 17 pages.
180 USPTO OA for U.S. Appl. No. 10/826,959, filed Apr. 15, 2004, mailed Mar. 12, 2007, 12 pages.
181 USPTO OA for U.S. Appl. No. 10/826,959, filed Apr. 15, 2004, mailed Oct. 20, 2008, 17 pages.
182 USPTO OA for U.S. Appl. No. 10/826,959, filed Apr. 15, 2004, mailed Oct. 4, 2006, 15 pages.
183 USPTO OA for U.S. Appl. No. 10/826,959, filed Apr. 15, 2004, mailed Oct. 4, 2007, 15 pages.
184 USPTO OA for U.S. Appl. No. 10/991,754, filed Nov. 17, 2004, mailed Mar. 20, 2008, 29 pages.
185 USPTO OA for U.S. Appl. No. 10/991,994 , filed Nov. 17, 2004, mailed Mar. 26, 2009, 14 pages.
186 USPTO OA for U.S. Appl. No. 10/991,994, filed Nov. 17, 2004, mailed 10/15/200, 14 pages.
187 USPTO OA for U.S. Appl. No. 10/991,994, filed Nov. 17, 2004, mailed Mar. 20, 2008, 16 pages.
188 USPTO OA for U.S. Appl. No. 10/991,994, filed Nov. 17, 2004, mailed Sep. 12, 2008, 16 pages.
189 USPTO OA for U.S. Appl. No. 10/991,994, filed Nov. 17, 2004, mailed Sep. 19, 2011, 15 pages.
190 USPTO OA for U.S. Appl. No. 11/618,196, filed Dec. 29, 2006, mailed Dec. 16, 2009, 8 pages.
191 USPTO OA for U.S. Appl. No. 11/618,196, filed Dec. 29, 2006, mailed Feb. 3, 2011, 16 pages.
192 USPTO OA for U.S. Appl. No. 11/618,196, filed Dec. 29, 2006, mailed Jul. 18, 2011, 20 pages.
193 USPTO OA for U.S. Appl. No. 11/618,196, filed Dec. 29, 2006, mailed May 13, 2009, 10 pages.
194 USPTO OA for U.S. Appl. No. 13/947,702, filed Jul. 22, 2013, mailed Feb. 20, 2014, 63 pages.
195 USPTO OA for U.S. Appl. No. 14/052,093, filed Oct. 11, 2013, mailed Dec. 20, 2013, 12 pages.
196 USPTO OA for U.S. Appl. No. 14/052,093, filed Oct. 11, 2013, mailed Jun. 4, 2014, 66 pages.
197 USPTO OA for U.S. Appl. No. 14/052,114, filed Oct. 11, 2013, mailed Feb. 14, 2014, 59 pages.
198 USPTO OA for U.S. Appl. No. 14/052,114, filed Oct. 11, 2013, mailed Jul. 16, 2014, 16 pages.
199 Wong; "Switch-Chip Fuels Third-Generation InfiniBand," Nov. 10, 2003, Electronic Design, 2 pages.
200 Y. Katayama; "Keeping Up with the Latest Technlogical Trends in HPC Clusters, PFU Technical Review," Japan, PFU Ltd., May 1, 2003, vol. 14, No. 1 (No. 25 throughout the volume), pp. 46-49.
International Classification G06F15/80, G06F9/50, G06F11/14, G06F11/20, G06F9/46, G06F9/48
Cooperative Classification G06F9/5083, G06F9/5077, G06F9/50, H04L41/0654, G06F2201/815, G06F9/5038, G06F11/2025, G06F9/5072, G06F11/1482, G06F9/5005, G06F9/5066, G06F9/4881
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:DAVIDSON, SHANNON V.;RICHOUX, ANTHONY N.;SIGNING DATES FROM 20130708 TO 20130715;REEL/FRAME:031390/0499