2208 search results - page 97 / 442 » Memory Practices in the Sciences |
TALG
2008
14 years 9 months ago
2008
The Fibonacci heap was devised to provide an especially efficient implementation of Dijkstra's shortest path algorithm. Although asyptotically efficient, it is not as fast in...
SIGMETRICS
2005
ACM
15 years 3 months ago
2005
ACM
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...
108
click to vote
CAV
2004
Springer
15 years 1 months ago
2004
Springer
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
KBSE
2007
IEEE
15 years 4 months ago
2007
IEEE
Programs written in languages that provide direct access to memory through pointers often contain memory-related faults, which may cause non-deterministic failures and even securi...
ESA
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...