2023
DOI: 10.1007/978-3-031-22677-9_27
|View full text |Cite
|
Sign up to set email alerts
|

Astute Approach to Handling Memory Layouts of Regular Data Structures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 17 publications
0
0
0
Order By: Relevance
“…In recent decades, a lot of work has been done on solving the problem of cache memory partitioning in the case of multiprocessor systems. Most of the solutions represent either techniques for sharing resources by logically dividing cache memories [16][17][18][19][20][21][22] or techniques for assigning cache memory partitions in the case where a system supports private cache memories [23][24][25][26]. Unfortunately, various techniques introduce problems of unfairness [27], so-called trashing [28], and quality of service problems [29].…”
Section: Existing Solutions and Their Analysismentioning
confidence: 99%
“…In recent decades, a lot of work has been done on solving the problem of cache memory partitioning in the case of multiprocessor systems. Most of the solutions represent either techniques for sharing resources by logically dividing cache memories [16][17][18][19][20][21][22] or techniques for assigning cache memory partitions in the case where a system supports private cache memories [23][24][25][26]. Unfortunately, various techniques introduce problems of unfairness [27], so-called trashing [28], and quality of service problems [29].…”
Section: Existing Solutions and Their Analysismentioning
confidence: 99%