Sciweavers

4747 search results - page 153 / 950
» Shuffle Memory System
Sort
View
ICECCS
2007
IEEE
82views Hardware» more  ICECCS 2007»
15 years 8 months ago
Formalising Flash Memory: First Steps
We present first steps in the construction of formal models of NAND Flash memory, based on a recently emerged open standard for such devices. The model is at a level of abstracti...
Andrew Butterfield, Jim Woodcock
PPOPP
2009
ACM
16 years 2 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
139
Voted
PODS
2005
ACM
164views Database» more  PODS 2005»
16 years 1 months ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
15 years 8 months ago
Soft memory for stock market analysis using linear and developmental genetic programming
Recently, a form of memory usage was introduced for genetic programming (GP) called “soft memory.” Rather than have a new value completely overwrite the old value in a registe...
Garnett Carl Wilson, Wolfgang Banzhaf
ISCA
2006
IEEE
144views Hardware» more  ISCA 2006»
15 years 1 months ago
Conditional Memory Ordering
Conventional relaxed memory ordering techniques follow a proactive model: at a synchronization point, a processor makes its own updates to memory available to other processors by ...
Christoph von Praun, Harold W. Cain, Jong-Deok Cho...