Crystal Scheme A Language for Massively Parallel Machines Export

@misc{citeulike:234496, abstract = {Massively parallel computers are built out of thousands conventional but powerful processors with independent memories. Very simple topologies mainly based on physical neighbourhood link these processors. The paper discusses extensions to the Scheme language in order to master such machines. Allowing arguments of functions to be concurrently evaluated introduces parallelism. Migration across the different processors is achieved through a remote evaluation mechanism. First-class continuations...}, author = {Queinnec, Christian}, citeulike-article-id = {234496}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.6613}, keywords = {lisp, parallel}, posted-at = {2005-06-22 11:34:13}, priority = {2}, title = {Crystal Scheme A Language for Massively Parallel Machines}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.6613} }

TY - GEN ID - citeulike:234496 L3 - citeulike-article-id:234496 N2 - Massively parallel computers are built out of thousands conventional but powerful processors with independent memories. Very simple topologies mainly based on physical neighbourhood link these processors. The paper discusses extensions to the Scheme language in order to master such machines. Allowing arguments of functions to be concurrently evaluated introduces parallelism. Migration across the different processors is achieved through a remote evaluation mechanism. First-class continuations... TI - Crystal Scheme A Language for Massively Parallel Machines KW - lisp KW - parallel AU - Queinnec, Christian UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.6613 ER -