Sciweavers

2756 search results - page 102 / 552
» Computation-Centric Memory Models
Sort
View
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
16 years 4 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
IJCNN
2007
IEEE
15 years 10 months ago
Incorporating Forgetting in a Category Learning Model
— We present a computational model of human category learning that learns the essential structures of the categories by forgetting information that is not useful for the given ta...
Yasuaki Sakamoto, Toshihiko Matsuka
SWAT
2000
Springer
97views Algorithms» more  SWAT 2000»
15 years 7 months ago
I/O-Space Trade-Offs
We define external memory (or I/O) models which capture space complexity and develop a general technique for deriving I/O-space trade-offs in these models from internal memory mode...
Lars Arge, Jakob Pagter
IPPS
2005
IEEE
15 years 9 months ago
Stream PRAM
Parallel random access memory, or PRAM, is a now venerable model of parallel computation that that still retains its usefulness for the design and analysis of parallel algorithms....
Darrell R. Ulm, Michael Scherger
SC
2005
ACM
15 years 9 months ago
Making Sequential Consistency Practical in Titanium
The memory consistency model in parallel programming controls the order in which operations performed by one thread may be observed by another. Language designers have been reluct...
Amir Kamil, Jimmy Su, Katherine A. Yelick