Exploring Time-Space trade-offs for synchronized in Lilliput
<|reference_start|>Exploring Time-Space trade-offs for synchronized in Lilliput: In the context of Project Lilliput, which attempts to reduce the size of object header in the HotSpot Java Virtual Machine (JVM), we explore a curated set of synchronization algorithms. Each of the algorithms could serve as a potential replacement implementation for the "synchronized" construct in HotSpot. Collectively, the algorithms illuminate trade-offs in space-time properties. The key design decisions are where to locate synchronization metadata (monitor fields), how to map from an object to those fields, and the lifecycle of the monitor information. The reader is assumed to be familiar with current HotSpot implementation of "synchronized" as well as the Compact Java Monitors (CJM) design and Project Lilliput.<|reference_end|>
@article{dice2024exploring,
    title={Exploring Time-Space trade-offs for synchronized in Lilliput},
    author={Dave Dice and Alex Kogan},
    journal={arXiv preprint arXiv:2409.18342},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.18342},
    primaryClass={cs.OS}
}