Patents by Inventor Michael James Morrison

Michael James Morrison 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: 6249798
    Abstract: An apparatus, a processor, a computer system and a method may be used to directly transfer and translate data between a memory format in an integer processing unit and a floating point format in a floating point processing unit. Data is stored in integer registers of the integer processing unit in a memory format and is stored in floating point registers of the floating point processing unit in a floating point format. A direct data link is provided between the integer register file of the integer processing unit and the floating point register file of the floating point processing unit. The direct data link includes a logic circuit which translates data between the memory format and the floating point format.
    Type: Grant
    Filed: October 10, 1996
    Date of Patent: June 19, 2001
    Assignee: Institute for the Development of Emerging Architectures, L.L.C.
    Inventors: Roger A. Golliver, Michael James Morrison, Glenn Colon-Bonet, Guatam Bhawandas Doshi, Jerome C. Huck, Alan Hersh Karp, Sivakumar Makineni
  • Patent number: 6021486
    Abstract: A data processing device having an apparatus to execute operations out-of-order. The apparatus having an execution unit to execute the set of operations out-of-order. The execution unit, upon executing an operation that generates a first exception, continues to execute operations out-of-order, to avoid deadlock, until an operation of a first type is to be executed. The execution unit flushes a pipeline once the operation of the first type is to be executed.
    Type: Grant
    Filed: September 30, 1997
    Date of Patent: February 1, 2000
    Assignee: Intel Corporation
    Inventor: Michael James Morrison
  • Patent number: 5880985
    Abstract: In order to multiply operands of different binary lengths using a common combined array, for example to do both 8 bit by 8 bit and 16 bit by 16 bit multiplications, 2.sup.m-1 multiplications are performed, where m is equal to the number of different bit lengths it is desired to multiply. For example, where 8.times.8 bit and 16.times.16 bit multiplications are done, 2 different multiplications are done. Each multiplication is an n.times.n/2.sup.m-1 multiplication, e.g., a 16.times.8 bit multiplication. Sign correction is performed by adding a correction vector or by modifying one of the partial products. The results of the multiplications are added together to obtain a 2 n bit result. Groups of bits from said 2 n result are selected depending on the length of the operands being multiplied.
    Type: Grant
    Filed: October 18, 1996
    Date of Patent: March 9, 1999
    Assignee: Intel Corporation
    Inventors: Sivakumar Makineni, David Harris, Thomas Grutkowski, Michael James Morrison