Patents by Inventor Sudhanshu Shukla

Sudhanshu Shukla 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).

  • Publication number: 20230325748
    Abstract: A method for identifying and handling related incidents using a machine-learning based model, includes, performing by one or more processors, operations including: clustering a sub-group of incident records from among a plurality of incident records using the machine-learning based model based on a rolling time window and a number of records in the sub-group of incident records; creating a problem record based on the clustered incident records; populating the problem record with information related to the clustered incident records; linking the clustered incident records to the problem record; providing a notification that the problem record has been created; receiving a resolution for the problem record; and updating, based on the resolution, the machine-learning based model to learn an association between extracted features of the resolution and extracted features of the clustered incident records.
    Type: Application
    Filed: August 2, 2022
    Publication date: October 12, 2023
    Inventors: Gary DUMA, Geoffrey Allan SPARKE, Andrew WYNKOOP, Sudhanshu SHUKLA
  • Publication number: 20230214325
    Abstract: Techniques relating to register file prefetch are described. In an embodiment, execution circuitry causes issuance of a prefetch request to copy data from a data cache unit to a register file. Other embodiments are also disclosed and claimed.
    Type: Application
    Filed: September 30, 2022
    Publication date: July 6, 2023
    Applicant: Intel Corporation
    Inventors: SUDHANSHU SHUKLA, SUMEET BANDISHTE, Jayesh Gaur
  • Publication number: 20220308876
    Abstract: Techniques and mechanisms for determining a relative order in which a load instruction and a store instruction are to be executed. In an embodiment, a processor detects an address collision event wherein two instructions, corresponding to different respective instruction pointer values, target the same memory address. Based on the address collision event, the processor identifies respective instruction types of the two instructions as an aliasing instruction type pair. The processor further determines a count of decisions each to forego a reversal of an order of execution of instructions. Each decision represented in the count is based on instructions which are each of a different respective instruction type of the aliasing instruction type pair. In another embodiment, the processor determines, based on the count of decisions, whether a later load instruction is to be advanced in an order of instruction execution.
    Type: Application
    Filed: March 26, 2021
    Publication date: September 29, 2022
    Applicant: Intel Corporation
    Inventors: Sudhanshu Shukla, Jayesh Gaur, Stanislav Shwartsman, Pavel I. Kryukov
  • Patent number: 11043256
    Abstract: Described are mechanisms and methods for amortizing the cost of address decode, row-decode and wordline firing across multiple read accesses (instead of just on one read access). Some or all memory locations that share a wordline (WL) may be read, by walking through column multiplexor addresses (instead of just reading out one column multiplexor address per WL fire or memory access). The mechanisms and methods disclosed herein may advantageously enable N distinct memory words to be read out if the array uses an N-to-1 column multiplexor. Since memories such as embedded DRAMs (eDRAMs) may undergo a destructive read, for a given WL fire, a design may be disposed to sense N distinct memory words and restore them in order.
    Type: Grant
    Filed: June 29, 2019
    Date of Patent: June 22, 2021
    Assignee: Intel Corporation
    Inventors: Kaushik Vaidyanathan, Huichu Liu, Tanay Karnik, Sreenivas Subramoney, Jayesh Gaur, Sudhanshu Shukla
  • Publication number: 20200411079
    Abstract: Described are mechanisms and methods for amortizing the cost of address decode, row-decode and wordline firing across multiple read accesses (instead of just on one read access). Some or all memory locations that share a wordline (WL) may be read, by walking through column multiplexor addresses (instead of just reading out one column multiplexor address per WL fire or memory access). The mechanisms and methods disclosed herein may advantageously enable N distinct memory words to be read out if the array uses an N-to-1 column multiplexor. Since memories such as embedded DRAMs (eDRAMs) may undergo a destructive read, for a given WL fire, a design may be disposed to sense N distinct memory words and restore them in order.
    Type: Application
    Filed: June 29, 2019
    Publication date: December 31, 2020
    Applicant: Intel Corporation
    Inventors: Kaushik Vaidyanathan, Huichu Liu, Tanay Karnik, Sreenivas Subramoney, Jayesh Gaur, Sudhanshu Shukla