Supporting Huge Address Spaces in a Virtual Machine for Java on a Cluster

Veldema R, Philippsen M (2008)

Publication Language: English

Publication Type: Conference contribution, Original article

Publication year: 2008

Journal

Lecture Notes in Computer Science Springer Verlag

Publisher: Springer-verlag

Edited Volumes: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

City/Town: Berlin Heidelberg

Book Volume: LNCS 5234

Pages Range: 187-201

Conference Proceedings Title: Languages and Compilers for Parallel Computing, 20th International Workshop, LCPC 2007

Event location: Urbana, Illinois US

ISBN: 978-3-540-85260-5

URI: http://www2.informatik.uni-erlangen.de/publication/download/LCPC_LVM.pdf

DOI: 10.1007/978-3-540-85261-2_13

Abstract

To solve problems that require far more memory than a single machine can supply, data can be swapped to disk in some manner, it can be compressed, and/or the memory of multiple parallel machines can be used to provide enough memory and storage space. Instead of implementing either functionality anew and specific for each application, or instead of relying on the operating system's swapping algorithms (which are inflexible, not algorithm-aware, and often limited in their fixed storage capacity), our solution is a Large Virtual Machine (LVM) that transparently provides a large address space to applications and that is more flexible and efficient than operating system approaches. LVM is a virtual machine for Java that is designed to support large address spaces for billions of objects. It swaps objects out to disk, compresses objects where needed, and uses multiple parallel machines in a Distributed Shared Memory (DSM) setting. The latter is the main focus of this paper. Allocation and collection performance is similar to well-known JVMs if no swapping is needed. With swapping and clustering, we are able to create a list containing 1.2×108 elements far faster than other JVMs. LVM's swapping is up to 10 times faster than OS-level swapping. A swap-aware GC algorithm helps by a factor of 3. © 2008 Springer-Verlag Berlin Heidelberg.

Authors with CRIS profile

Ronald Veldema Lehrstuhl für Informatik 2 (Programmiersysteme) Michael Philippsen Lehrstuhl für Informatik 2 (Programmiersysteme)

How to cite

APA:

Veldema, R., & Philippsen, M. (2008). Supporting Huge Address Spaces in a Virtual Machine for Java on a Cluster. In Vikram Adve, María Jesús Garzarán, Paul Petersen (Eds.), Languages and Compilers for Parallel Computing, 20th International Workshop, LCPC 2007 (pp. 187-201). Urbana, Illinois, US: Berlin Heidelberg: Springer-verlag.

MLA:

Veldema, Ronald, and Michael Philippsen. "Supporting Huge Address Spaces in a Virtual Machine for Java on a Cluster." Proceedings of the 20th International Workshop on Languages and Compilers for Parallel Computing (LCPC '07), Urbana, Illinois Ed. Vikram Adve, María Jesús Garzarán, Paul Petersen, Berlin Heidelberg: Springer-verlag, 2008. 187-201.

BibTeX: Download