Patents by Inventor Linda L. Lin

Linda L. Lin 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: 11922535
    Abstract: Embodiments provide mechanisms to facilitate compute operations for deep neural networks. One embodiment comprises a graphics processing unit comprising one or more multiprocessors, at least one of the one or more multiprocessors including a register file to store a plurality of different types of operands and a plurality of processing cores. The plurality of processing cores includes a first set of processing cores of a first type and a second set of processing cores of a second type. The first set of processing cores are associated with a first memory channel and the second set of processing cores are associated with a second memory channel.
    Type: Grant
    Filed: February 13, 2023
    Date of Patent: March 5, 2024
    Assignee: Intel Corporation
    Inventors: Prasoonkumar Surti, Narayan Srinivasa, Feng Chen, Joydeep Ray, Ben J. Ashbaugh, Nicolas C. Galoppo Von Borries, Eriko Nurvitadhi, Balaji Vembu, Tsung-Han Lin, Kamal Sinha, Rajkishore Barik, Sara S. Baghsorkhi, Justin E. Gottschlich, Altug Koker, Nadathur Rajagopalan Satish, Farshad Akhbari, Dukhwan Kim, Wenyin Fu, Travis T. Schluessler, Josh B. Mastronarde, Linda L. Hurd, John H. Feit, Jeffery S. Boles, Adam T. Lake, Karthik Vaidyanathan, Devan Burke, Subramaniam Maiyuran, Abhishek R. Appu
  • Publication number: 20030069914
    Abstract: A carry lookahead adder having a reduced internal block fanout which is achieved efficiently in terms of the silicon area needed to implement the carry lookahead adder. The carry lookahead adder of the present invention is characterized by a modified tree structure having carry generate/propagate signal operators located in such a manner that the maximum internal block fanout is equal to (adder width)/8 for adders having a width of at least 16 bits. For adders having a width of less than 16 bits, the internal block fanout is 2. The routing complexity is increased in order to implement redundant overlapping carry generate/propagate operations which, in turn, decreases the internal block fanout of the adder. However, increases in routing complexity can be accomplished within the minimum X-by-Y area of each stage of the adder. Therefore, the overall performance of the carry lookahead adder of the present invention can be optimized while meeting minimum area requirements.
    Type: Application
    Filed: September 3, 1998
    Publication date: April 10, 2003
    Applicant: Agilent Technologies
    Inventors: GREGORY S. DIX, ROBERT J. MARTIN, LINDA L. LIN
  • Patent number: 6516335
    Abstract: An incrementer/decrementer architecture having a reduced internal block fanout which is achieved efficiently in terms of the silicon area needed to implement the incrementer/decrementer. The incrementer/decrementer of the present invention is characterized by a modified tree structure having operators located in such a manner that the maximum internal block fanout is equal to (incrementer/decrementer width)/8 for incrementer/decrementers having a width of at least 16 bits. For incrementer/decrementers having a width of less than 16 bits, the internal block fanout is 2. The routing complexity is increased in order to implement redundant overlapping operations which, in turn, decreases the internal block fanout. However, increases in routing complexity can be accomplished within the minimum X-by-Y area of each stage of the incrementer/decrementer. Therefore, the overall performance of the incrementer/decrementer of the present invention can be optimized while meeting minimum area requirements.
    Type: Grant
    Filed: August 31, 1999
    Date of Patent: February 4, 2003
    Assignee: Agilent Technologies, Inc.
    Inventors: Robert J Martin, Gregory S. Dix, Linda L. Lin