Patents by Inventor Ravi Iyengar
Ravi Iyengar 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: 20230313358Abstract: In one aspect, a highly scalable diffusion-couple apparatus includes a transfer chamber configured to load a wafer into a process chamber. The process chamber is configured to receive the wafer substrate from the transfer chamber. The process chamber comprises a chamber for growth of a diffusion material on the wafer. A heatable bottom substrate disk includes a first heating mechanism. The heatable bottom substrate disk is fixed and heatable to a specified temperature. The wafer is placed on the heatable bottom substrate disk. A heatable top substrate disk comprising a second heating mechanism. The heatable top substrate disk is configured to move up and down along an x axis and an x prime axis to apply a mechanical pressure to the wafer on the heatable bottom substrate disk. While the heatable top substrate disk applies the mechanical pressure a chamber pressure is maintained at a specified low value.Type: ApplicationFiled: June 9, 2023Publication date: October 5, 2023Inventors: Kaustav BANERJEE, Ravi IYENGAR, Satish SUNDAR, Nalin RUPESINGHE
-
Publication number: 20230105855Abstract: In one aspect, a highly scalable diffusion-couple apparatus includes a transfer chamber configured to load a wafer into a process chamber. The process chamber is configured to receive the wafer substrate from the transfer chamber. The process chamber comprises a chamber for growth of a diffusion material on the wafer. A heatable bottom substrate disk includes a first heating mechanism. The heatable bottom substrate disk is fixed and heatable to a specified temperature. The wafer is placed on the heatable bottom substrate disk. A heatable top substrate disk comprising a second heating mechanism. The heatable top substrate disk is configured to move up and down along an x axis and an x prime axis to apply a mechanical pressure to the wafer on the heatable bottom substrate disk. While the heatable top substrate disk applies the mechanical pressure a chamber pressure is maintained at a specified low value.Type: ApplicationFiled: July 5, 2022Publication date: April 6, 2023Inventors: KAUSTAV BANERJEE, RAVI IYENGAR, SATISH SUNDAR, NALIN RUPESINGHE
-
Publication number: 20230008834Abstract: In one aspect, a highly scalable diffusion-couple apparatus includes a transfer chamber configured to load a wafer into a process chamber. The process chamber is configured to receive the wafer substrate from the transfer chamber. The process chamber comprises a chamber for growth of a diffusion material on the wafer. A heatable bottom substrate disk includes a first heating mechanism. The heatable bottom substrate disk is fixed and heatable to a specified temperature. The wafer is placed on the heatable bottom substrate disk. A heatable top substrate disk comprising a second heating mechanism. The heatable top substrate disk is configured to move up and down along an x axis and an x prime axis to apply a mechanical pressure to the wafer on the heatable bottom substrate disk. While the heatable top substrate disk applies the mechanical pressure a chamber pressure is maintained at a specified low value.Type: ApplicationFiled: July 12, 2022Publication date: January 12, 2023Inventors: KAUSTAV BANERJEE, RAVI IYENGAR, NALIN RUPESINGHE, SATISH SUNDAR
-
Patent number: 10552157Abstract: A data processing method for a data processing system, comprising: initializing a value of a counter associated with a first entry to indicate a number of destinations of other entries on which the first entry depends; changing the value of the counter in a first direction in response to selecting a first one of the other entries; and changing the value of the counter in a second direction opposite the first direction in response to cancelling a second one of the other entries.Type: GrantFiled: July 12, 2016Date of Patent: February 4, 2020Assignee: SAMSUNG ELECTRONICS CO., LTD.Inventors: Ravi Iyengar, Sandeep Kumar Dubey
-
Patent number: 9588770Abstract: Reconfiguring a register file using a rename table having a plurality of fields that indicate fracture information about a source register of an instruction for instructions which have narrow to wide dependencies.Type: GrantFiled: March 15, 2013Date of Patent: March 7, 2017Assignee: Samsung Electronics Co., LTD.Inventors: Bradley Gene Burgess, Ashraf Ahmed, Ravi Iyengar
-
Publication number: 20160321079Abstract: A data processing method for a data processing system, comprising: initializing a value of a counter associated with a first entry to indicate a number of destinations of other entries on which the first entry depends; changing the value of the counter in a first direction in response to selecting a first one of the other entries; and changing the value of the counter in a second direction opposite the first direction in response to cancelling a second one of the other entries.Type: ApplicationFiled: July 12, 2016Publication date: November 3, 2016Inventors: Ravi IYENGAR, Sandeep Kumar DUBEY
-
Patent number: 9448799Abstract: Out-of-order CPUs, devices and methods diminish the time penalty from stalling the pipe to rebuild a rename table, such as due to a misprediction. A microprocessor can include a pipe that has a decoder, a dispatcher, and at least one execution unit. A rename table stores rename data, and a check-point table (“CPT”) stores rename data received from the dispatcher. A Re-Order Buffer (“ROB”) stores ROB data, and has a dynamic mapping relationship with the CPT. If the rename table is flushed, such as due to a misprediction, the rename table is rebuilt at least in part by concurrent copying of rename data stored in the CPT, in coordination with walking the ROB.Type: GrantFiled: March 14, 2013Date of Patent: September 20, 2016Assignee: SAMSUNG ELECTRONICS CO., LTD.Inventors: Ravi Iyengar, Prarthna Santhanakrishnan
-
Patent number: 9448800Abstract: Out-of-order CPUs, devices and methods diminish the time penalty from stalling the pipe to rebuild a rename table, such as due to a misprediction. A microprocessor can include a pipe that has a decoder, a dispatcher, and at least one execution unit. A rename table stores rename data, and a check-point table (“CPT”) stores rename data received from the dispatcher. A Re-Order Buffer (“ROB”) stores ROB data, and has a static mapping relationship with the CPT. If the rename table is flushed, such as due to a misprediction, the rename table is rebuilt at least in part by concurrent copying of rename data stored in the CPT, in coordination with walking the ROB.Type: GrantFiled: March 14, 2013Date of Patent: September 20, 2016Assignee: SAMSUNG ELECTRONICS CO., LTD.Inventors: Ravi Iyengar, Prarthna Santhanakrishnan
-
Patent number: 9424041Abstract: A method and apparatus for simultaneously canceling a dependent instruction and a nested dependent instruction when a cancel timer of a source of the dependent instruction and a cancel timer of a source of the nested dependent instruction expire and a producer instruction speculatively waking up the dependent instruction is canceled.Type: GrantFiled: March 15, 2013Date of Patent: August 23, 2016Assignee: Samsung Electronics Co., Ltd.Inventors: Ravi Iyengar, Bradley Gene Burgess, Sandeep Kumar Dubey
-
Patent number: 9400653Abstract: A data processing system and method of clearing and rebuilding dependencies, the data processing method including changing a counter associated with a first entry in response to selecting a second entry; comparing the counter with a threshold; and indicating that the first entry is ready to be selected in response to comparing the counter with the threshold; wherein the first entry is dependent on the second entry.Type: GrantFiled: March 14, 2013Date of Patent: July 26, 2016Assignee: SAMSUNG ELECTRONICS CO., LTD.Inventors: Ravi Iyengar, Sandeep Kumar Dubey
-
Patent number: 9395988Abstract: A method and apparatus for register packing prior to register renaming in a microprocessor are provided. The method includes: receiving a plurality of micro operations (micro-ops) decoded from one or more instructions; packing a plurality of registers which are included in the micro-ops into a packed register structure including a plurality of packed registers based on a preset number of rename ports of a renamer through which the packed registers are read or written for register renaming; and sending the packed registers for register renaming.Type: GrantFiled: March 8, 2013Date of Patent: July 19, 2016Assignee: SAMSUNG ELECTRONICS CO., LTD.Inventors: Teik-Chung Tan, Bradley Gene Burgess, Ravi Iyengar
-
Publication number: 20140281415Abstract: Reconfiguring a register file using a rename table having a plurality of fields that indicate fracture information about a source register of an instruction for instructions which have narrow to wide dependencies.Type: ApplicationFiled: March 15, 2013Publication date: September 18, 2014Inventors: Bradley Gene BURGESS, Ashraf AHMED, Ravi IYENGAR
-
Publication number: 20140281393Abstract: Out-of-order CPUs, devices and methods diminish the time penalty from stalling the pipe to rebuild a rename table, such as due to a misprediction. A microprocessor can include a pipe that has a decoder, a dispatcher, and at least one execution unit. A rename table stores rename data, and a check-point table (“CPT”) stores rename data received from the dispatcher. A Re-Order Buffer (“ROB”) stores ROB data, and has a static mapping relationship with the CPT. If the rename table is flushed, such as due to a misprediction, the rename table is rebuilt at least in part by concurrent copying of rename data stored in the CPT, in coordination with walking the ROB.Type: ApplicationFiled: March 14, 2013Publication date: September 18, 2014Inventors: Ravi Iyengar, Prarthna Santhanakrishnan
-
Publication number: 20140281431Abstract: A method and apparatus for simultaneously canceling a dependent instruction and a nested dependent instruction when a cancel timer of a source of the dependent instruction and a cancel timer of a source of the nested dependent instruction expire and a producer instruction speculatively waking up the dependent instruction is canceled.Type: ApplicationFiled: March 15, 2013Publication date: September 18, 2014Inventors: Ravi IYENGAR, Bradley Gene BURGESS, Sandeep Kumar DUBEY
-
Publication number: 20140281404Abstract: A data processing system and method of clearing and rebuilding dependencies, the data processing method including changing a counter associated with a first entry in response to selecting a second entry; comparing the counter with a threshold; and indicating that the first entry is ready to be selected in response to comparing the counter with the threshold; wherein the first entry is dependent on the second entry.Type: ApplicationFiled: March 14, 2013Publication date: September 18, 2014Inventors: Ravi Iyengar, Sandeep Kumar Dubey
-
Publication number: 20140281414Abstract: Out-of-order CPUs, devices and methods diminish the time penalty from stalling the pipe to rebuild a rename table, such as due to a misprediction. A microprocessor can include a pipe that has a decoder, a dispatcher, and at least one execution unit. A rename table stores rename data, and a check-point table (“CPT”) stores rename data received from the dispatcher. A Re-Order Buffer (“ROB”) stores ROB data, and has a dynamic mapping relationship with the CPT. If the rename table is flushed, such as due to a misprediction, the rename table is rebuilt at least in part by concurrent copying of rename data stored in the CPT, in coordination with walking the ROB.Type: ApplicationFiled: March 14, 2013Publication date: September 18, 2014Inventors: Ravi Iyengar, Prarthna Santhanakrishnan
-
Publication number: 20140258687Abstract: A method and apparatus for register packing prior to register renaming in a microprocessor are provided. The method includes: receiving a plurality of micro operations (micro-ops) decoded from one or more instructions; packing a plurality of registers which are included in the micro-ops into a packed register structure including a plurality of packed registers based on a preset number of rename ports of a renamer through which the packed registers are read or written for register renaming; and sending the packed registers for register renaming.Type: ApplicationFiled: March 8, 2013Publication date: September 11, 2014Inventors: Teik-Chung TAN, Bradley Gene BURGESS, Ravi IYENGAR
-
Patent number: 8808992Abstract: The present invention is directed to methods of diagnosing Noonan-like syndrome with loose anagen hair comprising detecting a mutation in SHOC2 gene. One specific diagnostic mutation disclosed is an A-to-G transition at position 4 resulting in a mutation at position 2 of SHOC2 amino acid sequence from serine to glycine. The invention also provides related sequences and kits.Type: GrantFiled: May 6, 2010Date of Patent: August 19, 2014Assignees: Icahn School of Medicine at Mount Sinai, The Regents of the University of CaliforniaInventors: Bruce D. Gelb, Marco Tartaglia, Len Pennacchio, Ravi Iyengar, Avi Ma'ayan
-
Publication number: 20110059851Abstract: The present invention is directed to methods of diagnosing Noonan-like syndrome with loose anagen hair comprising detecting a mutation in SHOC2 gene. One specific diagnostic mutation disclosed is an A-to-G transition at position 4 resulting in a mutation at position 2 of SHOC2 amino acid sequence from serine to glycine. The invention also provides related sequences and kits.Type: ApplicationFiled: May 6, 2010Publication date: March 10, 2011Applicant: MOUNT SINAI SCHOOL OF MEDICINE OF NEW YORK UNIVERSITYInventors: BRUCE D. GELB, MARCO TARTAGLIA, LEN PENNACCHIO, SRINIVAS RAVI IYENGAR, AVI MA'AYAN
-
Publication number: 20080261820Abstract: The present invention relates to a family of graph-theory based methods for the analysis of intracellular signaling networks created from biomedical literature using data-mining processes or acquired through high-content experiments. The methods of the present invention can be used to identify functional dynamic modules within biological networks that can be analyzed quantitatively for input/output relationships. In particular, the present invention relates to a computer-aided method for the in-silico analysis of signaling and other cellular interaction pathways to rank drug targets, identify biomarkers, predict side effects, and classify/diagnose patients.Type: ApplicationFiled: August 1, 2006Publication date: October 23, 2008Applicant: Mount Sinai School of Medicine of New York UniversityInventors: Ravi Iyengar, Avi Ma'ayan