research-article

Storage strategies for collections in dynamically typed languages

Authors:

Carl Friedrich Bolz,

Lukas Diekmann,

Laurence TrattAuthors Info & Claims

ACM SIGPLAN Notices, Volume 48, Issue 10

Pages 167 - 182

https://doi.org/10.1145/2544173.2509531

Published: 29 October 2013 Publication History

Abstract

Dynamically typed language implementations often use more memory and execute slower than their statically typed cousins, in part because operations on collections of elements are unoptimised. This paper describes storage strategies, which dynamically optimise collections whose elements are instances of the same primitive type. We implement storage strategies in the PyPy virtual machine, giving a performance increase of 18% on wide-ranging benchmarks of real Python programs. We show that storage strategies are simple to implement, needing only 1500LoC in PyPy, and have applicability to a wide range of virtual machines.

References

[1]

C. S. Ananian and M. Rinard. Data size optimizations for Java programs. In phProc. LCTES, pages 59--68, 2003.

Digital Library

[2]

A. W. Appel and M. J. Gonçalves. Hash-consing garbage collection. Technical Report CS-TR-412--93, Princeton University, Dept. of Computer Science, 1993.

[3]

V. Bala, E. Duesterwald, and S. Banerjia. Dynamo: a transparent dynamic optimization system. In phProc. PLDI, pages 1--12, 2000.

Digital Library

[4]

M. Bayer. Orm2010, 2012. URL http://techspot.zzzeek.org. {Online; accessed 26-March-2013}.

[5]

S. Bird, E. Klein, and E. Loper. phNatural Language Processing with Python. O'Reilly Media, July 2009.

Digital Library

[6]

C. F. Bolz and L. Tratt. The impact of meta-tracing on VM design and implementation. phTo appear, Science of Computer Programming, 2013.

[7]

C. F. Bolz, A. Cuni, M. Fijałkowski, and A. Rigo. Tracing the meta-level: PyPy's tracing JIT compiler. In phProc. ICOOOLPS, pages 18--25, 2009.

Digital Library

[8]

C. F. Bolz, A. Cuni, M. Fijałkowski, M. Leuschel, S. Pedroni, and A. Rigo. Allocation removal by partial evaluation in a tracing JIT. phProc. PEPM, Jan. 2011.

Digital Library

[9]

O. Callaú, R. Robbes, E. Tanter, and D. Röthlisberger. How developers use the dynamic features of programming languages: the case of smalltalk. In phProc. MSR, page 23--32, 2011.

Digital Library

[10]

B. Cannon. phLocalized type inference of atomic types in Python. Master thesis, California Polytechnic State University, 2005.

[11]

C. Chambers, D. Ungar, and E. Lee. An efficient implementation of SELF a dynamically-typed object-oriented language based on prototypes. In phOOPSLA, volume 24, 1989.

Digital Library

[12]

C. Chambers, D. Ungar, and E. Lee. An efficient implementation of self a dynamically-typed object-oriented language based on prototypes. phSIGPLAN Not., 24: 49--70, Sept. 1989\natexlabb.

Digital Library

[13]

D. Clifford. URL http://v8-io12.appspot.com/. Talk at IO12 {Online; accessed 27-June-2013}.

[14]

D. Clifford, V. Egorov, and M. Stanton. Personal communication, July 2013.

[15]

J. da Silva and G. Lopes. A local maxima method and a fair dispersion normalization for extracting multi-word units from corpora. In phMeeting on Mathematics of Language, 1999.

[16]

FeedParser Developers. Feedparser, 2012. URL http://code.google.com/p/feedparser/. {Online; accessed 26-March-2013}.

[17]

P. Fleming and J. Wallace. How not to lie with statistics: the correct way to summarize benchmark results. phCommun. ACM, 29 (3): 218--221, Mar. 1986.

Digital Library

[18]

A. Gal, B. Eich, M. Shaver, D. Anderson, D. Mandelin, M. R. Haghighat, B. Kaplan, G. Hoare, B. Zbarsky, J. Orendorff, J. Ruderman, E. W. Smith, R. Reitmaier, M. Bebenita, M. Chang, and M. Franz. Trace-based Just-In-Time type specialization for dynamic languages. In phProc. PLDI, 2009.

Digital Library

[19]

E. Gamma, R. Helm, R. E. Johnson, and J. Vlissides. phDesign Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley Longman, Amsterdam, Oct. 1994.

Digital Library

[20]

A. Georges, D. Buytaert, and L. Eeckhout. Statistically rigorous Java performance evaluation. phSIGPLAN Notices, 42 (10): 57--76, 2007.

Digital Library

[21]

D. Gudeman. Representing type information in Dynamically-Typed languages. Technical Report TR93--27, University of Arizona at Tucson, 1993.

[22]

B. Hackett and S.-y. Guo. Fast and precise hybrid type inference for JavaScript. In phProc. PLDI, pages 239--250, 2012.

Digital Library

[23]

A. Holkner and J. Harland. Evaluating the dynamic behaviour of python applications. In phProc. ACSC, pages 19--28, 2009.

Digital Library

[24]

T. Kotzmann and H. Mössenböck. Escape analysis in the context of dynamic compilation and deoptimization. In phProc. VEE, page 111--120, 2005.

Digital Library

[25]

Logilab. Pylint, 2012. URL http://www.logilab.org/project/pylint. {Online; accessed 26-March-2013}.

[26]

NetworkX Developers. Networkx, 2012. URL http://networkx.lanl.gov. {Online; accessed 26-March-2013}.

[27]

Excelerator Developers. pyexcelerator, 2012. URL http://sourceforge.net/projects/pyexcelerator. {Online; accessed 26-March-2013}.

[28]

PyPy Team. Pypy speed benchmarks, 2013. URL http://speed.pypy.org/. {Online; accessed 27-June-2013}.

[29]

P. Quentel. Pydblite, 2012. URL http://www.pydblite.net/en/index.html. {Online; accessed 26-March-2013}.

[30]

A. Radziszewski and M. Piasecki. A preliminary Noun Phrase Chunker for Polish. In phProc. IOS, pages 169--180. Springer, 2010. Chunker available at http://nlp.pwr.wroc.pl/trac/private/disaster/.

[31]

G. Richards, S. Lebresne, B. Burg, and J. Vitek. An analysis of the dynamic behavior of JavaScript programs. In phProc. PLDI, pages 1--12, 2010.

Digital Library

[32]

A. Rigo and S. Pedroni. PyPy's approach to virtual machine construction. In phProc. DLS, 2006.

Digital Library

[33]

Rosetta Code. Inverted index, 2012. URL http://rosettacode.org/wiki/Inverted_index#Python. {Online; accessed 26-March-2013}.

[34]

J. B. Sartor, M. Hirzel, and K. S. McKinley. No bit left behind: the limits of heap data compression. In phProc. ISSM, pages 111--120. ACM, 2008.

Digital Library

[35]

L. Tratt. Dynamically typed languages. phAdvances in Computers, 77: 149--184, July 2009.

[36]

Whoosh Developers. Whoosh, 2012. URL https://bitbucket.org/mchaput/whoosh. {Online; accessed 26-March-2013}.

Cited By

Serrano MFeeley MAmaral JKulkarni M(2019)Property caches revisitedProceedings of the 28th International Conference on Compiler Construction10.1145/3302516.3307344(99-110)Online publication date: 16-Feb-2019
https://dl.acm.org/doi/10.1145/3302516.3307344
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
Show More Cited By

Index Terms

Storage strategies for collections in dynamically typed languages
1. Software and its engineering
  1. Software notations and tools
    1. Compilers

Recommendations

Storage strategies for collections in dynamically typed languages
OOPSLA '13: Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications

Dynamically typed language implementations often use more memory and execute slower than their statically typed cousins, in part because operations on collections of elements are unoptimised. This paper describes storage strategies, which dynamically ...
Language-independent storage strategies for tracing-JIT-based virtual machines
DLS '15

Storage strategies have been proposed as a run-time optimization for the PyPy Python implementation and have shown promising results for optimizing execution speed and memory requirements. However, it remained unclear whether the approach works equally ...
Language-independent storage strategies for tracing-JIT-based virtual machines
DLS 2015: Proceedings of the 11th Symposium on Dynamic Languages

Storage strategies have been proposed as a run-time optimization for the PyPy Python implementation and have shown promising results for optimizing execution speed and memory requirements. However, it remained unclear whether the approach works equally ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices

ACM SIGPLAN Notices Volume 48, Issue 10

OOPSLA '13

October 2013

867 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/2544173

Editor:
Mark W. Bailey
Hamilton College, Clinton, NY

Issue’s Table of Contents

OOPSLA '13: Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications
October 2013
904 pages
ISBN:9781450323741
DOI:10.1145/2509136
Co-chair:
Antony Hosking
Purdue University, USA
,
General Chair:
Patrick Eugster
Purdue University, USA
,
Program Chair:
Cristina V. Lopes
University of California, Irvine, USA

Copyright © 2013 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 October 2013

Published in SIGPLAN Volume 48, Issue 10

Check for updates

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

46
Total Citations
View Citations
478
Total Downloads

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

Reflects downloads up to 03 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Serrano MFeeley MAmaral JKulkarni M(2019)Property caches revisitedProceedings of the 28th International Conference on Compiler Construction10.1145/3302516.3307344(99-110)Online publication date: 16-Feb-2019
https://dl.acm.org/doi/10.1145/3302516.3307344
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
Clifford DPayer HStanton MTitzer B(2015)Memento mori: dynamic allocation-site-based optimizationsACM SIGPLAN Notices10.1145/2887746.275418150:11(105-117)Online publication date: 14-Jun-2015
https://dl.acm.org/doi/10.1145/2887746.2754181
Newton RFogg PVaramesh A(2015)Adaptive lock-free maps: purely-functional to scalableACM SIGPLAN Notices10.1145/2858949.278473450:9(218-229)Online publication date: 29-Aug-2015
https://dl.acm.org/doi/10.1145/2858949.2784734
Felgentreff TPape TWassermann LHirschfeld RBolz CMorandat FZendra O(2015)Towards reducing the need for algorithmic primitives in dynamic language VMs through a tracing JITProceedings of the 10th Workshop on Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems10.1145/2843915.2843924(1-10)Online publication date: 4-Jul-2015
https://dl.acm.org/doi/10.1145/2843915.2843924
Newton RFogg PVaramesh AFisher KReppy J(2015)Adaptive lock-free maps: purely-functional to scalableProceedings of the 20th ACM SIGPLAN International Conference on Functional Programming10.1145/2784731.2784734(218-229)Online publication date: 29-Aug-2015
https://dl.acm.org/doi/10.1145/2784731.2784734
Clifford DPayer HStanton MTitzer BHosking ABond M(2015)Memento mori: dynamic allocation-site-based optimizationsProceedings of the 2015 International Symposium on Memory Management10.1145/2754169.2754181(105-117)Online publication date: 14-Jun-2015
https://dl.acm.org/doi/10.1145/2754169.2754181
De Wael MMarr SDe Meuter W(2014)Data interface + algorithms = efficient programsProceedings of the 9th International Workshop on Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems PLE10.1145/2633301.2633303(1-4)Online publication date: 28-Jul-2014
https://dl.acm.org/doi/10.1145/2633301.2633303
Larose OKaleba SBurchell HMarr S(2023)AST vs. Bytecode: Interpreters in the Age of Meta-CompilationProceedings of the ACM on Programming Languages10.1145/36228087:OOPSLA2(318-346)Online publication date: 16-Oct-2023
https://dl.acm.org/doi/10.1145/3622808
Show More Cited By

View Options

Get Access

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