2703 search results - page 376 / 541 » Optimizing memory transactions |
192
click to vote
SC
2005
ACM
16 years 15 days ago
2005
ACM
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadth...
170
Voted
LCTRTS
2005
Springer
16 years 13 days ago
2005
Springer
Knuth’s buddy system is an attractive algorithm for managing storage allocation, and it can be made to operate in real-time. At some point, storage-management systems must eithe...
209
Voted
STACS
2005
Springer
16 years 13 days ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
189
click to vote
JSSPP
2004
Springer
16 years 9 days ago
2004
Springer
Job scheduling typically focuses on the CPU with little work existing to include I/O or memory. Time-shared execution provides the chance to hide I/O and long-communication latenc...
201
click to vote
PARA
2004
Springer
16 years 9 days ago
2004
Springer
During the last half-decade, a number of research efforts have centered around developing software for generating automatically tuned matrix multiplication kernels. These include ...