Title

Effectively mapping linguistic abstractions for message-passing concurrency to threads on the Java virtual machine

Campus Units

Computer Science

Document Type

Conference Proceeding

Conference

OOPSLA 2015 Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications

Publication Version

Accepted Manuscript

Link to Published Version

http://dx.doi.org/10.1145/2858965.2814289

Publication Date

Fall 10-2015

Journal or Book Title

ACM SigPlan Notices

Volume

50

Issue

10

First Page

840

Last Page

859

DOI

10.1145/2858965.2814289

Conference Title

OOPSLA 2015 Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications

Conference Date

October 25-30 2015

City

Pittsburgh

Abstract

Efficient mapping of message passing concurrency (MPC) abstractions to Java Virtual Machine (JVM) threads is critical for performance, scalability, and CPU utilization; but tedious and time consuming to perform manually. In general, this mapping cannot be found in polynomial time, but we show that by exploiting the local characteristics of MPC abstractions and their communication patterns this mapping can be determined effectively. We describe our MPC abstraction to thread mapping technique, its realization in two frame- works (Panini and Akka), and its rigorous evaluation using several benchmarks from representative MPC frameworks. We also compare our technique against four default mapping techniques: thread-all, round-robin-task-all, random-task-all and work-stealing. Our evaluation shows that our mapping technique can improve the performance by 30%-60% over default mapping techniques. These improvements are due to a number of challenges addressed by our technique namely: i) balancing the computations across JVM threads, ii) reducing the communication overheads, iii) utilizing information about cache locality, and iv) mapping MPC abstractions to threads in a way that reduces the contention between JVM threads.

Comments

This is a manuscript of a proceeding published as Choi, Ilkyoo, Bernard Lidický, and Derrick Stolee. "On choosability with separation of planar graphs with forbidden cycles." Journal of Graph Theory 81, no. 3 (2016): 283-306. 10.1145/2858965.2814289. Posted with permission.

Rights

© ACM, 2015 This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM SIGPLAN Notices, vol. 50, no. 10, pp. 840-859. 2015. https://doi.org/10.1145/2858965.2814289

Copyright Owner

ACM

Language

en

File Format

application/pdf

Published Version

Share

Article Location

 
COinS