Cache and I/O efficent functional algorithms

Blelloch, Guy E.; Harper, Robert

doi:10.1145/2429069.2429077

Cited by 9 publications

(4 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Cost semantics: Another promising research area consists on cost estimation for programs using functional concepts, like higher-order functions. A study relating asymptotic analysis with cost semantics [52] can be explored for further investigations. In a cost semantics, it is possible to specify an abstract cost for a program which can be validated by a provable implementation that transfers the abstract cost to a precise concrete cost on a particular platform [53].…”

Section: Property-based Random Testing and Mechanized Proofsmentioning

confidence: 99%

Formal Semantics for Java-like Languages and Research Opportunities

Feitosa

Ribeiro

Bois

2018

RITA

View full text Add to dashboard Cite

The objective of this paper is twofold: first, we discuss the state of art on Java-like semantics, focusing on those that provide formal specification using operational semantics (big-step or small-step), studying in detail the most cited projects and presenting some derivative works that extend the originals aggregating useful features. Also, we filter our research for those that provide some insights in type-safety proofs. Furthermore, we provide a comparison between the most used projects in order to show which functionalities are covered in such projects. Second, our effort is focused towards the research opportunities in this area, showing some important works that can be applied to the previously presented projects to study features of object-oriented languages, and pointing for some possibilities to explore in future researches.

show abstract

Section: Property-based Random Testing and Mechanized Proofsmentioning

confidence: 99%

Formal Semantics for Java-like Languages and Research Opportunities

Feitosa

Ribeiro

Bois

2018

RITA

View full text Add to dashboard Cite

show abstract

“…Blelloch and Greiner [13] pioneered the cost measures work and depth. There are more advanced cost models that take into account caches and IO (see, e.g., Blelloch and Harper [14]), However, these works do not provide machine support for deriving static cost bounds.…”

Section: Related Workmentioning

confidence: 99%

Towards automatic resource bound analysis for OCaml

2017

View full text Add to dashboard Cite

This article presents a resource analysis system for OCaml programs. The system automatically derives worst-case resource bounds for higher-order polymorphic programs with user-defined inductive types. The technique is parametric in the resource and can derive bounds for time, memory allocations and energy usage. The derived bounds are multivariate resource polynomials which are functions of different size parameters that depend on the standard OCaml types. Bound inference is fully automatic and reduced to a linear optimization problem that is passed to an off-the-shelf LP solver. Technically, the analysis system is based on a novel multivariate automatic amortized resource analysis (AARA). It builds on existing work on linear AARA for higher-order programs with user-defined inductive types and on multivariate AARA for first-order programs with built-in lists and binary trees. This is the first amortized analysis, that automatically derives polynomial bounds for higherorder functions and polynomial bounds that depend on user-defined inductive types. Moreover, the analysis handles a limited form of side effects and even outperforms the linear bound inference of previous systems. At the same time, it preserves the expressivity and efficiency of existing AARA techniques. The practicality of the analysis system is demonstrated with an implementation and integration with Inria's OCaml compiler. The implementation is used to automatically derive resource bounds for 411 functions and 6018 lines of code derived from OCaml libraries, the CompCert compiler, and implementations of textbook algorithms. In a case study, the system infers bounds on the number of queries that are sent by OCaml programs to DynamoDB, a commercial NoSQL cloud database service.

show abstract

“…We show this in the context of a purely functional (side-effect free) language. The formulation given here is slightly simplified compared to the associated conference paper [5] for the sake of brevity and clarity; we refer the reader to that paper for a fuller explanation.…”

Section: Careful Layout and Careful Allocationmentioning

confidence: 99%

Cache efficient functional algorithms

Blelloch

Harper

2015

Commun. ACM

Self Cite

View full text Add to dashboard Cite

The widely studied I/O and ideal-cache models were developed to account for the large difference in costs to access memory at different levels of the memory hierarchy. Both models are based on a two level memory hierarchy with a fixed size fast memory (cache) of size M , and an unbounded slow memory organized in blocks of size B. The cost measure is based purely on the number of block transfers between the primary and secondary memory. All other operations are free. Many algorithms have been analyzed in these models and indeed these models predict the relative performance of algorithms much more accurately than the standard RAM model. The models, however, require specifying algorithms at a very low level, requiring the user to carefully lay out their data in arrays in memory and manage their own memory allocation.We present a cost model for analyzing the memory efficiency of algorithms expressed in a simple functional language. We show how some algorithms written in standard forms using just lists and trees (no arrays) and requiring no explicit memory layout or memory management are efficient in the model. We then describe an implementation of the language and show provable bounds for mapping the cost in our model to the cost in the ideal-cache model. These bounds imply that purely functional programs based on lists and trees with no special attention to any details of memory layout can be asymptotically as efficient as the carefully designed imperative I/O efficient algorithms. For example we describe an O( n B log M/B n B ) cost sorting algorithm, which is optimal in the ideal cache and I/O models.

show abstract

Cache and I/O efficent functional algorithms

Cited by 9 publications

References 22 publications

Formal Semantics for Java-like Languages and Research Opportunities

Formal Semantics for Java-like Languages and Research Opportunities

Towards automatic resource bound analysis for OCaml

Cache efficient functional algorithms

Contact Info

Product

Resources

About