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

Eugene Burmako

dblp:136/0947 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none

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

Software engineering, systems software and programming languages · 2

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.

Software engineering, system software, and programming languages
2 papers
Programming languages and type systems · 50% Compilers and program optimization · 27% Runtime systems and virtual machines · 23%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization › memory optimization
data layout transformation
0.212014
Late data layout: unifying data representation transformations · OOPSLA 2014
Programming languages and type systems
type systems
0.212014
Late data layout: unifying data representation transformations · OOPSLA 2014
Runtime systems and virtual machines › object representation
object serialization
0.212013
Instant pickles: generating object-oriented pickler combinators for fast and extensible serialization · OOPSLA 2013
Programming languages and type systems
serialization
0.212013
Instant pickles: generating object-oriented pickler combinators for fast and extensible serialization · OOPSLA 2013

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

type class pattern · 0.2compile-time code generation · 0.2
YearPublicationVenuePosition
2014 Late data layout: unifying data representation transformations
abstract
Values need to be represented differently when interacting with certain language features. For example, an integer has to take an object-based representation when interacting with erased generics, although, for performance reasons, the stack-based value representation is better. To abstract over these implementation details, some programming languages choose to expose a unified high-level concept (the integer) and let the compiler choose its exact representation and insert coercions where necessary.
Vlad Ureche, Eugene Burmako, Martin Odersky
OOPSLA2
2013 Instant pickles: generating object-oriented pickler combinators for fast and extensible serialization
abstract
As more applications migrate to the cloud, and as "big data" edges into even more production environments, the performance and simplicity of exchanging data between compute nodes/devices is increasing in importance. An issue central to distributed programming, yet often under-considered, is serialization or pickling, i.e., persisting runtime objects by converting them into a binary or text representation. Pickler combinators are a popular approach from functional programming; their composability alleviates some of the tedium of writing pickling code by hand, but they don't translate well to object-oriented programming due to qualities like open class hierarchies and subtyping polymorphism. Furthermore, both functional pickler combinators and popular, Java-based serialization frameworks tend to be tied to a specific pickle format, leaving programmers with no choice of how their data is persisted. In this paper, we present object-oriented pickler combinators and a framework for generating them at compile-time, called scala/pickling, designed to be the default serialization mechanism of the Scala programming language. The static generation of OO picklers enables significant performance improvements, outperforming Java and Kryo in most of our benchmarks. In addition to high performance and the need for little to no boilerplate, our framework is extensible: using the type class pattern, users can provide both (1) custom, easily interchangeable pickle formats and (2) custom picklers, to override the default behavior of the pickling framework. In benchmarks, we compare scala/pickling with other popular industrial frameworks, and present results on time, memory usage, and size when pickling/unpickling a number of data types used in real-world, large-scale distributed applications and frameworks.
Heather Miller, Philipp Haller, Eugene Burmako, Martin Odersky
OOPSLA3