874 search results - page 43 / 175 » Predicting the Running Times of Parallel Programs by Simulat... |
235
click to vote
HPCA
2004
IEEE
16 years 6 months ago
2004
IEEE
Recent research suggests that there are large variations in a cache's spatial usage, both within and across programs. Unfortunately, conventional caches typically employ fixe...
181
click to vote
ISCA
2009
IEEE
16 years 18 days ago
2009
IEEE
With the shift towards chip multiprocessors (CMPs), exploiting and managing parallelism has become a central problem in computer systems. Many issues of parallelism management boi...
160
click to vote
LCPC
2004
Springer
15 years 11 months ago
2004
Springer
Previous work shows the possibility of predicting the cache miss rate (CMR) for all inputs of a program. However, most optimization techniques need to know more than the miss rate ...
157
click to vote
ISORC
2007
IEEE
16 years 7 days ago
2007
IEEE
This paper describes an extension to the componentbased programming model to support real-time dynamic guarantee for distributed applications. The extended model aims to include a...
186
click to vote
IFIP
1998
Springer
15 years 10 months ago
1998
Springer
This paper presents a hybrid approach to automatic parallelization of computer programs which combines static extraction of threads (tasks) with dynamic scheduling for parallel an...