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

David Kadjo

dblp:139/2520 · DBLP profile ↗
← Back
4ranked-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 · 4 · 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
Energy-efficient computing · 30% GPUs and heterogeneous computing · 30% Memory systems · 26%

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

TopicWeightPapersLastEvidence papers
GPUs and heterogeneous computing
CPU-GPU heterogeneous computing
0.212015
A control-theoretic approach for energy efficient CPU-GPU subsystem in mobile platforms · DAC 2015
GPUs and heterogeneous computing
CPU-GPU power management
0.212015
A control-theoretic approach for energy efficient CPU-GPU subsystem in mobile platforms · DAC 2015
Energy-efficient computing › power management
dynamic voltage and frequency scaling
0.212015
A control-theoretic approach for energy efficient CPU-GPU subsystem in mobile platforms · DAC 2015
Energy-efficient computing
power management
0.212015
A control-theoretic approach for energy efficient CPU-GPU subsystem in mobile platforms · DAC 2015
Memory systems › cache management › cache interference
cache pollution
0.212014
B-Fetch: Branch Prediction Directed Prefetching for Chip-Multiprocessors · MICRO 2014
Processor architecture and microarchitecture
chip multiprocessor
0.212014
B-Fetch: Branch Prediction Directed Prefetching for Chip-Multiprocessors · MICRO 2014
Memory systems › cache › prefetching
data prefetching
0.212014
B-Fetch: Branch Prediction Directed Prefetching for Chip-Multiprocessors · MICRO 2014

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

state-space control · 0.2queueing model · 0.2control theory · 0.2cycle-accurate simulation · 0.2
YearPublicationVenuePosition
2015 A control-theoretic approach for energy efficient CPU-GPU subsystem in mobile platforms
abstract
This paper presents a control-theoretic approach to optimize the energy consumption of integrated CPU and GPU subsystems for graphic applications. It achieves this via a dynamic management of the CPU and GPU frequencies. To this end, we first model the interaction between the GPU and CPU as a queuing system. Second, we formulate a Multi-Input-Multi-Output state-space closed loop control to ensure robustness and stability. We evaluated this control on an Intel Baytrail-based Android platform. Experimental evaluations show energy savings of 17.4% in the CPU-GPU subsystem with a low performance impact of 0.9%.
David Kadjo, Raid Ayoub, Michael Kishinevsky, Paul Gratz
DAC1
2014 B-Fetch: Branch Prediction Directed Prefetching for Chip-Multiprocessors
abstract
For decades, the primary tools in alleviating the "Memory Wall" have been large cache hierarchies and dataprefetchers. Both approaches, become more challenging in modern, Chip-multiprocessor (CMP) design. Increasing the last-level cache (LLC) size yields diminishing returns in terms of performance per Watt, given VLSI power scaling trends, this approach becomes hard to justify. These trends also impact hardware budgets for prefetchers. Moreover, in the context of CMPs running multiple concurrent processes, prefetching accuracy is critical to prevent cache pollution effects. These concerns point to the need for a light-weight prefetcher with high accuracy. Existing data prefetchers may generally be classified as low-overhead and low accuracy (Next-n, Stride, etc.) or high-overhead and high accuracy (STeMS, ISB). Wepropose B-Fetch: a data prefetcher driven by branch prediction and effective address value speculation. B-Fetch leverages control flow prediction to generate an expected future path of the executing application. It then speculatively computes the effective address of the load instructions along that path based upon a history of past register transformations. Detailed simulation using a cycle accurate simulator shows a geometric mean speedup of 23.4% for single-threaded workloads, improving to 28.6% for multi-application workloads over a baseline system without prefetching. We find that B-Fetch outperforms an existing "best-of-class" light-weight prefetcher under single-threaded and multi programmed workloads by 9% on average, with 65% less storage overhead.
David Kadjo, Jinchun Kim, Prabal Sharma, Reena Panda, Paul Gratz, Daniel A. Jiménez
MICRO1
2013 Managing mobile platform power
abstract
Power consumption has been one of the major design considerations for more than a decade [6]. Hence, energy efficient techniques have been widely studied to harness the processing power within available power and thermal budgets [3][4][10]. With the proliferation of smart mobile devices, the criticality of energy efficiency is multiplied. On one hand, increasing computational power as well as sensing, storage, and communication capabilities open up wide range of power-hungry application domains. On the other hand, the battery life rises as one of the major concerns of the end user [9]. Furthermore, these fanless devices are subject to tight surface, or skin, temperature constraints which limit the peak power consumption, since the skin temperature directly affects the user experience (UX). As a result, power management techniques crafted specifically for smart mobile devices become necessary. In this paper, we review three differentiating aspects for managing the power of smart mobile devices. More specifically, we emphasize the importance of platform view, user experience and platform level optimization.
Ümit Y. Ogras, Raid Ayoub, Michael Kishinevsky, David Kadjo
ICCAD4
2013 Power gating with block migration in chip-multiprocessor last-level caches
abstract
We propose a novel technique to significantly reduce the leakage energy of last level caches while mitigating any significant performance impact. In general, cache blocks are not ordered by their temporal locality within the sets; hence, simply power gating off a partition of the cache, as done in previous studies, may lead to considerable performance degradation. We propose a solution that migrates the high temporal locality blocks to facilitate power gating, where blocks likely to be used in the future are migrated from the partition being shutdown to the live partition at a negligible performance impact and hardware overhead. Our detailed simulations show energy savings of 66% at low performance degradation of 2.16%.
David Kadjo, Paul Gratz, Jiang Hu 0001, Raid Ayoub
ICCD1