Sciweavers

1929 search results - page 172 / 386
» Load Balancing with Memory
Sort
View
85
Voted
IBMRD
2006
63views more  IBMRD 2006»
15 years 23 days ago
Decomposing the load-store queue by function for power reduction and scalability
Because they are based on large content-addressable memories, load-store queues (LSQ) present implementation challenges in superscalar processors, especially as issue width and nu...
Lee Baugh, Craig B. Zilles
FCCM
2007
IEEE
129views VLSI» more  FCCM 2007»
15 years 7 months ago
Automatic On-chip Memory Minimization for Data Reuse
FPGA-based computing engines have become a promising option for the implementation of computationally intensive applications due to high flexibility and parallelism. However, one...
Qiang Liu, George A. Constantinides, Konstantinos ...
102
Voted
KDD
2010
ACM
222views Data Mining» more  KDD 2010»
15 years 2 months ago
Large linear classification when data cannot fit in memory
Recent advances in linear classification have shown that for applications such as document classification, the training can be extremely efficient. However, most of the existing t...
Hsiang-Fu Yu, Cho-Jui Hsieh, Kai-Wei Chang, Chih-J...
IEEEPACT
2009
IEEE
15 years 7 months ago
Architecture Support for Improving Bulk Memory Copying and Initialization Performance
—Bulk memory copying and initialization is one of the most ubiquitous operations performed in current computer systems by both user applications and Operating Systems. While many...
Xiaowei Jiang, Yan Solihin, Li Zhao, Ravishankar I...
97
Voted
IPPS
2000
IEEE
15 years 5 months ago
A Mechanism for Speculative Memory Accesses Following Synchronizing Operations
In order to reduce the overhead of synchronizing operations of shared memory multiprocessors, this paper proposes a mechanism, named specMEM, to execute memory accesses following ...
Takayuki Sato, Kazuhiko Ohno, Hiroshi Nakashima