IP Library › Granted Patent US 12,657,068
Granted Patent B2
US 12,657,068 · App. 19/030,316 · Granted Jun 16, 2026

Cluster computing

Inventors: Zvi Tannenbaum (Newport Coast, CA); Dean E. Dauger (Huntington Beach, CA)
Assignee: Advanced Cluster Systems, Inc.
G06F9/5072G06F9/54G06F15/76H04L41/04
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,657,068
App. No.
19/030,316
Granted
Jun 16, 2026
Kind
B2
Abstract

In some embodiments, a computer cluster system comprises a plurality of nodes and a software package comprising a user interface and a kernel for interpreting program code instructions. In certain embodiments, a cluster node module is configured to communicate with the kernel and other cluster node modules. The cluster node module can accept instructions from the user interface and can interpret at least some of the instructions such that several cluster node modules in communication with one another and with a kernel can act as a computer cluster.

Claims (52)

1 . A system for gathering data, the system comprising:

a non-transitory computer-readable memory that stores program code; and

a hardware processor that is in communication with the non-transitory computer-readable memory and that executes the program code to at least:

execute a command to distribute values among a plurality of processing nodes at least partially in parallel, wherein the plurality of processing nodes coordinate tasks with each other;

wherein the plurality of processing nodes comprise:

a first processing node that, when executing the command: sends a first value stored in a first memory to the remaining processing nodes of the plurality of processing nodes; receives a first set of values from the remaining processing nodes of the plurality of processing nodes; and stores the first set of values in the first memory, wherein the first value is sent to the remaining processing nodes while the first set of values are being received;

a second processing node that, when executing the command: sends a second value stored in a second memory to the remaining processing nodes of the plurality of processing nodes; receives a second set of values from the remaining processing nodes of the plurality of processing nodes; and stores the second set of values in the second memory, wherein the second value is sent to the remaining processing nodes while the second set of values are being received; and

a third processing node that, when executing the command: sends a third value stored in a third memory to the remaining processing nodes of the plurality of processing nodes; receives a third set of values from the remaining processing nodes of the plurality of processing nodes; and stores the third set of values in the third memory, wherein the third value is sent to the remaining processing nodes while the third set of values are being received.

2 . The system of claim 1 , wherein the hardware processor implements the first processing node.

3 . The system of claim 1 , wherein the first processing node comprises a root node.

4 . The system of claim 1 , wherein the first processing node accesses a non-volatile memory to access program code that when executed by the first processing node causes the first processing node to communicate with the second processing node via a first communications interface using a peer-to-peer architecture, wherein the second processing node communicates with the third processing node via a second communications interface using the peer-to-peer architecture; and wherein the third processing node communicates with the first processing node via a third communications interface using the peer-to-peer architecture.

5 . The system of claim 4 , wherein the non-volatile memory comprises the non-transitory computer-readable memory and wherein the program code of the non-volatile memory comprises the program code of the non-transitory computer-readable memory.

6 . The system of claim 4 , wherein the non-volatile memory comprises the first memory.

7 . The system of claim 1 , wherein each of the first processing node, the second processing node, and the third processing node accesses the program code from the non-transitory computer-readable memory, wherein executing the program code causes each of the first processing node, the second processing node, and the third processing node to communicate with a respective adjacent processing node of the plurality of processing nodes via a peer-to-peer architecture.

8 . The system of claim 1 , wherein each of the plurality of processing nodes is implemented by a different hardware processor.

9 . The system of claim 2 , wherein each of the plurality of processing nodes is implemented on the same computer system.

10 . The system of claim 1 , wherein each of the plurality of processing nodes is implemented on a different computer system.

11 . The system of claim 1 , wherein the command comprises a gather command.

12 . The system of claim 1 , wherein the command causes the values to be distributed among the plurality of processing nodes in parallel.

13 . A system for reducing data, the system comprising:

a non-transitory computer-readable memory that stores program code; and

a hardware processor that is in communication with the non-transitory computer-readable memory and that executes the program code to at least:

execute a command to distribute a reduced value set among a plurality of processing nodes at least partially in parallel, wherein the plurality of processing nodes coordinate tasks with each other;

wherein the plurality of processing nodes comprise:

a first processing node that, when executing the command: combines a first value set with a second value set and a third value set to obtain a combined value set; executes a mathematical expression on the combined value set to obtain a reduced value set; distributes the reduced value set among the plurality of processing nodes; and stores a first data set corresponding to the reduced value set in a first memory of the first processing node;

a second processing node that, when executing the command: sends the second value set to the first processing node and receives a second data set corresponding to the reduced value set from the first processing node; and

a third processing node that, when executing the command: sends the third value set to the first processing node and receives a third data set corresponding to the reduced value set from the first processing node, wherein the third value set is sent to the first processing node at least partially in parallel with the second value set being sent to the first processing node, and wherein the third data set is received at least partially in parallel with the second data set being received by the second processing node.

14 . The system of claim 13 , wherein the hardware processor implements the first processing node, and wherein a second hardware processor implements the second processing node.

15 . The system of claim 13 , wherein the first data set, the second data set, and the third data set each comprise a copy of the reduced value set.

16 . The system of claim 13 , wherein the first data set comprises a first portion of the reduced value set, the second data set comprises a second portion of the reduced value set, and the third data set comprises a third portion of the reduced value set.

17 . The system of claim 13 , wherein the first processing node communicates with the second processing node via a peer-to-peer architecture.

18 . The system of claim 13 , wherein the plurality of processing nodes communicate with each other using a communications network that implements peer-to-peer communication.

19 . The system of claim 13 , wherein the command comprises a reduce command.

20 . The system of claim 13 , wherein the command causes the reduced value set to be distributed among the plurality of processing nodes in parallel.

21 . A system for distributing values, the system comprising:

a non-transitory computer-readable memory that stores program code; and

a hardware processor in communication with the non-transitory computer-readable memory and configured to execute the program code to at least:

execute a command to distribute values from a plurality of processing nodes among the plurality of processing nodes at least partially in parallel, wherein the plurality of processing nodes coordinate tasks with each other;

wherein the plurality of processing nodes comprise:

a first processing node that, when executing the command: sends a first portion of a first set of values stored in a first memory to a second processing node;

sends a second portion of the first set of values to a third processing node; receives a first portion of a second set of values from the second processing node; receives a first portion of a third set of values from the third processing node; and stores the first portion of the second set of values and the first portion of the third set of values in the first memory, wherein the first portion of the first set of values and the second portion of the first set of values are sent while the first portion of the second set of values and the first portion of the third set of values are being received;

the second processing node that, when executing the command: sends the first portion of the second set of values stored in a second memory to the first processing node; sends a second portion of the second set of values to the third processing node; receives the first portion of the first set of values from the first processing node; receives a second portion of the third set of values from the third processing node; and stores the first portion of the first set of values and the second portion of the third set of values in the second memory, wherein the first portion of the second set of values and the second portion of the second set of values are sent while the first portion of the first set of values and the second portion of the third set of values are being received; and

the third processing node that, when executing the command: sends the first portion of the third set of values stored in a third memory to the first processing node; sends the second portion of the third set of values to the second processing node; receives the second portion of the first set of values from the first processing node; receives the second portion of the second set of values from the second processing node; and stores the second portion of the first set of values and the second portion of the second set of values in the third memory, wherein the first portion of the third set of values and the second portion of the third set of values are sent while the second portion of the first set of values and the second portion of the second set of values are being received.

22 . The system of claim 21 , wherein, absent an additional command, a third portion of the first set of values continues to be stored at the first memory after execution of the command.

23 . The system of claim 21 , wherein the first portion of the first set of values, the second portion of the first set of values, and a third portion of the first set of values are of equal size.

24 . The system of claim 21 , wherein the first portion of the first set of values, the first portion of the second set of values, and the first portion of the third set of values are of equal size.

25 . The system of claim 21 , wherein the first processing node, the second processing node, and the third processing node form a node cluster among which sets of values are distributed in response to the command.

26 . The system of claim 21 , wherein the first processing node receives values from each processing node of the plurality of processing nodes.

27 . The system of claim 21 , wherein the first processing node sends at least a portion of the first set of values to each processing node of the plurality of processing nodes.

28 . The system of claim 21 , wherein the first processing node accesses a non-volatile memory to access program code that when executed by the first processing node causes the first processing node to communicate with the second processing node via a communications interface using a peer-to-peer architecture.

29 . The system of claim 21 , wherein the command comprises an all-to-all command.

30 . The system of claim 21 , wherein the command causes the values to be redistributed among the plurality of processing nodes in parallel such that the distribution of values after the command differs from the distribution of values before the command.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 29, 2025
From: TANNENBAUM, ZVI; DAUGER, DEAN E.
To: ADVANCED CLUSTER SYSTEMS, INC.
Reel/Frame 072722/0094 →
Continuity (14)
Continuation 18666632 · May 16, 2024
Continuation 18479720 · Oct 2, 2023
Continuation 18158283 · Jan 23, 2023
Continuation 17374864 · Jul 13, 2021
Continuation 17374789 · Jul 13, 2021
Continuation 16449084 · Jun 21, 2019
Continuation 16449084 · Jun 21, 2019
Continuation 14181112 · Feb 14, 2014
Continuation 13423063 · Mar 16, 2012
Continuation 12040519 · Feb 29, 2008
Continuation In Part 11744461 · May 4, 2007
Provisional Application 60850908 · Oct 11, 2006
Provisional Application 60813738 · Jun 13, 2006
Related Publication 20250173196A1 · May 29, 2025
References Cited (400)
US 4739476A · Fiduccia · 1988 [cited by applicant]
US 5423046A · Nunnelley et al. · 1995 [cited by applicant]
US 5546023A · Borkar et al. · 1996 [cited by applicant]
US 5829052A · Pawlowski et al. · 1998 [cited by applicant]
US 5881315A · Cohen · 1999 [cited by applicant]
US 5930768A · Hooban · 1999 [cited by applicant]
US 6006259A · Adelman et al. · 1999 [cited by applicant]
US 6023753A · Pechanek et al. · 2000 [cited by applicant]
US 6047323A · Krause · 2000 [cited by applicant]
US 6067609A · Meeker et al. · 2000 [cited by applicant]
US 6074427A · Fought et al. · 2000 [cited by applicant]
US 6092098A · Araki · 2000 [cited by applicant]
US 6108699A · Moiin · 2000 [cited by applicant]
US 6151663A · Pawlowski et al. · 2000 [cited by applicant]
US 6167502A · Pechanek et al. · 2000 [cited by applicant]
US 6195680B1 · Goldszmidt et al. · 2001 [cited by applicant]
US 6202080B1 · Lu et al. · 2001 [cited by applicant]
US 6338129B1 · Pechanek et al. · 2002 [cited by applicant]
US 6418462B1 · Xu · 2002 [cited by applicant]
US 6438737B1 · Morelli et al. · 2002 [cited by applicant]
US 6449700B2 · Hagersten et al. · 2002 [cited by applicant]
US 6470441B1 · Pechanek et al. · 2002 [cited by applicant]
US 6546403B1 · Carlson, Jr. et al. · 2003 [cited by applicant]
US 6578068B1 · Bowman-Amuah · 2003 [cited by applicant]
US 6604134B2 · Haury · 2003 [cited by applicant]
US 6691216B2 · Kelly et al. · 2004 [cited by applicant]
US 6697773B1 · Karchmer et al. · 2004 [cited by applicant]
US 6728961B1 · Velasco · 2004 [cited by applicant]
US 6751698B1 · Deneroff et al. · 2004 [cited by applicant]
US 6769056B2 · Barry et al. · 2004 [cited by applicant]
US 6782537B1 · Blackmore et al. · 2004 [cited by applicant]
US 6856621B1 · Artes · 2005 [cited by applicant]
US 6859869B1 · Vorbach · 2005 [cited by applicant]
US 6865591B1 · Garg et al. · 2005 [cited by applicant]
US 6892291B2 · Pechanek et al. · 2005 [cited by applicant]
US 6904335B2 · Solomon · 2005 [cited by applicant]
US 6968335B2 · Bayliss et al. · 2005 [cited by applicant]
US 6968359B1 · Miller · 2005 [cited by examiner]
US 7003777B2 · Hines · 2006 [cited by applicant]
US 7015915B1 · Diard · 2006 [cited by applicant]
US 7031944B2 · Tanioka · 2006 [cited by applicant]
US 7065579B2 · Traversat et al. · 2006 [cited by applicant]
US 7093004B2 · Bernardin et al. · 2006 [cited by applicant]
US 7124404B1 · Bebout et al. · 2006 [cited by applicant]
US 7130305B2 · Kuukankorpi et al. · 2006 [cited by applicant]
US 7136924B2 · Dauger · 2006 [cited by applicant]
US 7136927B2 · Traversat et al. · 2006 [cited by applicant]
US 7139882B2 · Suzuoki et al. · 2006 [cited by applicant]
US 7146421B2 · Syvanne · 2006 [cited by applicant]
US 7162590B2 · Pruvost et al. · 2007 [cited by applicant]
US 7167920B2 · Traversat et al. · 2007 [cited by applicant]
US 7174381B2 · Gulko et al. · 2007 [cited by applicant]
US 7177874B2 · Jardin · 2007 [cited by applicant]
US 7197624B2 · Pechanek et al. · 2007 [cited by applicant]
US 7206841B2 · Traversat et al. · 2007 [cited by applicant]
US 7222339B2 · Rothman et al. · 2007 [cited by applicant]
US 7231337B1 · Karchmer et al. · 2007 [cited by applicant]
US 7249357B2 · Landman et al. · 2007 [cited by applicant]
US 7275123B2 · Duncan et al. · 2007 [cited by applicant]
US 7280540B2 · Halme et al. · 2007 [cited by applicant]
US 7289125B2 · Diard et al. · 2007 [cited by applicant]
US 7313619B2 · Torrant et al. · 2007 [cited by applicant]
US 7315877B2 · Bhanot et al. · 2008 [cited by applicant]
US 7325123B2 · Master et al. · 2008 [cited by applicant]
US 7334232B2 · Jacobs et al. · 2008 [cited by applicant]
US 7340500B2 · Traversat et al. · 2008 [cited by applicant]
US 7350036B2 · Kim et al. · 2008 [cited by applicant]
US 7401152B2 · Traversat et al. · 2008 [cited by applicant]
US 7401153B2 · Traversat et al. · 2008 [cited by applicant]
US 7437460B2 · Chidambaran et al. · 2008 [cited by applicant]
US 7469309B1 · Duncan et al. · 2008 [cited by applicant]
US 7472193B2 · Dauger · 2008 [cited by applicant]
US 7475225B2 · Jourdan et al. · 2009 [cited by applicant]
US 7502823B2 · Garg et al. · 2009 [cited by applicant]
US 7502915B2 · Jacob et al. · 2009 [cited by applicant]
US 7519652B2 · Page et al. · 2009 [cited by applicant]
US 7533141B2 · Nadgir et al. · 2009 [cited by applicant]
US 7533168B1 · Pabla et al. · 2009 [cited by applicant]
US 7533172B2 · Traversat et al. · 2009 [cited by applicant]
US 7533389B2 · Verbeke et al. · 2009 [cited by applicant]
US 7542981B2 · Choy et al. · 2009 [cited by applicant]
US 7554949B2 · Chen · 2009 [cited by applicant]
US 7562174B2 · Danilak · 2009 [cited by applicant]
US 7568115B2 · Borkar et al. · 2009 [cited by applicant]
US 7568131B2 · Vertes · 2009 [cited by applicant]
US 7574523B2 · Traversat et al. · 2009 [cited by applicant]
US 7596790B2 · Moakley · 2009 [cited by applicant]
US 7627744B2 · Maher et al. · 2009 [cited by applicant]
US 7631165B2 · Pechanek et al. · 2009 [cited by applicant]
US 7634530B2 · Dean et al. · 2009 [cited by applicant]
US 7644130B2 · Magro et al. · 2010 [cited by applicant]
US 7663633B1 · Diamond et al. · 2010 [cited by applicant]
US 7694158B2 · Melpignano et al. · 2010 [cited by applicant]
US 7698390B1 · Harkness et al. · 2010 [cited by applicant]
US 7716323B2 · Gole et al. · 2010 [cited by applicant]
US 7757236B1 · Singh · 2010 [cited by applicant]
US 7788314B2 · Holt · 2010 [cited by applicant]
US 7788465B2 · Pires Dos Reis Moreira et al. · 2010 [cited by applicant]
US 7814462B2 · Husbands et al. · 2010 [cited by applicant]
US 7831713B2 · Torrant et al. · 2010 [cited by applicant]
US 7835022B2 · Matsumoto · 2010 [cited by applicant]
US 7861060B1 · Nickolls et al. · 2010 [cited by applicant]
US 7870081B2 · Li et al. · 2011 [cited by applicant]
US 7937455B2 · Saha et al. · 2011 [cited by applicant]
US 7962716B2 · Master et al. · 2011 [cited by applicant]
US 7996592B2 · Kim et al. · 2011 [cited by applicant]
US 8010593B2 · Master et al. · 2011 [cited by applicant]
US 8074224B1 · Nordquist et al. · 2011 [cited by applicant]
US 8082289B2 · Tannenbaum et al. · 2011 [cited by applicant]
US 8117288B2 · Bhanot et al. · 2012 [cited by applicant]
US 8140612B2 · Tannenbaum et al. · 2012 [cited by applicant]
US 8160077B2 · Traversat et al. · 2012 [cited by applicant]
US 8176189B2 · Traversat et al. · 2012 [cited by applicant]
US 8271605B2 · Torrant et al. · 2012 [cited by applicant]
US 8321849B2 · Nickolls et al. · 2012 [cited by applicant]
US 8341381B2 · Pechanek et al. · 2012 [cited by applicant]
US 8356161B2 · Master et al. · 2013 [cited by applicant]
US 8359397B2 · Traversat et al. · 2013 [cited by applicant]
US 8402080B2 · Tannenbaum et al. · 2013 [cited by applicant]
US 8402083B2 · Tannenbaum et al. · 2013 [cited by applicant]
US 8533431B2 · Master et al. · 2013 [cited by applicant]
US 8539207B1 · LeGrand · 2013 [cited by applicant]
US 8543794B2 · Master et al. · 2013 [cited by applicant]
US 8543795B2 · Master et al. · 2013 [cited by applicant]
US 8601101B1 · Singh · 2013 [cited by examiner]
US 8676877B2 · Tannenbaum et al. · 2014 [cited by applicant]
US 8726278B1 · Shawver et al. · 2014 [cited by applicant]
US 8849889B1 · Tannenbaum et al. · 2014 [cited by applicant]
US 8924690B2 · Fossum et al. · 2014 [cited by applicant]
US 8941668B2 · Diamond · 2015 [cited by applicant]
US 9164952B2 · Master et al. · 2015 [cited by applicant]
US 9390057B2 · Pechanek et al. · 2016 [cited by applicant]
US 9405564B2 · Muellers et al. · 2016 [cited by applicant]
US 10313260B2 · Torrant et al. · 2019 [cited by applicant]
US 10333768B2 · Tannenbaum et al. · 2019 [cited by applicant]
US 11128519B2 · Tannenbaum et al. · 2021 [cited by applicant]
US 11563621B2 · Tannenbaum et al. · 2023 [cited by applicant]
US 11570034B2 · Tannenbaum et al. · 2023 [cited by applicant]
US 11811582B2 · Tannenbaum et al. · 2023 [cited by applicant]
US 12021679B1 · Tannenbaum et al. · 2024 [cited by applicant]
US 20020013832A1 · Hubbard · 2002 [cited by applicant]
US 20020049859A1 · Bruckert et al. · 2002 [cited by applicant]
US 20020091752A1 · Firlie · 2002 [cited by applicant]
US 20020143944A1 · Traversat et al. · 2002 [cited by applicant]
US 20020161768A1 · Miller et al. · 2002 [cited by applicant]
US 20020198932A1 · Wagner · 2002 [cited by applicant]
US 20030005068A1 · Nickel et al. · 2003 [cited by applicant]
US 20030005266A1 · Akkary et al. · 2003 [cited by applicant]
US 20030051062A1 · Circenis · 2003 [cited by applicant]
US 20030074393A1 · Peart · 2003 [cited by applicant]
US 20030121027A1 · Hines · 2003 [cited by applicant]
US 20030135621A1 · Romagnoli · 2003 [cited by applicant]
US 20030177240A1 · Gulko et al. · 2003 [cited by applicant]
US 20030195931A1 · Dauger · 2003 [cited by applicant]
US 20030195938A1 · Howard · 2003 [cited by examiner]
US 20030217112A1 · Emmot · 2003 [cited by applicant]
US 20030220960A1 · Demoff et al. · 2003 [cited by applicant]
US 20040015968A1 · Neiman et al. · 2004 [cited by applicant]
US 20040098359A1 · Bayliss et al. · 2004 [cited by applicant]
US 20040098373A1 · Bayliss et al. · 2004 [cited by applicant]
US 20040098447A1 · Verbeke et al. · 2004 [cited by applicant]
US 20040110209A1 · Yokota et al. · 2004 [cited by applicant]
US 20040157203A1 · Dunk · 2004 [cited by applicant]
US 20040195572A1 · Kato et al. · 2004 [cited by applicant]
US 20040225443A1 · Kamps · 2004 [cited by applicant]
US 20040252710A1 · Jeter, Jr. et al. · 2004 [cited by applicant]
US 20040254984A1 · Dinker · 2004 [cited by applicant]
US 20050015460A1 · Goyle et al. · 2005 [cited by applicant]
US 20050021751A1 · Block · 2005 [cited by examiner]
US 20050033818A1 · Jardin · 2005 [cited by applicant]
US 20050038852A1 · Howard · 2005 [cited by applicant]
US 20050060237A1 · Barsness et al. · 2005 [cited by applicant]
US 20050076105A1 · Keohane et al. · 2005 [cited by applicant]
US 20050097300A1 · Gildea et al. · 2005 [cited by applicant]
US 20050108394A1 · Braun et al. · 2005 [cited by applicant]
US 20050132379A1 · Sankaran et al. · 2005 [cited by applicant]
US 20050154789A1 · Fellenstein et al. · 2005 [cited by applicant]
US 20050160398A1 · Bjornson et al. · 2005 [cited by applicant]
US 20050165932A1 · Banerjee et al. · 2005 [cited by applicant]
US 20050180095A1 · Ellis · 2005 [cited by applicant]
US 20050185662A1 · Sheehan · 2005 [cited by applicant]
US 20050188055A1 · Saletore · 2005 [cited by applicant]
US 20050188088A1 · Fellenstein et al. · 2005 [cited by applicant]
US 20050198469A1 · Mitchell · 2005 [cited by applicant]
US 20050201272A1 · Wang et al. · 2005 [cited by applicant]
US 20050207421A1 · Suzuki · 2005 [cited by applicant]
US 20050235055A1 · Davidson · 2005 [cited by applicant]
US 20050235264A1 · Hines · 2005 [cited by applicant]
US 20050246682A1 · Hines · 2005 [cited by applicant]
US 20050251580A1 · Tu · 2005 [cited by applicant]
US 20050251644A1 · Maher et al. · 2005 [cited by applicant]
US 20060026161A1 · Henseler · 2006 [cited by applicant]
US 20060026601A1 · Solt · 2006 [cited by applicant]
US 20060037016A1 · Saha et al. · 2006 [cited by applicant]
US 20060053216A1 · Deokar et al. · 2006 [cited by applicant]
US 20060059473A1 · Moler · 2006 [cited by applicant]
US 20060069811A1 · Kelly · 2006 [cited by applicant]
US 20060101050A1 · Choy et al. · 2006 [cited by applicant]
US 20060106931A1 · Richou · 2006 [cited by applicant]
US 20060107266A1 · Martin et al. · 2006 [cited by applicant]
US 20060153201A1 · Hepper et al. · 2006 [cited by applicant]
US 20060179436A1 · Yasue · 2006 [cited by applicant]
US 20070044099A1 · Rajput · 2007 [cited by applicant]
US 20070073705A1 · Gray · 2007 [cited by examiner]
US 20070094214A1 · Li et al. · 2007 [cited by applicant]
US 20070094532A1 · Sengupta · 2007 [cited by examiner]
US 20070124363A1 · Lurie et al. · 2007 [cited by applicant]
US 20070124684A1 · Riel et al. · 2007 [cited by applicant]
US 20080250347A1 · Gray et al. · 2008 [cited by applicant]
US 20080281997A1 · Archer et al. · 2008 [cited by applicant]
US 20090037691A1 · Master et al. · 2009 [cited by applicant]
US 20200007458A1 · Torrant et al. · 2020 [cited by applicant]
US 20230308339A1 · Tannenbaum et al. · 2023 [cited by applicant]
US 20250147817A1 · Tannenbaum et al. · 2025 [cited by applicant]
US 20250173195A1 · Tannenbaum et al. · 2025 [cited by applicant]
US 20250173197A1 · Tannenbaum et al. · 2025 [cited by applicant]
EP 1229442 · 2002 [cited by applicant]
EP 1229443 · 2002 [cited by applicant]
EP 1368948 · 2003 [cited by applicant]
EP 1501013 · 2005 [cited by applicant]
JP 08087473 · 1996 [cited by applicant]
JP 10275125 · 1998 [cited by applicant]
JP 10301875 · 1998 [cited by applicant]
JP 11126196 · 1999 [cited by applicant]
JP 11224245 · 1999 [cited by applicant]
JP 11272622 · 1999 [cited by applicant]
JP 11328134 · 1999 [cited by applicant]
JP 2000315160 · 2000 [cited by applicant]
JP 3495010 · 2001 [cited by applicant]
JP 2001229145 · 2001 [cited by applicant]
JP 2002117010 · 2002 [cited by applicant]
JP 2002223214 · 2002 [cited by applicant]
JP 2004061359 · 2004 [cited by applicant]
JP 2004247405 · 2004 [cited by applicant]
JP 3601955 · 2004 [cited by applicant]
JP 2005071333 · 2005 [cited by applicant]
JP 3628514 · 2005 [cited by applicant]
JP 2005063033 · 2005 [cited by applicant]
JP 2006031699 · 2006 [cited by applicant]
JP 2009519548 · 2009 [cited by applicant]
WO WO02033564 · 2002 [cited by applicant]
WO WO02035799 · 2002 [cited by applicant]
WO WO02057917 · 2002 [cited by applicant]
WO WO2004086270 · 2004 [cited by applicant]
WO WO2005091129 · 2005 [cited by applicant]
WO WO2006050404 · 2006 [cited by applicant]
“128-Xserve G5 Cluster Achieves 1.21 TeraFlop”, Jan. 14, 2005, https://www.hpcwire.com/2005/01 /14/128-xserve-g5-cluster-achieves-1-21-teraflop/, pp. 2. [NVIDIA-ACS-0239003-NVIDIA-ACS-0239004]. [cited by applicant]
Abdennadher et al., “A Large Scale Distributed Platform for High Performance Computing”, Conference Paper, Grid and Cooperative Computing—GCC 2005, LNPSE,vol. 3795, pp. 848-859. [cited by applicant]
Advanced Cluster Systems, LLC, “Math Supercomputer-In-A-Box”, 2007, pp. 1. [NVIDIA-ACS-0237306]. [cited by applicant]
Affidavit of Elizabeth Rosenberg, dated Sep. 1, 2020 in 7 pages. [NVIDIA-ACS-0163529, NVIDIA-ACS-0227196 & NVIDIA-ACS-0231075]. [cited by applicant]
Agarwal et al., “A High Performance Parallel Algorithm for 1-D FFT”, Proceedings, Supercomputing '94, Washington, D.C., Nov. 14-18, 1994, pp. 34-40 (17 Total pages). [NVIDIA-ACS-0163536 & NVIDIA-ACS-0227225]. [cited by applicant]
Annaratone et al., “The Warp Computer: Architecture, Implementation, and Performance”, Dept. of Computer Science, The Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, Jul. 1987, pp. 31. [cited by applicant]
AppleSeed Development p. Apr. 12, 2004 https://web.archive.org/web/20050317034217/http:/exodus.physics.ucla.edu/appleseed/dev/developer.html as archived Mar. 17, 2005, pp. 6. [NVIDIA-ACS-0165922]. [cited by applicant]
Balay et al., “PETSc Users Manual”, ANL-95/11—Revision 2.3.2, Argonne National Laboratory, Sep. 1, 2006, pp. 184. [NVIDIA-ACS-0168513]. [cited by applicant]
Barnell et al., “Migrating Modeling and Simulation Applications on to High Performance Computers”, SPIE Enabling Technologies for Simulation Science X Conference, Apr. 18, 2006, pp. 8. [NVIDIA-ACS-0234890]. [cited by applicant]
Bekker, Scott, “HPC Edition of Windows Server 2003 on Tap for 2005”, ENT News, Jun. 23, 2004, pp. 3. [NVIDIA-ACS-0238318-NVIDIA-ACS-0238320]. [cited by applicant]
Bekker, Scott, “Microsoft Enterprise Product Roadmap for 2005”, Redmond Channel Partner, Jan. 10, 2005, pp. 14. https://rcpmag.com/articles/2005/01/10/microsoft-enterprise-product-roadmap-for-2005.aspx [NVIDIA-ACS-02393… [cited by applicant]
Bekker, Scott, “Muglia Updates Windows Server Roadmap”, MCP Mag, Dec. 10, 2004, pp. 5. https://mcpmag.com/articles/2004/12/10/muglia-updates-windows-server-roadmap.aspx [NVIDIA-ACS-0239405-NVIDIA-ACS-0239409]. [cited by applicant]
Bernardin, Laurent, “Maple on the Intel Paragon”, Oct. 15, 1996, pp. 7. https://www.research-collection.ethz.ch/handle/20.500.11850/68829 [NVIDIA-ACS-0172328-NVIDIA-ACS-0172334]. [cited by applicant]
Bósa et al., “Task Logging, Rescheduling and Peer Checking in Distributed Maple”, RISC-Linz, Johannes Kepler University, Linz, Austria. Technical Report No. 02-10, Mar. 18, 2002, pp. 24. [NVIDIA-ACS-0165235 & NVIDIA-ACS… [cited by applicant]
Bridges et al., “Users' Guide to mpich, a Portable Implementation of MPI”, Sep. 18, 1995, pp. 35. [NVIDIA-ACS-0235035]. [cited by applicant]
Buchberger et al., “Concert, A Software Architecture for Coordinating Education Sessions in Distributed Environments”, RISC-Linz Technical Report 97-04, Feb. 17, 1997, pp. 60. [NVIDIA-ACS-0169480]. [cited by applicant]
Buck et al., “Brook for GPUs”, Presentation, Feb. 10, 2003, pp. 19. [NVIDIA-ACS-0166705]. [cited by applicant]
Buck et al., “Brook for GPUs: Stream Computing on Graphics Hardware”, 2004, pp. 777-786. [NVIDIA-ACS-0166724]. [cited by applicant]
Buck et al., “Brook for GPUs: Stream Computing on Graphics Hardware”, Presentation, SIGGRAPH2004, 2004, pp. 36. [NVIDIA-ACS-0166734]. [cited by applicant]
Buck, Ian, “Brook: A Streaming Programming Language”, Oct. 8, 2001, pp. 12. [NVIDIA-ACS-0166693]. [cited by applicant]
Buck, Ian, “GPU Computing with NVIDIA CUDA”, SiIGGPRAH 2007, pp. 29. [NVIDIA-ACS-0166770 & NVIDIA-ACS-0166799]. [cited by applicant]
Buck, Ian, “From Brook to CUDA”, GPU Technology Conference, 2009, pp. 30. [NVIDIA-ACS-0166955]. [cited by applicant]
Buck, Ian, “Stream Computing on Graphics Hardware”, Dissertation, Stanford University, Sep. 2006, pp. 106. [NVIDIA-ACS-0166849]. [cited by applicant]
Buck, Ian, “TESLA, GPU Computing, Past, Present, Future”, Presentation, 2012, pp. 21. [NVIDIA-ACS-0166828]. [cited by applicant]
Burns et al., “LAM: An Open Cluster Environment for MPI”, Ohio Supercomputer Center, Colombus, OH, 2001, pp. 8. [NVIDIA-ACS-0168697]. [cited by applicant]
Carns et al., “An Evaluation of Message Passing Implementations on Beowulf Workstations”, Aerospace Conference, Mar. 6-13, 1999, IEEE 1999, vol. 5, pp. 41-54. [cited by applicant]
CCS Sample RIS Scripts, 2003, pp. 55. [NVIDIA-ACS-0237326-NVIDIA-ACS-0237380]. [cited by applicant]
“Chapter 4, Merrimac: The Streaming Supercomputer”, 2003, pp. 155-209. [NVIDIA-ACS-0167001]. [cited by applicant]
Chen, Julian Yu-Chung, “Fast Fourier Transform with BrookGPU”, Apr. 25, 2006, pp. 16. [NVIDIA-ACS-0166985]. [cited by applicant]
Cheng et al., “Fast Sorting on a Distributed-Memory Architecture”, Dec. 2004, pp. 7. [NVIDIA-ACS-0234898]. [cited by applicant]
Chinchilla et al., “Parallel N-Body Simulation using GPUs”, Technical Report TR04-032, Dec. 2004, pp. 8. [NVIDIA-ACS-0165482-NVIDIA-ACS-0165489]. [cited by applicant]
Choy et al., “Parallel MATLAB: Doing it Right”, Proceedings of the IEEE, vol. 93, No. 2, Feb. 2005, pp. 331-341 [NVIDIA-ACS-0168766]. [cited by applicant]
Choy et al., “MATLAB*P 2.0: A Unified Parallel MATLAB”, MIT DSpace, Computer Science Collection, Jan. 2003, pp. 6. [NVIDIA-ACS-0168705]. [cited by applicant]
Choy et al., “Star-P: High {Productivity Parallel Computing”, Jun. 9, 2004, pp. 2. [NVIDIA-ACS-0234905]. [cited by applicant]
Choy et al., “Star-P: High {Productivity Parallel Computing”, Presentation Agenda, Jun. 9, 2004, pp. 33. [NVIDIA-ACS-0168777]. [cited by applicant]
Choy, Long Yin, “MATLAB*P 2.0: Interactive Supercomputing Made Practical”, Thesis, MIT, Sep. 2002, pp. 67. [NVIDIA-ACS-0168810, NVIDIA-ACS-0233448 & NVIDIA-ACS-0233683]. [cited by applicant]
Choy, Long Yin, “Chapter 1”, Draft, MIT, Sep. 2002, pp. 16. [NVIDIA-ACS-0233432-NVIDIA-ACS-0233447]. [cited by applicant]
Choy, Ron, “Parallel MATLAB: Doing it Right”, Presentation, MIT, 2005, pp. 55. [NVIDIA-ACS-0168711]. [cited by applicant]
Choy, Ron, “Source Code”, Project Status, Matlab*P 1.0 & Matlab*P 2.0, as archived Dec. 13, 2002, in 1 page. https://web.archive.org/web/20021213224219fw_/http:/theory.lcs.mit.edu/˜cly/download.html. [cited by applicant]
Chu et al., “FFT Algorithms and their Adaptation to Parallel Processing”, Linear Algebra and its Applications, vol. 284, 1998, pp. 95-124. [NVIDIA-ACS-0163554, NVIDIA-ACS-0221165 & NVIDIA-ACS-0227333]. [cited by applicant]
“Compute Cluster Job Aids”, Windows Server 2003 Deployment Kit, 2003, pp. 80. [NVIDIA-ACS-0238212-NVIDIA-ACS-0238291]. [cited by applicant]
“Compute Cluster Server: Getting Started”, 2006, pp. 1. [NVIDIA-ACS-0238300]. [cited by applicant]
“Compute Cluster Server Glossary”, Dec. 5, 2005, pp. 6. [NVIDIA-ACS-0238292-NVIDIA-ACS-0238297]. [cited by applicant]
“Compute Cluster Server Setup Command-Line Interface Reference”, Jun. 6, 2006, pp. 2. [NVIDIA-ACS-0238298-NVIDIA-ACS-0238299]. [cited by applicant]
“Compute Cluster Server: Technical Reference”, 2007, pp. 2. [NVIDIA-ACS-0238301-NVIDIA-ACS-0238302]. [cited by applicant]
Cotronis et al., “Recent Advances in Parallel Virtual Machine and Message Passing Interface”, 8th European PVM/MPI Users' Group Meeting, Santorini/Thera, Greece, Sep. 2001, Proceedings, pp. 456, [NVIDIA-ACS-0170449-NVID… [cited by applicant]
Cownie et al., “A Standard Interface for Debugger Access to Message Queue Information in MPI”, Conference Paper, Sep. 1999, pp. 9. [NVIDIA-ACS-0232908-NVIDIA-ACS-0232916]. [cited by applicant]
Cramer, et al., “The Development and Integration of a Distributed 3D FFT for a Cluster of Workstations”, Proceedings of the 4th Annual Linux Showcase & Conference, Atlanta, GA, Oct. 10-14, 2000, pp. 1-9. [NVIDIA-ACS-016… [cited by applicant]
Dally et al., “A Streaming Supercomputer”, Sep. 18, 2001, pp. 17. [NVIDIA-ACS-0167056]. [cited by applicant]
Dally et al., “Merrimac: Supercomputing with Streams”, SC'03, Nov. 15-21, 2003, Phoenix, AZ, pp. 8. [NVIDIA-ACS-0167073]. [cited by applicant]
Dauger, Dean, “DR's Pooch Cluster Software for Mac OS X v10.4 ‘Tiger’”, https://www.prweb.com/releases/2005/04/prweb234831.htm, Apr. 29, 2005, pp. 3. [NVIDIA-ACS-0239021-NVIDIA-ACS-0239023]. [cited by applicant]
Dauger, Dean, “Pooch Application”, Pooch Quick Start, Parallel Operation and Control Heuristic. Application, Version 1.2.1, 2002, pp. 61. [DR_NVIDIA_000006-DR_NVIDIA_000066]. [cited by applicant]
Dauger, Dean, “Pooch Application”, Pooch Quick Start, Parallel Operation and Control Heuristic Application, Version 1.4, 2004, pp. 82. [DR_NVIDIA_000160-DR_NVIDIA_000241]. [cited by applicant]
Dauger, Dean, “Pooch Application”, Parallel Operation and Control Heuristic Application, Version 1.3.5, 2003, pp. 67. [DR_NVIDIA_000400-DR_NVIDIA_000466]. [cited by applicant]
Dauger, Dean, “Simulation and Study of Fresnel Diffraction for Arbitrary two-dimensional Apertures”, Computers in Physics, vol. 10, No. 6, Nov./Dec. 1996, pp. 15. [NVIDIA-ACS-0165941]. [cited by applicant]
Dauger, Dean, “The Launch Den Mother and Launch Puppy”, Advanced Information, 2000, pp. 10. [DR_NVIDIA_000713-DR_NVIDIA_000722] & [NVIDIA-ACS-0239381-NVIDIA-ACS-0239390]. [cited by applicant]
Dauger, Dean, “The Launch Den Mother and Launch Puppy”, Read Me, 1999, pp. 10. [DR_NVIDIA_000703-DR_NVIDIA_000712]. [cited by applicant]
Dauger et al., “Numerically-Intensive ‘Plug-and-Play’ Parallel Computing”, Proceedings. 2001 IEEE Cluster, pp. 8. [ACS_NVIDIA_005621-ACS_NVIDIA_005628]. [cited by applicant]
Dauger et al., “Numerically-Intensive ‘Plug-and-Play’ Parallel Computing”, Proceedings. 2001 IEEE Cluster, pp. 8. [ACS_NVIDIA_005654-ACS_NVIDIA_005661]. [cited by applicant]
Dauger, Dean E., “‘Plug-and-Play’ Cluster Computing Brings HPC to the Mainstream”, 2007, pp. 1. [NVIDIA-ACS-0239454]. [cited by applicant]
Dauger, Dean E., “Semiclassical Modeling of Quantum-Mechanical Multiparticle Systems using Parallel Particle-In-Cell Methods”, Dissertation, 2001, pp. 291. [NVIDIA-ACS-0166004]. [cited by applicant]
Dauger et al., “Clúster de Cómputo ‘Enchufar y Listo’”, “‘Plug-and-Play’ Cluster Computing”, 2006, pp. 9, http://daugerresearch.com/vault/clcarPnPCluster.pdf [NVIDIA-ACS-0166502]. [cited by applicant]
Dauger et al., “‘Plug-and-Play’ Cluster Computing using Mac OS X”, Proceedings. 2003 IEEE International Conference on Cluster Computing, Dec. 1-4, 2003, published Jan. 2004, pp. 6. [ACS_NVIDIA_005715 & NVIDIA-ACS-016634… [cited by applicant]
Dauger et al., “‘Plug-and-Play’ Cluster Computing: High-Performance Computing for the Mainstream”, Computing in Science & Engineering, Jan. /Feb. 2005, pp. 22-28. [ACS_NVIDIA_005607 & NVIDIA-ACS-0166485]. [cited by applicant]
Dauger et al., “Plug-and-Play Cluster Computing: High-Performance Computing for the Mainstream”, IEEE Computing in Science and Engineering, Mar./Apr. 2005, pp. 27-33. [NVIDIA-ACS-0163598 & NVIDIA-ACS-0166495]. [cited by applicant]
Dauger et al., “‘Plug-and-Play’ Cluster Computing: HPC Designed for the Mainstream Scientist”, ICCS 2005, pp. 7. [ACS-NVIDIA-005614, NVIDIA-ACS-0170905 & NVIDIA-ACS-0166475]. [cited by applicant]
Dauger et al., “Semiclassical Modeling of Multiparticle Quantum Systems Using High-Performance Clustering and Visualization on the Macintosh”, 2006, pp. 1. [NVIDIA-ACS-0166510]. [cited by applicant]
Dauger Research, Computing in Science & Engineering, Excerpt, Mar./Apr. 2005, pp. 2. [ACS_NVIDIA_005634-ACS_NVIDIA_005635]. [cited by applicant]
Dauger Research, “Keeping America Strong Award”, 2005, pp. 3. [NVIDIA-ACS-0239455-NVIDIA-ACS-0239457]. [cited by applicant]
Dauger Research, “Parallel Zoology”, Dauger Research Vault, 2006, pp. 7. [NVIDIA-ACS-0237202-NVIDIA-ACS-0237208]. [cited by applicant]
Dauger Research, “Parallelization”, Dauger Research Vault, 2006, pp. 3. [NVIDIA-ACS-0237209-NVIDIA-ACS-0237211]. [cited by applicant]
Dauger Research, “Parallelization—Parallel Adder”, Dauger Research Vault, 2006, pp. 7. [NVIDIA-ACS-0237154-NVIDIA-ACS-0237160]. [cited by applicant]
Dauger Research, “Parallelization—Parallel Circle Pi”, Dauger Research Vault, 2006, pp. 13. [NVIDIA-ACS-0237161-NVIDIA-ACS-0237173]. [cited by applicant]
Dauger Research, “Parallelization—Parallel Knock”, Dauger Research Vault, 2006, pp. 4. [NVIDIA-ACS-0237174-NVIDIA-ACS-0237177]. [cited by applicant]
Dauger Research, “Parallelization—Parallel Life”, Dauger Research Vault, 2006, pp. 14. [NVIDIA-ACS-0237178-NVIDIA-ACS-0237191]. [cited by applicant]
Dauger Research, “Parallelization—Parallel Pascal's Triangle”, Dauger Research Vault, 2006, pp. 10. [NVIDIA-ACS-0237192-NVIDIA-ACS-0237201]. [cited by applicant]
Dauger Research, “Pooch Application: Parallel Operation and Control Heuristic Application”, Dauger Research Vault, Apr. 28, 2001, pp. 1. [NVIDIA-ACS-0239122]. [cited by applicant]
Dauger Research, “Pooch Quick Start”, Pooch Application, Parallel Operation and Control Heuristic Application, Version 1.3, 2002, pp. 65. [NVIDIA-ACS-0239123-NVIDIA-ACS-0239187]. [cited by applicant]
Dauger Research, “Pooch Quick Start”, Pooch Application, Parallel Operation and Control Heuristic Application, Version 1.4, 2004, pp. 82. [NVIDIA-ACS-0239188-NVIDIA-ACS-0239269]. [cited by applicant]
Dauger Research, “Pooch Quick Start”, Pooch Application, Parallel Operation and Control Heuristic Application, Version 1.5, 2004, pp. 98. [NVIDIA-ACS-0239270 & NVIDIA-ACS-0166377]. [cited by applicant]
Dauger Research, “Plug-and-Play” Clustering, Build your cluster in minutes!, Apple HPC Seminar Series, 2002, pp. 66. [ACS_NVIDIA_001238-ACS_NVIDIA_001303]. [cited by applicant]
Dauger Research, “Pooch Selected for Omneta Supercomputer”, Paris, France, Apple Expo, Sep. 21, 2005, pp. 1. [NVIDIA-ACS-0239020]. [cited by applicant]
Dauger Research, “Pooch, Build Your Personal Computing Cluster in minutes!”, 2004, pp. 4. [DR_NVIDIA_000002-DR_NVIDIA_000005]. [cited by applicant]
Dauger Research, “Pooch”, Supercomputer-Style Cluster Computing Support for Mathematica, 2006, pp. 4. [NVIDIA-ACS-0237307-NVIDIA-ACS-0237310]. [cited by applicant]
Dauger Research, “Supercomputing Engine for Mathematica”, Advanced Cluster Systems, LLC and Dauger Research, 2006. pp. 20. [NVIDIA-ACS-0166511]. [cited by applicant]
Dauger Research, “Supercomputing Engine for Mathematica”, Machine Evaluation Workshop, UK, Dec. 2008, Advanced Cluster Systems, LLC and Dauger Research, pp. 39. [NVIDIA-ACS-0166576]. [cited by applicant]
Dauger Research, “The PoochMPI Toolkit”, High-Performance Computing with Mathematica, Wolfram Technology Conference 2006, Champaign, IL, pp. 45. [NVIDIA-ACS-0237217 & NVIDIA-ACS-0166531]. [cited by applicant]
Dauger Research, “Visualizing Message Passing with MacMPI”, Dauger Research Vault, 2006, pp. 5. [NVIDIA-ACS-0237212-NVIDIA-ACS-0237216]. [cited by applicant]
Dauger Research, “What's New”, SET and SET/Scilab debut at Supercomputing 2012, 2012. pp. 25. [NVIDIA-ACS-0239458-NVIDIA-ACS-0239482]. [cited by applicant]
Declaration of Henry Tufo, Ph.D., under 37 C.F.R. § 1.68 in Support of Petition for Inter Partes Review of U.S. Pat. No. 8,082,289, dated Sep. 18, 2020 in 160 pages. [cited by applicant]
Declaration of Sylvia Hall-Ellis Ph.D., for Inter Partes Review of U.S. Pat. No. 8,082,289, dated Sep. 18, 2020 in 138 pages, [NVIDIA-ACS-0163606-NVIDIA-ACS-0163743]. [cited by applicant]
Declaration of Wolfgang Schreiner, Ph.D., for Inter Partes Review of U.S. Pat. No. 8,082,289, dated Sep. 7, 2020 in 84 pages. [NVIDIA-ACS-0163744-NVIDIA-ACS-0163827]. [cited by applicant]
Declaration of Wolfgang Schreiner, Ph.D., for Inter Partes Review of U.S. Pat. No. 10,333,768, dated Oct. 1, 2020 in 85 pages. [NVIDIA-ACS-0170912-NVIDIA-ACS-0170996]. [cited by applicant]
Decyk, Viktor K., “Advanced PIC Techniques: Parallelization and Object-Oriented Programming”, Proceedings of ISSS-7, Mar. 26-31, 2005, pp. 3. [NVIDIA-ACS-0170997 & NVIDIA-ACS-0166482]. [cited by applicant]
Decyk et al., “AppleSeed: A Parallel Macintosh Cluster for Numerically Intensive Computing”, Abstract, 1999, pp. 1. [ACS_NVIDIA_0165956]. [cited by applicant]
Decyk et al., “AppleSeed: A Parallel Macintosh Cluster for Numerically Intensive Computing”, Jan. 2001, pp. 8. [ACS_NVIDIA_005692-ACS_NVIDIA_005699]. [cited by applicant]
Decyk et al., “5. AppleSeed: A Parallel Macintosh Cluster for Scientific Computing”, Journal of Plasma Fusion Research, vol. 79, No. 8, May 2003, pp. 772-779. [NVIDIA-ACS-0166369]. [cited by applicant]
Decyk et al., “AppleSeed: A Parallel Macintosh Cluster for Numerically Intensive Computing”, Jan. 2001, pp. 6. [ACS_NVIDIA_005700-ACS_NVIDIA_005705]. [cited by applicant]
Decyk et al., “AppleSeed: A Parallel Macintosh Cluster for Scientific Computing”, 2003, pp. 16. [ACS_NVIDIA_005638-ACS_NVIDIA_005653]. [cited by applicant]
Decyk et al., “AppleSeed: Personal Parallel Computing, Plug and Play Parallel Processing”, 2002, as archived Jun. 12, 2005, pp. 2, https://web.archive.org/web/20050612083102/http://exodus.physics.ucla.edu:80/appleseed/a… [cited by applicant]
Decyk et al., “How to Build an AppleSeed: A Parallel Macintosh Cluster for Numerically Intensive Computing”, Jan. 2001, pp. 11. [ACS_NVIDIA_005680-ACS_NVIDIA_005690]. [cited by applicant]
Decyk et al., “How to Build an AppleSeed: A Parallel Macintosh Cluster for Numerically Intensive Computing”, 2000, pp. 18. [ACS_NVIDIA_0165967]. [cited by applicant]
Decyk et al., “Plasma Physics Calculations on a Parallel Macintosh Cluster”, 1999, pp. 1-10. [NVIDIA-ACS-0165957]. [cited by applicant]
Decyk et al., “Skeleton PIC Codes for Parallel Computers”, Computer Physics Communications, 1995, vol. 87, pp. 87-94. [NVIDIA-ACS-0165933]. [cited by applicant]
Decyk et al., “Supercomputing for the Masses: A Parallel Macintosh Cluster”, 2002, pp. 10-22. [NVIDIA-ACS-0171000 & NVIDIA-ACS-0166308]. [cited by applicant]
Decyk et al., “Two Dimensional Particle-in-Cell Code for Simulation of Plasma”, Bulletin of theAmerican Physical Society, Nov. 2002, vol. 47, No. 9, pp. 52 (2 pages total). NVIDIA-ACS-0166306. [cited by applicant]
“Deploying and Managing Microsoft Windows Compute Cluster Server 2003”, Microsoft, Jun. 6, 2006, pp. 10. [NVIDIA-ACS-0238305-NVIDIA-ACS-0238314]. [cited by applicant]
“Distributed Maple”, https://web.archive.org/web/20040216100904/http:/www.risc.uni-linz.ac.at/software/distmaple/ as archived Feb. 16, 2004 in 1 page. [NVIDIA-ACS-0163856 & NVIDIA-ACS-0227203]. [cited by applicant]
“Distributed Maple Papers”, https://web.archive.org/web/20040304035455/http://www.risc.uni-linz.ac.at/software/distmaple/index_1.html as archived Mar. 4, 2004 in 3 pages. [NVIDIA-ACS-0163857 & NVIDIA-ACS-0227204]. [cited by applicant]
Edelman et al., “Interactive Supercomputing's Star-P Platform: Parallel MATLAB and MPI Homework Classroom Study on High Level Language Productivity”, 2006, pp. 2. [NVIDIA-ACS-0239024 & NVIDIA-ACS-0234907]. [cited by applicant]
Edelman , Alan, “SIAM Conference on Parallel Processing for Scientific Computing”, San Francisco, CA, Feb. 25-27, 2004, pp. 3. [NVIDIA-ACS-0234909]. [cited by applicant]
Edelman et al., “The Future Fast Fourier Transform?”, SIAM Journal on Scientific Computing, 1999, vol. 20, No. 3, pp. 1094-1114. [NVIDIA-ACS-0235070]. [cited by applicant]
Erez, Mattan, “MERRIMAC—High-Performance and Highly-Efficient Scientific Computing with Streams”, A Dissertation Submitted to the Department of Electrical Engineering and the Committee on Graduate Studies of Stanford Un… [cited by applicant]
Evers, Joris, “Windows Server for Supercomputers Delayed”, Network World, Apr. 6, 2005, pp. 2. https://www.computerworld.com/article/2556337/windows-server-for-supercomputers-delayed.html [NVIDIA-ACS-0239410-NVIDIA-ACS-… [cited by applicant]
Fagg et al., “PVMPI: An Integration of the PVM and MPI Systems”, Apr. 12, 1996, pp. 14. [NVIDIA-ACS-0169540]. [cited by applicant]
Fan et al., “GPU Cluster for High Performance Computing”, SC '04: Proceedings of the 2004 ACM/IEEE Conference on Supercomputing : Nov. 6-12, 2004, Pittsburgh, PA, USA, pp. 12. [NVIDIA-ACS-0172335-NVIDIA-ACS-0172346]. [cited by applicant]
Ferron, Jay, “Microsoft Compute Cluster Server Partner Training”, Windows Compute Cluster Server 2003, 2005, pp. 161. [NVIDIA-ACS-0237381-NVIDIA-ACS-0237541]. [cited by applicant]
Fried, Ina, “Gates Touts Microsoft's Supercomputing Move”, ZD Net, Nov. 15, 2005, pp. 3. [NVIDIA-ACS-0239412-NVIDIA-ACS-0239414]. [cited by applicant]
Frigo et al., “FFTW User's Manual”, Version 2.1.5, Mar. 16, 2003, pp. 74. [NVIDIA-ACS-0169554, NVIDIA-ACS-0163860 & NVIDIA-ACS-0227914]. [cited by applicant]
Frigo et al., “The Fastest Fourier Transform in the West”, Technical Report, MIT, Sep. 11, 1997, pp. 20. [NVIDIA-ACS-0165490-NVIDIA-ACS-0165509]. [cited by applicant]
Geist et al., “PVM: Parallel Virtual Machine, A Users' Guide and Tutorial for Network Parallel. Computing”, The MIT Press, 1994, pp. 287. [NVIDIA-ACS-0169648]. [cited by applicant]
“Getting Started with Compute Cluster 2003”, Chapter 2, Designing Unattended Installations, Jun. 2006, pp. 72. https://download.microsoft.com/download/e/2/b/e2bfb017-8525-4991-bbd5-7d7081f3d228/04_CHAPTER_2_Designing_Un… [cited by applicant]
“Getting Started with Star-P Taking Your First Test-Drive”, Interactive Supercomputing, Inc., 2006, pp. 32. [NVIDIA-ACS-0233516-NVIDIA-ACS-0233547]. [cited by applicant]
Gilbert et al., “High-Performance Graph Algorithms from Parallel Sparse Matrices”, Jun. 2006, pp. 4. [cited by applicant]
“GridMathematica 2: Grid Mathematica Extras”, Wolfram Research, Nov. 9, 2006, in 1 page. https://web.archive.org/web/20061109144357/http://www.wolfram.com/products/gridmathematica/extras.html [NVIDIA-ACS-0239622]. [cited by applicant]
“GridMathematica 1.1: Grid Computing Gets a Speed Boost from Mathematica 5”, The Mathematica Journal, vol. 9, No. 2, Aug. 25, 2003, in 1 page. <https://web.archive.org/web/20040618053429/https://www.mathematica-journal.… [cited by applicant]
Grigoras et al., “Advanced Environments, Tools, and Applications for Cluster Computing”, NATO Advanced Research Workshop, IWCC 2001, Mangalia, Romania, Sep. 2001, pp. 333. [NVIDIA-ACS-0169147]. [cited by applicant]
Gropp et al., “A High-Performance, Portable Implementation of the MPI Message Passing Interface Standard”, Parallel Computing, vol. 22, 1996, pp. 789-828. [NVIDIA-ACS-023509]. [cited by applicant]
Gropp et al., “Installation Guide to mpich, a Portable Implementation of MPI”, Argonne National Laboratory, Jul. 1996, pp. 42. [NVIDIA-ACS-0235131]. [cited by applicant]
Gropp et al., “MPICH2 Installer's Guide”, Version 0.4, Mathematics and Computer Science Division, Argonne National Laboratory, Sep. 9, 2004, pp. 21. [cited by applicant]
Gropp et al., “MPICH2 User's Guide”, Version 0.4, Mathematics and Computer Science Division, Argonne National Laboratory, Sep. 9, 2004, pp. 19. [cited by applicant]
Gruber et al., “Choosing an Automated Installation Method”, Chapter 1, Microsoft Windows Server 2003 Deployment Kit, Automating and Customizing Installations, 2003, pp. 18. [NVIDIA-ACS-0238572-NVIDIA-ACS-0238589]. [cited by applicant]
Gruber et al., “Introduction”, Microsoft Windows Server 2003 Deployment Kit, Automating and Customizing Installations, 2003, pp. 8. [NVIDIA-ACS-0238590-NVIDIA-ACS-0238597]. [cited by applicant]
Hamscher et al., “Evaluation of Job-Scheduling Strategies for Grid Computing”, Grid 2000, 2000, pp. 191-202. [cited by applicant]
Haynos, Matt, “Perspectives on Grid: Grid Computing—Next-Generation Distributed Computing”, IBM Developer Works, Jan. 27, 2004 in 7 pages, http://www-106.ibm.com/developerworks/library/gr-heritage. [cited by applicant]
Heal et al., “Maple V: Learning Guide”, Springer, Waterloo Maple Inc., 1996, 1998, pp. 299. [NVIDIA-ACS-0163934 & NVIDIA-ACS-0226491]. [cited by applicant]
Hemsoth, Nicole, “Startup Aims to Bring Parallel Applications to the Masses”, HPC Wire, Nov. 16, 2011, pp. 4. [NVIDIA-ACS-0165918-NVIDIA-ACS-0165921]. [cited by applicant]
Hillis, W. Daniel, “Richard Feynman and The Connection Machine”, for Physics Today, originally published 1989, http://longnow.org/essays/richard-feynman-connection-machine/, printed Oct. 1, 2019, pp. 8. [cited by applicant]
HPC Wire, “Advanced Cluster Systems Unveils Software that Parallelizes Sequential Apps”, Nov. 1, 2011, pp. 1. [NVIDIA-ACS-0239483]. [cited by applicant]
Husbands, Parry, “Interactive Supercomputing”, Thesis, MIT, Feb. 1999, pp. 97. http://dspace.mit.edu/bitstream/handle/1721.1/79973/42430246-MIT.pdf;sequence=2 [NVIDIA-ACS-0233548-NVIDIA-ACS-0233644]. [cited by applicant]
Husbands, Parry, “Interactive Supercomputing with MITMatlab”, Aug. 2001, pp. 10. https://math.mit.edu/˜edelman/publications/interactive_supercomputing.pdf [NVIDIA-ACS-0239026-NVIDIA-ACS-0239035]. [cited by applicant]
“Install”, File, Distributed Maple Application Software, Jun. 16, 2000, pp. 5. [NVIDIA-ACS-0164237 & NVIDIA-ACS-0226933]. [cited by applicant]
“Install”, File, Distributed Maple, Mar. 28, 2003, pp. 4. [NVIDIA-ACS-0164233 & NVIDIA-ACS-0226924]. [cited by applicant]
Interactive Supercomputing, “Background”, https://web.archive.org/web/20060427034450/http://www.interactivesupercomputing.com/index.php?option=com_content&task=view&id=30&Itemid=73, as archived Apr. 27, 2006, pp. 2. [NV… [cited by applicant]
Interactive Supercomputing, “Delivering Parallel Computing Power to the Desktop”, Presentation, Nov. 2004, pp. 15. [NVIDIA-ACS-0234990]. [cited by applicant]
Interactive Supercomputing, “Delivering Parallel Computing Power to the Desktop”, Presentation, 2003, pp. 17. [NVIDIA-ACS-0235005]. [cited by applicant]
Interactive Supercomputing, “Home”, https://web.archive.org/web/20060427034450/http://www.interactivesupercomputing.com, as archived Apr. 27, 2006, in 1 page. [NVIDIA-ACS-0234918]. [cited by applicant]
Interactive Supercomputing, “Parallel Matlab Survey”, https://web.archive.org/web/20061018110626/http://www.interactivesupercomputing.com/reference/ParallelMatlabsurvey.htm, as archived Oct. 18, 2006, in 8 pages. [NVIDI… [cited by applicant]
Interactive Supercomputing, “Products”, https://web.archive.org/web/20061018104836/http://www.interactivesupercomputing.com/product.php, as archived Oct. 18, 2006, in 3 pages. [NVIDIA-ACS-0234919]. [cited by applicant]
Interactive Supercomputing, “Resources”, https://web.archive.org/web/20061018105452/http://www.interactivesupercomputing.com/resources.php , as archived Oct. 18, 2006, in 3 pages. [NVIDIA-ACS-0234922]. [cited by applicant]
Jain et al., “Data Clustering: A Review”, ACM Computing Surveys, Sep. 1999, vol. 31, No. 3, pp. 264-323. [cited by applicant]
Johnson, Steven G., “FFTs, Portability, & Performance”, MIT, May 4, 2004, pp. 41. [NVIDIA-ACS-0234933]. [cited by applicant]
Johnston, Stuart J., “Gates: Microsoft Ships Beta 2 of HPC Cluster Version of Windows”, MCP Mag, Nov. 16, 2005, pp. 2. [NVIDIA-ACS-0239415-NVIDIA-ACS-00239416]. [cited by applicant]
Kahney, Leander, “That's a Whole Lot of Power, Mac”, Wired, Jan. 29, 2002, pp. 9. [NVIDIA-ACS-0239372 & NVIDIA-ACS-0166321]. [cited by applicant]