Push: Improving Heap Residency for Lazy Stream Processing by Concurrency
Written on August 27, 2007
Prototype implementation of a language Push, accompanying our recently submitted paper. The prototype is implemented and prepared by Ta-Chung Tsai.
While studying XML stream processing, we noticed that programmers need concurrency to save space, especially in a lazy language. We propose the idea of pushing datatypes — when a pushing closure is demanded, all expressions referring to it are evaluated concurrently to weak head normal forms. The closure is no more alive and may thus be garbage collected.
Filed in: Software.
Tags: Concurrency, XML Streaming.