Sciweavers

2703 search results - page 195 / 541
» Optimizing memory transactions
Sort
View
131
Voted
IJCAI
2007
15 years 4 months ago
An Information-Theoretic Analysis of Memory Bounds in a Distributed Resource Allocation Mechanism
Multiagent distributed resource allocation requires that agents act on limited, localized information with minimum communication overhead in order to optimize the distribution of ...
Ricardo M. Araujo, Luís C. Lamb
132
Voted
ISCA
2006
IEEE
92views Hardware» more  ISCA 2006»
15 years 2 months ago
Quantum Memory Hierarchies: Efficient Designs to Match Available Parallelism in Quantum Computing
The assumption of maximum parallelism support for the successful realization of scalable quantum computers has led to homogeneous, "sea-of-qubits" architectures. The res...
Darshan D. Thaker, Tzvetan S. Metodi, Andrew W. Cr...
MST
2002
169views more  MST 2002»
15 years 2 months ago
Bulk Synchronous Parallel Algorithms for the External Memory Model
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
Frank K. H. A. Dehne, Wolfgang Dittrich, David A. ...
124
Voted
CASES
2010
ACM
15 years 19 days ago
Fine-grain dynamic instruction placement for L0 scratch-pad memory
We present a fine-grain dynamic instruction placement algorithm for small L0 scratch-pad memories (spms), whose unit of transfer can be an individual instruction. Our algorithm ca...
JongSoo Park, James D. Balfour, William J. Dally
154
Voted
DATE
2010
IEEE
197views Hardware» more  DATE 2010»
14 years 9 months ago
Compilation of stream programs for multicore processors that incorporate scratchpad memories
The stream processing characteristics of many embedded system applications in multimedia and networking domains have led to the advent of stream based programming formats. Several ...
Weijia Che, Amrit Panda, Karam S. Chatha