3202 search results - page 104 / 641 » Memory access scheduling |
189
click to vote
GRID
2004
Springer
16 years 3 days ago
2004
Springer
— Time sharing between all the users of a Grid is a major issue in cluster and Grid integration. Classical Grid architecture involves a higher level scheduler which submits non o...
178
click to vote
ASPLOS
2010
ACM
16 years 1 months ago
2010
ACM
To make efficient use of CMPs with tens to hundreds of cores, it is often necessary to exploit fine-grain parallelism. However, managing tasks of a few thousand instructions is ...
182
Voted
INFOCOM
2003
IEEE
16 years 14 hour ago
2003
IEEE
— Input-queued switches are used extensively in the design of high-speed routers. As switch speeds and sizes increase, the design of the switch scheduler becomes a primary challe...
153
click to vote
ISPASS
2007
IEEE
16 years 1 months ago
2007
IEEE
—Although SIMD extensions are a cost effective way to exploit the data level parallelism present in most media applications, we will show that they had have a very limited memory...
163
click to vote
PPAM
2005
Springer
16 years 6 days ago
2005
Springer
This paper describes a checkpointing mechanism destined for Distributed Shared Memory (DSM) systems with speculative prefetching. Speculation is a general technique involving predi...