Sciweavers

4747 search results - page 242 / 950
» Shuffle Memory System
Sort
View
CONNECTION
2006
101views more  CONNECTION 2006»
15 years 4 months ago
High capacity, small world associative memory models
Models of associative memory usually have full connectivity or if diluted, random symmetric connectivity. In contrast, biological neural systems have predominantly local, non-symm...
Neil Davey, Lee Calcraft, Rod Adams
ETFA
2006
IEEE
15 years 10 months ago
Memory-Aware Feedback Scheduling of Control Tasks
This paper presents the incorporation of an auto-tuning real-time garbage collector into a feedback-based on-line scheduling system. The studied feedback scheduler is designed to ...
Sven Gestegard Robertz, Dan Henriksson, Anton Cerv...
124
Voted
WDAG
2005
Springer
82views Algorithms» more  WDAG 2005»
15 years 10 months ago
Distributed Transactional Memory for Metric-Space Networks
Transactional Memory is a concurrent programming API in which concurrent threads synchronize via transactions (instead of locks). Although this model has mostly been studied in the...
Maurice Herlihy, Ye Sun
IPPS
1998
IEEE
15 years 8 months ago
Managing Concurrent Access for Shared Memory Active Messages
Passing messages through shared memory plays an important role on symmetric multiprocessors and on Clumps. The management of concurrent access to message queues is an important as...
Steven Lumetta, David E. Culler
ICDCS
1996
IEEE
15 years 8 months ago
Larchant: Persistence by Reachability in Distributed Shared Memory Through Garbage Collection
We consider a shared store based on distributed shared memory (DSM), supporting persistence by reachability (PBR), a very simple data sharing model for a distributed system. This ...
Paulo Ferreira, Marc Shapiro