IP Library › Granted Patent US 12,693,977
Granted Patent B2
US 12,693,977 · App. 17/708,435 · Granted Jul 28, 2026

Dynamic inclusive and non-inclusive caching policy

Inventors: Hanna Alam (Jish, IL); Yuval Bustan (Moshav Mismeret, IL); Tomer Exterman (Petach Tiqwa, IL); Dor Kahana (Ramat Gan, IL); Larisa Novakovsky (Haifa, IL); Joseph Nuzman (Haifa, IL)
Assignee: Intel Corporation
G06F12/0811G06F2212/62
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,693,977
App. No.
17/708,435
Filed
Mar 30, 2022
Granted
Jul 28, 2026
Kind
B2
Art Unit
2133
USPC
711/122
Abstract

Methods and apparatus relating to a dynamic inclusive and non-inclusive caching policy are described. In an embodiment, a first cache has a higher level than a second cache. Circuitry determines a caching policy between the first cache and the second cache based on a comparison of a number of active processor cores and a threshold value. The caching policy is one of an inclusive caching policy or a non-inclusive caching policy. Other embodiments are also disclosed and claimed.

Claims (34)

1 . An apparatus comprising:

a first cache having a higher level than a second cache; and

circuitry to determine a caching policy between the first cache and the second cache based at least in part on a comparison of a number of active processor cores and a threshold value,

wherein the caching policy is one of an inclusive caching policy or a non-inclusive caching policy.

2 . The apparatus of claim 1 , wherein the circuitry is to dynamically determine the caching policy during runtime.

3 . The apparatus of claim 1 , comprising a machine learning model to determine the threshold value based on telemetry data.

4 . The apparatus of claim 3 , wherein training of the machine learning model is to be performed offline.

5 . The apparatus of claim 3 , wherein the telemetry data is to be collected during a selected period of time.

6 . The apparatus of claim 3 , wherein the machine learning model is to operate in accordance with a logistic regression model.

7 . The apparatus of claim 3 , wherein the telemetry data includes one or more of:

statistic data of a processor core, statistic data of a storage device, and telemetry data sent from a System On Chip (SOC) device.

8 . The apparatus of claim 7 , wherein the storage device comprises a cache, wherein the statistic data of the storage device includes a number of stalls, queue occupancy, and cache pre-fetcher data.

9 . The apparatus of claim 1 , wherein the first cache comprises one or more of a Last Level Cache and a Level 3 (L3) cache.

10 . The apparatus of claim 1 , wherein the second cache comprises one or more of a Mid-Level Cache (MLC) and Level 2 (2) cache.

11 . The apparatus of claim 1 , wherein the inclusive caching policy is to ensure that any cache line present in the second cache is also present in the first cache.

12 . The apparatus of claim 1 , wherein the non-inclusive caching policy is to indicate that any cache line present in the second cache may but is not guaranteed to also be present in the first cache.

13 . The apparatus of claim 1 , wherein the active processor cores are coupled to one or more of the first cache and the second cache.

14 . The apparatus of claim 1 , wherein a processor, having one or more processor cores, comprises the circuitry and/or the second cache.

15 . The apparatus of claim 1 , wherein a System On Chip (SOC) comprises one or more of: a processor, having one or more processor cores, the circuitry, the first cache, and the second cache.

16 . One or more non-transitory computer-readable media comprising one or more instructions that when executed on at least one processor configure the processor to perform one or more operations to cause:

a first cache, having a higher level than a second cache, to store data; and

circuitry to determine a caching policy between the first cache and the second cache based on a comparison of a number of active processor cores and a threshold value,

wherein the caching policy is one of an inclusive caching policy or a non-inclusive caching policy.

17 . The one or more computer-readable media of claim 16 , further comprising one or more instructions that when executed on the at least one processor configure the at least one processor to perform one or more operations to cause the circuitry to dynamically determine the caching policy during runtime.

18 . The one or more computer-readable media of claim 16 , further comprising one or more instructions that when executed on the at least one processor configure the at least one processor to perform one or more operations to cause a machine learning model to determine the threshold value based on telemetry data.

19 . The one or more computer-readable media of claim 18 , further comprising one or more instructions that when executed on the at least one processor configure the at least one processor to perform one or more operations to cause collection of the telemetry data during a selected period of time.

20 . The one or more computer-readable media of claim 18 , further comprising one or more instructions that when executed on the at least one processor configure the at least one processor to perform one or more operations to cause the machine learning model to operate in accordance with a logistic regression model.

21 . A method comprising:

causing a first cache, having a higher level than a second cache, to store data; and

determining a caching policy between the first cache and the second cache based on a comparison of a number of active processor cores and a threshold value, wherein the caching policy is one of an inclusive caching policy or a non-inclusive caching policy.

22 . The method of claim 21 , comprising dynamically determining the caching policy during runtime.

23 . The method of claim 21 , further comprising determining, by a machine learning model, the threshold value based on telemetry data.

24 . The method of claim 23 , further comprising collecting the telemetry data during a selected period of time.

25 . The method of claim 23 , further comprising operating the machine learning model in accordance with a logistic regression model.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 31, 2022
From: ALAM, HANNA; BUSTAN, YUVAL; EXTERMAN, TOMER; KAHANA, DOR; NOVAKOVSKY, LARISA; NUZMAN, JOSEPH
To: INTEL CORPORATION
Reel/Frame 060054/0954 →
Continuity (1)
Related Publication 20230315630A1 · Oct 5, 2023
References Cited (250)
US 4352869A · Mellors · 1982 [cited by applicant]
US 4412281A · Works · 1983 [cited by applicant]
US 4415969A · Bayliss et al. · 1983 [cited by applicant]
US 5506073A · Angell et al. · 1996 [cited by applicant]
US 5714279A · Zajac, Jr. et al. · 1998 [cited by applicant]
US 6009488A · Kavipurapu · 1999 [cited by applicant]
US 6427202B1 · Richardson et al. · 2002 [cited by applicant]
US 6560693B1 · Puzak et al. · 2003 [cited by applicant]
US 6625694B2 · Masri et al. · 2003 [cited by applicant]
US 6678847B1 · Perry et al. · 2004 [cited by applicant]
US 6684298B1 · Dwarkadas et al. · 2004 [cited by applicant]
US 6687789B1 · Keller et al. · 2004 [cited by applicant]
US 6766442B1 · Kahle et al. · 2004 [cited by applicant]
US 6779036B1 · Deshpande · 2004 [cited by applicant]
US 6826651B2 · Michael et al. · 2004 [cited by applicant]
US 6947047B1 · Moy et al. · 2005 [cited by applicant]
US 7017011B2 · Lesmanne et al. · 2006 [cited by applicant]
US 7096323B1 · Conway et al. · 2006 [cited by applicant]
US 7178013B1 · Batcher · 2007 [cited by applicant]
US 7844053B2 · Crispin et al. · 2010 [cited by applicant]
US 8041898B2 · Moga et al. · 2011 [cited by applicant]
US 8392665B2 · Moga et al. · 2013 [cited by applicant]
US 8539212B1 · Kang et al. · 2013 [cited by applicant]
US 9160034B2 · Kato et al. · 2015 [cited by applicant]
US 9164900B1 · Schuttenberg · 2015 [cited by applicant]
US 9172701B2 · Burch et al. · 2015 [cited by applicant]
US 9223709B1 · O'Bleness · 2015 [cited by examiner]
US 9519773B2 · Patel et al. · 2016 [cited by applicant]
US 9940138B2 · Lopez et al. · 2018 [cited by applicant]
US 10008735B2 · Ohtomo et al. · 2018 [cited by applicant]
US 11085964B2 · Kurts et al. · 2021 [cited by applicant]
US 11216366B2 · Durham et al. · 2022 [cited by applicant]
US 20020078331A1 · Ju et al. · 2002 [cited by applicant]
US 20020103979A1 · Koga · 2002 [cited by applicant]
US 20020116662A1 · Hofstee et al. · 2002 [cited by applicant]
US 20030023836A1 · Catherwood et al. · 2003 [cited by applicant]
US 20030041212A1 · Creta et al. · 2003 [cited by applicant]
US 20030149865A1 · Kadambi · 2003 [cited by applicant]
US 20030163649A1 · Kapur et al. · 2003 [cited by applicant]
US 20030163679A1 · Ganapathy et al. · 2003 [cited by applicant]
US 20040078558A1 · Sprangle · 2004 [cited by applicant]
US 20040123043A1 · Rotithor et al. · 2004 [cited by applicant]
US 20040151986A1 · Park et al. · 2004 [cited by applicant]
US 20050125640A1 · Ford et al. · 2005 [cited by applicant]
US 20050198187A1 · Tierney et al. · 2005 [cited by applicant]
US 20050198479A1 · Bean et al. · 2005 [cited by applicant]
US 20060101209A1 · Lais et al. · 2006 [cited by applicant]
US 20060143408A1 · Sistla · 2006 [cited by applicant]
US 20060179291A1 · Di Gregorio · 2006 [cited by applicant]
US 20060206686A1 · Banerjee et al. · 2006 [cited by applicant]
US 20060294344A1 · Hsu et al. · 2006 [cited by applicant]
US 20070055826A1 · Morton et al. · 2007 [cited by applicant]
US 20070055958A1 · Birenheide et al. · 2007 [cited by applicant]
US 20070113059A1 · Tran · 2007 [cited by applicant]
US 20070233932A1 · Collier et al. · 2007 [cited by applicant]
US 20080059710A1 · Handgen et al. · 2008 [cited by applicant]
US 20080162868A1 · Glew · 2008 [cited by applicant]
US 20090015589A1 · Luick et al. · 2009 [cited by applicant]
US 20090248989A1 · Chicheportiche et al. · 2009 [cited by applicant]
US 20090276581A1 · Moga et al. · 2009 [cited by applicant]
US 20100275049A1 · Balakrishnan et al. · 2010 [cited by applicant]
US 20100332762A1 · Moga et al. · 2010 [cited by applicant]
US 20110045355A1 · Ichikawa · 2011 [cited by applicant]
US 20110055523A1 · Kaplan et al. · 2011 [cited by applicant]
US 20110283124A1 · Branover et al. · 2011 [cited by applicant]
US 20120079214A1 · Moga et al. · 2012 [cited by applicant]
US 20120131555A1 · Hossain et al. · 2012 [cited by applicant]
US 20120159073A1 · Jaleel et al. · 2012 [cited by applicant]
US 20120159074A1 · Sodhi et al. · 2012 [cited by applicant]
US 20120301796A1 · Ohtomo et al. · 2012 [cited by applicant]
US 20120308900A1 · Ogasa · 2012 [cited by applicant]
US 20130246709A1 · Segelken et al. · 2013 [cited by applicant]
US 20130275724A1 · Bharadwaj · 2013 [cited by applicant]
US 20130295464A1 · Yanagi et al. · 2013 [cited by applicant]
US 20140195790A1 · Merten et al. · 2014 [cited by applicant]
US 20140281239A1 · Novakovsky · 2014 [cited by examiner]
US 20140297919A1 · Nachimuthu et al. · 2014 [cited by applicant]
US 20150127983A1 · Trobough et al. · 2015 [cited by applicant]
US 20150147659A1 · Kato · 2015 [cited by applicant]
US 20150254186A1 · Sugimoto et al. · 2015 [cited by applicant]
US 20160011975A1 · Ananthakrishnan et al. · 2016 [cited by applicant]
US 20160103232A1 · Ouspenski et al. · 2016 [cited by applicant]
US 20160149259A1 · Osada et al. · 2016 [cited by applicant]
US 20160156064A1 · Miyashita et al. · 2016 [cited by applicant]
US 20160204467A1 · Nogami et al. · 2016 [cited by applicant]
US 20160248119A1 · Kato · 2016 [cited by applicant]
US 20160268630A1 · Tsukada et al. · 2016 [cited by applicant]
US 20160308210A1 · Sakuda et al. · 2016 [cited by applicant]
US 20160342390A1 · Giesselmann et al. · 2016 [cited by applicant]
US 20160359193A1 · Yi et al. · 2016 [cited by applicant]
US 20170024205A1 · Kountanis et al. · 2017 [cited by applicant]
US 20170040637A1 · Ceder et al. · 2017 [cited by applicant]
US 20170093567A1 · Gopal et al. · 2017 [cited by applicant]
US 20170179481A1 · Yamada et al. · 2017 [cited by applicant]
US 20170187066A1 · Tsujimura et al. · 2017 [cited by applicant]
US 20170222257A1 · Miyashita et al. · 2017 [cited by applicant]
US 20170229734A1 · Furukawa et al. · 2017 [cited by applicant]
US 20170243203A1 · Bond et al. · 2017 [cited by applicant]
US 20170286254A1 · Menon et al. · 2017 [cited by applicant]
US 20170288281A1 · Chiang et al. · 2017 [cited by applicant]
US 20170300418A1 · Reed et al. · 2017 [cited by applicant]
US 20170344510A1 · Park et al. · 2017 [cited by applicant]
US 20170353576A1 · Guim Bernat et al. · 2017 [cited by applicant]
US 20170357596A1 · Moyer · 2017 [cited by examiner]
US 20180095752A1 · Kudaravalli et al. · 2018 [cited by applicant]
US 20180183065A1 · Sasaki · 2018 [cited by applicant]
US 20180269521A1 · Ohtomo et al. · 2018 [cited by applicant]
US 20180300238A1 · Vembu et al. · 2018 [cited by applicant]
US 20180307438A1 · Huang et al. · 2018 [cited by applicant]
US 20190012267A1 · Scalabrino et al. · 2019 [cited by applicant]
US 20190042799A1 · Durham et al. · 2019 [cited by applicant]
US 20190067736A1 · Yoshioka et al. · 2019 [cited by applicant]
US 20190088995A1 · Asano et al. · 2019 [cited by applicant]
US 20190095345A1 · Zmudzinski et al. · 2019 [cited by applicant]
US 20190095389A1 · Barnes et al. · 2019 [cited by applicant]
US 20190097266A1 · Yamamoto et al. · 2019 [cited by applicant]
US 20190097818A1 · Lu et al. · 2019 [cited by applicant]
US 20190220284A1 · Gupta et al. · 2019 [cited by applicant]
US 20190347213A1 · Lutz et al. · 2019 [cited by applicant]
US 20200089504A1 · Sheikh et al. · 2020 [cited by applicant]
US 20200125501A1 · Durham et al. · 2020 [cited by applicant]
US 20200125770A1 · LeMay et al. · 2020 [cited by applicant]
US 20200134417A1 · Mohapatra et al. · 2020 [cited by applicant]
US 20200159676A1 · Durham et al. · 2020 [cited by applicant]
US 20200169383A1 · Durham et al. · 2020 [cited by applicant]
US 20200210183A1 · Burylov et al. · 2020 [cited by applicant]
US 20200212481A1 · Nagamine et al. · 2020 [cited by applicant]
US 20200228137A1 · Chinya et al. · 2020 [cited by applicant]
US 20200328454A1 · Sakai et al. · 2020 [cited by applicant]
US 20200328455A1 · Sakai et al. · 2020 [cited by applicant]
US 20200328457A1 · Sakai et al. · 2020 [cited by applicant]
US 20200328460A1 · Asano et al. · 2020 [cited by applicant]
US 20200328461A1 · Asano et al. · 2020 [cited by applicant]
US 20200328462A1 · Asano et al. · 2020 [cited by applicant]
US 20200328464A1 · Asano et al. · 2020 [cited by applicant]
US 20200328465A1 · Sakaida et al. · 2020 [cited by applicant]
US 20200328468A1 · Sakaida et al. · 2020 [cited by applicant]
US 20200328469A1 · Asano et al. · 2020 [cited by applicant]
US 20200335817A1 · Asano et al. · 2020 [cited by applicant]
US 20200348361A1 · Kurts et al. · 2020 [cited by applicant]
US 20200350615A1 · Sakaida et al. · 2020 [cited by applicant]
US 20200350622A1 · Sakaida et al. · 2020 [cited by applicant]
US 20200371811A1 · Govindan et al. · 2020 [cited by applicant]
US 20200379902A1 · Durham et al. · 2020 [cited by applicant]
US 20200393557A1 · Manneschi · 2020 [cited by applicant]
US 20200410327A1 · Chinya et al. · 2020 [cited by applicant]
US 20210004233A1 · Kumar et al. · 2021 [cited by applicant]
US 20210042617A1 · Chinya et al. · 2021 [cited by applicant]
US 20210096861A1 · Wang et al. · 2021 [cited by applicant]
US 20210117197A1 · Hsu et al. · 2021 [cited by applicant]
US 20210200546A1 · LeMay et al. · 2021 [cited by applicant]
US 20210326139A1 · Gupta et al. · 2021 [cited by applicant]
US 20210357222A1 · Nair et al. · 2021 [cited by applicant]
US 20210364571A1 · Kurts et al. · 2021 [cited by applicant]
US 20210397454A1 · Plotnikov et al. · 2021 [cited by applicant]
US 20220058023A1 · Lemay et al. · 2022 [cited by applicant]
US 20220091852A1 · Gupta et al. · 2022 [cited by applicant]
US 20220100520A1 · Pokam et al. · 2022 [cited by applicant]
US 20220206815A1 · Wang et al. · 2022 [cited by applicant]
US 20220261509A1 · LeMay et al. · 2022 [cited by applicant]
US 20220343029A1 · Sultana et al. · 2022 [cited by applicant]
US 20220413715A1 · LeMay et al. · 2022 [cited by applicant]
US 20230056699A1 · Subramaniam et al. · 2023 [cited by applicant]
US 20230091205A1 · Moga et al. · 2023 [cited by applicant]
US 20230195388A1 · Butera et al. · 2023 [cited by applicant]
US 20230214325A1 · Shukla et al. · 2023 [cited by applicant]
US 20230315473A1 · Azeem et al. · 2023 [cited by applicant]
CN 108011883A · 2018 [cited by applicant]
CN 114942722A · 2022 [cited by applicant]
CN 115904504A · 2023 [cited by applicant]
CN 116266122A · 2023 [cited by applicant]
CN 116400960A · 2023 [cited by applicant]
EP 0354774A2 · 1990 [cited by applicant]
EP 0354774A3 · 1992 [cited by applicant]
EP 2508985A1 · 2012 [cited by applicant]
EP 4044027A2 · 2022 [cited by applicant]
EP 4141654A1 · 2023 [cited by applicant]
EP 4198717A1 · 2023 [cited by applicant]
EP 4209915A1 · 2023 [cited by applicant]
EP 4392868A1 · 2024 [cited by applicant]
GB 2599006A · 2022 [cited by applicant]
TW 202328926A · 2023 [cited by applicant]
WO 2012040731A2 · 2012 [cited by applicant]
WO 2012040731A3 · 2012 [cited by applicant]
WO 2021162792A1 · 2021 [cited by applicant]
WO 2022139850A1 · 2022 [cited by applicant]
Extended European Search Report, issued by the European Patent Office on Oct. 19, 2022, 16 pages. [cited by applicant]
LeMay, Michael “BackupRefPtr Spatial Safety Extension,” 8 pages, Feb. 2021. [cited by applicant]
M. Al-Otoom, E. Forbes, and E. Rotenberg, “Exact: explicit dynamic branch prediction with active updates, ” in Proceedings of the 7th ACM international conference on Computing frontiers. ACM, 2010, pp. 165-176. [cited by applicant]
MiraclePtr and *Scan—preventing exploitation of UaF bugs (BlinkOn 13). [cited by applicant]
Narasimha Adiga et al, “The IBM z15 High Frequency Mainframe Branch Predictor,” ACM/IEEE 47the International Symposium on Computer Architecture (ISCA), 2020, 13 pages. [cited by applicant]
Rakesh Kumar et al. “Blasting Through The Front-End Bottleneck With Shotgun,” ASPLOS'18, Mar. 24-28, 2018, 13 pages. [cited by applicant]
Sheikh, Rami, James Tuck, and Eric Rotenberg. “Control-Flow Decoupling: An Approach for Timely, Non-speculative Branching,” IEEE Transactions on Computers, Oct. 2014. [cited by applicant]
Shuwen Deng et al., “Leaky Frontends: Micro-Op Cache and Processor Frontend Vulnerabilities,” arXiv:2105.12224v1. May 25, 2021, pp. 1-13. [See, e.g., PCT ISR, highlighting pp. 3-4 and figure 1.]. [cited by applicant]
SPEC CPU2006 Platform Settings for Lenovo Systems, downloaded from https://www.spec.org/cpu2006/flags/Lenovo-Platform-Flags-V1.2-SKL-..., on Sep. 7, 2021, 3 pages. [cited by applicant]
Sudhanshu Shukla et al., “Register File Prefetching,” International Symposium on Computer Architecture (ISCA '22). ACM, NewYork, NY, USA, Jun. 18-22, 2022, published Jun. 11, 2022, 14 pages. [cited by applicant]
Ziad, Mohamed Tarek Ibn, “No-FAT: Architectural Support for Low Overhead Memory Safety Checks,” Department of Computer Science, New York, NY, pp. 1-14. [cited by applicant]
James Bonanno et al., “Two Level Bulk Preload Branch Prediction,” IEEE 978-1-4673-5587-2/13, 2013, 12 pages. [cited by applicant]
Jouppi et al. “In-Datacenter Performance Analysis of a Tensor Processing Unit,” 2017 ACM/IEEE 44th Annual International Symposium on Computer Architecture (ISCA), Toronto, ON, 2017, 12 pages. [cited by applicant]
Notice of Grant for counterpart GB application No. GB2599006 (issued Sep. 13, 2022, 2 pages. [cited by applicant]
Notice of Grant from counterpart Dutch patent application under No. under No. 2028988, Jul. 27, 2022, 5 pages [with Google Translation]. [cited by applicant]
Sheikh, Rami, James Tuck, and Eric Rotenberg. “Control-flow decoupling.” Proceedings of the 2012 45th Annual IEEE/ACM International Symposium on Microarchitecture. IEEE Computer Society, 2012. [cited by applicant]
Gao, et al. “Address-branch correlation: A novel locality for long latency hard-to-predict branches,” High Performance Computer Architecture, HPCA 2008, IEEE 14th International Symposium, Piscataway, New Jersey (Feb. 16… [cited by applicant]
Office Action issued on Apr. 4, 2022 for Dutch Patent Application No. 20228988. [cited by applicant]
Partial European Search Report, issued Jul. 12, 2022, for Application No. 22150649.6, 15 pages. [cited by applicant]
Written Opinion of the International Searching Authority, issued Oct. 28, 2022, 7 pages. [cited by applicant]
U.S. Appl. No. 17/409,090, filed Aug. 23, 2021, Kameswar Subramaniam. [cited by applicant]
U.S. Appl. No. 17/555,174, filed Dec. 17, 2021, William Butera. [cited by applicant]
U.S. Appl. No. 17/953,486, filed Sep. 27, 2022, Andreas Kleen. [cited by applicant]
U.S. Appl. No. 17/958,071, filed Sep. 30, 2022, Tsvika Kurts. [cited by applicant]
Amitabh Das et al., “Secure JTAG Implementation Using Schnorr Protocol,” Journal of Electronic Testing, vol. 29, No. 2, pp. 193-209, 2013, 22 pages. [cited by applicant]
Cheuk Wong, “Analysis of DPA and DEMA Attacks,” San Jose State University, Master's Projects, May 2012, 110 pages. [cited by applicant]
Das et al., “Secure JTAG Implementation Using Schnorr Protocol,” Journal of Electronic Testing, vol. 29, No. 2, 2013, 22 pages. [cited by applicant]
Dixit et al., “silent data corruptions at scale,” arXiv:2102.11245v1, Feb. 22, 2021, 8 pages. [cited by applicant]
Hochschild et al., “Cores that don't count,” In Proceedings of the Workshop on Hot Topics in Operating Systems (pp. 9-16), 8 pages total, Jun. 2021. [cited by applicant]
IONA Technologies PLC, “iPortal Application Server Developer's Guide,” Internet Citation, Oct. 1, 2001, retrieved from: http://www.iona.com/support/docs/iportal_application_server/3.0/DevelopGuide/pdf/ipas30_developguid… [cited by applicant]
Luiz Barroso et al., “Attack of the Killer Microseconds,” downloaded on Sep. 21, 2022, from [https://cacm.acm.org/magazines/2017/4/215032-attack-of-the-killer-microseconds/fulltext], 8 pages. [cited by applicant]
Rosenfeld, K., et al., “Attacks and Defenses for JTAG,” IEEE Design & Test of Computers, IEEE Service Center, New York, NY, US, vol. 27, No. 1, Jan. 1, 2020. [cited by applicant]
Valea et al., “Encryption-Based Secure JTAG,” 2019, Montpelier, France, Univ. Grenoble, 6 pages. [cited by applicant]
U.S. Appl. No. 17/957,977, filed Sep. 30, 2022, Sudhanshu Shukla. [cited by applicant]
Intel Select Solutions for HPC & AI Converged Clusters [Magpie*], Solution Brief, Intel Select Solutions High Solutions High Performance Computing and AI, May 2019. [cited by applicant]
B. Sinharoy et al. “IBM POWER8 processor core microarchitecture,” IBM J. Res. & Dev. vol. 59 No. 1 Paper 2 Jan./Feb. 2015, 21 pages. [cited by applicant]
C.-L. K. Shum et al., “Design and microarchitecture of the IBM System z10 microprocessor,” IBM J. Res. & Dev. vol. 53 No. 1 Paper 1 2009, 12 pages. [cited by applicant]
Chen et al. “Eyeriss: An Energy-Efficient Reconfigurable Accelerator for Deep Convolutional Neural Networks,” in ISSCC 2016, IEEE International Solid-State Circuits Conference, Jan. 31-Feb. 4, 2016, 4 pages. [cited by applicant]
European Examination Report for application No. 22208089.7, issued Jan. 18, 2024, 4 pages. [cited by applicant]
Extended European Search Report for EP20163972.3 dated Sep. 24, 2020. [cited by applicant]
Final Office Action for U.S. Appl. No. 16/905,914, mailed Feb. 27, 2024, 16 pages. [cited by applicant]
Google translation of CN108011883A (May 8, 2018 Publication of CN108011883A, 8 pages) (Year: 2018). [cited by applicant]
Non-final Office Action for U.S. Appl. No. 17/357,963, mailed Apr. 9, 2024, 16 pages. [cited by applicant]
Notice of Allowance issued in U.S. Appl. No. 17/409,090, issued Oct. 30, 2024, 10 pages. [cited by applicant]
Notice of Allowance issued in U.S. Appl. No. 17/028,387, issued Mar. 27, 2024, 10 pages. [cited by applicant]
Office Action issued in U.S. Appl. No. 17/357,951, on Sep. 25, 2024, 11 pages. [cited by applicant]
Office Action issued in U.S. Appl. No. 17/479,582, mailed on Sep. 30, 2024, 11 pages. [cited by applicant]
Resubmission: SPEC CPU2006 Platform Settings for Lenovo Systems, downloaded from https://www.spec.org/cpu2006/flags/Lenovo-Platform-Flags-V1.2-SKL-..., on Sep. 7, 2021, 3 pages. [cited by applicant]
Rosenfeld et al., “Attacks and Defenses for JTAG,” Politechnic Institute of New York University, Jan./Feb. 2010, 12 pages. [cited by applicant]
Valea Emanuele et al., “Encryption-Based Secure JTAG,” 2019 IEEE 22nd International Symposium on Design and Diagnostics of Electronic Circuits and Systems (DDECS), IEEE, Apr. 24, 2019. [cited by applicant]
Extended European Search Report for application No. 22208089.7, issued Apr. 28, 2023, 7 pages. [cited by applicant]
GB Examination Report and Notification of Intention to Grant counterpart GB application GB21111963.1, Jun. 28, 2022, 2 pages. [cited by applicant]
International Search Report (PCT/US2022/037037), issued Oct. 27, 2022, 4 pages. [cited by applicant]
International Search Report for PCT/US2011/053317, published Mar. 29, 2012, 4 pages. [cited by applicant]
Notice of Allowance from application No. 2028988 filed in NL, issued Jul. 29, 2022, 1 page (including Google machine translation). together with allowed claims in English, 3 pages. [cited by applicant]
Chen et al, “Using Dataflow o Optimize Energy Efficiency of Deep Neural Network Accelerators,” IEEE Micro, IEEE Computer Society, May/Jun. 2017, 10 pages. [cited by applicant]
Chromium Blog: Efficient And Safe Allocations Everywhere!, downloaded from “https://blog.chromium.org/2021/04/ efficient-and-safe-allocations-everyw,” on Jun. 22, 2021, 6 pages. [cited by applicant]
Farooq, M. Umar, and Lizy K. John. “Store-load-branch (slb) predictor: A compiler assisted branch prediction for data dependent branches.” High Performance Computer Architecture (HPCA2013), 2013 IEEE 19th International … [cited by applicant]
HPC Cluster Tuning on 3rd Generation Intel Xeon Scalable Processors, Intel Optimization Guide, High Performance Computing Intel Xeon Scalable Processor, 10 pages. [cited by applicant]
IBM T. J. Watson Research Center, “IBM T. J. Watson Research Center,” downloaded from https://ieeexplore.ieee.org/xpl/tocresult.jsp?isnumber=7175088 on Aug. 24, 2020, 6 pages. [cited by applicant]
Ioana Burcea et al., “Phantom-BTB: A Virtualized Branch Target Buffer Design,” ASPLOS'09, Mar. 7-11, 2009, 11 pages. [cited by applicant]
Alves et al., “Early Address Prediction: Efficient Pipeline Prefetch and Reuse,” ACM Transactions on Architecture and Code Optimization, vol. 18, No. 3, Jun. 8, 2021, 22 pages. [cited by applicant]
European Search Report for application No. EP 22206883, Jun. 12, 2023, 11 pages. [cited by applicant]
European Search Report for European Patent Application No. 22 183 309.8, issued Dec. 23, 2022, 11 pages. [cited by applicant]