1024 search results - page 73 / 205 » High-Level Execution Time Analysis |
125
click to vote
SPAA
1996
ACM
15 years 7 months ago
1996
ACM
In this paper, we analyze the performance of parallel multithreaded algorithms that use dag-consistent distributed shared memory. Specifically, we analyze execution time, page fau...
135
Voted
RTS
2011
14 years 10 months ago
2011
—Preemptive scheduling often generates a significant runtime overhead that may increase task worst-case execution times up to 40%, with respect to a fully non preemptive executi...
127
click to vote
ECRTS
2010
IEEE
15 years 3 months ago
2010
IEEE
— The generalized multiframe (GMF) task has been proposed to model a task whose execution times, deadlines and minimum separation times are changed according to a specified patte...
149
click to vote
WCET
2010
15 years 1 months ago
2010
To take full advantage of the increasingly used shared-memory multicore architectures, software algorithms will need to be parallelized over multiple threads. This means that thre...
155
click to vote
EMSOFT
2004
Springer
15 years 8 months ago
2004
Springer
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...