Sciweavers

2555 search results - page 72 / 511
» Quantifiers and Working Memory
Sort
View
LCPC
2005
Springer
15 years 3 months ago
Applying Data Copy to Improve Memory Performance of General Array Computations
Abstract. Data copy is an important compiler optimization which dynamically rearranges the layout of arrays by copying their elements into local buffers. Traditionally, array copy...
Qing Yi
ICPPW
2000
IEEE
15 years 2 months ago
Flits: Pervasive Computing for Processor and Memory Constrained Systems
Many pervasive computing software technologies are targeted for 32-bit desktop platforms. However, there are innumerable 8, 16, and 32-bit microcontroller and microprocessor-based...
William Majurski, Alden Dima, Mary Laamanen
IAJIT
2011
14 years 5 months ago
Blocked-based sparse matrix-vector multiplication on distributed memory parallel computers
: The present paper discusses the implementations of sparse matrix-vector products, which are crucial for high performance solutions of large-scale linear equations, on a PC-Cluste...
Rukhsana Shahnaz, Anila Usman
SIGMETRICS
2005
ACM
120views Hardware» more  SIGMETRICS 2005»
15 years 3 months ago
Automatic measurement of memory hierarchy parameters
The running time of many applications is dominated by the cost of memory operations. To optimize such applications for a given platform, it is necessary to have a detailed knowled...
Kamen Yotov, Keshav Pingali, Paul Stodghill
CIKM
2009
Springer
15 years 2 months ago
iMecho: an associative memory based desktop search system
Traditional desktop search engines only support keyword based search that needs exact keyword matching to find resources. However, users generally have a vague picture of what is...
Jidong Chen, Hang Guo, Wentao Wu, Wei Wang 0009