779 search results - page 68 / 156 » A Simple Program Transformation for Parallelism |
120
click to vote
ADBIS
1995
Springer
15 years 8 months ago
1995
Springer
It is by now folklore that the bottom-up evaluation of a program after the “magic set” transformation is “as efficient as” top-down evaluation. There are a number of forma...
144
click to vote
USENIX
2001
15 years 6 months ago
2001
Multiple threads running in a single, shared address space is a simple model for writing parallel programs for symmetric multiprocessor (SMP) machines and for overlapping I/O and ...
121
Voted
CSR
2009
Springer
15 years 11 months ago
2009
Springer
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
110
click to vote
GI
2009
Springer
15 years 9 months ago
2009
Springer
: In this paper we present the concurrent constraint functional programming CCFL and an abstract machine for the evaluation of CCFL programs in a multicore environment. The source ...
129
click to vote
SCCC
1998
IEEE
15 years 9 months ago
1998
IEEE
The last few years have seen a renewal of interest in the consideration of dynamic programming in compiler technology. This is due to the compactness of the representations, which...