Suche Bilder Maps Play YouTube News Gmail Drive Mehr »
Anmelden
Nutzer von Screenreadern: Klicke auf diesen Link, um die Bedienungshilfen zu aktivieren. Dieser Modus bietet die gleichen Grundfunktionen, funktioniert aber besser mit deinem Reader.

Patentsuche

  1. Erweiterte Patentsuche
VeröffentlichungsnummerUS7617383 B2
PublikationstypErteilung
AnmeldenummerUS 11/503,372
Veröffentlichungsdatum10. Nov. 2009
Eingetragen11. Aug. 2006
Prioritätsdatum16. Febr. 2006
GebührenstatusBezahlt
Auch veröffentlicht unterUS20070192576
Veröffentlichungsnummer11503372, 503372, US 7617383 B2, US 7617383B2, US-B2-7617383, US7617383 B2, US7617383B2
ErfinderCharles H. Moore, Jeffrey Arthur Fox, John W. Rible
Ursprünglich BevollmächtigterVns Portfolio Llc
Zitat exportierenBiBTeX, EndNote, RefMan
Externe Links: USPTO, USPTO-Zuordnung, Espacenet
Circular register arrays of a computer
US 7617383 B2
Zusammenfassung
A stack processor comprises a data stack with a T register, an S register, and eight hardwired bottom registers which function in a circular repeating pattern. The stack processor also comprises a return stack containing an R register, and eight hardwired bottom registers which function in a circular repeating pattern. The circular register arrays described herein eliminate overflow and underflow stack conditions.
Bilder(7)
Previous page
Next page
Ansprüche(65)
1. A stack computer processor, comprising:
a data stack, comprising an array of hardware data registers functioning in a circular pattern; and
a return stack, comprising an array of hardware return registers functioning in a circular pattern; and wherein:
each of said data registers in said data stack and each of said return registers in said return stack can accommodate an 18 bit instruction word;
said computer is programmed to input additional data in said data stack after all said data registers in said data stack have been filled such that data in a first data register of the data stack will be overwritten;
said computer is programmed to input additional data in said return stack after all said return registers in said return stack have been filled such that data in a first return resister of the return stack will be overwritten;
said computer is programmed to repeatedly read data from said data stack without reloading data into said data registers in said data stack; and
said computer is programmed to repeatedly read data from said return stack without reloading data into said return registers in said return stack.
2. The processor of claim 1, wherein said data stack further comprises a top of stack (T) register.
3. The processor of claim 2, wherein said data stack further comprises a second position on the stack (S) register.
4. The processor of claim 1, wherein said return stack further comprises a top register (R).
5. A method of manipulating a computer processor, comprising:
inputting a plurality of instruction words into a corresponding plurality of instruction cells of said processor; and
processing said plurality of instruction words, wherein:
there is no overflow or underflow of instructions as a result of said inputting and said processing; and
said processing comprises repeatedly reusing said plurality of instruction words without reloading said plurality of instruction words.
6. The method of claim 5, wherein said inputting comprises filling all available instruction cells.
7. The method of claim 6, wherein said inputting further comprises inputting additional instruction words after all available instruction cells have been filled such that previously-filled instruction cells are over-written.
8. The method of claim 7, wherein said inputting and said processing occur without using a software implemented pointer.
9. A computer processor, comprising:
an array of registers; and
a shift register, wherein:
said shift register comprises a plurality of one bit shift registers which are interconnected by electrical wires, and wherein said plurality of one bit shift registers is equal in number to a number of registers in said array of registers;
said computer processor is programmed to input additional data in said array of registers after all of said registers are full such that data in a first register of the array is overwritten; and
said processor is programmed to repeatedly read data from said array of registers without reloading data into said array of registers.
10. The processor of claim 9, further comprising at least one register positioned above said array of registers.
11. The processor of claim 9, wherein said array of registers further comprises a read bus and a write bus interconnecting said array.
12. The processor of claim 9, wherein said array of registers functions in a circular pattern.
13. The processor of claim 9, wherein said array of registers are stacked.
14. The processor of claim 13, wherein said one bit shift registers are interconnected by said electrical wires in an alternating pattern.
15. The processor of claim 9, wherein said processor is a data stack.
16. The processor of claim 15, wherein said array of registers comprises eight data registers.
17. The processor of claim 15, wherein said array of registers comprises a multiple of four data registers.
18. The processor of claim 9, wherein said processor is a return stack.
19. The processor of claim 18, wherein said array of registers comprises eight return registers.
20. The processor of claim 18, wherein said array of registers comprises a multiple of four return registers.
21. A computer processor, comprising:
an array of registers; and
a bi-directional shift register hardwired to said array of registers, further comprising a plurality of one bit shift registers which are interconnected by electrical wires, and wherein said plurality of one bit shift registers is equal in number to a number of registers in said array of registers; and wherein
said computer processor is programmed to input additional data in said array of registers after all of said registers are full such that data in a first register of the array is overwritten; and
said computer processor is programmed to repeatedly read data from said array of registers without reloading data into said array of registers.
22. The processor of claim 21, further comprising at least one register positioned above said array of registers.
23. The processor of claim 21, wherein said shift register functions as a hardware pointer to said array of registers.
24. The processor of claim 21, further comprising a read bus and a write bus.
25. The processor of claim 21, wherein each of said plurality of one bit shift registers corresponds to an associated register of said array of registers.
26. The processor of claim 25, wherein only one shift register of said plurality of one bit shift registers is activated at one time.
27. The processor of claim 21, wherein said array of registers further comprises a reed bus and a write bus interconnecting said array.
28. The processor of claim 21, wherein said plurality of one bit shift registers are interconnected by electrical wires such that a size of a driver and buffering are minimized.
29. The processor of claim 21, wherein all of said electrical wires extend between a maximum of three adjacent one bit shift registers.
30. The processor of claim 29, wherein said array of registers comprises eight registers.
31. The processor of claim 21, wherein said processor is a data stack.
32. The processor of claim 21, wherein said processor is a return stack.
33. The processor of claim 1, further comprising:
a hardware pointer to said array of hardware data registers of said data stack; and
a hardware pointer to said array of hardware return registers of said return stack.
34. The processor of claim 33, wherein:
said hardware pointer for said data stack includes a circular array of shift registers, each of said shift registers being connected to one of said data registers in said data stack; and
said hardware pointer for said return stack includes a circular array of shift registers, each of said shift registers being connected to one of said return registers in said return stack.
35. The processor of claim 34, wherein:
said circular array of shift registers for said data stack are one-bit shift registers; and
said circular array of shift registers for said return stack are one-bit shift registers.
36. The processor of claim 35, wherein:
only one of said one-bit shift registers for said data stack is active at a time; and
only one of said one-bit shift registers for said return stack is active at a time.
37. The processor of claim 34, wherein the shift registers for at least one of said data stack and said return stack are interconnected by electrical wires in an alternating pattern.
38. The processor of claim 37, wherein said electrical wires extend between a maximum of three adjacent shift registers.
39. The processor of claim 34, wherein:
said shift registers for said data stack are bi-directional in operation; and
said shift registers for said return stack are bi-directional in operation.
40. The processor of claim 1, wherein loading data into said data stack and said return stack does not generate an underflow or an overflow.
41. The processor of claim 1, further comprising a read bus and a write bus interconnecting said hardware registers of at least one of said data stack and said return stack.
42. The processor of claim 1, wherein said array of hardware registers of at least one of said data stack and said return stick comprises a multiple of four registers.
43. The processor of claim 42, wherein the number of hardware registers is eight.
44. The method of claim 5, wherein said instruction cells are an array of hardware registers.
45. The method of claim 44, wherein said processing includes accessing said array of hardware registers using a hardware pointer.
46. The method of claim 45, wherein said hardware pointer comprises a circular array of shift registers, each of said shift registers being connected to one of said hardware registers.
47. The method of claim 46, wherein said circular array of shift registers is a circular array of one-bit shift registers.
48. The method of claim 47, wherein only one of said one-bit shift registers is active at a time.
49. The method of claim 46, wherein said shift registers are interconnected by electrical wires in an alternating pattern.
50. The method of claim 49, wherein said electrical wires extend between a maximum of three adjacent shift registers.
51. The method of claim 45, wherein:
said shift registers for said data static are bi-directional in operation; and
said shift registers for said return stack are bi-directional in operation.
52. The method of claim 5, wherein the number of said instruction cells is a multiple of four.
53. The method of claim 52, wherein the number of instruction cells is eight.
54. The method of claim 5, wherein a read bus and a write bus interconnect plurality of instruction cells.
55. The method of claim 5, wherein one of said instruction cells is a top (T) instruction cell.
56. The method of claim 5, wherein one of said instruction cells is a second position (S) instruction cell.
57. The method of claim 5, wherein one of said instruction coils is a top instruction cell (R).
58. The processor of claim 14, wherein said electrical wires extend between a maximum of three adjacent one bit shift registers.
59. The processor of claim 9, wherein only one of said one bit shift registers is active at a time.
60. The processor of claim 9, wherein said array of registers and said shift register are implemented in hardware.
61. The processor of claim 9, wherein no overflow or underflow occurs in said array of registers.
62. The processor of claim 29, wherein said array of registers comprises a multiple of four registers.
63. The processor of claim 21, wherein said one bit shift registers are connected in a circular pattern.
64. The processor of claim 21, wherein no overflow or underflow occurs in said array of registers.
65. The processor of claim 21, wherein said array of registers and said shift register are implemented in hardware.
Beschreibung

This application claims priority to provisional application No. 60/818,084, filed Jun. 30, 2006, and is a continuation-in-part of the application entitled, “Method and Apparatus for Monitoring Inputs to a Computer,” filed May 26, 2006, Ser. No. 11/441,818, which is a continuation-in-part of the application entitled, “Asynchronous Power Saving Computer,” filed Feb. 16, 2006, Ser. No. 11/355,513. This application also claims priority to provisional application No. 60/788,265, filed Mar. 31, 2006, and claims priority to provisional application No. 60/797,345, filed May 3, 2006. All of the cited applications above are incorporated herein by reference.

BACKGROUND OF THE INVENTION

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 a more efficient use of a stack within a stack computer processor.

2. Description of the Background Art

Stack machines offer processor complexity that is much lower than that of Complex Instruction Set Computers (CISCs), and overall system complexity that is lower than that of either Reduced Instruction Set Computers (RICSs) or CISC machines. They do this without requiring complicated compilers or cache control hardware for good performance. They also attain competitive raw performance, and superior performance for a given price in most programming environments. Their first successful application area has been in real time embedded control environments, where they outperform other system design approaches by a wide margin. Where previously the stacks were kept mostly in program memory, newer stack machines maintain separate memory chips or even an area of on-chip memory for the stacks. These stack machines provide extremely fast subroutine calling capability and superior performance for interrupt handling and task switching.

However, there is no hardware detection of stack overflow or underflow conditions. Stack overflow occurs when there are not a sufficient number of registers available and results continue to be pushed onto the stack, causing the bottom register(s) to be overwritten. Stack underflow occurs when all registers have been emptied, and continued popping of a stack produces unintentional or incorrect results. Some other stack processors use stack pointers and memory management such that an error condition is flagged when a stack pointer goes out of range of memory allocated for the stack. U.S. Pat. No. 6,367,005 issued to Zahir et al. disclose a register stack engine, which saves to memory sufficient registers of a register stack to provide more available registers in the event of stack overflow. The register stack engine also delays the microprocessor until the engine can restore an appropriate number of registers in the event of stack underflow.

U.S. Pat. No. 6,219,685 issued to Story discloses a method of comparing the results of an operation with a threshold value. However, this approach does not distinguish between results that are rounded down to the threshold value (which would raise an overflow exception) and results that just happen to equal the threshold value. Another method disclosed by Story reads and writes hardware flags to identify overflow or underflow conditions. However, the instructions must be performed sequentially, and any instructions following a register read/write can not proceed until the read/write operation is completed, which makes for a slow process.

With a stack in memory, an overflow or underflow would overwrite a stack item or use a stack item that was not intended to be part of the stack. A need exists for an improved method of reducing or eliminating overflow and underflow within a stack.

SUMMARY OF THE INVENTION

It is an object of the present invention to provide an apparatus and method in which the data stack and return stack of a dual stack processor are not arrays in memory accessed by a stack pointer, but instead are hardwire accessed by a separate dedicated shift register.

It is another object of the present invention to reduce or eliminate overflow and underflow of a data or return stack.

It is another object of the present invention to minimize the length of electrical connections between one bit stack registers of a bi-directional stack register, and thereby minimize the required driver size and minimize buffering.

These and other objects are achieved by the presently described invention, in which a conventional stack is replaced by an array of registers which function in a circular, repeating pattern. This circular, repeating pattern is accomplished through utilization of an associated bi-directional shift register which contains a plurality of one bit shift registers electrically interconnected in an alternating pattern. This configuration prevents reading from outside of the stack, and prevents reading an unintended empty register value.

The above described dual stack processor can function as an independently functioning processor, or it can be used with several other like or different processors in an interconnected computer array.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram depicting a general layout of a stack computer;

FIG. 2 is a data stack according to the present invention;

FIG. 3 is a more detailed view of a single register of a stack;

FIG. 4 is a return stack according to the present invention;

FIG. 5 is a diagrammatic view of a computer array, according to the present invention; and

FIG. 6 is a detailed diagram showing a subset of the computers of FIG. 5 and a more detailed view of the interconnecting data buses of FIG. 5.

DETAILED DESCRIPTION

This invention is described 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 presently claimed invention.

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 for a variety of applications while remaining within the spirit and scope of the claimed invention, since it is intended that the present invention is adaptable to many variations.

FIG. 1 is a block diagram depicting the general layout of a dual stack computer 12 as used in the present invention. The computer 12 is generally a self contained computer having its own RAM 24 and ROM 26.

Other basic components of the computer 12 are a return stack 28, including an R register 29, an instruction area 30, an arithmetic logic unit (ALU or processor) 32, a data stack 34 and a decode logic section 36 for decoding instructions. The computer 12 is a dual stack computer having a data stack 34 and a separate return stack 28. One skilled in the art will be generally familiar with the operation of stack based computers such as the computer 12 of this example.

In the presently described embodiment, the instruction area 30 comprises a number of registers 40 including, in this example, an A register 40 a, a B register 40 b and a P register 40 c. In this example, the A register 40 a is a full eighteen-bit register, while the B register 40 b and the P register 40 c are nine-bit registers.

The present invention discloses a stack computer processor in which the data and return stacks comprise an array of registers, which function in a cyclical, repeating, or circular pattern. The data stack and return stack are not arrays in memory accessed by a stack pointer, as in many prior art computers.

FIG. 2 discloses an embodiment of an 18-bit data stack according to the present invention. The top two registers in the data stack are an 18-bit T register and an 18-bit S register. The remainder of the data stack comprises eight additional 18-bit hardware registers, numbered in this example as S2 through S9. The circular register array, S2-S9 can operate in the absence of the T and S registers. However, the presence of at least the S register in combination with S2-S9 registers provides faster access circuitry and an optimum for timing, and therefore provides higher operating speed of the circular register array. In addition, the S register acts as a buffer between the S2-S9 addressable registers and the rest of the processor system. This provides independence of timing between the S2-S9 registers and the rest of the processor system.

This embodiment also comprises a bi-directional shift register which contains a plurality of one bit shift registers. The number of one bit shift registers is equal to the number of bottom stack registers, S2 through S9 located below the S register. Each one bit shift register is connected to its corresponding S2 through S9 stack register as shown in FIG. 2. The one bit shift registers are electrically interconnected in an alternating pattern, such that the S2 through S9 registers of the stack function in the sequential circular interconnect pattern given by S2→S4→S6→S8→S9→S7→S5→S3→S2 as shown in FIG. 2. This sequential selection of bottom stack registers operates in a circular repeating pattern. The interconnecting wires of the one bit shift registers never span more than three adjacent shift registers, which avoids the need for a long wire connecting the bottom shift register to the top shift register. These shorter wires require a smaller driver, and buffering is also minimized. The embodiment given uses eight additional stack registers for the circular register array. However, other combinations of bottom registers used in multiples of four can also be utilized.

FIG. 2 also discloses a read bus and a write bus interconnecting registers S2 through S9 as well as the T register and the S register. Each one bit shift register of the bi-directional shift register is connected to a corresponding bottom stack register within the S2 through S9 array, where only one bit of the shift register is on (reads as a one) at a time, while all other bits read as a zero. At power-up, the shift register must be initialized to contain exactly one bit set to one and all other bits set to zero. In the given example, the shift register top bit points or reads to S2 and writes to the interconnected adjacent register, S4.

A ten cell deep push down stack is formed by the registers T, S, and S2 through S9. Because the bottom eight registers are in a circular buffer, the hardware wraps rather than overflows or underflows. One must not expect to put more than ten items there and get them all back, but one can keep taking more copies of the last eight items taken from the bottom of the stack forever. There is no underflow in the sense of it being an error. It is the fastest way to duplicate a pattern of eight words (or four or two or one) because the bottom eight will be read over and over if a program keeps taking values from the stack.

Similarly, there is no stack overflow in the sense of stack pointers allowing the stack to step on anything else. It is finite and if more than ten items are put there, only the last ten will remain; each store after the first ten will overwrite one of the S2 through S9 registers. There is no need to ‘initialize’ the stack to a preset location; one just declares it empty by starting to use it from wherever it is.

FIG. 3 is an expanded view of each register within the data or return stack. Each 18 bit register comprises 18 latches, numbered 0 through 17. There is a set of 18 input pass gates (numbered 0 through 17), each of which are connected to the 18 latches through a read bus and a write bus. There is also a set of 18 output pass gates (numbered 0 through 17), each of which is connected to the 18 latches through the read bus and the write bus. The input pass gates are controlled by a write control of inverter amps; the output pass gates are controlled by a read control of inverter amps.

FIG. 4 discloses an 18-bit return stack according to the present invention. The top register in the return stack is an 18-bit R register, and eight additional 18-bit hardware registers are located below the R register, and are numbered here as R1-R8. The bottom eight registers, R1-R8 function in an alternating pattern as a repeating circular array, similar to the data stack disclosed above.

The circular register array, R1-R8 can operate in the absence of the R register. However, the presence of the R register in combination with R1-R8 registers provides faster access circuitry and an optimum for timing, and therefore provides higher operating speed of the circular register array. In addition, the R register acts as a buffer between the R1-R8 addressable registers and the rest of the processor system, which provides independence of timing between the R1-R8 registers and the rest of the processor system.

This embodiment also comprises a bi-directional shift register which contains a plurality of one bit shift registers. The number of one bit shift registers is equal to the number of additional bottom registers, R1 through R8 located below the R register. Each one bit shift register is connected to its corresponding R1 through R8 bottom stack register as shown in FIG. 4. The one bit shift registers of the bi-directional shift register are electrically interconnected in an alternating pattern, such that the R1 through R8 registers of the stack function in the sequential circular interconnect pattern given by R1→R3→R5→R7→R8→R6→R4→R2→R1 as shown in FIG. 4. This sequential selection of registers operates in a circular repeating pattern. The interconnecting wires of the shift register never span more than three adjacent one bit shift registers, which avoids the need for a long wire connecting the bottom one bit shift register to the top one bit shift register. These shorter wires require a smaller driver, and buffering is also minimized. Although eight additional return registers are disclosed in the given embodiment, other bottom register combinations which are a multiple of four can also be used in the circular register array. A read bus and a write bus interconnect registers R1-R8. Each one bit register of the shift register is connected to a corresponding stack register within the R1-R8 array. Only one bit of the shift register is on (reads as a one) at a time, while all other bits read as a zero. At power-up, the shift register must be initialized to contain exactly one bit set to one and all other bits set to zero. In the given example, the shift register top bit points or reads to R1 and writes to the interconnected adjacent register, R3.

In the instant invention, there is no hardware detection of stack overflow or underflow conditions. Generally, prior art processors use stack pointers and memory management, or the like, such that an error condition is flagged when a stack pointer goes out of the range of memory allocated for the stack. When the stacks are located or managed in memory, an overflow or underflow would overwrite a stack item or use a stack item as something other than what it was intended. However, because the present invention bottom registers function as a circular array, the stacks cannot overflow or underflow out of the stack area. Instead, the circular arrays will merely wrap around the array of registers. Because the stacks have finite depth, pushing anything to the top of a stack means something on the bottom is being overwritten. Pushing more than ten items to the data stack, or more than nine items to the return stack in the given embodiments must be done with the knowledge that doing so will result in the item at the bottom of the stack to be overwritten.

It is the responsibility of software to keep track of the number of items on the stacks and not try to put more items there than the respective stacks can hold. The hardware will not detect an overwriting of items at the bottom of the stack or flag it as an error. It should be noted that the software can take advantage of the circular arrays at the bottom of the stacks in several ways. As one example, the software can simply assume that a stack is ‘empty’ at any time. There is no need to clear old items from the stack as they will be pushed down towards the bottom where they will be lost as the stack fills, so there is nothing to initialize for a program to assume that the stack is empty.

Another advantage which can be utilized is to reuse the register items without having to reload those items for reuse. The bottom eight items in these stacks can also be read or read and written in loops that take advantage of the stack wrap. After two data stack reads, T and S will have copies of two items from the circular array of the eight stack registers below. After eight more reads, T and S will be reloaded again with the same values read again from below using stack wrap. There is no limit to how many times those eight items can be read in sequence off of the stack without having to duplicate the items or write them back to the stack. Algorithms that cycle through a set of parameters that can repeat in eight, four, or two cells on the data or return stack can repeatedly read them from the stack as the bottom registers will just wrap, and if intentional is not a stack error.

Although the instant invention has been described in an embodiment for a data stack and return stack of a dual stack 18-bit processor, other bit size processors can be utilized with the present invention.

The above described circular register arrays were described with respect to a single dual stack processor. However, the above described circular register arrays can also be utilized in an array of several self-contained computers, such as the computer array 10 shown in FIG. 5. The computer array 10 has a plurality (twenty four in the example shown) of computers 12 (sometimes also referred to as “cores” or “nodes” in the example of an array). In the example shown, all of the computers 12 are located on a single die 14. According to the present invention, each of the computers 12 is a generally independently functioning computer. The computers 12 are interconnected by a plurality of interconnecting data buses 16. In this example, the data buses 16 are bidirectional asynchronous high speed parallel data buses, although it is within the scope of the invention that other interconnecting means might be employed for the purpose.

Computer 12 e is an example of one of the computers 12 that is not on the periphery of the array 10. That is, computer 12 e has four orthogonally adjacent computers 12 a, 12 b, 12 c, and 12 d. This grouping of computers 12 a through 12 e will be used, by way of example, hereinafter in relation to a more detailed discussion of the communications between the computers 12 of the array 10. As can be seen in the view of FIG. 5, interior computers such as computer 12 e will have four other computers 12 with which they can directly communicate via the buses 16. In the following discussion, the principles discussed will apply to all of the computers 12 except that the computers 12 on the periphery of the array 10 will be in direct communication with only three or, in the case of the corner computers 12, only two other of the computers 12.

FIG. 6 is a more detailed view of a portion of FIG. 5 showing only some of the computers 12 and, in particular, computers 12 a through 12 e, inclusive. The view of FIG. 6 also reveals that the data buses 16 each have a read line 18, a write line 20, and a plurality (eighteen, in this example) of data lines 22. The data lines 22 are capable of transferring all the bits of one eighteen-bit instruction word generally simultaneously in parallel.

According to the present inventive method, a computer 12, such as the computer 12 e can set high one, two, three, or all four of its read lines 18 such that it is prepared to receive data from the respective one, two, three, or all four adjacent computers 12. Similarly, it is also possible for a computer 12 to set one, two, three, or all four of its write lines 20 high.

When one of the adjacent computers 12 a, 12 b, 12 c, or 12 d sets a write line 20 between itself and the computer 12 e high, if the computer 12 e has already set the corresponding read line 18 high, then a word is transferred from that computer 12 a, 12 b, 12 c, or 12 d to the computer 12 e on the associated data lines 22. Then, the sending computer 12 will release the write line 20 and the receiving computer (12 e in this example) pulls both the write line 20 and the read line 18 low. The latter action will acknowledge to the sending computer 12 that the data has been received.

As shown in FIG. 1, in this embodiment of the invention, the computer 12 has four communication ports 38 for communicating with adjacent computers 12, as described above. The communication ports 38 are tri-state drivers, having an off status, a receive status (for driving signals into the computer 12) and a send status (for driving signals out of the computer 12). If the particular computer 12 is not on the interior of the array (FIG. 5) such as the example of computer 12 e, then one or more of the communication ports 38 will not be used in that particular computer at least for the purposes described above. However, those communication ports 38 that do abut the edge of the die can have additional circuitry, either designed into such computer 12 or else external to the computer 12 but associated therewith, to cause such communication port 38 to act as an external I/O port 39 (FIG. 5). Examples of such external I/O ports 39 include, but are not limited to, USB (universal serial bus) ports, RS232 serial bus ports, parallel communications ports, analog to digital and/or digital to analog conversion ports, and many other possible variations. In FIG. 5, an “edge” computer 12 f is depicted with associated interface circuitry 80 for communicating through an external I/O port 39 with an external device 82.

Various modifications may be made to the invention without altering its value or scope. For example, while this invention has been described herein using particular computers 12, many or all of the inventive aspects are readily adaptable to other computer designs, other computer arrays, and the like.

While the present invention has been disclosed primarily herein in relation to communications between computers 12 in an array 10 on a single die 14, the same principles and methods can be used, or modified for use, to accomplish other inter-device communications, such as communications between a computer 12 and its dedicated memory or between a computer 12 in an array 10 and an external device.

Similarly, while the present invention has been disclosed herein for a dual stack processor, the present invention can also be practiced for a single stack processor or a processor comprising more than two stacks.

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.

Patentzitate
Zitiertes PatentEingetragen Veröffentlichungsdatum Antragsteller Titel
US375730631. Aug. 19714. Sept. 1973Texas Instruments IncComputing systems cpu
US410777313. Mai 197415. Aug. 1978Texas Instruments IncorporatedAdvanced array transform processor with fixed/floating point formats
US421542222. Mai 197829. Juli 1980International Business Machines CorporationSelectively modifiable phrase storage for a typewriter
US429893211. Juni 19793. Nov. 1981International Business Machines CorporationSerial storage subsystem for a data processor
US446207419. Nov. 198124. Juli 1984Codex CorporationDo loop circuit
US458906727. Mai 198313. Mai 1986Analogic CorporationFull floating point vector processor with dynamically configurable multifunction pipelined ALU
US459335118. Juni 19843. Juni 1986International Business Machines CorporationHigh speed machine for the physical design of very large scale integrated circuits
US482123121. Dez. 198711. Apr. 1989Motorola, Inc.Method and apparatus for selectively evaluating an effective address for a coprocessor
US49841512. Aug. 19888. Jan. 1991Advanced Micro Devices, Inc.Flexible, next-address generation microprogram sequencer
US502912417. Mai 19882. Juli 1991Digital Equipment CorporationMethod and apparatus for providing high speed parallel transfer of bursts of data
US5053952 *5. Juni 19871. Okt. 1991Wisc Technologies, Inc.Stack-memory-based writable instruction set computer having a single data bus
US521868210. Mai 19918. Juni 1993Chrysler CorporationTwo-way handshake circuit and method for communication between processors
US531773514. Juni 199131. Mai 1994U.S. Philips CorporationSystem for parallel computation with three phase processing in processor tiers in which new instructions trigger execution and forwarding
US5319757 *16. Aug. 19917. Juni 1994Harris CorporationFORTH specific language microprocessor
US5359568 *3. Juni 199325. Okt. 1994Motorola, Inc.FIFO memory system
US537523820. Nov. 199120. Dez. 1994Nec CorporationNesting management mechanism for use in loop control system
US537733315. Sept. 199227. Dez. 1994Hitachi, Ltd.Parallel processor system having computing clusters and auxiliary clusters connected with network of partial networks and exchangers
US539030428. Sept. 199014. Febr. 1995Texas Instruments, IncorporatedMethod and apparatus for processing block instructions in a data processor
US539660918. Jan. 19907. März 1995Gesellschaft Fur Strahlen- Und Umweltforschung Mbh (Gsf)Method of protecting programs and data in a computer against unauthorized access and modification by monitoring address regions
US541072321. Mai 199325. Apr. 1995Deutsche Itt Industries GmbhWavefront array processor for blocking the issuance of first handshake signal (req) by the presence of second handshake signal (ack) which indicates the readyness of the receiving cell
US54407493. Aug. 19898. Aug. 1995Nanotronics CorporationHigh performance, low cost microprocessor architecture
US54856241. Juli 199416. Jan. 1996Hewlett-Packard CompanyCo-processor monitoring address generated by host processor to obtain DMA parameters in the unused portion of instructions
US55353935. Juni 19959. Juli 1996Reeve; Christopher L.System for parallel processing that compiles a filed sequence of instructions within an iteration space
US553541727. Sept. 19939. Juli 1996Hitachi America, Inc.On-chip DMA controller with host computer interface employing boot sequencing and address generation schemes
US555104518. Mai 199427. Aug. 1996Mitsubishi Denki Kabushiki KaishaMicroprocessor with reset execution from an arbitrary address
US5572698 *18. Apr. 19945. Nov. 1996Rolm CompanySystem and method for allocating memory resources where the category of a memory resource determines where on a circular stack a pointer to the memory resource is placed
US56574851. Aug. 199512. Aug. 1997Mitsubishi Denki Kabushiki KaishaProgram control operation to execute a loop processing not immediately following a loop instruction
US569219731. März 199525. Nov. 1997Sun Microsystems, Inc.Method and apparatus for reducing power consumption in a computer network without sacrificing performance
US5706491 *26. Febr. 19966. Jan. 1998Cyrix CorporationBranch processing unit with a return stack including repair using pointers from different pipe stages
US57179435. Juni 199510. Febr. 1998International Business Machines CorporationAdvanced parallel array processor (APAP)
US57271947. Juni 199510. März 1998Hitachi America, Ltd.Repeat-bit based, compact system and method for implementing zero-overhead loops
US574046320. Juli 199514. Apr. 1998Mitsubishi Denki Kabushiki KaishaInformation processing system and method of computation performed with an information processing system
US575225926. März 199612. Mai 1998Advanced Micro Devices, Inc.Instruction cache configured to provide instructions to a microprocessor having a clock cycle time less than a cache access time of said instruction cache
US57846028. Okt. 199621. Juli 1998Advanced Risc Machines LimitedMethod and apparatus for digital signal processing for integrated circuit architecture
US582610119. Aug. 199320. Okt. 1998Texas Instruments IncorporatedData processing device having split-mode DMA channel
US5893148 *10. Nov. 19976. Apr. 1999International Business Machines CorporationSystem and method for allocating cache memory storage space
US591108225. Febr. 19978. Juni 1999Audio Digitalimaging Inc.Parallel processing building block chip
US60031281. Mai 199714. Dez. 1999Advanced Micro Devices, Inc.Number of pipeline stages and loop length related counter differential based end-loop prediction
US602375330. Juni 19978. Febr. 2000Billion Of Operations Per Second, Inc.Manifold array processor
US603865516. Jan. 199714. März 2000Dallas Semiconductor CorporationMicrocontroller having register direct and register indirect addressing
US608530428. Nov. 19974. Juli 2000Teranex, Inc.Interface for processing element array
US610159814. Nov. 19978. Aug. 2000Cirrus Logic, Inc.Methods for debugging a multiprocessor system
US6112296 *18. Dez. 199729. Aug. 2000Advanced Micro Devices, Inc.Floating point stack manipulation using a register map and speculative top of stack values
US6145061 *7. Jan. 19987. Nov. 2000Tandem Computers IncorporatedMethod of management of a circular queue for asynchronous access
US614507220. Sept. 19947. Nov. 2000Hughes Electronics CorporationIndependently non-homogeneously dynamically reconfigurable two dimensional interprocessor communication topology for SIMD multi-processors and apparatus for implementing same
US6148392 *8. Sept. 199814. Nov. 2000Hyundai Electronics Industries Co., Ltd.Low power implementation of an asynchronous stock having a constant response time
US615480911. Sept. 199828. Nov. 2000Nippon Telegraph & Telephone CorporationMathematical morphology processing method
US61733894. Dez. 19989. Jan. 2001Billions Of Operations Per Second, Inc.Methods and apparatus for dynamic very long instruction word sub-instruction selection for execution time parallelism in an indirect very long instruction word processor
US617852523. Febr. 199823. Jan. 2001Sgs-Thomson Microelectronics LimitedTrigger sequencing controller
US62196854. Sept. 199817. Apr. 2001Intel CorporationMethod to detect IEEE overflow and underflow conditions
US622328230. Juli 199824. Apr. 2001Samsung Electronics Co., Ltd.Circuit for controlling execution of loop in digital signal processing chip
US62791017. Juni 199521. Aug. 2001Advanced Micro Devices, Inc.Instruction decoder/dispatch
US635388022. Juli 19985. März 2002Scenix Semiconductor, Inc.Four stage pipeline processing for a microcontroller
US63670052. Okt. 20002. Apr. 2002Idea Corporation Of DelawareSystem and method for synchronizing a register stack engine (RSE) and backing memory image with a processor's execution of instructions during a state saving context switch
US63817058. Nov. 199930. Apr. 2002Stmicroelectronics S.A.Method and device for reducing current consumption of a microcontroller
US642720425. Juni 199930. Juli 2002International Business Machines CorporationMethod for just in-time delivery of instructions in a data processing system
US644970927. Mai 199910. Sept. 2002Adaptec, Inc.Fast stack save and restore system and method
US646012812. Juni 20011. Okt. 2002Intel CorporationMesh network with method and apparatus for interleaved binary exchange
US650764918. Dez. 199814. Jan. 2003Ericsson Inc.Mechanism and method for distributing ISUP stacks over multiple loosely coupled processors
US659814829. Juli 199822. Juli 2003Patriot Scientific CorporationHigh performance microprocessor having variable speed system clock
US6665793 *28. Dez. 199916. Dez. 2003Institute For The Development Of Emerging Architectures, L.L.C.Method and apparatus for managing access to out-of-frame Registers
US672536116. Juni 200020. Apr. 2004Transmeta CorporationMethod and apparatus for emulating a floating point stack in a translation process
US682584322. Nov. 200230. Nov. 2004Nvidia CorporationMethod and apparatus for loop and branch instructions in a programmable graphics pipeline
US682667430. Aug. 200030. Nov. 2004Ip Flex, Inc.Program product and data processor
US68454127. Nov. 200118. Jan. 2005Lsi Logic CorporationMethod and system for a host processor to broadcast data to instruction or data memories of several processors in a multi-processor integrated circuit
US695937218. Febr. 200325. Okt. 2005Cogent Chipware Inc.Processor cluster architecture and associated parallel processing methods
US7028163 *22. Juni 199911. Apr. 2006Samsung Electronics, Co., Ltd.Apparatus for controlling multi-word stack operations using a multi-bank stack in digital data processors
US707904617. Okt. 200318. Juli 2006Yokogawa Electric CorporationMulti-point data acquisition apparatus
US708943825. Juni 20028. Aug. 2006Micron Technology, Inc.Circuit, system and method for selectively turning off internal clock drivers
US713698926. Sept. 200214. Nov. 2006Nec CorporationParallel computation processor, parallel computation control method and program thereof
US71556025. Dez. 200126. Dez. 2006Src Computers, Inc.Interface for integrating reconfigurable processors into a general purpose computing system
US716257325. Juni 20039. Jan. 2007Intel CorporationCommunication registers for processing elements
US71976249. Febr. 200427. März 2007Altera CorporationManifold array processor
US726362413. Mai 200528. Aug. 2007Altera CorporationMethods and apparatus for power control in a scalable array of processor elements
US726980530. Apr. 200411. Sept. 2007Xilinx, Inc.Testing of an integrated circuit having an embedded processor
US2002001084410. Juni 199824. Jan. 2002Karen L. NoelMethod and apparatus for dynamically sharing memory in a multiprocessor system
US2003002875025. Juli 20016. Febr. 2003Hogenauer Eugene B.Method and system for digital signal processing in an adaptive computing engine
US2003006590526. Sept. 20023. Apr. 2003Nec CorporationParallel computation processor, parallel computation control method and program thereof
US2003021724217. Mai 200220. Nov. 2003Samsung Electronics Co., Ltd.System and method for synchronizing a plurality of processors in a processor array
US2004000321930. Okt. 20021. Jan. 2004Teruaki UeharaLoop control circuit and loop control method
US20040059895 *18. Juli 200325. März 2004Christian MayMicroprocessor circuit for portable data carriers and method for operating the circuit
US2004010733229. Okt. 20033. Juni 2004Nec Electronics CorporationArray-type processor
US2004014363828. Okt. 200322. Juli 2004Beckmann Curt E.Apparatus and method for storage processing through scalable port processors
US2004025004631. Dez. 20039. Dez. 2004Gonzalez Ricardo E.Systems and methods for software extensible multi-processing
US2005002754831. Juli 20033. Febr. 2005Jacobs Philip C.Cost minimization of services provided by multiple service providers
US2005011456521. Dez. 200426. Mai 2005Stretch, Inc.Systems and methods for selecting input/output configuration in an integrated circuit
US2005014969321. Jan. 20057. Juli 2005Pts CorporationMethods and apparatus for dual-use coprocessing/debug interface
US2005020664816. März 200422. Sept. 2005Perry Ronald NPipeline and cache for processing data progressively
US2005022320430. März 20056. Okt. 2005Nec Electronics CorporationData processing apparatus adopting pipeline processing system and data processing method used in the same
US2006010123816. Sept. 200511. Mai 2006Pradip BoseAdaptive fetch gating in multithreaded processors, fetch control and method of controlling fetches
US2006014992527. Dez. 20056. Juli 2006Seiko Epson CorporationHigh-performance superscalar-based computer system with out-of-order instruction execution and concurrent results distribution
US2006024831723. Juli 20032. Nov. 2006Martin VorbachMethod and device for processing data
US2006025974310. Mai 200516. Nov. 2006Masakazu SuzuokiMethods and apparatus for power management in a computing system
US2007011305814. Nov. 200517. Mai 2007Texas Instruments IncorporatedMicroprocessor with indepedent SIMD loop buffer
US2007019250416. Febr. 200616. Aug. 2007Moore Charles HAsynchronous computer communication
EP0156654A229. März 19852. Okt. 1985Mitsubishi Denki Kabushiki KaishaControl method for a half-duplex data transmission system
EP0227319A226. Nov. 19861. Juli 1987Analog Devices, Inc.Instruction cache memory
EP0992896A16. Okt. 199812. Apr. 2000Texas Instruments FrancePipeline protection
EP1182544A221. Juni 199027. Febr. 2002Sun Microsystems, Inc.Multiprocessor system with multiple instruction sources
EP1821211A215. Febr. 200722. Aug. 2007Technology Properties LimitedCooperative multitasking method in a multiprocessor system
WO1997015001A24. Okt. 199624. Apr. 1997Patriot Scientific CorporationRisc microprocessor architecture
WO2000042506A113. Jan. 200020. Juli 2000Axis AbProcessor and method of executing instructions from several instruction sources
WO2002050700A219. Okt. 200127. Juni 2002Picochip Designs LimitedProcessor architecture
WO2002088936A130. Apr. 20027. Nov. 2002Portalplayer, Inc.Multiprocessor communication system and method
WO2003019356A122. Aug. 20026. März 2003Adelante Technologies B.V.Pipelined processor and instruction loop execution method
WO2005091847A218. Febr. 20056. Okt. 2005Technology Properties, Ltd.Computer processor array
Nichtpatentzitate
Referenz
125x Emulator; Chuck Moore; Euroforth 2001 (Online); Nov. 26, 2001, XP002490984, Schloss Dagstuhl, Saarland, Germany; Retreived from the Internet: p. 2, para 8, url:http://www.complang.tuwien.ac.at/anton/euroforth/ef01/moore01b.pdf>.
28Xc251SB Embedded Microcontroller User's Manual, Intel, Feb. 1995, pp. 9-1 through 9-4.
3Ambric's New Parallel Processor; Globally Asynchronous Architecture Eases Parallel Programming; Tom R. Halfhill; Microprocessor Report, Scottsdale, Az; Oct. 10, 2006; pp. 1-9.
4An Asynchronous Array of Simple Processors for DSP Applications; Zhiyi et al., Yu; IEEE International Conference Digest of Technical Papers, Feb. 6-9, 2006; pp. 1696-1705.
5An Instruction Buffer for Low-Power DSP; Brackenbury, M. L. L.; Advanced Research In Asynchronous Circuits And Systems, 2000 (ASYNC 2000) Proceedings, Sixth international Symposium On Eilat, Israel, Apr. 2-6, 2000; Los Alamitos, CA, USA; IEEE Comput. Soc., US; Apr. 2, 2000. pp. 176-186.
6An Ultra Low-Power Processor for Sensor Networks; Ekanayake et al., V.; Sigplan Notices ACM, vol. 39, No. 11, Nov. 2004; pp. 27-36.
7ASPRO-216: A Standard-Cell Q.D.I. 16-Bit RISC Asynchronous Microprocessor; Renaudin et al.; Proceedings. International Symposium On Advanced Research In Asychronous Circuits And Systems; Jan. 1, 1989, p. 2231.
8B16-Ein Forth Prozessor im FPGA; Bernd Paysan; INET (Online); Feb. 2, 2003, XP002490986; Retreived from the Internet: url:http://www.jwdt.com/{paysan/b16.pdf> p. 1.
9BitSNAP: Dynamic Significance Compression for a Low-Energy Sensor Network Asynchronous Processor; Ekanayake et al., V.N.; Asynchronous Circuits & Systems, Mar. 14-16, 2005; pp. 144-154.
10C18 Colorforth Compiler; Chuck Moore; Euroforth 2001 (Online); Nov. 26, 2001, XP002490985, Schloss Dagstuhl, Saarland, Germany; Retreived from the Internet: url:http://www.complang.tuwien.ac.at/anton/euroforth/ef01/moore01a.pdf> p. 1.
11Computer Archtecture: a Quantitative Approach; Hennessy et al., John L.; Morgan Kaufmann Publishers, 3rd Edition, 2003; p. 98.
12Connection Machine Model CM-5 System Overview; Palmer et al., Thinking Machine Corp., Cambridge, Mass., IEEE Jul. 1992, pp. 474-483.
13Datawave: A Single-Chip Multiprocessor for Video Applications; Schmidt et al., U.; IEEE Micro, IEEE Service Center, vol. 11, No. 3, Jun. 1, 1991; pp. 22-25, 88.
14Energy Characterization of a Tiled Architecture Processor with On-Chip Networks; Kim, J.S.; Proceedings of the 2003 International Symposium on Low Power Electronics & Design, Aug. 25-27 2003; pp. 424-427.
15Enhanced Serial Port on the 83C51FA, Intel, Nov. 1987.
16Flits: Pervasive Computing for Processor and Memory Constrained Systems, Majurski et al., NIST, pp. 31-38; not dated.
17Forth Session-The Evolution of Forth, Rather et al., Sigplan Notices USA, vol. 28, No. 3, Mar. 1993, pp. 177-199.
18Functionally Asynchronous Array Processor for Morphological Filtering of Greyscale Images; Robin et al., F.; IEEE Proceedings: Computers and Digital Techniques, vol. 143, No. 5, Sep. 24, 1996; pp. 273-281.
19IEEE Standard for Boot (Initialization Configuration) Firmware: Core Requirements and Practices, IEEE Std 1275; 1994.
20Introduction to Java's Architecture, Bill Venners, Artima.com; Jan. 8, 1999, pp. 1-10.
21iWarp: A 100-MPOS, LIW Microprocessor for Multicomputers; Peterson et al.; IEEE Micro; IEEE Service Center, Los Alamitos, CA; vol. 11, No. 3, Jun. 1, 1991, pp. 26-29, 81-87.
22 *Koopman Jr.,Phillp. , Stack Computers the new wave published by Ellis Horwood, 1989.,pp. 1-232.
23Low-Power Electronics Design; Piguet, Christian; CRC Press, 2005, pp. 7-1-7-18.
24M68HC11 Microcontrollers Reference Manual, Motorola, Rev.6, Apr. 2002, p. 29-31, 46, 203,234,549.
25Microchip, PIC18F6585/8585/6680/8680 Data Sheet; Microchop, 2004; pp. 1-31, 229-248.
26Performance and Power Analysis of Globally Asynchronous Locally Synchronous Multi-Processor Systems, Zhiyi Yu et al., Emerging VLSI Technologies And Architectures, 2006. IEEE Computer Society Annual Symposium On Klarlsruhe, Germany, Mar. 2-3, 2006, Piscataway, NJ, USA, IEEE, Mar. 2, 2006 pp. 378-383.
27 *Scholz.T etal. An Improved Dynamic Register Array Concept for High-Performance RISC Processors, IEEE 1995, pp. 181-190.
28 *Sharangpani, H etal. , Itanium Processor Microarchitecture. IEEE, 2000.pp. 24-43.
29The Architecture of the SC32 Forth Engine; Hayes et al.; Journal of Forth Application And Research, Institute For Applied Forth Research; Rochester, US; vol. 5, No. 4, 1989, pp. 493-506 (pp. 500-501 Fig 3).
30The Computer Engineering Handbook; Oklobdzija, Vojin G.; CRC Press, 2002; Chapter 7: Architectures for Low Power.
31The PASM Project: A Study of Reconfigurable Parallel Computing; Siegel et al., H.J.; Parallel Architectures, Algorithms and Networks, Jun. 12-14, 1996; pp. 529-536.
32The Raw Microprocessor: A Computational Fabric For Software Circuits And General-Purpose Programs; Agarwal et al.; IEEE Micro; IEEE , Service Center, Los Alamitos, CA; vol. 22, No. 2, Mar. 1, 2002, pp. 25-35.
33Use IRAM For Rasterization, Kang Y et al., Image Processing, 1998, ICIP 98. Proceedings. 1998; International Conference on Chicago, IL, USA. Oct. 4-7, 1998, Los Alamitos, CA, USA, IEEE Comput. Soc. US, vol. 3,Oct. 4, 1998, pp. 1010-1013.
34VBScript Looping Statements; W3Schools; www.w3schools.com/vbscript/vbsript-looping.asp; Jul. 2000.
Referenziert von
Zitiert von PatentEingetragen Veröffentlichungsdatum Antragsteller Titel
US881307326. Mai 201119. Aug. 2014Samsung Electronics Co., Ltd.Compiling apparatus and method of a multicore device
US20100023730 *24. Juli 200828. Jan. 2010Vns Portfolio LlcCircular Register Arrays of a Computer
Klassifizierungen
US-Klassifikation712/202
Internationale KlassifikationG06F12/00
UnternehmensklassifikationG06F7/785, G06F9/3806, G06F9/30134
Europäische KlassifikationG06F7/78C, G06F9/30R5S, G06F9/38B2B
Juristische Ereignisse
DatumCodeEreignisBeschreibung
30. Apr. 2008ASAssignment
Owner name: TECHNOLOGY PROPERTIES LIMITED, CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:MOORE, CHARLES H.;FOX, JEFFERY ARTHUR;RIBLE, JOHN W.;REEL/FRAME:020875/0601;SIGNING DATES FROM 20061205 TO 20070504
22. Mai 2008ASAssignment
Owner name: VNS PORTFOLIO LLC, CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:TECHNOLOGY PROPERTIES LIMITED;REEL/FRAME:020988/0234
Effective date: 20080423
Owner name: VNS PORTFOLIO LLC,CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:TECHNOLOGY PROPERTIES LIMITED;REEL/FRAME:020988/0234
Effective date: 20080423
5. März 2009ASAssignment
Owner name: TECHNOLOGY PROPERTIES LIMITED LLC, CALIFORNIA
Free format text: LICENSE;ASSIGNOR:VNS PORTFOLIO LLC;REEL/FRAME:022353/0124
Effective date: 20060419
Owner name: TECHNOLOGY PROPERTIES LIMITED LLC,CALIFORNIA
Free format text: LICENSE;ASSIGNOR:VNS PORTFOLIO LLC;REEL/FRAME:022353/0124
Effective date: 20060419
7. März 2013FPAYFee payment
Year of fee payment: 4
25. Apr. 2013ASAssignment
Owner name: ARRAY PORTFOLIO LLC, CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:MOORE, CHARLES H.;GREENARRAYS, INC.;REEL/FRAME:030289/0279
Effective date: 20130127
2. Aug. 2013ASAssignment
Owner name: ARRAY PORTFOLIO LLC, CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:VNS PORTFOLIO LLC;REEL/FRAME:030935/0747
Effective date: 20130123
23. Juni 2017REMIMaintenance fee reminder mailed