Patents by Inventor Paul T. Gutwin
Paul T. Gutwin 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: 6829755Abstract: A method and system for designing static timing analysis for application specific-type integrated circuits (ASIC). The method includes use of transistor level timing (TLT) methods that are used only when open channel circuit inputs are detected during the generation of the timing graph.Type: GrantFiled: August 16, 2001Date of Patent: December 7, 2004Assignee: International Business Machines CorporationInventors: Paul T. Gutwin, Peter J. Osler
-
Patent number: 6588000Abstract: A method and system for partitioning a large transistor design including transistors and transistor networks, and of the type having a top hierarchical design level and a second, lower hierarchical design level. The method comprises the steps of identifying a desired number of blocks for the second hierarchical level, representing the second hierarchical level as the desired number of blocks, each of the blocks having a boundary, and identifying transistor networks that extend across block boundaries. The method further comprises the steps of assigning transistor networks that cross block boundaries into the top hierarchical level to reduce cross boundary transistor networks, and re-assigning some of the transistors among the blocks to reduce the maximum number of transistors in any one block. Preferably, the transistors are assigned from one block to another by identifying partitions for groups of transistors; and then reassigning assigning transistors on the basis of said partitions.Type: GrantFiled: August 9, 2001Date of Patent: July 1, 2003Assignee: International Business Machines CorporationInventors: Paul T. Gutwin, Peter J. Osler
-
Patent number: 6532520Abstract: A method and apparatus are provided for managing cache allocation for a plurality of data types in a unified cache having dynamically allocable lines for first type data and for second type data. Cache allocation is managed by counting misses to first type data and misses to second type data in the unified cache, and by determining when a difference between a number of first type data misses and a number of second type data misses crosses a preselected threshold. A replacement algorithm of the unified cache then is adjusted in response to the detected crossing of the preselected threshold, the adjusting step including increasing a replacement priority of the first type data lines in the cache. The replacement algorithm preferably is an LRU algorithm wherein the adjusting step includes incrementing an age indication of the first type data lines.Type: GrantFiled: September 10, 1999Date of Patent: March 11, 2003Assignee: International Business Machines CorporationInventors: Alvar A. Dean, Marc R. Faucher, John W. Goetz, Kenneth J. Goodnow, Paul T. Gutwin, Stephen W. Mahin, Wilbur D. Pricer
-
Publication number: 20030037306Abstract: A method and system for designing static timing analysis for application specific-type integrated circuits (ASIC). The method includes use of transistor level timing (TLT) methods that are used only when open channel circuit inputs are detected during the generation of the timing graph.Type: ApplicationFiled: August 16, 2001Publication date: February 20, 2003Applicant: International Business Machines CorporationInventors: Paul T. Gutwin, Peter J. Osler
-
Publication number: 20030033583Abstract: A method and system for partitioning a large transistor design including transistors and transistor networks, and of the type having a top hierarchical design level and a second, lower hierarchical design level. The method comprises the steps of identifying a desired number of blocks for the second hierarchical level, representing the second hierarchical level as the desired number of blocks, each of the blocks having a boundary, and identifying transistor networks that extend across block boundaries. The method further comprises the steps of assigning transistor networks that cross block boundaries into the top hierarchical level to reduce cross boundary transistor networks, and re-assigning some of the transistors among the blocks to reduce the maximum number of transistors in any one block. Preferably, the transistors are assigned from one block to another by identifying partitions for groups of transistors; and then reassigning assigning transistors on the basis of said partitions.Type: ApplicationFiled: August 9, 2001Publication date: February 13, 2003Inventors: Paul T. Gutwin, Peter J. Osler
-
Publication number: 20020152361Abstract: Fine grained control of cache maintenance resulting in improved cache hit rate and processor performance by storing age values and aging rates for respective code lines stored in the cache to direct performance of a least recently used (LRU) strategy for casting out lines of code from the cache which become less likely, over time, of being needed by a processor, thus supporting improved performance of a processor accessing the cache. The invention is implemented by the provision for entry of an arbitrary age value when a corresponding code line is initially stored in or accessed from the cache and control of the frequency or rate at which the age of each code is incremented in response to a limited set of command instructions which may be placed in a program manually or automatically using an optimizing compiler.Type: ApplicationFiled: February 5, 2001Publication date: October 17, 2002Applicant: International Business Machines CorporationInventors: Alvar A. Dean, Kenneth J. Goodnow, Paul T. Gutwin, Stephen W. Mahin, W. David Pricer
-
Patent number: 6449693Abstract: A processor system is provided that comprises a plurality of L0 caches, a processor having a plurality of execution units, and an L1 cache for caching any data and instructions used by the processor. A portion of the execution units provided are configured so that each execution unit within the portion accesses one of the L0 caches. Each of the L0 caches is accessible by only one of the portion of the execution units, and each L0 cache caches a subset of any data used by the processor which is not cacheable by any of the other L0 caches. The processor system preferably comprises an instruction dispatcher that dispatches instructions executable by the processor and that selectively designates data as cacheable by only one of the L0 caches, preferably at dispatch time.Type: GrantFiled: April 5, 1999Date of Patent: September 10, 2002Assignee: International Business Machines CorporationInventors: John W. Goetz, Paul T. Gutwin, Stephen W. Mahin, Wilbur D. Pricer
-
Patent number: 6178467Abstract: A method and system for transferring data between a processor and a device residing at a non-cacheable address. The method includes the steps of asserting the non-cacheable address onto an address bus, asserting a first signal indicating that the processor has data ready for burst mode transfer between the processor and a device residing at the non-cacheable address, asserting a second signal indicating that the device is ready for the burst mode transfer, and performing a burst mode transfer of a plurality of bytes between the processor and the non-cacheable address. The method of the invention provides both sequential and non-sequential burst transfer modes. The system of the invention provides a processor, a device, bus control logic, and non-cacheable address logic.Type: GrantFiled: July 7, 1998Date of Patent: January 23, 2001Assignee: International Business Machines CorporationInventors: Marc R. Faucher, Paul T. Gutwin
-
Patent number: 5796621Abstract: What is provided is a system and method for reducing the storage requirements for delay networks used in performing timing analysis. A circuit delay network is transformed by processing all the possible hubs of the input pairs which are created from a bipartite delay graph of the circuit. A smaller delay network is formed by iteratively selecting the hub with the largest edge-saving and removing the conflicts from the remaining unselected hubs. The selections continues until there are no longer any unselected hubs. Further processing can occur using the selected hubs as inputs to insure that there are no further layers of hubs. The composite of all selected hubs and any inputs and outputs that do not contained hubs is an abstracted delay model for the circuit which can be efficiently stored. These models are subsequently used to reduce the computational requirements for timing analysis performed on delay networks at a higher level.Type: GrantFiled: July 31, 1996Date of Patent: August 18, 1998Assignee: International Business Machines CorporationInventors: Peter E. Dudley, Paul T. Gutwin, Gara Pruesse
-
Patent number: 5239481Abstract: A method for measuring pulse distortion in a digital logic design. A digital logic block of interest is divided into its component primary logic functions. The pulse width distortion characteristics are determined for each primary logic function. The pulse width distortion characteristics are used to develop values representing the minimum pulse width required to guarantee full pulse amplitude propagation through each primary logic function. Thus, pulse distortion is characterized in terms of both width and amplitude components. Pulse width distortion for the entire logic block is then determined by following each logic path through the logic block and statistically summing the pulse width distortion characteristics for each occurrence of each primary logic function in the logic path.Type: GrantFiled: August 30, 1991Date of Patent: August 24, 1993Assignee: International Business Machines CorporationInventors: Thomas W. Brooks, Paul T. Gutwin, Caryn G. Melrose, Frank A. Nemec, Jr., James J. Tomczak