Sciweavers

3202 search results - page 163 / 641
» Memory access scheduling
Sort
View
DAMON
2007
Springer
15 years 11 months ago
The five-minute rule twenty years later, and how flash memory changes the rules
In 1987, Gray and Putzolo presented the five-minute rule, which was reviewed and renewed ten years later in 1997. With the advent of flash memory in the gap between traditional RA...
Goetz Graefe
CW
2005
IEEE
15 years 6 months ago
Semantic Memory for Avatars in Cyberspace
Avatars that show intelligent behavior should have an access to general knowledge about the world, knowledge that humans store in their semantic memories. The simplest knowledge r...
Julian Szymanski, Tomasz Sarnatowicz, Wlodzislaw D...
CCGRID
2005
IEEE
15 years 10 months ago
Empirical evaluation of shared parallel execution on independently scheduled clusters
Parallel machines are typically space shared, or time shared such that only one application executes on a group of nodes at any given time. It is generally assumed that executing ...
M. Ghanesh, S. Kumar, Jaspal Subhlok
147
Voted
SPAA
1995
ACM
15 years 8 months ago
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias
DATE
2009
IEEE
135views Hardware» more  DATE 2009»
15 years 11 months ago
System-level hardware-based protection of memories against soft-errors
We present a hardware-based approach to improve the resilience of a computer system against the errors occurred in the main memory with the help of error detecting and correcting ...
Valentin Gherman, Samuel Evain, Mickael Cartron, N...