Sciweavers

449 search results - page 31 / 90
» Optimizing the use of GPU memory in applications with large ...
Sort
View
HPCA
2009
IEEE
14 years 9 months ago
PageNUCA: Selected policies for page-grain locality management in large shared chip-multiprocessor caches
As the last-level on-chip caches in chip-multiprocessors increase in size, the physical locality of on-chip data becomes important for delivering high performance. The non-uniform...
Mainak Chaudhuri
PSB
2003
13 years 10 months ago
MAP: Searching Large Genome Databases
A number of biological applications require comparison of large genome strings. Current techniques suffer from both disk I/O and computational cost because of extensive memory req...
Tamer Kahveci, Ambuj K. Singh
JSAC
2006
163views more  JSAC 2006»
13 years 8 months ago
Fast and Scalable Pattern Matching for Network Intrusion Detection Systems
High-speed packet content inspection and filtering devices rely on a fast multi-pattern matching algorithm which is used to detect predefined keywords or signatures in the packets....
Sarang Dharmapurikar, John W. Lockwood
DATE
2005
IEEE
146views Hardware» more  DATE 2005»
14 years 2 months ago
Nonuniform Banking for Reducing Memory Energy Consumption
Main memories can consume a large percentage of overall energy in many data-intensive embedded applications. The past research proposed and evaluated memory banking as a possible ...
Ozcan Ozturk, Mahmut T. Kandemir
STACS
2007
Springer
14 years 2 months ago
Small Space Representations for Metric Min-Sum k -Clustering and Their Applications
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
Artur Czumaj, Christian Sohler