1043 search results - page 26 / 209 » Reading, Writing and Relations |
116
Voted
OOPSLA
1992
Springer
15 years 8 months ago
1992
Springer
Generational garbage collectors are able to achieve very small pause times by concentrating on the youngest (most recently allocated) objects when collecting, since objects have b...
129
click to vote
DATE
2008
IEEE
15 years 11 months ago
2008
IEEE
The following study shows a direct comparison of memory write policies in Shared Memory Multicore Systems. Although there are much work and many studies about this issue, our work...
134
click to vote
PPL
2007
15 years 4 months ago
2007
ract problem of using P failure-prone processors to cooperatively update all locations of an N-element shared array is called Write-All. Solutions to Write-All can be used iterati...
138
click to vote
CHI
1998
ACM
15 years 8 months ago
1998
ACM
Reading frequently involves not just looking at words on a page, but also underlining, highlighting and commenting, either on the text or in a separate notebook. This combination ...
138
click to vote
HPCA
1999
IEEE
15 years 8 months ago
1999
IEEE
Cache coherence protocols of current shared-memory multiprocessors are difficult to verify. Our previous work proposed an extension of Lamport's logical clocks for showing th...