Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Adrian Moga

dblp:47/1375 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2015
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 5 · 3 first-author

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
2 papers
Memory systems · 85% Processor architecture and microarchitecture · 6% Cloud and datacenter computing · 6%

Topics — the 12 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Memory systems
cache
0.212015
High performing cache hierarchies for server workloads: Relaxing inclusion to capture the latency benefits of exclusive caches · HPCA 2015
Memory systems › memory hierarchy
cache hierarchy
0.212015
High performing cache hierarchies for server workloads: Relaxing inclusion to capture the latency benefits of exclusive caches · HPCA 2015
Memory systems › memory hierarchy › cache hierarchy management
exclusive caching
0.212015
High performing cache hierarchies for server workloads: Relaxing inclusion to capture the latency benefits of exclusive caches · HPCA 2015
Memory systems › memory hierarchy › cache hierarchy
last-level cache
0.212015
High performing cache hierarchies for server workloads: Relaxing inclusion to capture the latency benefits of exclusive caches · HPCA 2015
Processor architecture and microarchitecture
chip multiprocessor
0.112015
High performing cache hierarchies for server workloads: Relaxing inclusion to capture the latency benefits of exclusive caches · HPCA 2015
Cloud and datacenter computing
server workloads
0.112015
High performing cache hierarchies for server workloads: Relaxing inclusion to capture the latency benefits of exclusive caches · HPCA 2015
Memory systems
cache coherence
0.011998
The Effectiveness of SRAM Network Caches in Clustered DSMs · HPCA 1998
Memory systems › shared memory
distributed shared memory
0.011998
The Effectiveness of SRAM Network Caches in Clustered DSMs · HPCA 1998
Memory systems › cache management › storage caching
page cache
0.011998
The Effectiveness of SRAM Network Caches in Clustered DSMs · HPCA 1998
Distributed systems › distributed caching
remote caching
0.011998
The Effectiveness of SRAM Network Caches in Clustered DSMs · HPCA 1998
Processor architecture and microarchitecture › clustered architecture
cluster-based multiprocessor
0.011998
The Effectiveness of SRAM Network Caches in Clustered DSMs · HPCA 1998
Parallel and multicore computing
multiprocessor system
0.011998
The Effectiveness of SRAM Network Caches in Clustered DSMs · HPCA 1998

Methods — techniques the papers use, named apart from their topics

simulation · 0.2victim cache · 0.0page relocation · 0.0
YearPublicationVenuePosition
2015 High performing cache hierarchies for server workloads: Relaxing inclusion to capture the latency benefits of exclusive caches
abstract
Increasing transistor density enables adding more on-die cache real-estate However, devoting more space to the shared last-level-cache (LLC) causes the memory latency bottleneck to move from memory access latency to shared cache access latency. As such, applications whose working set is larger than the smaller caches spend a large fraction of their execution time on shared cache access latency. To address this problem, this paper investigates increasing the size of smaller private caches in the hierarchy as opposed to increasing the shared LLC. Doing so improves average cache access latency for workloads whose working set fits into the larger private cache while retaining the benefits of a shared LLC. The consequence of increasing the size of private caches is to relax inclusion and build exclusive hierarchies. Thus, for the same total caching capacity, an exclusive cache hierarchy provides better cache access latency. We observe that server workloads benefit tremendously from an exclusive hierarchy with large private caches. This is primarily because large private caches accommodate the large code working-sets of server workloads. For a 16-core CMP, an exclusive cache hierarchy improves server workload performance by 5-12% as compared to an equal capacity inclusive cache hierarchy. The paper also presents directions for further research to maximize performance of exclusive cache hierarchies.
Aamer Jaleel, Joseph Nuzman, Adrian Moga, Simon C. Steely Jr., Joel S. Emer
HPCA3
2009 A comparative evaluation of hybrid distributed shared-memory systems
Adrian Moga, Michel Dubois 0001
J. Syst. Archit.1
2008 To Snoop or Not to Snoop: Evaluation of Fine-Grain and Coarse-Grain Snoop Filtering Techniques
Jessica Young, Srihari Makineni, Ravi R. Iyer 0001, Donald Newell, Adrian Moga
Euro-Par5
1998 The Effectiveness of SRAM Network Caches in Clustered DSMs
abstract
The frequency of accesses to remote data is a key factor affecting the performance of all Distributed Shared Memory (DSM) systems. Remote data caching is one of the most effective and general techniques to fight processor stalls due to remote capacity misses in the processor caches. The design space of remote data caches (RDC) has many dimensions and one essential performance trade-off hit ratio versus speed. Some recent commercial systems have opted for large and slow (S)DRAM network caches (NC), but others completely avoid them because of their damaging effects on the remote/local latency ratio. In this paper we will explore small and fast SRAM network caches as a means to reduce the remote stalls and capacity traffic of multiprocessor clusters. The major appeal of SRAM NCs is that they add less penalty on the latency of NC hits and remote accesses. Their small capacity can handle conflict misses and a limited amount of capacity misses. However, they can be coupled with main memory page caches which satisfy the bulk of capacity misses. To maximize performance for a large spectrum of applications, we propose to organize the NC as a victim cache for remote data. We also propose a novel and scalable method to control the page cache by integrating page relocation mechanisms into the network victim cache.
Adrian Moga, Michel Dubois 0001
HPCA1
1997 Hardware Versus Software Implementation of COMA
abstract
Traditionally, cache coherence in multiprocessors has been maintained in hardware. However, the cost-effectiveness of hardwired protocols is questionable. Virtual Shared Memory systems have highlighted the many advantages of software-implemented protocols, albeit at a performance price. The performance gap is narrowed by hybrid systems with the addition of hardware support for fine-grain sharing. We have developed a software protocol for a COMA (Cache-Only Memory Architecture). We call the system SC-COMA for Software-Controlled COMA, to emphasize that the protocol engine is emulated by software executed on the main processor. Contrary to user-level protocols, the software handling coherence events in SC-COMA runs in sub-kernel mode, transparently providing the same services to applications as a hardware counterpart. The software emulation layer has been written and we compare SC-COMA to an idealized hardware COMA through detailed simulations. Our results show that SC-COMA is competitive. On systems with 32 processors, it achieves a slowdown of 11-56% with respect to its hardware counterpart, across a range of applications and memory pressures. SC-COMA scales well, up to 32 nodes. A study on the impact of faster processors on SC-COMA's relative performance indicates a consistent improvement, but with a limitation due to the loosely-integrated design. We conclude that SC-COMA is a viable solution to easily transform networks of workstations into powerful multiprocessors.
Adrian Moga, Michel Dubois 0001, Alain Gefflaut
ICPP1