1. Field of the Invention
The present invention relates to the field of computers and computer processors, and more particularly to a method and means for connecting computers together such that the overall speed and efficiency of the combined computers is optimized. The predominant current usage of the present inventive computer array is in the combination of multiple computers on a single microchip, wherein cooperation of the computers to achieve a unified object is desirable.
2. Description of the Background Art
In the art of computing, processing speed is a much desired quality, and the quest to create faster computers and processors is ongoing. Since, for any given state of the art, the maximum available processor speed is finite, there have been efforts to use multiple processors or multiple computers to speed up operations. It is known in the art to combine a plurality of computer processors or computers to divide a task or computation, such that the task is achieved in a minimum amount of time. An example is a multi-threading application wherein different program threads are operated upon by different processors.
As discussed above, it is a given that it is desirable to speed up the operation of a computer process. However no prior art method or apparatus has achieved an optimal speed for the performance of many computer operations.
Accordingly, it is an object of the present invention to provide an apparatus and method for increasing computer processing speed.
It is still another object of the present invention to provide an apparatus and method for providing substantial computing power inexpensively.
It is yet another object of the present invention to provide an apparatus and method for increasing the operational speed of a multi-computer array.
It is still another object of the present invention to provide an apparatus and method for accomplishing computational intensive tasks.
Briefly, a known embodiment of the present invention is an array of computers, each computer having its own memory and being capable of independent computational functions. A task, such as the implementation of a digital radio, a digital stereo preamplifier, a Global Positioning System (“GPS”) receiver unit, a radio transceiver, a speech recognition device, or any of many other such functions, is divided into a plurality of sub-operations, and each operation is assigned to one of the computers at initiation of the operation of the array.
In the embodiment of the invention described, the computer array is implemented on a single die, with at least some computers near the edge of the die being configured to accomplish input and output tasks. Connections between the computers are arranged to keep the implementation of the device relatively simple, while minimizing the number of “hops” required to communicate across the array. In a described embodiment, the computers are arranged in a 5 by 5 matrix wherein each of the computers connects directly to three of its neighbor computers by a parallel connection, although other types and quantities of connections are within the scope of the invention.
The inventor has found that, although assigning a separate task initially to each of the computers may result in some idle time for some or all of the computers, the lack of complexity and inherent efficiency of the arrangement will more than make up for any inefficiency caused by such idle time, and the overall speed and ease of the accomplishment of the task is greatly enhanced.
These and other objects and advantages of the present invention will become clear to those skilled in the art in view of the description of modes of carrying out the invention, and the industrial applicability thereof, as described herein and as illustrated in the several figures of the drawing. The objects and advantages listed are not an exhaustive list of all possible advantages of the invention. Moreover, it will be possible to practice the invention even where one or more of the intended objects and/or advantages might be absent or not required in the application.
Further, those skilled in the art will recognize that various embodiments of the present invention may achieve one or more, but not necessarily all, of the described objects and/or advantages. Accordingly, the objects and/or advantages described herein are not essential elements of the present invention, and should not be construed as limitations.
This invention is described in the following description with reference to the Figures, in which like numbers represent the same or similar elements. While this invention is described in terms of modes for achieving this invention's objectives, it will be appreciated by those skilled in the art that variations may be accomplished in view of these teachings without deviating from the spirit or scope of the present invention. The method form of the invention may be practiced by combining one or more machine readable storage devices containing the code, according to the present invention, with appropriate standard computer hardware to execute the code contained therein.
The embodiments and variations of the invention described herein, and/or shown in the drawings, are presented by way of example only and are not limiting as to the scope of the invention. Unless otherwise specifically stated, individual aspects and components of the invention may be omitted or modified, or may have substituted therefore known equivalents, or as yet unknown substitutes such as may be developed in the future or such as may be found to be acceptable substitutes in the future. The invention may also be modified for a variety of applications while remaining within the spirit and scope of the claimed invention, since the range of potential applications is great, and since it is intended that the present invention be adaptable to many such variations.
A known mode for carrying out the invention is an array of individual computers. The inventive computer array is depicted in a diagrammatic view in
It should be noted that the view of
Also pictured in the view of
The example of the memory controller computer 12a serves to illustrate an important aspect of the present invention. While, according to the present invention, the several computers 12 are either exactly or essentially alike, they each can be configured to perform very distinct and different functions. It should be noted that, according to the present invention, the computers 12 are essentially identical computers in that the structure, circuitry, layout, and operational characteristics are essentially the same. Some examples of minor differences that may be optionally provided will be discussed herein. However, it remains true that the arrays 10, 10a of the present invention are arrays of computers 12 that are all essentially the same. In other words, the present arrays 10, 10a are homogeneous arrays rather than heterogeneous arrays of computers which are designed from the outset to perform different functions. Although the computers 12 of the present homogeneous arrays 10, 10a are all essentially the same, they can be adapted for special purposes by the addition of a small amount of additional circuitry, as will be discussed in more detail hereinafter. Among the many advantages of the homogeneous arrays of the present invention is versatility. According to the present invention, the arrays 10, 10a can be used for a great many different purposes. Further, even if some modification is required or desirable for some special purpose, such modification can be easily accomplished during the manufacture of the devices.
The memory controller computer 12a is just one such example of one of the computers 12 performing a dedicated function. As can be seen in the example of
As discussed briefly above, many of the computers 12 in the computer array 10 will have different functions. Accordingly, it is thought that it will be most beneficial for the computers 12 nearest the edge of the die 14 to have input/output functions, since it will be easier to connect to the required pins from those external computers 12 if they are placed on the edge of the die 14. The interior computers 12 (those which are not on the outside of the computer array 10) will, therefore, be used more to accomplish computational and control functions, or other functions which typically require less input/output capability. In the view of
The example computer array 10a of
In the example of
In the example of
Returning to a discussion of the peripheral computers 12a through 12p, the computers 12a through 12d are configured for input and output to external devices. In the example shown, computers 12a through 12d implement a LAN interface, a USB interface, a Firewire interface, and a wireless interface, respectively. One skilled in the art will be familiar with the pin out and hardware protocols necessary to implement each of these functions in the computers 12a through 12d. Alternatively, one of the computers 12a through 12d could be used to implement a video output. In some applications fewer than the four input/output computers 12a through 12d might be required. For example, in some applications, only a USB interface might be sufficient input/output to external devices.
In the GPS receiver example of
Computers 12o and 12p are configured and programmed to sample and process received RF signals (analog to digital conversion) and the computer 12n is configured and programmed to provide reference frequencies for frequency down conversion prior to sampling (digital to analog conversion). Computer 12w and 12x are configured and programmed to decode the forward error corrected (“FEC”) bit stream from the GPS signal. The FEC used in GPS signals will be familiar to on skilled in the art of GPS receivers.
Computer 12y and 12h are optionally used for decrypting aspects of the GPS bit stream after reception demodulation. Note that the use of computers 12y and 12h as described is optional because encryption and decryption will not normally be required in a GPS receiver. Although some parts of a GPS signal are encrypted, a commercial receiver will generally not have access to those. However, encryption will be required in a military version of a GPS receiver. Computer 121 is configured and programmed to communicate with additional computer array(s) 10, as may be necessary or desirable.
In the example of the computer array 10a of
One skilled in the art will recognize that the listed operations of the computer array method 36 are not an exhaustive list of operations which will be used in conjunction with the manufacture and operation of the computer array 10, 10a. As just one example, one skilled in the art will recognize that, upon initialization of the computer array 10, 10a, a test routine will be run.
Various modifications may be made to the invention without altering its value or scope. For example, other quantities or arrangements of the computers 12 than those specifically discussed herein would be entirely within the spirit and scope of the invention. While specific examples of the arrangement and use of the computers 12 have been discussed herein, it is expected that there will be a great many applications for the inventive computer array 10 which have not yet been envisioned. Indeed, it is one of the advantages of the present invention that the inventive method and apparatus may be adapted to a great variety of uses.
All of the above are only some of the examples of available embodiments of the present invention. Those skilled in the art will readily observe that numerous other modifications and alterations may be made without departing from the spirit and scope of the invention. Accordingly, the disclosure herein is not intended as limiting and the appended claims are to be interpreted as encompassing the entire scope of the invention.
The inventive computer array 10, 10a and associated method are intended to be widely used in a great variety of computer applications. It is expected that it they will be particularly useful in computer intensive applications wherein a great number of different but related functions need to be accomplished. It is expected that some of the best applications for the inventive computer array 10, 10a, and associated method, will be where the needed tasks can be divided such that each of the computers 12 has computational requirements which are nearly equal to that of the others. However, even where some of the computers 12 might sometimes, or even always, be working at far less than their maximum capabilities, the inventor has found that the overall efficiency and speed of the computer array 10, 10a will generally exceed that of prior art computer arrays wherein tasks might be assigned dynamically.
It should be noted that there might be many applications wherein it would be advantageous to have more than one of the computer arrays 10, 10a. One of many such possible examples would be where a digital radio might require a GPS input. In such an example the radio might be implemented by one computer array 10, which receives input from a separate computer array 10 configured to accomplish the function of a GPS.
It should further be noted that, although the computers 12 may be optimized to do an individual task, as discussed in the examples above, if that task is not needed in a particular application, the computers 12 can easily be programmed to perform some other task, as might be limited only by the imagination of the programmer.
It is anticipated that the present inventive computer array 10, 10a will best be implemented using the Forth computer language, which is inherently segmented to readily divide tasks as required to implement the invention. Color Forth is a recent variation of the Forth language which would be equally applicable.
Since the computer array 10, 10a and computer array method 36 of the present invention may be readily produced and integrated with existing tasks, input/output devices, and the like, and since the advantages as described herein are provided, it is expected that they will be readily accepted in the industry. For these and other reasons, it is expected that the utility and industrial applicability of the invention will be both significant in scope and long-lasting in duration.
Number | Name | Date | Kind |
---|---|---|---|
3757306 | Boone | Sep 1973 | A |
3868677 | Kidd | Feb 1975 | A |
4107773 | Gilbreath et al. | Aug 1978 | A |
4215401 | Holsztynski et al. | Jul 1980 | A |
4215422 | McCray et al. | Jul 1980 | A |
4298932 | Sams | Nov 1981 | A |
4462074 | Linde | Jul 1984 | A |
4589067 | Porter et al. | May 1986 | A |
4591980 | Huberman et al. | May 1986 | A |
4593351 | Hong et al. | Jun 1986 | A |
4665494 | Tanaka et al. | May 1987 | A |
4672331 | Cushing | Jun 1987 | A |
4739474 | Holsztynski | Apr 1988 | A |
4742511 | Johnson | May 1988 | A |
4789927 | Hannah | Dec 1988 | A |
4821231 | Cruess et al. | Apr 1989 | A |
4868745 | Patton et al. | Sep 1989 | A |
4942517 | Cok | Jul 1990 | A |
4943909 | Huang | Jul 1990 | A |
4961167 | Kumanoya et al. | Oct 1990 | A |
4984151 | Dujari | Jan 1991 | A |
5021947 | Campbell et al. | Jun 1991 | A |
5029124 | Leahy et al. | Jul 1991 | A |
5053952 | Koopman et al. | Oct 1991 | A |
5159338 | Takahashi | Oct 1992 | A |
5218682 | Frantz | Jun 1993 | A |
5317735 | Schomberg | May 1994 | A |
5319757 | Moore et al. | Jun 1994 | A |
5359568 | Livay et al. | Oct 1994 | A |
5375238 | Ooi | Dec 1994 | A |
5377333 | Nakagoshi et al. | Dec 1994 | A |
5386585 | Traylor | Jan 1995 | A |
5390304 | Leach et al. | Feb 1995 | A |
5396609 | Schmidt et al. | Mar 1995 | A |
5410723 | Schmidt et al. | Apr 1995 | A |
5434989 | Yamaguchi | Jul 1995 | A |
5440749 | Moore et al. | Aug 1995 | A |
5475856 | Kogge | Dec 1995 | A |
5485624 | Steinmetz et al. | Jan 1996 | A |
5535393 | Reeve et al. | Jul 1996 | A |
5535417 | Baji et al. | Jul 1996 | A |
5550489 | Raab | Aug 1996 | A |
5551045 | Kawamoto et al. | Aug 1996 | A |
5581767 | Katsuki et al. | Dec 1996 | A |
5630154 | Bolstad et al. | May 1997 | A |
5649198 | Shibata et al. | Jul 1997 | A |
5657485 | Streitenberger et al. | Aug 1997 | A |
5673423 | Hillis | Sep 1997 | A |
5692197 | Narad et al. | Nov 1997 | A |
5706491 | McMahan | Jan 1998 | A |
5717943 | Barker et al. | Feb 1998 | A |
5727194 | Shridhar et al. | Mar 1998 | A |
5737628 | Birrittella et al. | Apr 1998 | A |
5740463 | Oshima et al. | Apr 1998 | A |
5752259 | Tran | May 1998 | A |
5765015 | Wilkinson et al. | Jun 1998 | A |
5784602 | Glass et al. | Jul 1998 | A |
5826101 | Beck et al. | Oct 1998 | A |
5832291 | Rosen et al. | Nov 1998 | A |
5867330 | Tanaka | Feb 1999 | A |
5893148 | Genduso et al. | Apr 1999 | A |
5911082 | Monroe et al. | Jun 1999 | A |
5937202 | Crosetto | Aug 1999 | A |
5944814 | McCulloch et al. | Aug 1999 | A |
6003128 | Tran | Dec 1999 | A |
6023753 | Pechanek et al. | Feb 2000 | A |
6038655 | Little et al. | Mar 2000 | A |
6057791 | Knapp | May 2000 | A |
6081215 | Kost et al. | Jun 2000 | A |
6085304 | Morris et al. | Jul 2000 | A |
6092183 | Takewa et al. | Jul 2000 | A |
6094030 | Gunthorpe et al. | Jul 2000 | A |
6101598 | Dokic et al. | Aug 2000 | A |
6112296 | Witt et al. | Aug 2000 | A |
6145072 | Shams et al. | Nov 2000 | A |
6148392 | Liu | Nov 2000 | A |
6154809 | Ikenaga et al. | Nov 2000 | A |
6173389 | Pechanek et al. | Jan 2001 | B1 |
6178525 | Warren | Jan 2001 | B1 |
6192388 | Cajolet | Feb 2001 | B1 |
6219685 | Story | Apr 2001 | B1 |
6223282 | Kang | Apr 2001 | B1 |
6232905 | Smith et al. | May 2001 | B1 |
6233670 | Ikenaga et al. | May 2001 | B1 |
6236645 | Agazzi | May 2001 | B1 |
6279101 | Witt et al. | Aug 2001 | B1 |
6307425 | Chevallier et al. | Oct 2001 | B1 |
6308229 | Masteller | Oct 2001 | B1 |
6353880 | Cheng | Mar 2002 | B1 |
6367005 | Zahir et al. | Apr 2002 | B1 |
6381705 | Roche | Apr 2002 | B1 |
6388600 | Johnson et al. | May 2002 | B1 |
6404274 | Hosono et al. | Jun 2002 | B1 |
6404663 | Shinozaki | Jun 2002 | B2 |
6427204 | Arimilli et al. | Jul 2002 | B1 |
6449709 | Gates | Sep 2002 | B1 |
6460128 | Baxter et al. | Oct 2002 | B1 |
6502141 | Rawson, III | Dec 2002 | B1 |
6507649 | Tovander | Jan 2003 | B1 |
6507947 | Schreiber et al. | Jan 2003 | B1 |
6560716 | Gasparik et al. | May 2003 | B1 |
6598148 | Moore et al. | Jul 2003 | B1 |
6636122 | Tsyrganovich | Oct 2003 | B2 |
6647027 | Gasparik et al. | Nov 2003 | B1 |
6657462 | Dobberpuhl | Dec 2003 | B2 |
6665793 | Zahir et al. | Dec 2003 | B1 |
6671112 | Murakami et al. | Dec 2003 | B2 |
6725361 | Rozas et al. | Apr 2004 | B1 |
6732253 | Redford | May 2004 | B1 |
6782468 | Nakazato | Aug 2004 | B1 |
6825843 | Allen et al. | Nov 2004 | B2 |
6826674 | Sato | Nov 2004 | B1 |
6845412 | Boike et al. | Jan 2005 | B1 |
6898721 | Schmidt | May 2005 | B2 |
6930628 | Reinhold et al. | Aug 2005 | B2 |
6937538 | Terzioglu et al. | Aug 2005 | B2 |
6959372 | Hobson et al. | Oct 2005 | B1 |
6966002 | Torrubia-Saez | Nov 2005 | B1 |
6970895 | Vaidyanathan et al. | Nov 2005 | B2 |
7028163 | Kim et al. | Apr 2006 | B2 |
7079046 | Tanaka | Jul 2006 | B2 |
7084793 | Elbornsson | Aug 2006 | B2 |
7131113 | Chang et al. | Oct 2006 | B2 |
7136989 | Ishii | Nov 2006 | B2 |
7155602 | Poznanovic | Dec 2006 | B2 |
7157934 | Teifel et al. | Jan 2007 | B2 |
7162573 | Mehta | Jan 2007 | B2 |
7197624 | Pechanek et al. | Mar 2007 | B2 |
7249357 | Landman et al. | Jul 2007 | B2 |
7269805 | Ansari et al. | Sep 2007 | B1 |
7380100 | Shimura et al. | May 2008 | B2 |
7386689 | Kirsch | Jun 2008 | B2 |
7471643 | Stansfield | Dec 2008 | B2 |
7512728 | Tseng | Mar 2009 | B2 |
7528756 | Moore et al. | May 2009 | B2 |
20020004912 | Fung | Jan 2002 | A1 |
20020010844 | Noel et al. | Jan 2002 | A1 |
20020019951 | Kubo et al. | Feb 2002 | A1 |
20020186159 | Reinhold et al. | Dec 2002 | A1 |
20030005168 | Leerssen et al. | Jan 2003 | A1 |
20030009502 | Katayanggi | Jan 2003 | A1 |
20030028750 | Hogenauer | Feb 2003 | A1 |
20030035549 | Bizjak et al. | Feb 2003 | A1 |
20030065905 | Ishii | Apr 2003 | A1 |
20030113031 | Wal | Jun 2003 | A1 |
20030135710 | Farwell et al. | Jul 2003 | A1 |
20030179123 | DeVilbiss | Sep 2003 | A1 |
20030217242 | Wybenga et al. | Nov 2003 | A1 |
20040003219 | Uehara | Jan 2004 | A1 |
20040030859 | Doerr et al. | Feb 2004 | A1 |
20040059895 | May et al. | Mar 2004 | A1 |
20040095264 | Thomas | May 2004 | A1 |
20040098707 | Tang et al. | May 2004 | A1 |
20040107332 | Fujii et al. | Jun 2004 | A1 |
20040143638 | Beckmann et al. | Jul 2004 | A1 |
20040215929 | Floyd et al. | Oct 2004 | A1 |
20040250046 | Gonzalez et al. | Dec 2004 | A1 |
20050027548 | Jacobs et al. | Feb 2005 | A1 |
20050034029 | Ramberg et al. | Feb 2005 | A1 |
20050114565 | Gonzalez et al. | May 2005 | A1 |
20050149693 | Barry | Jul 2005 | A1 |
20050182581 | Hashemian | Aug 2005 | A1 |
20050196060 | Wang et al. | Sep 2005 | A1 |
20050206648 | Perry et al. | Sep 2005 | A1 |
20050223204 | Kato | Oct 2005 | A1 |
20050237083 | Bakker et al. | Oct 2005 | A1 |
20050257037 | Elwood et al. | Nov 2005 | A1 |
20060059377 | Sherburne, Jr. | Mar 2006 | A1 |
20060082445 | O'Toole et al. | Apr 2006 | A1 |
20060101238 | Bose et al. | May 2006 | A1 |
20060149925 | Nguyen et al. | Jul 2006 | A1 |
20060218375 | Swarztrauber | Sep 2006 | A1 |
20060248317 | Vorbach et al. | Nov 2006 | A1 |
20060248360 | Fung | Nov 2006 | A1 |
20060279970 | Kernahan | Dec 2006 | A1 |
20070036150 | Pounds et al. | Feb 2007 | A1 |
20070070079 | Chung et al. | Mar 2007 | A1 |
20070113058 | Tran et al. | May 2007 | A1 |
20070192504 | Moore | Aug 2007 | A1 |
20070192566 | Moore et al. | Aug 2007 | A1 |
20070192570 | Moore | Aug 2007 | A1 |
20070192575 | Moore et al. | Aug 2007 | A1 |
20070192646 | Moore | Aug 2007 | A1 |
20070226457 | Moore et al. | Sep 2007 | A1 |
20080270648 | Rible | Oct 2008 | A1 |
20080270751 | Montvelishsky et al. | Oct 2008 | A1 |
Number | Date | Country |
---|---|---|
1051995 | Jun 1991 | CN |
3937807 | May 1990 | DE |
0156654 | Oct 1985 | EP |
0227319 | Jul 1987 | EP |
0724221 | Jul 1996 | EP |
0992896 | Apr 2000 | EP |
1182544 | Feb 2002 | EP |
1821211 | Aug 2007 | EP |
2154343 | Sep 1985 | GB |
2299422 | Oct 1996 | GB |
60-183645 | Sep 1985 | JP |
64-012339 | Jan 1989 | JP |
3-500585 | Feb 1991 | JP |
03-176757 | Jul 1991 | JP |
5-081216 | Apr 1993 | JP |
6-243113 | Sep 1994 | JP |
2509678 | Apr 1996 | JP |
8-161282 | Jun 1996 | JP |
2543306 | Oct 1996 | JP |
8-288768 | Nov 1996 | JP |
2000-181878 | Jun 2000 | JP |
2003-044292 | Feb 2003 | JP |
10-1999-0036970 | May 1999 | KR |
WO9715001 | Apr 1997 | WO |
WO0042506 | Jul 2000 | WO |
WO0212999 | Feb 2002 | WO |
WO0250700 | Jun 2002 | WO |
WO02088936 | Nov 2002 | WO |
WO03019356 | Mar 2003 | WO |
WO2005091847 | Oct 2005 | WO |
Number | Date | Country | |
---|---|---|---|
20050228904 A1 | Oct 2005 | US |