Sciweavers

3202 search results - page 249 / 641
» Memory access scheduling
Sort
View
VLSID
2002
IEEE
142views VLSI» more  VLSID 2002»
16 years 7 months ago
Address Code and Arithmetic Optimizations for Embedded Systems
An important class of problems used widely in both the embedded systems and scientific domains perform memory intensive computations on large data sets. These data sets get to be ...
J. Ramanujam, Satish Krishnamurthy, Jinpyo Hong, M...
CIKM
2004
Springer
15 years 10 months ago
Energy management schemes for memory-resident database systems
With the tremendous growth of system memories, memoryresident databases are increasingly becoming important in various domains. Newer memories provide a structured way of storing ...
Jayaprakash Pisharath, Alok N. Choudhary, Mahmut T...
ICS
2009
Tsinghua U.
16 years 1 months ago
Cancellation of loads that return zero using zero-value caches
The speed gap between processor and memory continues to limit performance. To address this problem, we explore the potential of eliminating Zero Loads—loads accessing memory loc...
Md. Mafijul Islam, Sally A. McKee, Per Stenstr&oum...
GLOBECOM
2007
IEEE
16 years 27 days ago
Parallel Search Trie-Based Scheme for Fast IP Lookup
—As data rates in the Internet increase, the Internet Protocol (IP) address lookup is required to be resolved in shorter resolution times. IP address lookup involves finding the...
Roberto Rojas-Cessa, Lakshmi Ramesh, Ziqian Dong, ...
IPPS
2006
IEEE
16 years 18 days ago
A segment-based DSM supporting large shared object space
This paper introduces a software DSM that can extend its shared object space exceeding 4GB in a 32bit commodity cluster environment. This is achieved through the dynamic memory ma...
Benny Wang-Leung Cheung, Cho-Li Wang