Sciweavers

2186 search results - page 41 / 438
» Considering an Organization's Memory
Sort
View
SIAMCOMP
2000
118views more  SIAMCOMP 2000»
15 years 5 months ago
Constructive, Deterministic Implementation of Shared Memory on Meshes
This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with m polynomial in n, where each mesh node hosts a processor and a memory module. A...
Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn
TIT
1998
50views more  TIT 1998»
15 years 5 months ago
Memory-Universal Prediction of Stationary Random Processes
Abstract— We consider the problem of one-step-ahead prediction of a real-valued, stationary, strongly mixing random process fXig
Dharmendra S. Modha, Elias Masry
ISCA
2011
IEEE
333views Hardware» more  ISCA 2011»
14 years 9 months ago
The impact of memory subsystem resource sharing on datacenter applications
In this paper we study the impact of sharing memory resources on five Google datacenter applications: a web search engine, bigtable, content analyzer, image stitching, and protoc...
Lingjia Tang, Jason Mars, Neil Vachharajani, Rober...
VLDB
2002
ACM
141views Database» more  VLDB 2002»
16 years 6 months ago
Data page layouts for relational databases on deep memory hierarchies
Relational database systems have traditionally optimized for I/O performance and organized records sequentially on disk pages using the N-ary Storage Model (NSM) (a.k.a., slotted ...
Anastassia Ailamaki, David J. DeWitt, Mark D. Hill
EUROMICRO
1998
IEEE
15 years 10 months ago
The Latency Hiding Effectiveness of Decoupled Access/Execute Processors
Several studies have demonstrated that out-of-order execution processors may not be the most adequate organization for wide issue processors due to the increasing penalties that w...
Joan-Manuel Parcerisa, Antonio González