Patents by Inventor Harrell Hoffman

Harrell Hoffman 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: 7945433
    Abstract: A system and method for design verification and, more particularly, a hardware simulation accelerator design and method that exploits a parallel structure of user models to support a large user model size. The method includes a computer including N number of logic evaluation units (LEUs) that share a common pool of instruction memory (IM). The computer infrastructure is operable to: partition a number of parallel operations in a netlist; and send a same instruction stream of the partitioned number of parallel operations to N number of LEUs from a single IM. The system is a hardware simulation accelerator having a computer infrastructure operable to provide a stream of instructions to multiple LEUs from a single IM. The multiple LEUs are clustered together with multiple IMs such that each LEU is configured to use instructions from any of the multiple IMs thereby allowing a same instruction stream to drive the multiple LEUs.
    Type: Grant
    Filed: April 30, 2007
    Date of Patent: May 17, 2011
    Assignee: International Business Machines Corporation
    Inventors: Daniel R. Crouse, II, Gernot E. Guenther, Viktor Gyuris, Harrell Hoffman, Kevin A. Pasnik, Thomas J. Tryt, John H. Westermann, Jr.
  • Patent number: 7769577
    Abstract: A hardware accelerator includes hardware support for a combinational only cycle and a latch only cycle in a simulation model with a single partition of latches and combinational logic. Preferred embodiments use a special 4-input 1-output function unit in the hardware accelerator in place of the normal latch function that write back the old latch value for combinational only cycles. Other embodiments include hardware support for separate array write disables for arrays and transparent latches depending on whether the cycle is a combinational only cycle and a latch only cycle. A conditional array write disable dependent on the occurrence of a hardware breakpoint is also included that supports switching from a latch plus combinational cycle to a latch only cycle, to give control to the user before evaluating the combinational logic if a breakpoint occurs on a latch.
    Type: Grant
    Filed: August 31, 2007
    Date of Patent: August 3, 2010
    Assignee: International Business Machines Corporation
    Inventors: Gernot E. Guenther, Viktor Gyuris, Harrell Hoffman, Kevin Anthony Pasnik, John Henry Westerman, Jr.
  • Publication number: 20080270748
    Abstract: A system and method for design verification and, more particularly, a hardware simulation accelerator design and method that exploits a parallel structure of user models to support a large user model size. The method includes a computer including N number of logic evaluation units (LEUs) that share a common pool of instruction memory (IM). The computer infrastructure is operable to: partition a number of parallel operations in a netlist; and send a same instruction stream of the partitioned number of parallel operations to N number of LEUs from a single IM. The system is a hardware simulation accelerator having a computer infrastructure operable to provide a stream of instructions to multiple LEUs from a single IM. The multiple LEUs are clustered together with multiple IMs such that each LEU is configured to use instructions from any of the multiple IMs thereby allowing a same instruction stream to drive the multiple LEUs.
    Type: Application
    Filed: April 30, 2007
    Publication date: October 30, 2008
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Daniel R. CROUSE, Gernot E. GUENTHER, Viktor GYURIS, Harrell HOFFMAN, Kevin A. PASNIK, Thomas J. TRYT, John H. WESTERMANN
  • Publication number: 20070294071
    Abstract: A hardware accelerator includes hardware support for a combinational only cycle and a latch only cycle in a simulation model with a single partition of latches and combinational logic. Preferred embodiments use a special 4-input 1-output function unit in the hardware accelerator in place of the normal latch function that write back the old latch value for combinational only cycles. Other embodiments include hardware support for separate array write disables for arrays and transparent latches depending on whether the cycle is a combinational only cycle and a latch only cycle. A conditional array write disable dependent on the occurrence of a hardware breakpoint is also included that supports switching from a latch plus combinational cycle to a latch only cycle, to give control to the user before evaluating the combinational logic if a breakpoint occurs on a latch.
    Type: Application
    Filed: August 31, 2007
    Publication date: December 20, 2007
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Gernot Guenther, Viktor Gyuris, Harrell Hoffman, Kevin Pasnik, John Westerman
  • Patent number: 7290228
    Abstract: A hardware accelerator includes hardware support for a combinational only cycle and a latch only cycle in a simulation model with a single partition of latches and combinational logic. Preferred embodiments use a special 4-input 1-output function unit in the hardware accelerator in place of the normal latch function that write back the old latch value for combinational only cycles. Other embodiments include hardware support for separate array write disables for arrays and transparent latches depending on whether the cycle is a combinational only cycle and a latch only cycle. A conditional array write disable dependent on the occurrence of a hardware breakpoint is also included that supports switching from a latch plus combinational cycle to a latch only cycle, to give control to the user before evaluating the combinational logic if a breakpoint occurs on a latch.
    Type: Grant
    Filed: February 24, 2005
    Date of Patent: October 30, 2007
    Assignee: International Business Machines Corporation
    Inventors: Gernot E. Guenther, Viktor Gyuris, Harrell Hoffman, Kevin Anthony Pasnik, John Henry Westermann, Jr.
  • Publication number: 20060190232
    Abstract: A hardware accelerator includes hardware support for a combinational only cycle and a latch only cycle in a simulation model with a single partition of latches and combinational logic. Preferred embodiments use a special 4-input 1-output function unit in the hardware accelerator in place of the normal latch function that write back the old latch value for combinational only cycles. Other embodiments include hardware support for separate array write disables for arrays and transparent latches depending on whether the cycle is a combinational only cycle and a latch only cycle. A conditional array write disable dependent on the occurrence of a hardware breakpoint is also included that supports switching from a latch plus combinational cycle to a latch only cycle, to give control to the user before evaluating the combinational logic if a breakpoint occurs on a latch.
    Type: Application
    Filed: February 24, 2005
    Publication date: August 24, 2006
    Applicant: International Business Machines Corporation
    Inventors: Gernot Guenther, Viktor Gyuris, Harrell Hoffman, Kevin Pasnik, John Westermann
  • Patent number: 6898562
    Abstract: A method and system are described in a logic simulator machine for overriding a value of a net during execution of a test routine. A model of a logic design to be simulated is built utilizing the logic simulator machine. The logic design includes multiple nets. One of the nets whose actual value may be overridden is selected. A multiplexer is inserted into the model. The multiplexer receives as its inputs the actual value of the selected net, a control bit, and an override value bit. An override value is input into the multiplexer using the override value bit. The multiplexer outputs a current value of the selected net. The current value is thus propagated to other nets. The override value is propagated as the current value of the net instead of the net's actual value throughout execution of the test routine when the multiplexer control bit is set.
    Type: Grant
    Filed: December 7, 2000
    Date of Patent: May 24, 2005
    Assignee: International Business Machines Corporation
    Inventor: Harrell Hoffman
  • Patent number: 6847927
    Abstract: A method and system are described in a logic simulator machine for efficiently creating a trace of an array which includes a plurality of storage locations. The logic simulator machine executes a test routine. Prior to executing the test routine, an initial copy of all data included within each of the storage locations of the array is stored as a first trace of the array. During execution of a first cycle the test routine, all of the write control inputs into the array are read to identify ones of the storage locations which were modified during the execution of the first cycle. A new trace of the array is generated which includes a copy of all of the data of the first trace. In addition, only those ones of the storage locations in the first trace which were modified during the first cycle are updated. A trace is thus generated by updating only those ones of the storage locations which were modified during execution of a cycle of the test routine.
    Type: Grant
    Filed: December 7, 2000
    Date of Patent: January 25, 2005
    Assignee: International Business Machines Corporation
    Inventors: Harrell Hoffman, John Henry Westermann, Jr.
  • Patent number: 6829572
    Abstract: A method and system are described for efficiently overriding a value of a net in an array during execution of a test routine. The logic simulator machine is simulating a logic design which includes the array and multiple nets. A current value of the net is set equal to an override value. A normal update to the array is permitted to occur during execution of a single cycle of the test routine. A determination is then made regarding whether the override value is still stored in the array for the particular net. If the override value is not still stored in the array for this net, normal updates to the array are prohibited during a single cycle of the test routine. During this cycle of the test routine, the override value is then again stored in the net as the current value of the net. This override value is thus made available to be read during this cycle of the test routine while writes to the array are disabled.
    Type: Grant
    Filed: December 7, 2000
    Date of Patent: December 7, 2004
    Assignee: Internatinal Business Machines Corporation
    Inventors: Daniel R. Crouse, II, Harrell Hoffman
  • Publication number: 20020072890
    Abstract: A method and system are described for efficiently overriding a value of a net in an array during execution of a test routine. The logic simulator machine is simulating a logic design which includes the array and multiple nets. A current value of the net is set equal to an override value. A normal update to the array is permitted to occur during execution of a single cycle of the test routine. A determination is then made regarding whether the override value is still stored in the array for the particular net. If the override value is not still stored in the array for this net, normal updates to the array are prohibited during a single cycle of the test routine. During this cycle of the test routine, the override value is then again stored in the net as the current value of the net. This override value is thus made available to be read during this cycle of the test routine while writes to the array are disabled.
    Type: Application
    Filed: December 7, 2000
    Publication date: June 13, 2002
    Applicant: IBM Corporation
    Inventors: Daniel R. Crouse, Harrell Hoffman
  • Publication number: 20020072888
    Abstract: A method and system are described in a logic simulator machine for overriding a value of a net during execution of a test routine. A model of a logic design to be simulated is built utilizing the logic simulator machine. The logic design includes multiple nets. One of the nets whose actual value may be overridden is selected. A multiplexer is inserted into the model. The multiplexer receives as its inputs the actual value of the selected net, a control bit, and an override value bit. An override value is input into the multiplexer using the override value bit. The multiplexer outputs a current value of the selected net. The current value is thus propagated to other nets. The override value is propagated as the current value of the net instead of the net's actual value throughout execution of the test routine when the multiplexer control bit is set.
    Type: Application
    Filed: December 7, 2000
    Publication date: June 13, 2002
    Applicant: IBM Corporation
    Inventor: Harrell Hoffman
  • Publication number: 20020072889
    Abstract: A method and system are described in a logic simulator machine for efficiently creating a trace of an array which includes a plurality of storage locations. The logic simulator machine executes a test routine. Prior to executing the test routine, an initial copy of all data included within each of the storage locations of the array is stored as a first trace of the array. During execution of a first cycle the test routine, all of the write control inputs into the array are read to identify ones of the storage locations which were modified during the execution of the first cycle. A new trace of the array is generated which includes a copy of all of the data of the first trace. In addition, only those ones of the storage locations in the first trace which were modified during the first cycle are updated. A trace is thus generated by updating only those ones of the storage locations which were modified during execution of a cycle of the test routine.
    Type: Application
    Filed: December 7, 2000
    Publication date: June 13, 2002
    Applicant: IBM Corporation
    Inventors: Harrell Hoffman, John Henry Westermann
  • Patent number: 5414858
    Abstract: A system and method for managing service requests from peripherals connected to a personal computer or workstation by operating both in an interrupt mode and a polling mode, with selective transition therebetween. In one practice of the invention, peripheral device service requests are first managed on an interrupt basis, then transition to a polling mode when the interrupt rate exceeds a rate threshold, and subsequently revert back to the interrupt mode when the rate again decreases below a threshold. The transition is dynamic and situation adjustable by parameter selection both as to the number of service requests and as to the time interval used to initiate transition between the interrupt and polling modes.
    Type: Grant
    Filed: December 11, 1992
    Date of Patent: May 9, 1995
    Assignee: International Business Machines Corporation
    Inventors: Harrell Hoffman, Mark D. Sweet
  • Patent number: 5001624
    Abstract: A data processing system including a processor that executes a plurality of instructions including at least one instruction that requires an external operation to be performed. The processor provides information for this external operation instruction to an external device and continues to execute instructions that do not require the results from this external operation. The external device receives the information from the processor, performs the external operation and provides the results to the processor. A further aspect of this data processing system is an interface that is interconnected between the processor and the external device. The processor provides the external operation information to the interface. The interface in turn provides the information to the external device and concurrently accesses data from the memory that will be required by the external device for performing the external operation.
    Type: Grant
    Filed: January 25, 1989
    Date of Patent: March 19, 1991
    Inventors: Harrell Hoffman, Scott M. Smith, John A. Voltin, Charles G. Wright
  • Patent number: 4817037
    Abstract: A data processing system including several devices connected to an asynchronous communications bus for communications between these devices. The communications bus includes a protocol that requires only a single device to regulate communication between devices at any one time. This regulating device is termed the bus master and the remaining devices are termed slaves. This protocol provides the capability for a slave device to indicate to the bus master that a new bus master is to be designated for a temporary communication. This communication with a different bus master then occurs during the communication of the designated bus master.
    Type: Grant
    Filed: February 13, 1987
    Date of Patent: March 28, 1989
    Assignee: International Business Machines Corporation
    Inventors: Harrell Hoffman, Charles G. Wright