Graphite two years after: First lessons learned from real-world polyhedral compilation
…, F Li, T Grosser, H Jagasia, R Ladelsky… - … Workshop (GROW'10 …, 2010 - inria.hal.science
Modern compilers are responsible for adapting the semantics of source programs into a
form that makes efficient use of a highly complex, heterogeneous machine. This adaptation …
form that makes efficient use of a highly complex, heterogeneous machine. This adaptation …
{Efficient} and Scalable Paravirtual {I/O} System
…, M Ben-Yehuda, A Traeger, R Ladelsky - 2013 USENIX Annual …, 2013 - usenix.org
The most popular I/O virtualization method today is paravirtual I/O. Its popularity stems from
its reasonable performance levels while allowing the host to interpose, ie, inspect or control …
its reasonable performance levels while allowing the host to interpose, ie, inspect or control …
Paravirtual remote i/o
Y Kuperman, E Moscovici, J Nider, R Ladelsky… - ACM SIGARCH …, 2016 - dl.acm.org
The traditional "trap and emulate" I/O paravirtualization model conveniently allows for I/O
interposition, yet it inherently incurs costly guest-host context switches. The newer "sidecore" …
interposition, yet it inherently incurs costly guest-host context switches. The newer "sidecore" …
Parallelizing more loops with compiler guided refactoring
P Larsen, R Ladelsky, J Lidman… - 2012 41st …, 2012 - ieeexplore.ieee.org
The performance of many parallel applications relies not on instruction-level parallelism but
on loop-level parallelism. Unfortunately, automatic parallelization of loops is a fragile process…
on loop-level parallelism. Unfortunately, automatic parallelization of loops is a fragile process…
Acotes project: Advanced compiler technologies for embedded streaming
Streaming applications are built of data-driven, computational components, consuming and
producing unbounded data streams. Streaming oriented systems have become dominant in …
producing unbounded data streams. Streaming oriented systems have become dominant in …
[PDF][PDF] Matrix flattening and transposing in GCC
R Ladelsky - Proceedings of the GCC Developers' Summit, 2006 - researchgate.net
The layout of data in memory can have a significant effect on the performance of applications.
Several compilation techniques can be used to optimize this layout. This paper describes …
Several compilation techniques can be used to optimize this layout. This paper describes …
Automatic loop parallelization via compiler guided refactoring
For many parallel applications, performance relies not on instruction-level parallelism, but
on loop-level parallelism. Unfortunately, many modern applications are written in ways that …
on loop-level parallelism. Unfortunately, many modern applications are written in ways that …
[PDF][PDF] Compiler driven code comments and refactoring
P Larsen, R Ladelsky, S Karlsson, A Zaks - Fourth Workshop on …, 2011 - Citeseer
Helping programmers write parallel software is an urgent problem given the popularity of
multi-core architectures. Engineering compilers which automatically parallelize and vectorize …
multi-core architectures. Engineering compilers which automatically parallelize and vectorize …
[PDF][PDF] Interprocedural constant propagation and method versioning in GCC
R Ladelsky, M Namolaru - Proceedings of the 2005 GCC Developers' …, 2005 - Citeseer
In recent years interprocedural dataflow optimization and analysis became a standard part
of optimizing compilers. We implemented such an optimization in GCC—interprocedural …
of optimizing compilers. We implemented such an optimization in GCC—interprocedural …
Zero-copy receive path in virtio
K Meth, M Rapoport, J Nider, R Ladelsky - Proceedings of the 10th ACM …, 2017 - dl.acm.org
In the KVM hypervisor, incoming packets from the network must pass through several objects
in the Linux kernel before being delivered to the guest VM. Currently, both the hypervisor …
in the Linux kernel before being delivered to the guest VM. Currently, both the hypervisor …