Sciweavers

3202 search results - page 347 / 641
» Memory access scheduling
Sort
View
CIKM
2009
Springer
15 years 10 months ago
Suffix trees for very large genomic sequences
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
PODC
2010
ACM
15 years 10 months ago
Transactional predication: high-performance concurrent sets and maps for STM
Concurrent collection classes are widely used in multi-threaded programming, but they provide atomicity only for a fixed set of operations. Software transactional memory (STM) pr...
Nathan Grasso Bronson, Jared Casper, Hassan Chafi,...
CLUSTER
2004
IEEE
15 years 10 months ago
JuxtaView - a tool for interactive visualization of large imagery on scalable tiled displays
JuxtaView is a cluster-based application for viewing ultra-high-resolution images on scalable tiled displays. We present in JuxtaView, a new parallel computing and distributed mem...
Naveen K. Krishnaprasad, Venkatram Vishwanath, Sha...
SIGARCH
2008
144views more  SIGARCH 2008»
15 years 6 months ago
A stream chip-multiprocessor for bioinformatics
- Bioinformatics applications such as gene and protein sequence matching algorithms are characterized by the need to process large amounts of data. While uni-processor performance ...
Ravi Kiran Karanam, Arun Ravindran, Arindam Mukher...
PC
1998
101views Management» more  PC 1998»
15 years 6 months ago
Performing Out-of Core FFTs on Parallel Disk Systems
The Fast Fourier Transform (FFT) plays a key role in many areas of computational science and engineering. Although most one-dimensional FFT problems canbe entirely solvedentirely ...
Thomas H. Cormen, David M. Nicol