Sciweavers

3202 search results - page 364 / 641
» Memory access scheduling
Sort
View
AAAI
2006
15 years 8 months ago
Domain-Independent Structured Duplicate Detection
The scalability of graph-search algorithms can be greatly extended by using external memory, such as disk, to store generated nodes. We consider structured duplicate detection, an...
Rong Zhou, Eric A. Hansen
ALENEX
2003
144views Algorithms» more  ALENEX 2003»
15 years 8 months ago
Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries
Ongoing changes in computer performance are affecting the efficiency of string sorting algorithms. The size of main memory in typical computers continues to grow, but memory acce...
Ranjan Sinha, Justin Zobel
SNPD
2003
15 years 8 months ago
Incomplete Information Processing for Optimization of Distributed Applications
This paper focuses on non-strict processing, optimization, and partial evaluation of MPI programs which use incremental data structures (ISs). We describe the design and implement...
Alfredo Cristóbal-Salas, Andrei Tchernykh, ...
IBMRD
2006
63views more  IBMRD 2006»
15 years 6 months 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
IJIM
2007
84views more  IJIM 2007»
15 years 6 months ago
Mobile e-learning course scenario model on PDA
: Web-based services mobile learning can enable collaborative learning and access to different information sources in actual problem-solving situations. The PDA’s are now designe...
Jeanne Schreurs