Pith. sign in

REVIEW

Memory-Efficient Object-Oriented Programming on GPUs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1908.05845 v1 pith:YOCV4EJQ submitted 2019-08-16 cs.PL

classification cs.PL
keywords object-orientedprogrammingmemorysmmoapplicationsdevelopgpuslayout
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Object-oriented programming is often regarded as too inefficient for high-performance computing (HPC), despite the fact that many important HPC problems have an inherent object structure. Our goal is to bring efficient, object-oriented programming to massively parallel SIMD architectures, especially GPUs. In this thesis, we develop various techniques for optimizing object-oriented GPU code. Most notably, we identify the object-oriented Single-Method Multiple-Objects (SMMO) programming model. We first develop an embedded C++ Structure of Arrays (SOA) data layout DSL for SMMO applications. We then design a lock-free, dynamic memory allocator that stores allocations in SOA layout. Finally, we show how to further optimize the memory access of SMMO applications with memory defragmentation.

Discussion (0). Continue with ORCID to comment.

Pith tools