Sciweavers

183 search results - page 36 / 37
» A case for multi-level main memory
Sort
View
HPCA
1998
IEEE
13 years 9 months ago
FPGA Based Custom Computing Machines for Irregular Problems
Over the past few years there has been increased interest in building custom computing machines (CCMs) as a way of achieving very high performance on specific problems. The advent...
David Abramson, Paul Logothetis, Adam Postula, Mar...
STACS
1992
Springer
13 years 9 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
ASPLOS
2008
ACM
13 years 7 months ago
General and efficient locking without blocking
Standard concurrency control mechanisms offer a trade-off: Transactional memory approaches maximize concurrency, but suffer high overheads and cost for retrying in the case of act...
Yannis Smaragdakis, Anthony Kay, Reimer Behrends, ...
DEBS
2008
ACM
13 years 7 months ago
Top-k/w publish/subscribe: finding k most relevant publications in sliding time window w
Existing content-based publish/subscribe systems are designed assuming that all matching publications are equally relevant to a subscription. As we cannot know in advance the dist...
Kresimir Pripuzic, Ivana Podnar Zarko, Karl Aberer
CN
2002
82views more  CN 2002»
13 years 5 months ago
Optimal allocation of electronic content
Abstract-The delivery of large files to single users, such as application programs for some versions of the envisioned network computer, or movies, is expected by many to be one of...
Israel Cidon, Shay Kutten, Ran Soffer