Sciweavers

4747 search results - page 205 / 950
» Shuffle Memory System
Sort
View
IPPS
2005
IEEE
15 years 7 months ago
A Cost-Effective Main Memory Organization for Future Servers
Today, the amount of main memory in mid-range servers is pushing practical limits with as much as 192 GB memory in a 24 processor system [21]. Further, with the onset of multi-thr...
Magnus Ekman, Per Stenström
SPAA
2005
ACM
15 years 7 months ago
Efficient algorithms for verifying memory consistency
One approach in verifying the correctness of a multiprocessor system is to show that its execution results comply with the memory consistency model it is meant to implement. It ha...
Chaiyasit Manovit, Sudheendra Hangal
ASPLOS
1996
ACM
15 years 6 months ago
Reducing Network Latency Using Subpages in a Global Memory Environment
New high-speed networks greatly encourage the use of network memory as a cache for virtual memory and file pages, thereby reducing the need for disk access. Becausepages are the f...
Hervé A. Jamrozik, Michael J. Feeley, Geoff...
CODES
2004
IEEE
15 years 5 months ago
Efficient exploration of on-chip bus architectures and memory allocation
Separation between computation and communication in system design allows the system designer to explore the communication architecture independently of component selection and map...
Sungchan Kim, Chaeseok Im, Soonhoi Ha
WDAG
1995
Springer
102views Algorithms» more  WDAG 1995»
15 years 5 months ago
Larchant-RDOSS: a Distributed Shared Persistent Memory and its Garbage Collector
Larchant-RDOSS is a distributed shared memory that persists on reliable storage across process lifetimes. Memory management is automatic: including consistent caching of data and ...
Marc Shapiro, Paulo Ferreira