Trausti Saemundsson

dblp:141/9122 · also Trausti Sæmundsson · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none

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

Systems, architecture and hardware · 4 · 1 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
1 paper
Performance modeling and evaluation · 77% Memory systems · 23%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation
cache performance modeling
0.312017
Cache Modeling and Optimization using Miniature Simulations · USENIX ATC 2017
Memory systems › cache
cache optimization
0.112017
Cache Modeling and Optimization using Miniature Simulations · USENIX ATC 2017

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

simulation · 0.3
YearPublicationVenuePosition
2017 Mithril: mining sporadic associations for cache prefetching
abstract
The growing pressure on cloud application scalability has accentuated storage performance as a critical bottleneck. Although cache replacement algorithms have been extensively studied, cache prefetching - reducing latency by retrieving items before they are actually requested - remains an underexplored area. Existing approaches to history-based prefetching, in particular, provide too few benefits for real systems for the resources they cost.
Juncheng Yang, Reza Karimi, Trausti Saemundsson, Avani Wildani, Ymir Vigfusson
SoCC3
2017 Cache Modeling and Optimization using Miniature Simulations
Carl A. Waldspurger, Trausti Saemundsson, Irfan Ahmad 0005, Nohhyun Park
USENIX ATC2
2014 Dynamic Performance Profiling of Cloud Caches
abstract
Large-scale in-memory object caches such as memcached are widely used to accelerate popular web sites and to reduce burden on backend databases. Yet current cache systems give cache operators limited information on what resources are required to optimally accommodate the present workload. This paper focuses on a key question for cache operators: how much total memory should be allocated to the in-memory cache tier to achieve desired performance?
Trausti Saemundsson, Hjörtur Björnsson, Gregory V. Chockler, Ymir Vigfusson
SoCC1
2013 Dynamic performance profiling of cloud caches
abstract
In-memory object caches, such as memcached, are critical to the success of popular web sites, such as Facebook [3], by reducing database load and improving scalability [2]. The prominence of caches implies that configuring their ideal memory size has the potential for significant savings on computation resources and energy costs, but unfortunately cache configuration is poorly understood. The modern practice of manually tweaking live caching systems takes significant effort and may both increase the variance for client request latencies and impose high load on the database backend.
Hjörtur Björnsson, Gregory V. Chockler, Trausti Saemundsson, Ymir Vigfusson
SoCC3