Sciweavers

3616 search results - page 525 / 724
» Conditional Memory Ordering
Sort
View
LOPSTR
2005
Springer
15 years 8 months ago
Experiments in Context-Sensitive Analysis of Modular Programs
Abstract. Several models for context-sensitive analysis of modular programs have been proposed, each with different characteristics and representing different trade-offs. The ad...
Jesús Correas, Germán Puebla, Manuel...
FPGA
2004
ACM
119views FPGA» more  FPGA 2004»
15 years 8 months ago
A quantitative analysis of the speedup factors of FPGAs over processors
The speedup over a microprocessor that can be achieved by implementing some programs on an FPGA has been extensively reported. This paper presents an analysis, both quantitative a...
Zhi Guo, Walid A. Najjar, Frank Vahid, Kees A. Vis...
SIGMETRICS
2010
ACM
201views Hardware» more  SIGMETRICS 2010»
15 years 7 months ago
Transparent, lightweight application execution replay on commodity multiprocessor operating systems
We present S, the first system to provide transparent, lowoverhead application record-replay and the ability to go live from replayed execution. S i...
Oren Laadan, Nicolas Viennot, Jason Nieh
CODES
2009
IEEE
15 years 7 months ago
MinDeg: a performance-guided replacement policy for run-time reconfigurable accelerators
Reconfigurable Processors utilize a reconfigurable fabric (to implement application-specific accelerators) and may perform runtime reconfigurations to exchange the set of deployed...
Lars Bauer, Muhammad Shafique, Jörg Henkel
VLDB
1997
ACM
134views Database» more  VLDB 1997»
15 years 7 months ago
Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations
R-tree based spatial join is useful because of both its superior performance and the wide spread implementation of R-trees. We present a new R-tree join method called BFRJ (Breadt...
Yun-Wu Huang, Ning Jing, Elke A. Rundensteiner