Share This Author
Partitioned Global Address Space Languages
- M. D. Wael, Stefan Marr, B. D. Fraine, T. V. Cutsem, W. Meuter
- Computer ScienceACM Comput. Surv.
- 26 May 2015
This survey proposes a definition and a taxonomy of the Partitioned Global Address Space, revealing that today’s PGAS languages focus on distributing regular data and distinguish only between local and remote data access cost, whereas the distribution of irregular data and the adoption of richer dataAccess cost models remain open challenges.
The Art, Science, and Engineering of Programming
- Stefan Marr
- ArtThe Art, Science, and Engineering of Programming
- 31 May 2019
A Study of Concurrency Bugs and Advanced Development Support for Actor-based Programs
- Carmen Torres Lopez, Stefan Marr, H. Mössenböck, E. G. Boix
- Computer ScienceProgramming with Actors
- 22 June 2017
This study taxonomizes concurrency bugs in actor-based programs reported in literature and analyzes the bugs to identify the patterns causing them as well as their observable behavior, and finds that current approaches to static analysis and testing focus on communication deadlocks and message protocol violations.
The SOM family: virtual machines for teaching and research
The SOM (Simple Object Machine) family of virtual machine (VM) implementations, a collection of VMs for the same Smalltalk dialect addressing students at different levels of expertise, are introduced.
Are We There Yet?: Simple Language Implementation Techniques for the 21st Century
RPython and Truffle are implementation techniques based on simple interpreters; they promise to perform at the same order of magnitude as highly optimizing virtual machines.
Fork/join parallelism in the wild: documenting patterns and anti-patterns in Java programs using the fork/join framework
An empirical study on a corpus of 120 open source Java projects that use the Fork/Join framework found three recurring anti-patterns that potentially limit parallel performance: sub-optimal use of Java collections when tasks into subtasks as well as when merging the results of subtasks, and finally the inappropriate sharing of resources between tasks.
Cross-language compiler benchmarking: are we fast yet?
This paper presents 14 benchmarks and a novel methodology to assess the compiler effectiveness across language implementations and argues that these benchmarks help language implementers to identify performance bugs and optimization potential by comparing to other language implementations.
Tracing vs. partial evaluation: comparing meta-compilation approaches for self-optimizing interpreters
This study investigates both approaches in the context of self-optimizing interpreters, a technique for building fast abstract-syntax-tree interpreters and finds that tracing and partial evaluation both reach roughly the same level of performance.
Efficient and deterministic record & replay for actor languages
- Dominik Aumayr, Stefan Marr, Clément Béra, E. G. Boix, H. Mössenböck
- Computer ScienceManLang '18
- 16 May 2018
This work presents a low-overhead record & replay approach for actor languages that allows one to debug concurrency issues deterministically based on a previously recorded trace, and takes a first step towards deterministic replay debugging of actor systems in production.
A concurrency-agnostic protocol for multi-paradigm concurrent debugging tools
- Stefan Marr, Carmen Torres Lopez, Dominik Aumayr, E. G. Boix, H. Mössenböck
- Computer ScienceDLS
- 1 June 2017
A concurrency-agnostic debugger protocol is proposed that decouples the debugger from the concurrency models employed by the target application, and the underlying language runtime can define custom breakpoints, stepping operations, and execution events for each concurrency model it supports, and a debugger can expose them without having to be specifically adapted.