Patents by Inventor Raymond J. Pedersen

Raymond J. Pedersen 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: 5553254
    Abstract: A first-in-first-out queue is used to manage instruction sequence execution from an instruction cache in a computer processor. Fields are provided in the queue element structure for not only referencing the correct instruction cache line but also for specifying cache line subsequences and the location of branch instructions so as to cause subsequent execution from other cache lines. The structure is particularly supportive of instruction loops and provides significant performance improvement through the elimination of unnecessary cache line writeovers.
    Type: Grant
    Filed: December 20, 1994
    Date of Patent: September 3, 1996
    Assignee: International Business Machines Corporation
    Inventors: Viktors Berstis, Raymond J. Pedersen
  • Patent number: 5280593
    Abstract: A hardware controlled pipelined processor having an interpretive storage and multiple execution units employs interpretive storage "milli-instructions" and an interpretive execution "milli-mode". Additional hardware controlled instructions that are exclusively used in milli-mode may be added to provide additional controls or to improve performance (they augment the architected instruction set). Milli-mode routines intermingle milli-mode only instructions with architected instructions to implement complex functions. One milli-instruction called the DRAIN INSTRUCTION PIPELINE (DIP) causes the pipeline to drain selectively so the milli-programmer determines when and and what type of pipeline drain to perform. A DRAIN INSTRUCTION PIPELINE causes suspension of decoding until a selected event occurs. This DIP instruction includes options for suspending decoding until one of the following events have occurred: 1. all conceptually previous macro-instructions have completed; 2.
    Type: Grant
    Filed: July 28, 1993
    Date of Patent: January 18, 1994
    Assignee: International Business Machines Corporation
    Inventors: Robert J. Bullions, III, Ronald F. Hill, Stephen J. Nadas, Raymond J. Pedersen
  • Patent number: 5226164
    Abstract: An alternate instruction architecture which uses the preexisting dataflow and hardware controlled execution units of an otherwise conventional pipelined processor to accomplish complex functions. Additional hardware controlled instructions (private milli-mode only instructions) are added to provide control functions or to improve performance. These milli-mode instructions augment the standard "user visible" architected instruction set (which in the preferred embodiment is the System 390 instruction set). Millicode routines can intermingle the milli-mode only instructions with standard system instructions to implement complex functions. The set of instructions available in milli-mode can be considered to be an alternate architecture that the processor can execute. The millicode and standard system architectures each have there own set of architected registers. However, these registers are dynamically taken from and returned to a common physical register pool under control of a register management system.
    Type: Grant
    Filed: April 24, 1991
    Date of Patent: July 6, 1993
    Assignee: International Business Machines Corporation
    Inventors: Stephen J. Nadas, Raymond J. Pedersen
  • Patent number: 5185871
    Abstract: The disclosure describes means for allowing the sequencing of operand fetches to deviate from the conceptual sequence specified in the program. Allowing fetch sequencing deviations may improve system performance, while not causing any deviation in program execution results. Out-of-sequence (OOS) fetching may be caused by issuing each fetch without regard to the following conditions: 1. a delay in issuance to storage (such as a delay in generating the address for a fetch request); 2. a speed up in operand data return (such as due to fetching the operand data from a store buffer in the execution unit without going to storage for the data); 3. a delay in the return of operand data (such as when a fetch request has a cache miss and its data must be obtained from the storage hierarchy); or 4. an overlap in the return of fetch data for a serializer instruction with execution of instructions preceding the serializer or data and instruction fetching for instructions following the serializer before its completion.
    Type: Grant
    Filed: December 26, 1989
    Date of Patent: February 9, 1993
    Assignee: International Business Machines Corporation
    Inventors: Bradly G. Frey, Raymond J. Pedersen
  • Patent number: 5176408
    Abstract: A seal device for providing a weather seal between an elongated member such as a pipe, and a surface, such as a roof of a building, through which the pipe extends. The seal device has an apertured base member of resilient material with one end in contact with the roof and the opposite end with an aperture through which the pipe extends. The base member has a sleeve of resilient material integral and projecting from one surface thereof and includes the aperture on the opposite end of the sleeve. A rib formed integral with the sleeve and base member projecting outwardly from the external surface thereof. The rib extends generally down the length of the sleeve and across the base member whereby in use the wall of the sleeve and base member may be slit adjacent to and for the full length of the rib to permit opening of the sleeve and base member to allow fitting around the pipe. The rib has clamp means for holding it closed.
    Type: Grant
    Filed: December 26, 1990
    Date of Patent: January 5, 1993
    Inventor: Raymond J. Pedersen
  • Patent number: 4531199
    Abstract: A binary number substitution mechanism includes first and second storage arrays addressed by first and second portions, respectively, of an input binary number, producing a substitute output binary number. The input binary number represents a predetermined number of microinstruction addresses in a read-only store, and the output binary number is representative of microinstruction addresses in a main storage device. Only a limited number of the possible input binary numbers are required to access the first and second storage arrays to read out selectively stored binary numbers to create a limited range of output binary numbers unique to each of the limited number of the input binary numbers.
    Type: Grant
    Filed: October 13, 1983
    Date of Patent: July 23, 1985
    Assignee: International Business Machines Corporation
    Inventor: Raymond J. Pedersen
  • Patent number: 4422144
    Abstract: A microinstruction control storage mechanism includes a read-only store (ROS), writeable control store (WCS), first cycle control store, and a reserved portion of main storage in a data processing system. The ROS stores frequently used sequences of microinstructions and is not altered during operation. Other sequences of microinstructions which are not frequently used are stored in the reserved portion of main storage. As required, blocks of microinstructions are paged into the WCS from the main storage. One cycle of execution is saved for each machine instruction by utilizing the operation code portion directly from the instruction register of the data processing system to access a microinstruction from the first cycle control store. An array of single-bit storage devices, accessed by microinstruction addresses also utilized to access microinstructions from the ROS, signal the existence of a faulty microinstruction from the ROS as determined by maintenance or design personnel.
    Type: Grant
    Filed: June 1, 1981
    Date of Patent: December 20, 1983
    Assignee: International Business Machines Corp.
    Inventors: Lance H. Johnson, John A. Kiselak, II, Edward A. Nadarzynski, Raymond J. Pedersen
  • Patent number: 4008460
    Abstract: A digital LRU network in which a use value in a chronology register always appears to be increasing; it is incremented for each access to a different data block currently represented in an active LRU array and this use value is copied into an index for that block in an active use-value array. Special circuits are provided to maintain the appearance of continuously increasing use values. At the start of each array search, the special circuits check the chronology register to determine if its use value is nearing its highest registerable value by testing its two high order bits for 1's. If so, the chronology register is set to 100...0, which is higher than any use value in the active array, after the use values in the active array are shifted one bit position to the right by writing them into corresponding positions in another array, which then becomes the active array. The right shift drops the low-order bit in the use values and sets the high-order bit to zero.
    Type: Grant
    Filed: December 24, 1975
    Date of Patent: February 15, 1977
    Assignee: International Business Machines Corporation
    Inventors: Louis R. Bryant, Raymond J. Pedersen, Arnold Weinberger