IP Library › Granted Patent US 12,271,675
Granted Patent B2
US 12,271,675 · App. 17/647,679 · Granted Apr 8, 2025

Location-aware protection system of latches (LAPS-L)

Inventors: Karthik V Swaminathan (Mount Kisco, NY); Alper Buyuktosunoglu (White Plains, NY); Pradip Bose (Yorktown Heights, NY); Bulent Abali (Tenafly, NJ)
Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
G06F30/398G06F30/392H03M13/27G06F2119/12
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,271,675
App. No.
17/647,679
Granted
Apr 8, 2025
Kind
B2
Abstract

Embodiments for providing enhanced location-aware protection of latches in a computing environment are provided. One or more latches are combined in one or more of a plurality of bounding boxes on a two-dimensional circuit design layout based on one or more rules. A location-aware interleaving of error correction codes (“ECC”) and burst error correction codes may be selectively applied to one or more latches in those of the plurality of bounding boxes, where multiple bit errors are corrected.

Claims (30)

1. A method for providing enhanced location-aware protection of memory register latches in a computing environment by one or more processors comprising:

combining one or more latches in one or more of a plurality of bounding boxes on a circuit design layout based on one or more rules; and

selectively applying a location-aware interleaving of error correction codes (“ECC”) and burst error correction codes (“BEC”) to one or more latches in those of the plurality of bounding boxes, wherein multiple bit errors are corrected.

2. The method of claim 1 , further including applying a two-dimensional (“2D”) template having the plurality of bounding boxes to the circuit design layout having one or more latches.

3. The method of claim 1 , further including identifying a maximum high energy particle strike radius for each of the plurality of bounding boxes.

4. The method of claim 1 , further including identifying a set of latches in each ECC word based on the location-aware interleaving.

5. The method of claim 1 , further including preventing one or more latches in each ECC word from sharing a same boundary box of the plurality of bounding boxes based on the location-aware interleaving.

6. The method of claim 1 , further including combining a set of functionally separate latches having a similar clock sequence.

7. The method of claim 1 , further including overlapping one or more boundary boxes of the plurality of bounding boxes with one or more alternative boundary boxes of the plurality of bounding boxes, wherein overlapped boundary boxes ensure any two latches are at least two boundary boxes apart.

8. A system for providing enhanced location-aware protection of memory register latches in a computing environment, comprising:

one or more computers with executable instructions that when executed cause the system to:

combine one or more latches in one or more of a plurality of bounding boxes on a circuit design layout based on one or more rules; and

selectively apply a location-aware interleaving of error correction codes (“ECC”) and burst error correction codes (“BEC”) to one or more latches in those of the plurality of bounding boxes, wherein multiple bit errors are corrected.

9. The system of claim 8 , wherein the executable instructions when executed cause the system to apply a two-dimensional (“2D”) template having the plurality of bounding boxes to the circuit design layout having the one or more latches.

10. The system of claim 8 , wherein the executable instructions when executed cause the system to identify a maximum high energy particle strike radius for each of the plurality of bounding boxes.

11. The system of claim 8 , wherein the executable instructions when executed cause the system to identify a set of latches in each ECC word based on the location-aware interleaving.

12. The system of claim 8 , wherein the executable instructions when executed cause the system to prevent one or more latches from sharing a same boundary box of the plurality of bounding boxes based on the location-aware interleaving.

13. The system of claim 8 , wherein the executable instructions when executed cause the system to combine a set of functionally separate latches having a similar clock sequence.

14. The system of claim 8 , wherein the executable instructions when executed cause the system to overlap one or more boundary boxes of the plurality of bounding boxes with one or more alternative boundary boxes of the plurality of bounding boxes, wherein overlapped boundary boxes ensure any two latches are at least two boundary boxes apart.

15. A computer program product for providing enhanced location-aware protection of memory register latches in a computing environment, the computer program product comprising:

one or more computer readable storage media, and program instructions collectively stored on the one or more computer readable storage media, the program instruction comprising:

program instructions to combine one or more latches in one or more of a plurality of bounding boxes on a circuit design layout based on one or more rules; and

program instructions to selectively apply a location-aware interleaving of error correction codes (“ECC”) and burst error correction codes (“BEC”) to one or more latches in those of the plurality of bounding boxes, wherein multiple bit errors are corrected.

16. The computer program product of claim 15 , further including program instructions to apply a two-dimensional (“2D”) template having the plurality of bounding boxes to the circuit design layout having the one or more latches.

17. The computer program product of claim 15 , further including program instructions to:

identify a maximum high energy particle strike radius for each of the plurality of bounding boxes; and

identify a set of latches in each ECC word based on the location-aware interleaving.

18. The computer program product of claim 15 , further including program instructions to prevent the one or more latches from sharing a same boundary box of the plurality of bounding boxes based on the location-aware interleaving.

19. The computer program product of claim 15 , further including program instructions to combine a set of functionally separate latches having a similar clock sequence.

20. The computer program product of claim 15 , further including program instructions to overlap one or more boundary boxes of the plurality of bounding boxes with one or more alternative boundary boxes of the plurality of bounding boxes, wherein overlapped boundary boxes ensure any two latches are at least two boundary boxes apart.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 11, 2022
From: SWAMINATHAN, KARTHIK V; BUYUKTOSUNOGLU, ALPER; BOSE, PRADIP; ABALI, BULENT
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 058622/0274 →
Continuity (1)
Related Publication 20230222279A1 · Jul 13, 2023
References Cited (32)
US 7774732B2 · Kleinosowski et al. · 2010 [cited by applicant]
US 7795900B1 · Lesea et al. · 2010 [cited by applicant]
US 8171386B2 · Chandra et al. · 2012 [cited by applicant]
US 8271912B2 · Ellavsky · 2012 [cited by examiner]
US 8468484B2 · Lilja · 2013 [cited by applicant]
US 8972819B2 · Morris · 2015 [cited by examiner]
US 9268637B2 · Gifford · 2016 [cited by examiner]
US 9985656B2 · Jeganathan et al. · 2018 [cited by applicant]
US 10365327B2 · Bose et al. · 2019 [cited by applicant]
US 10930646B2 · Chang · 2021 [cited by examiner]
US 20080120525A1 · Agarwal · 2008 [cited by examiner]
US 20090049418A1 · KleinOsowski · 2009 [cited by examiner]
US 20090241073A1 · Ellavsky · 2009 [cited by examiner]
US 20090249301A1 · Kalla et al. · 2009 [cited by applicant]
US 20130162293A1 · Lilja · 2013 [cited by examiner]
US 20160373158A1 · Ardalan · 2016 [cited by examiner]
US 20170063401A1 · Jeganathan et al. · 2017 [cited by applicant]
US 20210247441A1 · Autie et al. · 2021 [cited by applicant]
US 20230308182A1 · Frankel · 2023 [cited by examiner]
US 20240054046A1 · Khayat · 2024 [cited by examiner]
US 20240071521A1 · Nguyen · 2024 [cited by examiner]
US 20240071544A1 · Zainuddin · 2024 [cited by examiner]
US 20240104282A1 · Trombley · 2024 [cited by examiner]
CN 104409103A · 2015 [cited by applicant]
WO 2014066402A1 · 2014 [cited by applicant]
Kim et al., “All-inclusive ECC: Thorough end-to-end protection for reliable computer memory”, 2016 ACM/IEEE 43rd Annual International Symposium on Computer Architecture (ISCA), 2016, pp. 622-633, doi: 10.1109/ISCA.2016.… [cited by applicant]
Arbel et al., “Automated detection and verification of parity-protected memory elements”, ICCAD '14: Proceedings of the 2014 IEEE/ACM International Conference on Computer-Aided Design, Nov. 2014, (8 pages). [cited by applicant]
Maniatakos et al., “Vulnerability-based interleaving for multi-bit upset (MBU) protection in modern microprocessors”, 2012 IEEE International Test Conference, 2012, pp. 1-8, doi: 10.1109/TEST.2012.6401594, (8 pages). [cited by applicant]
Paul et al., “Reliability-Driven ECC Allocation for Multiple Bit Error Resilience in Processor Cache,” in IEEE Transactions on Computers, vol. 60, No. 1, pp. 20-34, Jan. 2011, doi: 10.1109/TC.2010.203, (15 pages). [cited by applicant]
Shi et al., “Interleaving for combating bursts of errors,” in IEEE Circuits and Systems Magazine, vol. 4, No. 1, pp. 29-42, 2004, doi: 10.1109/MCAS.2004.1286985, (14 pages). [cited by applicant]
Lilja et al., “Single-Event Performance and Layout Optimization of Flip-Flops in a 28-nm Bulk Technology,” in IEEE Transactions on Nuclear Science, vol. 60, No. 4, pp. 2782-2788, Aug. 2013, doi: 10.1109/TNS.2013.2273437… [cited by applicant]
Das et al., “Low Complexity Burst Error Correcting Codes to Correct MBUs in SRAMs” Proceedings of the 2018 on Great Lakes Symposium on VLSI, 219-224, 2018, (6 pages). [cited by applicant]