Source: https://patents.google.com/patent/US8336040B2/en
Timestamp: 2019-09-22 22:48:57
Document Index: 301980337

Matched Legal Cases: ['Application No. 05', 'Application No. 07007897', '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. 94111492', 'Application No. 200510081719']

US8336040B2 - System and method for topology-aware job scheduling and backfilling in an HPC environment - Google Patents
US8336040B2
US8336040B2 US10/825,021 US82502104A US8336040B2 US 8336040 B2 US8336040 B2 US 8336040B2 US 82502104 A US82502104 A US 82502104A US 8336040 B2 US8336040 B2 US 8336040B2
US10/825,021
US20050235286A1 (en
2004-04-16 Assigned to RAYTHEON COMPANY reassignment RAYTHEON COMPANY ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: BALLEW, JAMES D., DAVIDSON, SHANNON V., EARLY, GARY R.
2004-11-19 Assigned to RAYTHEON COMPANY reassignment RAYTHEON COMPANY CORRECTIVE ASSIGNMENT TO CHANGE CONVEYING PARTIES, DOCUMENT PREVIOUSLY RECORDED ON REEL 015225 FRAME 0439. ASSIGNOR CONFRIMS THE ASSIGNMENT. Assignors: DAVIDSON, SHANNON V., RICHOUX, ANTHONY N.
2005-10-20 Publication of US20050235286A1 publication Critical patent/US20050235286A1/en
2012-12-18 Publication of US8336040B2 publication Critical patent/US8336040B2/en
2016-04-22 US case filed in Texas Eastern District Court litigation Critical https://portal.unifiedpatents.com/litigation/Texas%20Eastern%20District%20Court/case/2%3A16-cv-00423 Source: District Court Jurisdiction: Texas Eastern District Court "Unified Patents Litigation Data" by Unified Patents is licensed under a Creative Commons Attribution 4.0 International License.
This disclosure relates generally to the field of data processing and, more specifically, to a system and method for topology-aware job scheduling and backfilling
determining, using one or more computers, an original subset of a plurality of nodes, the original subset comprising nodes currently unallocated to a job, each node in the plurality of nodes comprising a switching fabric comprising a switch integrated on the card and allowing node to node communication during execution of a job;
selecting a job from a job queue;
executing the selected job using one or more processors of one or more nodes of the original subset; and
selecting one or more nodes from a second plurality of nodes, the second plurality being distinct from the original subset, each of the nodes in the second plurality of nodes comprising a switching fabric integrated to a card and at least two processors integrated to the card, wherein the selected one or more nodes from the second plurality are unavailable at the time of selecting; and
adding the nodes selected from the second plurality to the original subset to satisfy the dimensions of the selected job after the nodes selected from the second plurality become available.
2. The method of claim 1, wherein selecting the job comprises selecting the job from the job queue based on priority, the selected job comprising dimensions not greater than a topology of the original subset.
3. The method of claim 2, wherein selecting the job from the job queue based on priority comprises:
selecting a first job from the sorted job queue;
determining dimensions of the first job with the topology of the original subset; and
in response to the dimensions of the first job being greater than the topology of the original subset, selecting a second job from the sorted job queue.
4. The method of claim 2, wherein the dimensions of the first job are based, at least in part, on one or more job parameters and an associated policy.
5. The method of claim 2, further comprising dynamically allocating a job space from the original subset based, at least in part, on the dimensions of the job, wherein executing the selected job comprises executing the selected job using the job space.
6. The method of claim 1, further comprising executing the selected job using the original subset of nodes including the nodes selected from the second plurality.
determining that a second job that was executing on a second subset of the plurality of nodes, the second subset of the plurality of nodes being distinct from the original subset, has failed;
adding the second subset to the original subset; and
adding the failed job to the job queue.
8. Software embodied in one or more non-transitory, tangible computer-readable media and when executed operable to:
determine an original subset of a plurality of nodes, the original subset comprising nodes currently unallocated to a job, each node in the plurality of nodes comprising a switching fabric integrated to a card and at least two processors integrated to the card, the switching fabric comprising a switch integrated on the card and allowing node to node communication during execution of a job;
select a job from a job queue;
execute the selected job using one or more processors of one or more nodes of the original subset; and
select one or more nodes from a second plurality of nodes, the second plurality being distinct from the original subset, each of the second nodes comprising an integrated fabric, wherein the selected one or more nodes from the second plurality are unavailable at the time of selecting; and
add the selected second nodes to the original subset to satisfy the dimensions of the selected job after the nodes selected from the second plurality become available.
9. The software of claim 8, wherein the software being operable to select the job comprises the software being operable to select the job from the job queue based on priority, the selected job comprising dimensions not greater than a topology of the original subset.
10. The software of claim 9, wherein the software being operable to select the job from the job queue based on priority comprises the software being operable to:
select a first job form the sorted job queue;
determine dimensions of the first job with the topology of the original subset; and
in response to the dimensions of the first job being greater than the topology of the original subset, select a second job from the sorted job queue.
11. The software of claim 9, wherein the dimensions of the first job are based, at least in part, on one or more job parameters and an associated policy.
12. The software of claim 9, further dynamically allocate a job space form the original subset based, at least in part, on the dimensions of the job, wherein the software being operable to execute the selected job comprises the software being operable to execute the selected job using the dynamically allocated job space.
13. The software of claim 8, further operable to execute the selected job using the original subset of nodes including the nodes selected from the second plurality.
14. The software of claim 8, further operable to:
determine that a second job that was executing on a second subset in the plurality of nodes, the second subset of the plurality of nodes being distinct from the original subset, has failed;
add the second subset to the original subset; and
add the failed job to the job queue.
a plurality of nodes, each node comprising a switching fabric integrated to a card and at least two processors integrated to the card, the switching fabric comprising a switch integrated on the card and allowing node to node communication during execution of a job; and
determine an original subset of the plurality of nodes, the original subset comprising nodes currently unallocated to a job;
determine that dimensions of the selected job are greater than topology of the original subset;
select one or more nodes from a second plurality of nodes, the second plurality being distinct from the original subset, each of the nodes in the second plurality of nodes comprising a switching fabric integrated to a card and at least two processors integrated to the card, wherein the selected one or more nodes from the second plurality are unavailable at the time of selecting; and
add the selected one or more nodes from the second plurality to the original subset to satisfy the dimensions of the selected job after the nodes selected from the second plurality become available.
16. The system of claim 15, wherein the management node being operable to select the job comprises the management node being operable to select the job from the job queue based on priority, the selected job comprising dimensions not greater than a topology of the original subset.
17. The system of claim 16, wherein the management node being operable to select the job form the job queue based on priority comprises the management node being operable to:
select a first job from the sorted job queue;
in response to the dimensions of the first job being greater than the topology of the original subset, select a second job form the sorted job queue.
18. The system of claim 16, wherein the dimensions of the first job are based, at least in part, on one or more job parameters and an associated policy.
19. The system of claim 16, wherein the management node is further operable to dynamically allocate a job space form the original subset based, at least in part, on the dimensions of the job, wherein the management node being operable to execute the selected job comprises the management node being operable to execute the selected job using the dynamically allocated job space.
20. The system of claim 15, wherein the management node is further operable to execute the selected job using the original subset of nodes including the nodes selected from the second plurality.
21. The system of claim 15, wherein the management node is further operable to:
US10/825,021 2004-04-15 2004-04-15 System and method for topology-aware job scheduling and backfilling in an HPC environment Active 2025-12-12 US8336040B2 (en)
MYPI20051527 MY150399A (en) 2004-04-15 2005-04-05 System and method for topology-aware job scheduling and backfilling in an hpc environment
CA2503777A CA2503777C (en) 2004-04-15 2005-04-07 System and method for topology-aware job scheduling and backfilling in an hpc environment
EP17165448.6A EP3267309A1 (en) 2004-04-15 2005-04-09 System and method for topology-aware job scheduling and backfilling in an hpc environment
EP05252237A EP1582981A1 (en) 2004-04-15 2005-04-09 System and method for topology-aware job scheduling and backfilling in an HPC environment
PCT/US2005/012031 WO2005106663A1 (en) 2004-04-15 2005-04-12 System and method for topology-aware job scheduling and backfilling in an hpc environment
KR1020067023880A KR20070006906A (en) 2004-04-15 2005-04-12 System and method for topology-aware job scheduling and backfilling in an hpc environment
TW094111486A TWI272502B (en) 2004-04-15 2005-04-12 System and method for topology-aware job scheduling and backfilling in an HPC environment
JP2005117404A JP2005310139A (en) 2004-04-15 2005-04-14 System and method for executing topology-aware job scheduling and backfilling in hpc environment
CNB2005100922363A CN100562852C (en) 2004-04-15 2005-04-15 System and method for executing topology-aware job scheduling and backfilling in HPC environment
IL178606A IL178606A (en) 2004-04-15 2006-10-15 System and method for topology-aware job scheduling and backfilling in an hpc environment
US13/947,702 US20130304895A1 (en) 2004-04-15 2013-07-22 System and method for topology-aware job scheduling and backfilling in an hpc environment
US14/052,127 US9189278B2 (en) 2004-04-15 2013-10-11 System and method for topology-aware job scheduling and backfilling in an HPC environment
US14/052,093 US8984525B2 (en) 2004-04-15 2013-10-11 System and method for topology-aware job scheduling and backfilling in an HPC environment
US14/942,214 US9904583B2 (en) 2004-04-15 2015-11-16 System and method for topology-aware job scheduling and backfilling in an HPC environment
US15/449,150 US9928114B2 (en) 2004-04-15 2017-03-03 System and method for topology-aware job scheduling and backfilling in an HPC environment
US15/855,554 US20180121253A1 (en) 2004-04-15 2017-12-27 System and method for topology-aware job scheduling and backfilling in an hpc environment
US13/712,423 Continuation US9189275B2 (en) 2004-04-15 2012-12-12 System and method for topology-aware job scheduling and backfilling in an HPC environment
US20050235286A1 US20050235286A1 (en) 2005-10-20
US8336040B2 true US8336040B2 (en) 2012-12-18
US15/855,554 Pending US20180121253A1 (en) 2004-04-15 2017-12-27 System and method for topology-aware job scheduling and backfilling in an hpc environment
US10108411B2 (en) * 2015-10-08 2018-10-23 Lightbend, Inc. Systems and methods of constructing a network topology
2017-12-27 US US15/855,554 patent/US20180121253A1/en active Pending
Anonymous, "Cisco LocalDirector Configuration and Command Reference Guide," Internet Article, Online!, Apr. 4, 2001, pp. 1-12, XP002352335, Retrieved from the Internet: URL.http://www.k-state.edu/cns/project/KEAS/Cisco%20Hardware/Local-Director.htm, retrieved on Nov. 1, 2005, p. 1.1, p. 1.4, p. 3.9, p. 3.12.
Anonymous, "Cisco LocalDirector Configuration and Command Reference Guide," Internet Article, Online!, Apr. 4, 2001, pp. 1-12, XP002352335, Retrieved from the Internet: URL.http://www.k-state.edu/cns/project/KEAS/Cisco%20Hardware/Local—Director.htm, retrieved on Nov. 1, 2005, p. 1.1, p. 1.4, p. 3.9, p. 3.12.
Anonymous, "HP AlphaServer SC User Guide," Internet Article, Online!, Jul. 12, 2004, pp. 1-38, XP002336777, Retrieved from the Internet: URL:http://web1.quadrics.com/onlinedocs/AlphaServer/Eagle/html/AlphaServerUserGuide/, retrieved on Jul. 19, 2005, p. 3, p. 7, pp. 31, 33, and 34.
Cisco Systems, "Cisco 12012 Gigabit Switch Router Switch Fabric Cards Replacement Instructions", 2002, Doc. No. 78-4343-02, Cisco Systems, Inc., pp. 1-14. *
Communication from the European Patent Office, European Search Report for Application No. EP 05 25 2235, 3 pages, Jul. 22, 2005.
Communication from the European Patent Office, European Search Report for Application No. PCT/US2005/012314, 6 pages, Sep. 20, 2005, and Written Opinion of the International Search Authority, 7 pages.
Cukier, M. et al.; "AQuA: an adaptive architecture that provides dependable distributed objects"; 1998 Reliable Distributed Systems. Proceedings. Seventeenth 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, 1998.
Di Santo et al., "Kernel Implementation of Locality-Aware Dispatching Techniques for Web Server Clusters," Cluster Computing, 2003 Proceedings, pp. 154-162.
EPO Registered Letter, Application No. 05 252 239.8-1243, 6 pages, Mailed Feb. 2, 2007.
European Patent Office Communication for Application No. 07007897.7-2211; 12 pages, Mar. 19, 2009.
European Patent Office Communication Pursuant to Article 94(3) EPC for Application 07 007 897.7-2211, Ref. JL30003P. EPPD1; 7 pgs, Dated Feb. 22, 2011.
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 pgs), Jul. 27, 2010.
European Patent Office Communication, Netherlands Communication re: Summons to attend oral proceedings in accordance to Rule 115(1) EPC, for Application No. 05 252 240.6-1243 / 1662388, (8 pgs), Aug. 5, 2011.
European Patent Office Communication, Netherlands Communication re: Summons to attend oral proceedings in accordance to Rule 115(1) EPC, for Application No. 05 737 440.7-1244 / 1735949, (7 pgs), Aug. 4, 2011.
European Patent Office, Munich Germany, Communication re: Summons to attend oral proceedings pursuant to Rule 115(1) EPC, for Application No. 05 742 298.2-2224, Ref. JL 36198P.EPP, (7 pgs), Mailed: May 13, 2011.
European Patent Office, Netherlands, Communication pursuant to Article 94(3) EPC Office Action for Application No. 05 252 237.2-1243 / JL5127 (6 pgs), Aug. 2, 2011.
European Patent Office; Communicatin Pursuant to Article 94(3) EPC for Application No. 05 737 440.7-1244, Ref. JL36200P.EPP, 4 pages, Nov. 12, 2009.
European Patent Office; Communication Pursuant to Article 94(3) EPC for Application No. 05 732 940.1-2211, Ref. JL36196P.EPP, 4 pages, Jan. 15, 2010.
European Patent Office-Munich, Germany Communication re: Examining Div., oral proceedings of Sep. 22, 2011, Decision to refuse EU patent appl., Appl. 05 742 298.2-2224 / 1735708, Ref. JL36198P.EPP; Nov. 2, 2011 (Feb. 11, 2011).
Hans-Ulrich Heiss, "Processor Management in Two-Dimensional Grid-Architectures," Interner Bericht Nr. 20/92, XP002416087, 51 pages.
Haynes et al., "A Visualization Tool for Analyzing Cluster Performance Data," 42nd Annual Symposium on Foundations of Computer Science, (FOCS 2001), Oct. 8, 2001, pp. 295-302.
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, 1996.
Hovestadt et al., "Scheduling in HPC Resource Management Systems: Queuing vs. Planning", Proceedings of the 9th Workshop on Job Scheduling Strategies for Parallel Processing, Seattle, WA, pp. 1-19, Jun. 2003. *
Hyunseung Choo et al., "An Efficient Submesh Allocation Scheme for 3D Torus Multicomputer Systems," Parallel Algorithms/Architecture Synthesis, 1997 Proceedings, Second AIZU International Symposium AIZU-WAKAMATSU, Japan, Mar. 17-21, 1997, Los Alamitos, CA, Mar. 17, 1997, pp. 83-90, XP010218817 ISBN: 0-8186-7870-4, abstract, (p. 83, right-hand column, lines 2-20), (p. 87, left-hand column, lines 42-49).
Israel Patent Office Communication Re: Brief Translation of the Office Action, Re: Notice of Deficiences in Patent No. 178607 (4 pgs), Mailed: Sep. 13, 2010.
Israel Patent Office Communication Re: Brief Translation of the Office Action, Re: Notice of Deficiences in Patent No. 178608 (4 pgs), Mailed: Sep. 20, 2010.
Israel Patent Office Communication Re: Brief Translation of the Office Action, Re: Notice of Deficiences in Patent No. 178610 (4 pgs), Mailed Sep. 20, 2010.
Israel Patent Office Communication Re: Hebrew version and brief English Translation of Office Action, ref: Patent appl. No. 178606 (3 pgs) Mailed: Sep. 19, 2010.
Japanese Patent Office Communication, Japanese OA and English Translation for Appl No. 2007-508520, Ref.: JBBL/P0632, dated Jun. 17, 2011; (6 pgs), Jun. 28, 2011.
Japanese Patent Office Communication, Japanese Office Action and Translation of Office Action for Application No. 2005-117404, dated Aug. 26, 2011, (41 pgs), Mailed: Aug. 30, 2011.
Japanese Patent Office Communication, Japanese Office Action and Translation of Office Action for Application No. 2007-508456, dated Jul. 26, 2011, (11 pgs), Mailed: Aug. 2, 2011.
Jiun-Sheng et al., "Network Topology Structure on Board of Computer Cluster," Publication No. TW532011B, Data Supplied from the esp@cenet database-Worldwide, 1 page.
Jonsson et al., "Comparative Performance of InfiniBand Architecture and Gigabit Ethernet Interconnects on Intel® Itanium® 2 Microarchitecture-based Clusters", May 2003, 4th European LS-DYNA Users Conference, 10 pages. *
Kandlur et al., "Hypercube Management in the Presence of Node Failures", third conference on hypercube concurrent computers and applications ACM New York, 1988, pp. 328-336, vol. 1, XP002364194.
Keller et al., "Anatomy of a Resource Management System for HPC Clusters", Annual Review of Scalable Computing, vol. 3., pp. 1-23, 2001. *
Kimitalca et al., "Liquid Crystal Display Device," Abstracts of Japan for Publication No. 2005-241804, published Sep. 8, 2005, 2 pages.
Korean Patent Office Communication (KIPO) Ofice Action and English Translation re: Notice of Preliminary Rejection, Examination Results Summary,-Notification of Reason for Refusal; Application No. 10-2006-7023881, dated Apr. 26, 2011, (7 pgs).
Korean Patent Office Communication (KIPO) Ofice Action and English Translation re: Notice of Preliminary Rejection, Examination Results Summary,—Notification of Reason for Refusal; Application No. 10-2006-7023881, dated Apr. 26, 2011, (7 pgs).
Korean Patent Office Communication, Korean OA and Translation for Appl. No. 10-2006-7021323, dated Jul. 14, 2011, KIPO Examination Results Summary Ref: Detailed Grounds for Rejection (8 pgs).
Korean Patent Office Communication, OA and English Translation, Examination Results Summary re: KIPO's Notice of Preliminary Rejection (English Translation) for Application 10-2006-7023882, (4 pgs.), Jul. 18, 2011.
Malaysia Patent Office Communication re: Substantive Examination Adverse Report (Section 30(1)/30(2)) for Application No. PI 20051525, Filing Date Apr. 5, 2005, Ref. 7945MY4/PM/MS/WN (2 pgs), Mailed: Aug. 30, 2010.
Moore J. et al., "Managing Mixed-Use Clusters with Cluster-on-Demand," Internet Article, Nov. 2002, XP002311138, (p. 1, right-hand column, lines 10-41), (p. 2, right-hand column, lines 17-41), (p. 4, right-hand column, line 22), (p. 5, left-hand column, line 3).
Official Letter re: R.O.C. (Taiwanese) Application 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, Saint Island Int'l letter dated May 13, 2010.
Patel et al., "Sage: An Application Development Tool Suite for High Performance Computing Systems," Aerospace Conference Proceedings, 2000, IEEE, vol. 11, pp. 491-500.
Patent Application entitled, "Graphical User Interface for Managing HPC Clusters", 48 pages specification, claims and abstract, 10 pages of drawings, inventors Ballew et al, Apr. 15, 2004.
Patent Application entitled, "High Performance Computing System and Method", 47 pages specification, claims and abstract, 10 pages of drawings, inventors Ballew et al, Apr. 15, 2004.
Patent Application entitled, "System and Method for Cluster Management Based on HPC Architecture", 49 pages specification, claims and abstract, 10 pages of drawings, inventors Ballew et al, Apr. 15, 2004.
Patent Application entitled, "System and Method for Detecting and Managing HPC Node Failure", 49 pages specification, claims and abstract, 10 pages of drawings, inventors Ballew et al, Apr. 15, 2004.
Perbadanan Harat lntelek Malaysia; Malaysia Patent Office Communication re: Substantive Examination Adverse Report (Section 30(1)/30(2)) for Appl. No. PI 20051526, filing date Apr. 5, 2005, Ref. 7945MY2/PM/MS/AR (3 pgs), Mailed Jan. 31, 2011.
Ross et al., "Connectionless Transport: UDP," Internet Article, Online!, Feb. 22, 2001, pp. 1-4, XP002352336, Retrieved from the Internet: URL:http://web.archive.org/web/200100222023253/http://www-net.cs.umass.edu/kirose/transport/UDP.html., Feb. 22, 2001.
SearchStorage.com, "Look up Tech Terms-Switching fabric", retrieved on Oct. 6, 2009, http://search.techtarget.com, pp. 1-4. *
SearchStorage.com, "Look up Tech Terms—Switching fabric", retrieved on Oct. 6, 2009, http://search.techtarget.com, pp. 1-4. *
The Patent Office of the State Intellectual Property Office of the People's Republic of China, Office Action for Application No. 200510081719.3, 11 pages, Apr. 20, 2007.
Unknown, "Message Passing Interface (MPI)," Internet Article, Online!, Dec. 23, 2003, pp. 1-33, retrieved from the internet: URL:http//web.archive.org/web/20040102194825/http://www.llnl.gov/computing/tutorial s/mpi/>, retrieved on Jul. 18, 2005.
USPTO Final Office Action for U.S. Appl. No. 10/825,345, filed Apr. 15, 2004 Inventor Shannon V. Davidson.; (22 pgs), Notification Date Apr. 15, 2011.
USPTO Final Office Action for U.S. Appl. No. 10/825,539, filed Apr. 15, 2004 Inventor James D. Ballew et al.; (22 pgs), Notification Date Mar. 17, 2011.
USPTO Office Action for U.S. Appl. No. 10/825,345, filed Apr. 15, 2004 Inventor Shannon V. Davidson.; (18 pgs), Notification Date Oct. 28, 2010.
USPTO Office Action for U.S. Appl. No. 10/991,994, filed Nov. 17, 2004, Inventor Shannon V. Davidson; (14 pgs), Notification Date Jan. 19, 2011.
USPTO; Notice of Allowance and Fee(s) Due for U.S. Appl. No. 10/824, filed Apr. 15, 2004, Inventor James D. Ballew; (5 pgs), Mailed May 5, 2011.
USPTO; Notice of Allowance, U.S. Appl. No. 10/825,345, filed Apr. 15, 2004 in the name of Shannon V. Davidson; Notification Date Oct. 27, 2011.
USPTO; Notice of Allowance, U.S. Appl. No. 12/246,783, filed Oct. 7, 2008 in the name of Anthony N. Richoux; Notification Date Sep. 29, 2011.
USPTO; Office Action for U.S. Appl. No. 10/824,873, filed Apr. 15, 2004 in the name of Shannon V. Davidson; 14 pgs, Notification Date Nov. 18, 2011.
USPTO; Office Action for U.S. Appl. No. 10/991,994, filed Nov. 17, 2004 Inventor Shannon V. Davidson; (15 pgs), Aug. 19, 2011.
US8910175B2 (en) 2014-12-09
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BALLEW, JAMES D.;EARLY, GARY R.;DAVIDSON, SHANNON V.;REEL/FRAME:015225/0436
Free format text: CORRECTIVE ASSIGNMENT TO CHANGE CONVEYING PARTIES, DOCUMENT PREVIOUSLY RECORDED ON REEL 015225 FRAME 0439;ASSIGNORS:DAVIDSON, SHANNON V.;RICHOUX, ANTHONY N.;REEL/FRAME:016414/0620;SIGNING DATES FROM 20041103 TO 20041104
Free format text: CORRECTIVE ASSIGNMENT TO CHANGE CONVEYING PARTIES, DOCUMENT PREVIOUSLY RECORDED ON REEL 015225 FRAME 0439. ASSIGNOR CONFRIMS THE ASSIGNMENT;ASSIGNORS:DAVIDSON, SHANNON V.;RICHOUX, ANTHONY N.;SIGNING DATES FROM 20041103 TO 20041104;REEL/FRAME:016414/0620