research-article

Efficient communication and collection with compact normal forms

Authors:

Edward Z. Yang,

Giovanni Campagna,

Ömer S. Ağacan,

Ahmed El-Hassany,

Abhishek Kulkarni,

Ryan R. NewtonAuthors Info & Claims

ACM SIGPLAN Notices, Volume 50, Issue 9

Pages 362 - 374

https://doi.org/10.1145/2858949.2784735

Published: 29 August 2015 Publication History

Abstract

In distributed applications, the transmission of non-contiguous data structures is greatly slowed down by the need to serialize them into a buffer before sending. We describe Compact Normal Forms, an API that allows programmers to explicitly place immutable heap objects into regions, which can both be accessed like ordinary data as well as efficiently transmitted over the network. The process of placing objects into compact regions (essentially a copy) is faster than any serializer and can be amortized over a series of functional updates to the data structure in question. We implement this scheme in the Glasgow Haskell Compiler and show that even with the space expansion attendant with memory-oriented data structure representations, we achieve between x2 and x4 speedups on fast local networks with sufficiently large data structures.

References

[1]

E. D. Berger, B. G. Zorn, and K. S. McKinley. Reconsidering custom memory allocation. ACM SIGPLAN Notices, 37:1, 2002.

Digital Library

[2]

R. L. Bocchino Jr, V. S. Adve, D. Dig, S. V. Adve, S. Heumann, R. Komuravelli, J. Overbey, P. Simmons, H. Sung, and M. Vakilian. A type and effect system for deterministic parallel Java. ACM Sigplan Notices, 44(10):97–116, 2009.

Digital Library

[3]

S. Breitinger, U. Klusik, and R. Loogen. From (sequential) Haskell to (parallel) Eden: An Implementation Point of View. Symposium on Programming Language Implementation and Logic Programming - PLILP, pages 318–334, 1998.

Digital Library

[4]

L. Cardelli. The Functional Abstract Machine. Technical Report TR- 107, AT&T Bell Laboratories, 1983.

[5]

J. Chase, F. Amador, E. Lazowska, H. Levy, and R. Littlefield. The Amber system: parallel programming on a network of multiprocessors. ACM SIGOPS Operating Systems Review, 23(December 1989):147–158, 1989.

Digital Library

[6]

J. S. Chase, H. M. Levy, E. D. Lazowska, and M. Baker-Harvey. Lightweight shared objects in a 64-bit operating system. In ACM SIGPLAN Notices, volume 27, pages 397–413, 1992.

Digital Library

[7]

S. Chaumette, P. Grange, B. Métrot, and P. Vignéras. Implementing a High Performance Object Transfer Mechanism over JikesRVM. 2004.

[8]

T. M. Chilimbi and J. R. Larus. Using generational garbage collection to implement cache-conscious data placement. In ACM SIGPLAN Notices, volume 34, pages 37–48, 1999.

Digital Library

[9]

L. Courtrai, Y. Maheo, and F. Raimbault. Expresso: a Library for Fast Java Objects Transfer. In Myrinet User Group Conference (MUG), 2000.

[10]

J. Epstein, A. P. Black, and S. Peyton-Jones. Towards Haskell in the cloud. ACM SIGPLAN Notices, 46(Section 4):118, 2012.

Digital Library

[11]

T. D. S. Gene Novark. Custom Object Layout for Garbage-Collected Languages. Techreport, 2006.

[12]

D. Grossman, G. Morrisett, T. Jim, M. Hicks, Y. Wang, and J. Cheney. Region-based memory management in Cyclone. In PLDI, 2002.

Digital Library

[13]

N. Hallenberg, M. Elsman, and M. Tofte. Combining region inference and garbage collection. In PLDI, volume 37, page 141, May 2002.

Digital Library

[14]

G. C. Hunt and J. R. Larus. Singularity: rethinking the software stack. SIGOPS OSR, 2007.

Digital Library

[15]

S. L. P. Jones. Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine. Journal of Functional Programming, 2:127–202, 1992.

[16]

A. Kemper and D. Kossmann. Adaptable pointer swizzling strategies in object bases: design, realization, and quantitative analysis. The VLDB Journal, 4:519–566, 1995.

Digital Library

[17]

R. Lämmel and S. P. Jones. Scrap your boilerplate with class: Extensible generic functions. SIGPLAN Not., 40(9):204–215, Sept. 2005.

Digital Library

[18]

J. Launchbury. A natural semantics for lazy evaluation. In Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 144–154. ACM Press, 1993.

Digital Library

[19]

R. Loogen, Y. Ortega-mallén, and R. Pe˜na mar´ı. Parallel functional programming in Eden. Journal of Functional Programming, 15(3):431–475, May 2005.

Digital Library

[20]

P. Maier and P. Trinder. Implementing a high-level distributedmemory parallel haskell in haskell. In Implementation and Application of Functional Languages, pages 35–50. Springer, 2012.

Digital Library

[21]

S. Marlow, T. Harris, R. P. James, and S. Peyton Jones. Parallel generational-copying garbage collection with a block-structured heap. In Proceedings of the 7th international symposium on Memory management, ISMM ’08, pages 11–20, New York, NY, USA, 2008. ACM.

Digital Library

[22]

K. McKelvey and F. Menczer. Design and prototyping of a social media observatory. In Proceedings of the 22nd international conference on World Wide Web companion, WWW ’13 Companion, pages 1351– 1358, 2013.

Digital Library

[23]

K. McKelvey and F. Menczer. Truthy: Enabling the Study of Online Social Networks. In Proc. 16th ACM Conference on Computer Supported Cooperative Work and Social Computing Companion (CSCW), 2013.

Digital Library

[24]

Microsoft Corporation. Word (. doc) Binary File Format. https://msdn.microsoft.com/en-us/library/office/ cc313153(v=office.12).aspx, 2014.

[25]

Microsoft Corporation. Bitmap Storage. https://msdn. microsoft.com/en-us/library/dd183391.aspx, 2015.

[26]

H. Miller, P. Haller, E. Burmako, and M. Odersky. Instant pickles: Generating object-oriented pickler combinators for fast and extensible serialization. In Proceedings of the 2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages & Applications, OOPSLA ’13, pages 183–202, New York, NY, USA, 2013. ACM.

Digital Library

[27]

C. Nester, M. Philippsen, and B. Haumacher. A more efficient RMI for Java. In Proceedings of the ACM 1999 conference on Java Grande, pages 152–159. ACM, 1999.

Digital Library

[28]

E. Shekita and M. Zwilling. Cricket: A Mapped, Persistent Object Store. Center for Parallel Optimization, Computer Sciences Department, University of Wisconsin, 1996.

[29]

TIS Committee. Tool Interface Standard (TIS) Executable and Linking Format (ELF) Specification (Version 1.2). Technical Report May, 1995.

[30]

M. Tofte, L. Birkedal, M. Elsman, and N. Hallenberg. A retrospective on region-based memory management. Higher-Order and Symbolic Computation, 17(3):245–265, 2004.

Digital Library

[31]

K. Varda. Cap’n Proto. https://capnproto.org/, 2015.

[32]

P. Wilson and S. Kakkad. Pointer swizzling at page fault time: efficiently and compatibly supporting huge address spaces on standard hardware. {1992} Proceedings of the Second International Workshop on Object Orientation in Operating Systems, 1992.

Cited By

Koparkar CRainey MVollmer MKulkarni MNewton R(2021)Efficient tree-traversals: reconciling parallelism and dense data representationsProceedings of the ACM on Programming Languages10.1145/34735965:ICFP(1-29)Online publication date: 22-Aug-2021
https://doi.org/10.1145/3473596
Koparkar CSinghal VGupta ARainey MVollmer MPelenitsyn ATobin-Hochstadt SKulkarni MNewton RBond MLee JPayer H(2024)Garbage Collection for Mostly Serialized HeapsProceedings of the 2024 ACM SIGPLAN International Symposium on Memory Management10.1145/3652024.3665512(1-14)Online publication date: 20-Jun-2024
https://dl.acm.org/doi/10.1145/3652024.3665512
Koparkar CRainey MVollmer MKulkarni MNewton R(2021)Efficient tree-traversals: reconciling parallelism and dense data representationsProceedings of the ACM on Programming Languages10.1145/34735965:ICFP(1-29)Online publication date: 19-Aug-2021
https://dl.acm.org/doi/10.1145/3473596
Show More Cited By

Index Terms

Efficient communication and collection with compact normal forms
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types

Recommendations

Efficient communication and collection with compact normal forms
ICFP 2015: Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming

In distributed applications, the transmission of non-contiguous data structures is greatly slowed down by the need to serialize them into a buffer before sending. We describe Compact Normal Forms, an API that allows programmers to explicitly place ...
Instant pickles: generating object-oriented pickler combinators for fast and extensible serialization
OOPSLA '13: Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications

As more applications migrate to the cloud, and as "big data" edges into even more production environments, the performance and simplicity of exchanging data between compute nodes/devices is increasing in importance. An issue central to distributed ...
Efficient Layering for High Speed Communication: Fast Messages 2.x
HPDC '98: Proceedings of the 7th IEEE International Symposium on High Performance Distributed Computing

We describe our experience designing, implementing, and evaluating two generations of our high performance communication library, Fast Messages (FM) for Myrinet. In FM 1.x, we designed a simple interface and provided guarantees of reliable and in-order ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices

ACM SIGPLAN Notices Volume 50, Issue 9

ICFP '15

September 2015

436 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/2858949

Editor:
Andy Gill
University of Kansas, Lawrence, KS

Issue’s Table of Contents

ICFP 2015: Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming
August 2015
436 pages
ISBN:9781450336697
DOI:10.1145/2784731
General Chair:
Kathleen Fisher
Tufts University, USA
,
Program Chair:
John Reppy
University of Chicago, USA

Copyright © 2015 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 29 August 2015

Published in SIGPLAN Volume 50, Issue 9

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

National Science Foundation

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
284
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)1

Reflects downloads up to 13 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Koparkar CRainey MVollmer MKulkarni MNewton R(2021)Efficient tree-traversals: reconciling parallelism and dense data representationsProceedings of the ACM on Programming Languages10.1145/34735965:ICFP(1-29)Online publication date: 22-Aug-2021
https://doi.org/10.1145/3473596
Koparkar CSinghal VGupta ARainey MVollmer MPelenitsyn ATobin-Hochstadt SKulkarni MNewton RBond MLee JPayer H(2024)Garbage Collection for Mostly Serialized HeapsProceedings of the 2024 ACM SIGPLAN International Symposium on Memory Management10.1145/3652024.3665512(1-14)Online publication date: 20-Jun-2024
https://dl.acm.org/doi/10.1145/3652024.3665512
Koparkar CRainey MVollmer MKulkarni MNewton R(2021)Efficient tree-traversals: reconciling parallelism and dense data representationsProceedings of the ACM on Programming Languages10.1145/34735965:ICFP(1-29)Online publication date: 19-Aug-2021
https://dl.acm.org/doi/10.1145/3473596
Krauter NRaaf PBraam PSalkhordeh RErdweg SBrinkmann A(2021)Persistent software transactional memory in HaskellProceedings of the ACM on Programming Languages10.1145/34735685:ICFP(1-29)Online publication date: 19-Aug-2021
https://dl.acm.org/doi/10.1145/3473568
Vollmer MKoparkar CRainey MSakka LKulkarni MNewton RMcKinley KFisher K(2019)LoCal: a language for programs operating on serialized dataProceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3314221.3314631(48-62)Online publication date: 8-Jun-2019
https://dl.acm.org/doi/10.1145/3314221.3314631
Chen CChoudhury VNewton R(2017)Adaptive lock-free data structures in Haskell: a general method for concurrent implementation swappingACM SIGPLAN Notices10.1145/3156695.312297352:10(197-211)Online publication date: 7-Sep-2017
https://dl.acm.org/doi/10.1145/3156695.3122973
Chen CChoudhury VNewton RDiatchki I(2017)Adaptive lock-free data structures in Haskell: a general method for concurrent implementation swappingProceedings of the 10th ACM SIGPLAN International Symposium on Haskell10.1145/3122955.3122973(197-211)Online publication date: 7-Sep-2017
https://dl.acm.org/doi/10.1145/3122955.3122973

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents