Sciweavers

3202 search results - page 575 / 641
» Memory access scheduling
Sort
View
DAMON
2009
Springer
13 years 9 months ago
k-ary search on modern processors
This paper presents novel tree-based search algorithms that exploit the SIMD instructions found in virtually all modern processors. The algorithms are a natural extension of binar...
Benjamin Schlegel, Rainer Gemulla, Wolfgang Lehner
CPHYSICS
2008
86views more  CPHYSICS 2008»
13 years 8 months ago
On ERI sorting for SIMD execution of large-scale Hartree-Fock SCF
Given the resurgent attractiveness of single-instruction-multiple-data (SIMD) processing, it is important for high-performance computing applications to be SIMD-capable. The Hartr...
Tirath Ramdas, Gregory K. Egan, David Abramson, Ki...
ENTCS
2008
132views more  ENTCS 2008»
13 years 8 months ago
Distributed Verification of Multi-threaded C++ Programs
Verification of multi-threaded C++ programs poses three major challenges: the large number of states, states with huge sizes, and time intensive expansions of states. This paper p...
Stefan Edelkamp, Shahid Jabbar, Damian Sulewski
IEEESP
2008
89views more  IEEESP 2008»
13 years 8 months ago
Virtual Machine Introspection: Observation or Interference?
hardware, eliminating an abstraction layer and often improving efficiency as a result. Examples of type 1 systems include VMware ESX,3 Xen (www. xensource.com/xen/xen/nfamily/virtu...
Kara L. Nance, Matt Bishop, Brian Hay
COMCOM
2006
98views more  COMCOM 2006»
13 years 7 months ago
High-speed IP address lookup using balanced multi-way trees
Rapid growth of the Internet traffic requires more bandwidth and high-speed packet processing in the Internet routers. As one of the major packet processing performed in routers, ...
Hyesook Lim, Wonjung Kim, Bomi Lee, Changhoon Yim