Sciweavers

2035 search results - page 95 / 407
» Working memory
Sort
View
SIGMETRICS
2010
ACM
213views Hardware» more  SIGMETRICS 2010»
15 years 8 months ago
Small subset queries and bloom filters using ternary associative memories, with applications
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...
Ashish Goel, Pankaj Gupta
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 7 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
FMCAD
2004
Springer
15 years 7 months ago
Memory Efficient All-Solutions SAT Solver and Its Application for Reachability Analysis
This work presents a memory-efficient All-SAT engine which, given a propositional formula over sets of important and non-important variables, returns the set of all the assignments...
Orna Grumberg, Assaf Schuster, Avi Yadgar
HIPEAC
2010
Springer
15 years 5 months ago
Improving Performance by Reducing Aborts in Hardware Transactional Memory
The optimistic nature of Transactional Memory (TM) systems can lead to the concurrent execution of transactions that are later found to conflict. Conflicts degrade scalability, a...
Mohammad Ansari, Behram Khan, Mikel Luján, ...
ISI
2006
Springer
15 years 3 months ago
Entity Workspace: An Evidence File That Aids Memory, Inference, and Reading
An intelligence analyst often needs to keep track of more facts than can be held in human memory. As a result, analysts use a notebook or evidence file to record facts learned so f...
Eric A. Bier, Edward W. Ishak, Ed Chi