A Method for Improving the Caching Strategy for Computing Systems with Shared Memory

A new method for improving the data caching strategy is considered. An analytical approach is implemented to evaluate software efficiency in terms of hierarchical memory usage. The proposed method is applied to the two-sided Householder transformation to convert an general matrix to the Hessenberg form. The paper also presents the results of computational experiments.

Authors

Institutions

Publication Details

Journal
Programming and Computer Software
Published
2024-12-01
DOI
https://doi.org/10.1134/s036176882470049x
Citations
1
Primary Topic
Caching and Content Delivery
Type
article
Field-Weighted Citation Impact
0.35
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Method for Improving the Caching Strategy for Computing Systems with Shared Memory

В. А. Егунов, Alla G. Kravets
1 citations
Programming and Computer Software
Caching and Content Delivery
0.35
article

A Method for Improving the Caching Strategy for Computing Systems with Shared Memory

В. А. Егунов, Alla G. Kravets
article en
1 citations

Abstract

A new method for improving the data caching strategy is considered. An analytical approach is implemented to evaluate software efficiency in terms of hierarchical memory usage. The proposed method is applied to the two-sided Householder transformation to convert an general matrix to the Hessenberg form. The paper also presents the results of computational experiments.

Programming and Computer SoftwareVol. 50(S2)
Volgograd State Technical University (RU)
Openalex Percentile: Top 34%
Caching and Content Delivery
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.