Parallelizing Stream with Future release_yapqbkumfjcxnll4hnyxgwzjjq

by Raphaël Jolly

Released as a article .

2013  

Abstract

Stream is re-interpreted in terms of a Lazy monad. Future is substituted for Lazy in the obtained construct, resulting in possible parallelization of any algorithm expressible as a Stream computation. The principle is tested against two example algorithms. Performance is evaluated, and a way to improve it briefly discussed.
In text/plain format

Archived Files and Locations

application/pdf  79.5 kB
file_rlouuiv35jd5jf3h6so4yraspm
web.archive.org (webarchive)
arxiv.org (repository)
Read Archived PDF
Archived
Type  article
Stage   submitted
Date   2013-05-19
Version   v1
Language   en ?
arXiv  1305.4367v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 0843d7c7-1e0c-43ef-a443-31c7dace0400
API URL: JSON