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.

Marisabel Guevara

dblp:130/7690 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
1since 2021 · last 2021
0000-0002-5414-1437ORCID · corroborated

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

Systems, architecture and hardware · 6 · 3 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2Software engineering, systems software and programming languages · 1 · 1 since 2021

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
4 papers
Cloud and datacenter computing · 57% Hardware accelerators and domain-specific architectures · 32% Processor architecture and microarchitecture · 8%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › datacenter architecture
datacenter acceleration
0.512021
Warehouse-scale video acceleration: co-design and deployment in the wild · ASPLOS 2021
Cloud and datacenter computing
resource allocation
0.212014
Market mechanisms for managing datacenters with heterogeneous microarchitectures · ACM Trans. Comput. Syst. 2014
Cloud and datacenter computing
resource management
0.212014
Market mechanisms for managing datacenters with heterogeneous microarchitectures · ACM Trans. Comput. Syst. 2014
Processor architecture and microarchitecture › multicore design
heterogeneous processor architecture
0.212013
Navigating heterogeneous processors with market mechanisms · HPCA 2013
Cloud and datacenter computing › resource allocation
market-based resource allocation
0.212013
Navigating heterogeneous processors with market mechanisms · HPCA 2013
Algorithmic game theory and mechanism design › market design
market mechanism
0.112014
Market mechanisms for managing datacenters with heterogeneous microarchitectures · ACM Trans. Comput. Syst. 2014

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

hardware-software co-design · 0.5market-based allocation · 0.4multi-agent market mechanism · 0.3architectural proxy bidding · 0.3multi-agent systems · 0.2multi-agent system · 0.2design space exploration · 0.2coefficient of variation analysis · 0.2
YearPublicationVenuePosition
2021 Warehouse-scale video acceleration: co-design and deployment in the wild
abstract
Video sharing (e.g., YouTube, Vimeo, Facebook, TikTok) accounts for the majority of internet traffic, and video processing is also foundational to several other key workloads (video conferencing, virtual/augmented reality, cloud gaming, video in Internet-of-Things devices, etc.). The importance of these workloads motivates larger video processing infrastructures and – with the slowing of Moore’s law – specialized hardware accelerators to deliver more computing at higher efficiencies. This paper describes the design and deployment, at scale, of a new accelerator targeted at warehouse-scale video transcoding. We present our hardware design including a new accelerator building block – the video coding unit (VCU) – and discuss key design trade-offs for balanced systems at data center scale and co-designing accelerators with large-scale distributed software systems. We evaluate these accelerators “in the wild" serving live data center jobs, demonstrating 20-33x improved efficiency over our prior well-tuned non-accelerated baseline. Our design also enables effective adaptation to changing bottlenecks and improved failure management, and new workload capabilities not otherwise possible with prior systems. To the best of our knowledge, this is the first work to discuss video acceleration at scale in large warehouse-scale environments.
Parthasarathy Ranganathan, Daniel Stodolsky, Jeff Calow, Jeremy Dorfman, Marisabel Guevara, Clinton Wills Smullen IV, Aki Kuusela, Raghu Balasubramanian, Sandeep Bhatia, Prakash Chauhan, Anna Cheung, In Suk Chong, Niranjani Dasharathi, Brian Fosco, Samuel Foss, Ben Gelb, Sara J. Gwin, Yoshiaki Hase, Dake He, Richard Ho 0001, Roy W. Huffman Jr., Elisha Indupalli, Indira Jayaram, Poonacha Kongetira, Cho Mon Kyaw, Aaron Laursen, Fong Lou, Kyle Lucke, J. P. Maaninen, Ramon Macias, Maire Mahony, David Alexander Munday, Srikanth Muroor, Narayana Penukonda, Eric Perkins-Argueta, Devin Persaud, Alex Ramírez, Ville-Mikko Rautio, Yolanda Ripley, Amir Salek, Sathish Sekar, Sergey N. Sokolov, Rob Springer, Don Stark 0002, Mercedes Tan, Mark Wachsler, Andrew C. Walton, David A. Wickeraad, Alvin Wijaya, Hon Kwan Wu
ASPLOS5
2014 Strategies for anticipating risk in heterogeneous system design
abstract
Heterogeneous design presents an opportunity to improve energy efficiency but raises a challenge in resource management. Prior design methodologies aim for performance and efficiency, yet a deployed system may miss these targets due to run-time effects, which we denote as risk. We propose design strategies that explicitly aim to mitigate risk. We introduce new processor selection criteria, such as the coefficient of variation in performance, to produce heterogeneous configurations that balance performance risks and efficiency rewards. Out of the tens of strategies we consider, risk-aware approaches account for more than 70% of the strategies that produce systems with the best service quality. Applying these risk-mitigating strategies to heterogeneous datacenter design can produce a system that violates response time targets 50% less often.
Marisabel Guevara, Benjamin Lubin, Benjamin C. Lee
HPCA1
2014 Market mechanisms for managing datacenters with heterogeneous microarchitectures
abstract
Specialization of datacenter resources brings performance and energy improvements in response to the growing scale and diversity of cloud applications. Yet heterogeneous hardware adds complexity and volatility to latency-sensitive applications. A resource allocation mechanism that leverages architectural principles can overcome both of these obstacles. We integrate research in heterogeneous architectures with recent advances in multi-agent systems. Embedding architectural insight into proxies that bid on behalf of applications, a market effectively allocates hardware to applications with diverse preferences and valuations. Exploring a space of heterogeneous datacenter configurations, which mix server-class Xeon and mobile-class Atom processors, we find an optimal heterogeneous balance that improves both welfare and energy-efficiency. We further design and evaluate twelve design points along the Xeon-to-Atom spectrum, and find that a mix of three processor architectures achieves a 12× reduction in response time violations relative to equal-power homogeneous systems.
Marisabel Guevara, Benjamin Lubin, Benjamin C. Lee
ACM Trans. Comput. Syst.1
2013 Navigating heterogeneous processors with market mechanisms
abstract
Specialization of datacenter resources brings performance and energy improvements in response to the growing scale and diversity of cloud applications. Yet heterogeneous hardware adds complexity and volatility to latency-sensitive applications. A resource allocation mechanism that leverages architectural principles can overcome both of these obstacles. We integrate research in heterogeneous architectures with recent advances in multi-agent systems. Embedding architectural insight into proxies that bid on behalf of applications, a market effectively allocates hardware to applications with diverse preferences and valuations. Exploring a space of heterogeneous datacenter configurations, which mix server-class Xeon and mobile-class Atom processors, we find an optimal heterogeneous balance that improves both welfare and energy-efficiency. We further design and evaluate twelve design points along the Xeon-to-Atom spectrum, and find that a mix of three processor architectures achieves a 12× reduction in response time violations relative to equal-power homogeneous systems.
Marisabel Guevara, Benjamin Lubin, Benjamin C. Lee
HPCA1
2013 Understanding query complexity and its implications for energy-efficient web search
abstract
Today's largest datacenters dissipate megawatts of power. Efficiency is rapidly becoming the primary determinant of datacenter capability. To understand microarchitectural factors that affect efficiency, we must study datacenter workloads. Most studies treat the workload as a large, monolithic piece of software. But a workload is often comprised of many, diverse software tasks. For example, a web search engine executes many individual queries. There is a vast difference between the complexity of searching for a single term and that of searching for a collection of related terms interspersed with Boolean and wildcard operators, which are increasingly common in search engines [1, 6].
Emily Bragg, Marisabel Guevara, Benjamin C. Lee
ISLPED2
2013 Understanding the critical path in power state transition latencies
abstract
Increasing demands on datacenter computing prompts research in energy-efficient warehouse scale systems. In one approach, server activation policies invoke low-power sleep states but the power state transition latency must be small to produce effective energy savings. Chrome OS and Arch Linux require 50ms and 650ms, respectively, to enter sleep states. These states consume merely 4-6% of nominal power. By analyzing the critical path, we propose strategies for selecting hardware components and optimizing kernel resume sequences to make datacenter server activation viable. With fast transitions, server activation can provide better performance at lower energy than dynamic voltage and frequency scaling.
Sam Likun Xi, Marisabel Guevara, Jared Nelson, Patrick Pensabene, Benjamin C. Lee
ISLPED2