Search NASA⌕ Search

SEARCH · Search NASA

Results for “Memory tool”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 793 records · Page 44

Physics of wurtzite ferroelectrics

Ferroelectricity was long considered incompatible with the wurtzite structure, but the recent discovery of switchable polarization in wurtzite alloys has renewed interest in these materials for integrated electronic and memory applications. The development of wurtzite ferroelectrics faces significant technological challenges, which can be addressed through a fundamental physical understanding of their dielectric and ferroelectric properties. This article focuses on the physics that govern the polarization switching behavior, emphasizing the atomic- and meso-scale (domain) mechanisms involved in the transition between polarization states. A distinguishing feature of this article is a deep dive into the role of intrinsic and extrinsic defects—an area that has received limited attention in prior reviews, but is increasingly recognized as central to polarization switching, coercive fields, leakage, and fatigue. We highlight how defect behavior evolves during processing and electrical cycling, often contributing to long-term degradation. We also introduce powerful first-principles defect calculations, common in semiconductors but not yet widespread in ferroelectrics, as tools to understand and design materials. By integrating recent theoretical and experimental insights, we aim to provide a framework for advancing wurtzite ferroelectrics.

36 MATERIALS SCIENCE↗

NLR HPC Eagle Jobs Data and Additional Energy Metrics

Overview: Anonymized job-level records from the Eagle high-performance computing (HPC) system at the National Laboratory of the Rockies (NLR). Each record represents a Slurm batch job with scheduling metadata, resource requests, resource utilization, CPU/GPU energy consumption, and efficiency metrics. Sensitive fields (user, account, job name) are replaced with cryptographic hashes. System & Timeframe: Eagle was a 2,000-node, 8-petaflop system operated at NLR from 2019–2024. Data covers the full operational lifetime of the system. Slurm data was processed nightly; timestamps are in Mountain Time. Funding provided by the U.S. Department of Energy, EERE. Files: esif.hpc.eagle.job-anon.zip — Core anonymized job records (Hive-partitioned Parquet) esif.hpc.eagle.job-anon-energy-metrics.zip — Same records with additional iLO and Ganglia energy metrics datacard.md — Full dataset documentation ~13.8 million rows, 62 variables. Readable with PyArrow, pandas, DuckDB, Apache Spark, or any Parquet-compatible tool. Data Collection: Jobs collected via sacct through a pipeline: Eagle Jobs API → Redpanda → StreamSets → HPCMON API → PostgreSQL. Node-level power from iLO (HP Integrated Lights-Out); GPU power from Ganglia monitoring, joined to jobs via node lists and time ranges. Preprocessing: Anonymization of name, user, and account fields via cryptographic hashing Derived columns: queue_wait, cpu_eff, max_mem_eff Simplified job state mapping (e.g., "CANCELLED BY 12345" → "CANCELLED") QoS accounting rules (buy-in, standby, or Slurm QoS value) CPU energy estimated from TDP (200W, Intel Xeon Gold 6154, 18 cores) Timezone-aware columns (_tz) sourced from LEX accounting database to correctly handle DST transitions Key Variables: Scheduling: job_id, partition, state_simple, submit_time_tz, start_time_tz, end_time_tz, queue_waitResources: nodes_req/used, processors_req/used, memory_req, wallclock_req/used, gpus_requested Efficiency: cpu_eff, max_mem_eff Energy: cpu_energy_tdp_estimated_max/used_watt_hours, node_energy_total_watt_hours (iLO), gpu0/1_energy_total_watt_hours (Ganglia) Partitions: bigmem, bigmem-8600, bigscratch, csc, dav, ddn, debug, gpu, haswell, long, mono, short, standard Job States: CANCELLED, COMPLETED, FAILED, NODE_FAIL, OUT_OF_MEMORY, PENDING, RUNNING, TIMEOUT QoS Levels: Unknown, normal, buy-in, debug, penalty, high, standby Important Notes: Non-_tz timestamp columns may be off by one hour across DST boundaries; use _tz columns for time difference calculations Energy fields are null for jobs without monitoring coverage Job step records and raw Slurm JSONB fields are excluded from this extract Do not attempt to re-identify individuals from hashed fields

97 MATHEMATICS AND COMPUTING↗

Ellicott City Disasters II - Building a Real-Time Predictive Flood Model for Improving Early Warning Systems in Ellicott City, Maryland

As flood events in the United States grow in frequency and intensity, the uses of applied remote sensing analyses are increasingly necessary for effective flood monitoring and warning systems. The NASA DEVELOP Ellicott City Disasters III project investigated the use of machine learning for applications in flood risk detection to support the improvement of early warning systems in Ellicott City, Maryland. To strengthen the efforts of the Howard County Office of Emergency Management (OEM) in building a more robust flood monitoring system, this term built on the predictive capability of the long-short term memory (LSTM) model created by the second term of this DEVELOP project to create a Sequentially Trained Real-time EstimAted Model (STREAM). Enhancements to the model included the integration of both real-time and predicted weather products from the National Weather Service to increase predictive capacity. These weather products were supplemented by stream gauge data from the OEM as well as real-time radar products. The resultant flood risk model was trained to evaluate input variables and predict stage height in Ellicott City in real time. The model, upgraded to predict stage height up to 8 hours in advance, was incorporated into an online dashboard in a user-friendly interface. The project demonstrated the potential for integration of open data and NASA Earth observations into a flood risk forecasting tool capable of informing real-time decision-making.

Erika Munshi↗

Ellicott City Disasters III: Building a Real-Time Statistical Flood Model for Improving Early Warning Systems in Ellicott City, Maryland

As flood events in the United States grow in frequency and intensity, the uses of applied remote sensing analyses are increasingly necessary for effective flood monitoring and warning systems. The NASA DEVELOP Ellicott City Disasters III project investigated the use of machine learning for applications in flood risk detection to support the improvement of early warning systems in Ellicott City, Maryland. To strengthen the efforts of the Howard County Office of Emergency Management (OEM) in building a more robust flood monitoring system, this term built on the predictive capability of the long-short term memory (LSTM) model created by the second term of this DEVELOP project to create a Sequentially Trained Real-time EstimAted Model (STREAM). Enhancements to the model included the integration of both real-time and predicted weather products from the National Weather Service to increase predictive capacity. These weather products were supplemented by stream gauge data from the OEM as well as real-time radar products. The resultant flood risk model was trained to evaluate input variables and predict stage height in Ellicott City in real time. The model, upgraded to predict stage height up to 8 hours in advance, was incorporated into an online dashboard in a user-friendly interface. The project demonstrated the potential for integration of open data and NASA Earth observations into a flood risk forecasting tool capable of informing real-time decision-making.

Erika Munshi↗

A Multi-Level Parallelization Concept for High-Fidelity Multi-Block Solvers

The integration of high-fidelity Computational Fluid Dynamics (CFD) analysis tools with the industrial design process benefits greatly from the robust implementations that are transportable across a wide range of computer architectures. In the present work, a hybrid domain-decomposition and parallelization concept was developed and implemented into the widely-used NASA multi-block Computational Fluid Dynamics (CFD) packages implemented in ENSAERO and OVERFLOW. The new parallel solver concept, PENS (Parallel Euler Navier-Stokes Solver), employs both fine and coarse granularity in data partitioning as well as data coalescing to obtain the desired load-balance characteristics on the available computer platforms. This multi-level parallelism implementation itself introduces no changes to the numerical results, hence the original fidelity of the packages are identically preserved. The present implementation uses the Message Passing Interface (MPI) library for interprocessor message passing and memory accessing. By choosing an appropriate combination of the available partitioning and coalescing capabilities only during the execution stage, the PENS solver becomes adaptable to different computer architectures from shared-memory to distributed-memory platforms with varying degrees of parallelism. The PENS implementation on the IBM SP2 distributed memory environment at the NASA Ames Research Center obtains 85 percent scalable parallel performance using fine-grain partitioning of single-block CFD domains using up to 128 wide computational nodes. Multi-block CFD simulations of complete aircraft simulations achieve 75 percent perfect load-balanced executions using data coalescing and the two levels of parallelism. SGI PowerChallenge, SGI Origin 2000, and a cluster of workstations are the other platforms where the robustness of the implementation is tested. The performance behavior on the other computer platforms with a variety of realistic problems will be included as this on-going study progresses.

Hatay, Ferhat F.↗

Design and Fabrication of a Composite Morphing Radiator Panel Using High Conductivity Fibers

Upcoming crewed space missions will involve large internal and external heat loads and require advanced thermal control systems to maintain a desired internal environment temperature. Radiators with at least 12:1 turndown ratios (the ratio between the maximum and minimum heat rejection rates) will be needed. However, current technologies are only able to achieve turndown ratios of approximately 3:1. A morphing radiator capable of altering shape could significantly increase turndown capabilities. Shape memory alloys offer qualities that may be well suited for this endeavor; their temperature-dependent phase changes could offer radiators the ability to passively control heat rejection. In 2015, a morphing radiator prototype was constructed and tested in a thermal vacuum environment, where it successfully demonstrated the morphing behavior and variable heat rejection. Newer composite prototypes have since been designed and manufactured using two distinct types of SMA materials. These models underwent temperature cycling tests in a thermal vacuum chamber and a series of fatigue tests to characterize the lifespan of these designs. The focus of this paper is to present the design approach and testing of the morphing composite facesheet. The discussion includes: an overall description of the project background, definition of performance requirements, composite materials selection, use of analytic and numerical design tools, facesheet fabrication, and finally fatigue testing with accompanying results.

Wescott, Matthew T.↗

A participant-derived xenograft model of HIV enables long-term evaluation of autologous immunotherapies

HIV-specific CD8+ T cells partially control viral replication and delay disease progression, but they rarely provide lasting protection, largely due to immune escape. Here, we show that engrafting mice with memory CD4+ T cells from HIV+ donors uniquely allows for the in vivo evaluation of autologous T cell responses while avoiding graft-versus-host disease and the need for human fetal tissues that limit other models. Treating HIV-infected mice with clinically relevant HIV-specific T cell products resulted in substantial reductions in viremia. In vivo activity was significantly enhanced when T cells were engineered with surface-conjugated nanogels carrying an IL-15 superagonist, but it was ultimately limited by the pervasive selection of a diverse array of escape mutations, recapitulating patterns seen in humans. By applying mathematical modeling, we show that the kinetics of the CD8+ T cell response have a profound impact on the emergence and persistence of escape mutations. This “participant-derived xenograft” model of HIV provides a powerful tool for studying HIV-specific immunological responses and facilitating the development of effective cell-based therapies.

60 APPLIED LIFE SCIENCES↗

WE-AB-303-09: Rapid Projection Computations for On-Board Digital Tomosynthesis in Radiation Therapy

Purpose: To facilitate fast and accurate iterative volumetric image reconstruction from limited-angle on-board projections. Methods: Intrafraction motion hinders the clinical applicability of modern radiotherapy techniques, such as lung stereotactic body radiation therapy (SBRT). The LIVE system may impact clinical practice by recovering volumetric information via Digital Tomosynthesis (DTS), thus entailing low time and radiation dose for image acquisition during treatment. The DTS is estimated as a deformation of prior CT via iterative registration with on-board images; this shifts the challenge to the computational domain, owing largely to repeated projection computations across iterations. We address this issue by composing efficient digital projection operators from their constituent parts. This allows us to separate the static (projection geometry) and dynamic (volume/image data) parts of projection operations by means of pre-computations, enabling fast on-board processing, while also relaxing constraints on underlying numerical models (e.g. regridding interpolation kernels). Further decoupling the projectors into simpler ones ensures the incurred memory overhead remains low, within the capacity of a single GPU. These operators depend only on the treatment plan and may be reused across iterations and patients. The dynamic processing load is kept to a minimum and maps well to the GPU computational model. Results: We have integrated efficient, pre-computable modules for volumetric ray-casting and FDK-based back-projection with the LIVE processing pipeline. Our results show a 60x acceleration of the DTS computations, compared to the previous version, using a single GPU; presently, reconstruction is attained within a couple of minutes. The present implementation allows for significant flexibility in terms of the numerical and operational projection model; we are investigating the benefit of further optimizations and accurate digital projection sub-kernels. Conclusion: Composable projection operators constitute a versatile research tool which can greatly accelerate iterative registration algorithms and may be conducive to the clinical applicability of LIVE. National Institutes of Health Grant No. R01-CA184173; GPU donation by NVIDIA Corporation.

60 APPLIED LIFE SCIENCES↗

Parallel Calculation of Sensitivity Derivatives for Aircraft Design using Automatic Differentiation

Sensitivity derivative (SD) calculation via automatic differentiation (AD) typical of that required for the aerodynamic design of a transport-type aircraft is considered. Two ways of computing SD via code generated by the ADIFOR automatic differentiation tool are compared for efficiency and applicability to problems involving large numbers of design variables. A vector implementation on a Cray Y-MP computer is compared with a coarse-grained parallel implementation on an IBM SP1 computer, employing a Fortran M wrapper. The SD are computed for a swept transport wing in turbulent, transonic flow; the number of geometric design variables varies from 1 to 60 with coupling between a wing grid generation program and a state-of-the-art, 3-D computational fluid dynamics program, both augmented for derivative computation via AD. For a small number of design variables, the Cray Y-MP implementation is much faster. As the number of design variables grows, however, the IBM SP1 becomes an attractive alternative in terms of compute speed, job turnaround time, and total memory available for solutions with large numbers of design variables. The coarse-grained parallel implementation also can be moved easily to a network of workstations.

Bischof, c. H.↗

In Situ/Operando (Soft) X-ray Spectroscopy Study of Beyond Lithium-ion Batteries

The lightweight, rechargeable lithium-ion battery is one of the dominant energy storage devices globally in portable electronics due to its high energy density, no memory effect, wide operating voltage, lightweight, and good charge efficiency. However, due to safety concerns, the depletion of lithium reserves, and the corresponding increase of cost, an alternative battery system becomes more and more desirable. To develop alternative battery systems with low cost and high material abundance, for example, sodium, magnesium, zinc, and calcium, it is important to understand the chemical and electronic structure of materials. Additionally, soft X-ray spectroscopy, for example, X-ray absorption spectroscopy (XAS), X-ray emission spectroscopy (XES), and resonant inelastic soft X-ray scattering (RIXS), is an element-specific technique with sensitivity to the local chemical environment and structural order of the element of interest. Modern soft X-ray systems enable operando experiments that can be applied to amorphous and crystalline samples, making it a powerful tool for studying the electronic and structural changes in electrode and electrolyte species. In this article, the application of in situ/operando (soft) X-ray spectroscopy in beyond lithium-ion batteries is reviewed to demonstrate how such spectroscopic characterizations could facilitate the interpretation of interfacial phenomena under in situ/operando condition and subsequent development of the beyond lithium-ion batteries.

(soft) X-ray spectroscopy↗

Proteome-wide analysis of HIV-specific naive and memory CD4 + T cells in unexposed blood donors

The preexisting HIV-1–specific T cell repertoire must influence both the immunodominance of T cells after infection and immunogenicity of vaccines. We directly compared two methods for measuring the preexisting CD4 + T cell repertoire in healthy HIV-1–negative volunteers, the HLA-peptide tetramer enrichment and T cell library technique, and show high concordance (r = 0.989). Using the library technique, we examined whether naive, central memory, and/or effector memory CD4 + T cells specific for overlapping peptides spanning the entire HIV-1 proteome were detectable in 10 HLA diverse, HIV-1–unexposed, seronegative donors. HIV-1–specific cells were detected in all donors at a mean of 55 cells/million naive cells and 38.9 and 34.1 cells/million in central and effector memory subsets. Remarkably, peptide mapping showed most epitopes recognized by naive (88%) and memory (56%) CD4 + T cells had been previously reported in natural HIV-1 infection. Furthermore, 83% of epitopes identified in preexisting memory subsets shared epitope length matches (8–12 amino acids) with human microbiome proteins, suggestive of a possible cross-reactive mechanism. These results underline the power of a proteome-wide analysis of peptide recognition by human T cells for the identification of dominant antigens and provide a baseline for optimizing HIV-1–specific helper cell responses by vaccination.

59 BASIC BIOLOGICAL SCIENCES↗

Design of Composite Structures Using Knowledge-Based and Case Based Reasoning

A method of using knowledge based and case based reasoning to assist designers during conceptual design tasks of composite structures was proposed. The cooperative use of heuristics, procedural knowledge, and previous similar design cases suggests a potential reduction in design cycle time and ultimately product lead time. The hypothesis of this work is that the design process of composite structures can be improved by using Case-Based Reasoning (CBR) and Knowledge-Based (KB) reasoning in the early design stages. The technique of using knowledge-based and case-based reasoning facilitates the gathering of disparate information into one location that is easily and readily available. The method suggests that the inclusion of downstream life-cycle issues into the conceptual design phase reduces potential of defective, and sub-optimal composite structures. Three industry experts were interviewed extensively. The experts provided design rules, previous design cases, and test problems. A Knowledge Based Reasoning system was developed using the CLIPS (C Language Interpretive Procedural System) environment and a Case Based Reasoning System was developed using the Design Memory Utility For Sharing Experiences (MUSE) xviii environment. A Design Characteristic State (DCS) was used to document the design specifications, constraints, and problem areas using attribute-value pair relationships. The DCS provided consistent design information between the knowledge base and case base. Results indicated that the use of knowledge based and case based reasoning provided a robust design environment for composite structures. The knowledge base provided design guidance from well defined rules and procedural knowledge. The case base provided suggestions on design and manufacturing techniques based on previous similar designs and warnings of potential problems and pitfalls. The case base complemented the knowledge base and extended the problem solving capability beyond the existence of limited well defined rules. The findings indicated that the technique is most effective when used as a design aid and not as a tool to totally automate the composites design process. Other areas of application and implications for future research are discussed.

Lambright, Jonathan Paul↗

A case for Virtual Machine based Fault Injection in a High-Performance Computing Environment

Large-scale computing platforms provide tremendous capabilities for scientific discovery. These systems have hundreds of thousands of computing cores, hundreds of terabytes of memory, and enormous high-performance interconnection networks. These systems are facing enormous challenges to achieve performance at such scale. Failures are an Achilles heel of these enormous systems. As applications and system software scale up to multi-petaflop and beyond to exascale platforms, the occurrence of failure will be much more common. This has given rise to a push in fault-tolerance and resilience research for HPC systems. This includes work on log analysis to identify types of failures, enhancements to the Message Passing Interface (MPI) to incorporate fault awareness, and a variety of fault tolerance mechanisms that span redundant computation, algorithm based fault tolerance, and advanced checkpoint/restart techniques. While there is much work to be done on the FT/Resilience mechanisms for such large-scale systems, there is also a profound gap in the tools for experimentation. This gap is compounded by the fact that HPC environments have stringent performance requirements and are often highly customized. The tool chain for these systems are often tailored for the platform and while the majority of systems on the Top500 Supercomputer list run Linux, these operating environments typically contain many site/machine specific enhancements. Therefore, it is desirable to maintain a consistent execution environment to minimize end-user (scientist) interruption. The work on system-level virtualization for HPC system offers a unique opportunity to maintain a consistent execution environment via a virtual machine (VM). Recent work on virtualization for HPC has shown that low-overhead, high performance systems can be realized. Virtualization also provides a clean abstraction for building experimental tools for investigation into the effects of failures in HPC and the related research on FT/Resilience mechanisms and policies. In this paper we discuss the motivation for tools to perform fault injection in an HPC context, and outline an approach that can leverage virtualization.

99 GENERAL AND MISCELLANEOUS↗

Educating HPC Users in the use of advanced computing technology

We examine a multi-modal approach to educating and training users of an advanced computing technology testbed at the Institute for Advanced Computational Science at Stony Brook University. Ookami provides researchers worldwide with access to 176 Fujitsu A64FX compute nodes, this being the same processor technology powering the Japanese Fugaku supercomputer, the fastest computer in the world since June 2020. However, achieving high-performance on this Arm-based, leadership computing technology requires that users be familiar with details of computer architecture, performance analysis and modeling, and high-performance programming models that are commonly omitted in introductory programming courses. Indeed, regardless of their seniority, many of the testbed users are surprisingly unfamiliar with basic concepts such as vectorization, pipelining, latency/bandwidth, roofline models, computing energy/power, threads, and non-uniform memory access. These same concepts also pervade mainstream x86 technologies, so this is of widespread concern. Due to the national/global nature of our user community that is also very diverse in both discipline and experience, the inability to offer formal classes, and our experience that most people do not tend to read online documentation or training materials in sufficient depth, we have consciously employed multiple approaches that heavily emphasize (online) personal interactions and transfer of skills. Online documentation has been organized around best-practices and FAQs; twice-weekly hackathons and office hours via Zoom enable deep dives by both the team and the user community with multiple broad benefits; a Slack channel provides both real time and archived answers and discussions; and workshops, training and webinars target community needs as they arise. Furthermore, the perspective that these tools are being used in an educational setting rather than just for project communication makes them more effective and contributes to community success.

A64FX↗

The development of GPU-based parallel PRNG for Monte Carlo applications in CUDA Fortran

The implementation of Monte Carlo simulation on the CUDA Fortran requires a fast random number generation with good statistical properties on GPU. In this study, a GPU-based parallel pseudo random number generator (GPPRNG) have been proposed to use in high performance computing systems. According to the type of GPU memory usage, GPU scheme is divided into two work modes including GLOBAL-MODE and SHARED-MODE. To generate parallel random numbers based on the independent sequence method, the combination of middle-square method and chaotic map along with the Xorshift PRNG have been employed. Implementation of our developed PPRNG on a single GPU showed a speedup of 150x and 470x (with respect to the speed of PRNG on a single CPU core) for GLOBAL-MODE and SHARED-MODE, respectively. To evaluate the accuracy of our developed GPPRNG, its performance was compared to that of some other commercially available PPRNGs such as MATLAB, FORTRAN and Miller-Park algorithm through employing the specific standard tests. The results of this comparison showed that the developed GPPRNG in this study can be used as a fast and accurate tool for computational science applications.

97 MATHEMATICS AND COMPUTING↗

Parallelizable adjoint stencil computations using transposed forward-mode algorithmic differentiation

Algorithmic differentiation (AD) is a tool for generating discrete adjoint solvers, which efficiently compute gradients of functions with many inputs, for example for use in gradient-based optimization. AD is often applied to large computations such as stencil operators, which are an important part of most structured-mesh PDE solvers. Stencil computations are often parallelized, for example by using OpenMP, and optimized by using techniques such as cache-blocking and tiling to fully utilize multicore CPUs and many-core accelerators and GPUs. Differentiating these codes with conventional reverse-mode AD results in adjoint codes that cannot be expressed as stencil operations and may not be easily parallelizable. They thus leave most of the compute power of modern architectures unused. We present a method that combines forward-mode AD and loop transformation to generate adjoint solvers that use the same memory access pattern as the original computation that they are derived from and can benefit from the same optimization techniques. The effectiveness of this method is demonstrated by generating a scalable adjoint CFD solver for multicore CPUs and Xeon Phi accelerators.

algorithmic differentiation↗

Optimal pattern distributions in Rete-based production systems

Since its introduction into the AI community in the early 1980's, the Rete algorithm has been widely used. This algorithm has formed the basis for many AI tools, including NASA's CLIPS. One drawback of Rete-based implementation, however, is that the network structures used internally by the Rete algorithm make it sensitive to the arrangement of individual patterns within rules. Thus while rules may be more or less arbitrarily placed within source files, the distribution of individual patterns within these rules can significantly affect the overall system performance. Some heuristics have been proposed to optimize pattern placement, however, these suggestions can be conflicting. This paper describes a systematic effort to measure the effect of pattern distribution on production system performance. An overview of the Rete algorithm is presented to provide context. A description of the methods used to explore the pattern ordering problem area are presented, using internal production system metrics such as the number of partial matches, and coarse-grained operating system data such as memory usage and time. The results of this study should be of interest to those developing and optimizing software for Rete-based production systems.

Scott, Stephen L.↗

Analytical Modeling of Cache Behavior for Affine Programs

Modern optimizing compiler design integrates program transformation strategies aimed at reducing data movement to/from main memory by exploiting the data cache hierarchy. But in reality, the effect of these transformations on the actual cache miss count is ignored in compilers due to the lack of precise compile-time models of misses for hierarchical caches. The current state of practice for cache miss analysis is based on accurate simulation. However, simulation requires time proportional to the dataset/problem size as well as the number of distinct cache configurations of interest to be evaluated. This paper takes a fundamentally different approach, made possible by focusing on polyhedral programs with static control flow: instead of relying on costly simulation, this paper develops the first closed-form solution for exact modeling of misses in a set-associative cache hierarchy. It enabling simulation-less selection of program transformations at compile-time to optimize cache misses. A push-button tool implementing the approach is developed and used for extensive validation of the complete framework.

affine programs, cache modeling, set associativity↗