874 search results - page 87 / 175 » Predicting the Running Times of Parallel Programs by Simulat... |
SIAMDM
2002
14 years 9 months ago
2002
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
EMSOFT
2007
Springer
15 years 4 months ago
2007
Springer
Most recent embedded systems use caches to improve their average performance. Current timing analyses are able to compute safe timing guarantees for these systems, if tasks are ru...
HPCC
2009
Springer
15 years 2 months ago
2009
Springer
Compared with lock-based synchronization techniques, Software Transactional Memory (STM) can significantly improve the programmability of multithreaded applications. Existing res...
HPCA
2005
IEEE
15 years 10 months ago
2005
IEEE
Most programs are repetitive, where similar behavior can be seen at different execution times. Proposed on-line systems automatically group these similar intervals of execution in...
121
click to vote
PPSN
1994
Springer
15 years 1 months ago
1994
Springer
We present the Genetic L-System Programming (GLP) paradigm for evolutionary creation and development of parallel rewrite systems (Lsystems, Lindenmayer-systems) which provide a com...