93 search results - page 18 / 19 » Transactional Memory: Architectural Support for Lock-Free Da... |
ISLPED
2004
ACM
14 years 29 days ago
2004
ACM
While set-associative caches incur fewer misses than directmapped caches, they typically have slower hit times and higher power consumption, when multiple tag and data banks are p...
PPOPP
1997
ACM
13 years 11 months ago
1997
ACM
Global addressing of shared data simplifies parallel programming and complements message passing models commonly found in distributed memory machines. A number of programming sys...
ISPASS
2003
IEEE
14 years 24 days ago
2003
IEEE
Emerging application domains such as interactive vision, animation, and multimedia collaboration display dynamic scalable parallelism, and high computational requirements, making ...
CIKM
2009
Springer
14 years 5 days ago
2009
Springer
In dynamic environments with frequent content updates, we require online full-text search that scales to large data collections and achieves low search latency. Several recent met...
ISPASS
2006
IEEE
14 years 1 months ago
2006
IEEE
Applications in Computer Networks often require high throughput access to large data structures for lookup and classification. Many advanced algorithms exist to speed these searc...