VLDB 2026 Research / reviewers in the wild / expert
Bob B. Aglietti
dblp:00/2721
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2001
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Memory systems · 75% Parallel and multicore computing · 25% | |
| Databases, data mining, and information retrieval
1 paper |
Transaction processing and concurrency control · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Memory systems › non-uniform memory access
CC-NUMA |
0.0 | 1 | 2001 | Dynamic page placement to improve locality in CC-NUMA multiprocessors for TPC-C · SC 2001 |
Memory systems › page placement
dynamic page placement |
0.0 | 1 | 2001 | Dynamic page placement to improve locality in CC-NUMA multiprocessors for TPC-C · SC 2001 |
Parallel and multicore computing
locality optimization |
0.0 | 1 | 2001 | Dynamic page placement to improve locality in CC-NUMA multiprocessors for TPC-C · SC 2001 |
Memory systems
page placement |
0.0 | 1 | 2001 | Dynamic page placement to improve locality in CC-NUMA multiprocessors for TPC-C · SC 2001 |
Methods — techniques the papers use, named apart from their topics
dynamic page migration · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2001 | Dynamic page placement to improve locality in CC-NUMA multiprocessors for TPC-CabstractThe use of CC-NUMA multiprocessors complicates the placement of physical memory pages. Memory closest to a processor provides the best access time, but optimal memory page placement is a difficult problem with process movement, multiple processes requiring access to the same physical memory page, and application behavior changing over execution time. We use dynamic page placement to move memory pages where needed for the database benchmark TPC-C executing on a four node CC-NUMA multiprocessor. Dynamic page placement achieves local memory accesses up to 73% of the time instead of the static page placement results of 34% locality achieved with first touch and 25% with round robin. This can result in a 17% improvement in performance. Kenneth M. Wilson, Bob B. Aglietti |
SC | 2 |