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

Konstantinos Koukos

dblp:95/7854 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
0since 2021 · last 2018
0000-0002-9460-1290ORCID · corroborated

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

Systems, architecture and hardware · 6 · 2 first-authorSoftware engineering, systems software and programming languages · 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
3 papers
Processor architecture and microarchitecture · 62% GPUs and heterogeneous computing · 18% Memory systems · 14%

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

TopicWeightPapersLastEvidence papers
Processor architecture and microarchitecture › microprocessor design › processor core design
in-order core
0.312018
SWOOP: software-hardware co-design for non-speculative, execute-ahead, in-order cores · PLDI 2018
Processor architecture and microarchitecture
instruction scheduling
0.312018
Static Instruction Scheduling for High Performance on Limited Hardware · IEEE Trans. Computers 2018
Processor architecture and microarchitecture › instruction scheduling
static instruction scheduling
0.312018
Static Instruction Scheduling for High Performance on Limited Hardware · IEEE Trans. Computers 2018
Memory systems
cache coherence
0.212016
Building Heterogeneous Unified Virtual Memories (UVMs) without the Overhead · ACM Trans. Archit. Code Optim. 2016
GPUs and heterogeneous computing › GPU memory management
unified virtual memory
0.212016
Building Heterogeneous Unified Virtual Memories (UVMs) without the Overhead · ACM Trans. Archit. Code Optim. 2016
Processor architecture and microarchitecture › out-of-order execution
out-of-order processor
0.112018
Static Instruction Scheduling for High Performance on Limited Hardware · IEEE Trans. Computers 2018

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

non-speculative execution · 0.3load clustering · 0.3cross-layer co-design · 0.3compiler optimization · 0.3coherence protocol · 0.2
YearPublicationVenuePosition
2018 SWOOP: software-hardware co-design for non-speculative, execute-ahead, in-order cores
abstract
Increasing demands for energy efficiency constrain emerging hardware. These new hardware trends challenge the established assumptions in code generation and force us to rethink existing software optimization techniques. We propose a cross-layer redesign of the way compilers and the underlying microarchitecture are built and interact, to achieve both performance and high energy efficiency.
Kim-Anh Tran, Alexandra Jimborean, Trevor E. Carlson, Konstantinos Koukos, Magnus Själander, Stefanos Kaxiras
PLDI4
2018 Static Instruction Scheduling for High Performance on Limited Hardware
abstract
Complex out-of-order (OoO) processors have been designed to overcome the restrictions of outstanding long-latency misses at the cost of increased energy consumption. Simple, limited OoO processors are a compromise in terms of energy consumption and performance, as they have fewer hardware resources to tolerate the penalties of long-latency loads. In worst case, these loads may stall the processor entirely. We present Clairvoyance, a compiler based technique that generates code able to hide memory latency and better utilize simple OoO processors. By clustering loads found across basic block boundaries, Clairvoyance overlaps the outstanding latencies to increases memory-level parallelism. We show that these simple OoO processors, equipped with the appropriate compiler support, can effectively hide long-latency loads and achieve performance improvements for memory-bound applications. To this end, Clairvoyance tackles (i) statically unknown dependencies, (ii) insufficient independent instructions, and (iii) register pressure. Clairvoyance achieves a geomean execution time improvement of 14 percent for memory-bound applications, on top of standard O3 optimizations, while maintaining compute-bound applications' high-performance.
Kim-Anh Tran, Trevor E. Carlson, Konstantinos Koukos, Magnus Själander, Vasileios Spiliopoulos 0001, Stefanos Kaxiras, Alexandra Jimborean
IEEE Trans. Computers3
2017 Clairvoyance: look-ahead compile-time scheduling
Kim-Anh Tran, Trevor E. Carlson, Konstantinos Koukos, Magnus Själander, Vasileios Spiliopoulos 0001, Stefanos Kaxiras, Alexandra Jimborean
CGO3
2016 Multiversioned decoupled access-execute: the key to energy-efficient compilation of general-purpose programs
abstract
Computer architecture design faces an era of great challenges in an attempt to simultaneously improve performance and energy efficiency. Previous hardware techniques for energy management become severely limited, and thus, compilers play an essential role in matching the software to the more restricted hardware capabilities. One promising approach is software decoupled access-execute (DAE), in which the compiler transforms the code into coarse-grain phases that are well-matched to the Dynamic Voltage and Frequency Scaling (DVFS) capabilities of the hardware. While this method is proved efficient for statically analyzable codes, general-purpose applications pose significant challenges due to pointer aliasing, complex control flow and unknown runtime events. We propose a universal compile-time method to decouple general-purpose applications, using simple but efficient heuristics. Our solutions overcome the challenges of complex code and show that automatic decoupled execution significantly reduces the energy expenditure of irregular or memory-bound applications and even yields slight performance boosts. Overall, our technique achieves over 20% on average energy-delay-product (EDP) improvements (energy over 15% and performance over 5%) across 14 benchmarks from SPEC CPU 2006 and Parboil benchmark suites, with peak EDP improvements surpassing 70%.
Konstantinos Koukos, Per Ekemark, Georgios Zacharopoulos 0001, Vasileios Spiliopoulos 0001, Stefanos Kaxiras, Alexandra Jimborean
CC1
2016 Building Heterogeneous Unified Virtual Memories (UVMs) without the Overhead
abstract
This work proposes a novel scheme to facilitate heterogeneous systems with unified virtual memory. Research proposals implement coherence protocols for sequential consistency (SC) between central processing unit (CPU) cores and between devices. Such mechanisms introduce severe bottlenecks in the system; therefore, we adopt the heterogeneous-race-free (HRF) memory model. The use of HRF simplifies the coherency protocol and the graphics processing unit (GPU) memory management unit (MMU). Our protocol optimizes CPU and GPU demands separately, with the GPU part being simpler while the CPU is more elaborate and latency aware. We achieve an average 45% speedup and 45% energy-delay product reduction (20% energy) over the corresponding SC implementation.
Konstantinos Koukos, Alberto Ros 0001, Erik Hagersten, Stefanos Kaxiras
ACM Trans. Archit. Code Optim.1
2014 Fix the code. Don't tweak the hardware: A new compiler approach to Voltage-Frequency scaling
Alexandra Jimborean, Konstantinos Koukos, Vasileios Spiliopoulos 0001, David Black-Schaffer, Stefanos Kaxiras
CGO2
2013 Towards more efficient execution: a decoupled access-execute approach
abstract
The end of Dennard scaling is expected to shrink the range of DVFS in future nodes, limiting the energy savings of this technique. This paper evaluates how much we can increase the effectiveness of DVFS by using a software decoupled access-execute approach. Decoupling the data access from execution allows us to apply optimal voltage-frequency selection for each phase and therefore improve energy efficiency over standard coupled execution.
Konstantinos Koukos, David Black-Schaffer, Vasileios Spiliopoulos 0001, Stefanos Kaxiras
ICS1
2010 Tagged Procedure Calls (TPC): Efficient Runtime Support for Task-Based Parallelism on the Cell Processor
George Tzenakis, Konstantinos Kapelonis, Michail Alvanos, Konstantinos Koukos, Dimitrios S. Nikolopoulos, Angelos Bilas
HiPEAC4