111 search results - page 15 / 23 » Algebraic Effects, Linearity, and Quantum Programming Langua... |
IPPS
2007
IEEE
15 years 5 months ago
2007
IEEE
The excessive complexity of both machine architectures and applications have made it difficult for compilers to statically model and predict application behavior. This observatio...
103
click to vote
CASES
2003
ACM
15 years 3 months ago
2003
ACM
Bank locality can be defined as localizing the number of load/store accesses to a small set of memory banks at a given time. An optimizing compiler can modify a given input code t...
ICALP
2004
Springer
15 years 4 months ago
2004
Springer
Abstract We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we p...
164
click to vote
CP
2009
Springer
15 years 11 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
ASPLOS
1992
ACM
15 years 2 months ago
1992
ACM
: In scalable parallel machines, processors can make local memory accesses much faster than they can make remote memory accesses. In addition, when a number of remote accesses must...