Sciweavers

2477 search results - page 128 / 496
» Parallelizing Functional Programs by Generalization
Sort
View
PPOPP
2012
ACM
13 years 10 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
DASFAA
2010
IEEE
179views Database» more  DASFAA 2010»
15 years 9 months ago
Scalable Splitting of Massive Data Streams
Scalable execution of continuous queries over massive data streams often requires splitting input streams into parallel sub-streams over which query operators are executed in paral...
Erik Zeitler, Tore Risch
POPL
2007
ACM
16 years 2 months ago
Scrap your boilerplate with XPath-like combinators
XML programming involves idioms for expressing `structure shyness' such as the descendant axis of XPath or the default templates of XSLT. We initiate a discussion of the rela...
Ralf Lämmel
IFL
2001
Springer
146views Formal Methods» more  IFL 2001»
15 years 7 months ago
Optimizations on Array Skeletons in a Shared Memory Environment
Map- and fold-like skeletons are a suitable abstractions to guide parallel program execution in functional array processing. However, when it comes to achieving high performance, i...
Clemens Grelck
158
Voted
LANMR
2004
15 years 3 months ago
New Semantics for Hybrid Probabilistic Programs
Hybrid probabilistic programs framework [5] is a variation of probabilistic annotated logic programming approach, which allows the user to explicitly encode the available knowledge...
Emad Saad