Sciweavers

2609 search results - page 485 / 522
» Optimizing for parallelism and data locality
Sort
View
91
Voted
LOPSTR
2004
Springer
15 years 3 months ago
Determinacy Analysis for Logic Programs Using Mode and Type Information
We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (...
Pedro López-García, Francisco Bueno,...
LCPC
1998
Springer
15 years 2 months ago
Compiling for SIMD Within a Register
Although SIMD (Single Instruction stream Multiple Data stream) parallel computers have existed for decades, it is only in the past few years that a new version of SIMD has evolved...
Randall J. Fisher, Henry G. Dietz
LICS
1997
IEEE
15 years 1 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
VLDB
1991
ACM
146views Database» more  VLDB 1991»
15 years 1 months ago
An Evaluation of Non-Equijoin Algorithms
A non-equijoin of relations R and S is a band join if the join predicate requires values in the join attribute of R to fall within a speci ed band about the values in the join att...
David J. DeWitt, Jeffrey F. Naughton, Donovan A. S...
AIPR
2008
IEEE
15 years 3 days ago
Low-cost, high-speed computer vision using NVIDIA's CUDA architecture
In this paper, we introduce real time image processing techniques using modern programmable Graphic Processing Units (GPU). GPUs are SIMD (Single Instruction, Multiple Data) device...
Seung In Park, Sean P. Ponce, Jing Huang, Yong Cao...