Patents by Inventor Stephen R. Colley

Stephen R. Colley has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 5367636
    Abstract: A parallel processor network comprised of a plurality of nodes, each node including a processor containing a number of I/O ports, and a local memory. Each processor in the network is assigned a unique processor ID (202) such that the processor IDs of two processors connected to each other through port number n, vary only in the nth bit. Input message decoding means (200) and compare logic and message routing logic (204) create a message path through the processor in response to the decoding of an address message packet and remove the message path in response to the decoding of an end of transmission (EOT) Packet. Each address message packet includes a Forward bit used to send a message to a remote destination either within the network or to a foreign network. Each address packet includes Node Address bits that contain the processor ID of the destination node, it the destination node is in the local network.
    Type: Grant
    Filed: November 1, 1993
    Date of Patent: November 22, 1994
    Assignee: nCUBE Corporation
    Inventors: Stephen R. Colley, Stanley P. Kenoyer, Doran K. Wilde
  • Patent number: 5113523
    Abstract: A parallel processor comprised of a plurality of processing nodes (10), each node including a processor (100-114) and a memory (116). Each processor includes means (100, 102) for executing instructions, logic means (114) connected to the memory for interfacing the processor with the memory and means (112) for internode communication. The internode communication means (112) connect the nodes to form a first array (8) of order n having a hypercube topology. A second array (21) of order n having nodes (22) connected together in a hypercube topology is interconnected with the first array to form an order n+l array. The order n+l array is made up of the first and second arrays of order n, such that a parallel processor system may be structured with any number of processors that is a power of two. A set of I/O processors (24) are connected to the nodes of the arrays (8, 21) by means of I/O channels (106).
    Type: Grant
    Filed: May 6, 1985
    Date of Patent: May 12, 1992
    Assignee: NCUBE Corporation
    Inventors: Stephen R. Colley, David W. Jurasek, John F. Palmer, William S. Richardson, Doran K. Wilde
  • Patent number: 4729095
    Abstract: A broadcast pointer instruction has a first source operand (address pointer value) which is the starting address in a memory of message data to be broadcast to a number of processors through output ports. The broadcast pointer instruction has a first destination operand (first multibit mask), there being one bit position in the first mask for each one of the plurality of output ports. The address pointer value is loaded into each of the output ports whose numbers correspond to bit positions in the first mask that are set to be one, such that each output port that is designated in the first mask receives the starting address of the message data in the memory. A broadcast count instruction has a second source operand (a byte count value) equal to the number of bytes in the message data. The broadcast count instruction has a second destination operand (a second multibit mask), there being one bit position in the second mask for each one of the plurality of output ports.
    Type: Grant
    Filed: May 19, 1986
    Date of Patent: March 1, 1988
    Assignee: Ncube Corporation
    Inventors: Stephen R. Colley, Doran K. Wilde
  • Patent number: 4473880
    Abstract: An arbitration mechanism comprising a request FIFO (408) for storing ones and zeros corresponding to received requests in the order that they are made. A one indicates that the request was made by the module in which the FIFO is located, and a zero indicates that the request was made by one of a number of other similar modules. The request status information from the other modules is received over signal lines (411) connected between the modules. This logic separates multiple requests into time-ordered slots, such that all requests in a particular time slot may be serviced before any requests in the next time slot. A store (409) stores a unique logical module number. An arbiter (410) examines this logical number bit-by-bit in successive cycles and places a one in a grant queue (412) upon the condition that the bit examined in a particular cycle is a zero and signals this condition over the signal lines.
    Type: Grant
    Filed: January 26, 1982
    Date of Patent: September 25, 1984
    Assignee: Intel Corporation
    Inventors: David L. Budde, David G. Carson, Stephen R. Colley, David B. Johnson, Robert P. Voll, Doran K. Wilde
  • Patent number: 4415969
    Abstract: An instruction translator unit which receives an instruction stream from a main memory of a microprocessor, for latching data fields, for generating microinstructions necessary to emulate the function encoded in an instruction, and for transferring the data and microinstructions to a microinstruction execution unit over an output bus. The instruction unit includes an instruction decoder (ID) which interprets the fields of received instructions and generates single forced microinstructions and starting addresses of multiple-microinstruction routines. A microinstruction sequencer (MIS) accepts the forced microinstructions and the starting addresses and places on the output bus correct microinstruction sequences necessary to execute the received instruction. The microinstruction routines are stored in a read-only memory (ROM) in the MIS. The starting addresses received from the ID are used to index into and to fetch these microinstructions from the ROM.
    Type: Grant
    Filed: February 7, 1980
    Date of Patent: November 15, 1983
    Assignee: Intel Corporation
    Inventors: John A. Bayliss, Stephen R. Colley, Roy H. Kravitz, William S. Richardson, Dorn K. Wilde, Gurdev Singh
  • Patent number: 4367524
    Abstract: An execution unit which is part of a general-purpose microprocessor, partitioned between two integrated circuit chips, with the execution unit on one chip and an instruction unit on another chip. The execution unit provides the interface for accessing a main memory to thereby fetch data and macroinstructions for transfer to the instruction unit when requested to do so by the instruction unit. The execution unit receives arithmetic microinstructions in order to perform various arithmetic operations, and receives access-memory microinstructions in order to develop memory references from logical addresses received from the instruction unit. Arithmetic operations are performed by a data manipulation unit which contains registers and arithmetic capability, controlled by a math sequencer.
    Type: Grant
    Filed: February 7, 1980
    Date of Patent: January 4, 1983
    Assignee: Intel Corporation
    Inventors: David L. Budde, Stephen R. Colley, Stephen L. Domenik, Allan L. Goodman, James D. Howard
  • Patent number: 4325120
    Abstract: A data processor architecture wherein the processors recognize two basic types of objects, an object being a representation of related information maintained in a contiguously-addresed set of memory locations. The first type of object contains ordinary data, such as characters, integers, reals, etc. The second type of object contains a list of access descriptors. Each access descriptor provides information for locating and defining the extent of access to an object associated with that access descriptor. The processors recognize complex objects that are combinations of objects of the basic types. One such complex object (a context) defines an environment for execution of objects accessible to a given instance of a procedural operation. The dispatching of tasks to the processors is accomplished by hardware-controlled queuing mechanisms (dispatching-port objects) which allow multiple sets of processors to serve multiple, but independent sets of tasks.
    Type: Grant
    Filed: December 21, 1978
    Date of Patent: April 13, 1982
    Assignee: Intel Corporation
    Inventors: Stephen R. Colley, George W. Cox, Justin R. Rattner, Roger C. Swanson