Sciweavers

2208 search results - page 312 / 442
» Memory Practices in the Sciences
Sort
View
CPHYSICS
2008
86views more  CPHYSICS 2008»
14 years 10 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...
ALMOB
2006
80views more  ALMOB 2006»
14 years 10 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel
JACM
2006
98views more  JACM 2006»
14 years 10 months ago
Distribution sort with randomized cycling
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
Jeffrey Scott Vitter, David A. Hutchinson
JPDC
2006
111views more  JPDC 2006»
14 years 10 months ago
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an...
Guojing Cong, David A. Bader
JSAC
2006
131views more  JSAC 2006»
14 years 10 months ago
On Dynamic Optimization of Packet Matching in High-Speed Firewalls
Abstract--Packet matching plays a critical role in the performance of many network devices and a tremendous amount of research has already been invested to come up with better opti...
Hazem Hamed, Adel El-Atawy, Ehab Al-Shaer