1534 search results - page 149 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
153
click to vote
WCET
2010
15 years 4 months ago
2010
Current worst-case execution time (WCET) analyses do not support programs using dynamic memory allocation. This is mainly due to the unpredictability of cache performance introduc...
165
click to vote
CASES
2009
ACM
15 years 3 months ago
2009
ACM
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
155
click to vote
SIROCCO
2000
15 years 7 months ago
2000
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...
216
click to vote
COMPSAC
2004
IEEE
15 years 9 months ago
2004
IEEE
Web services (WS) received significant attention recently because services can be searched, bound, and executed at runtime over the Internet. This paper proposes a dynamic reconfi...
193
Voted
TPDS
2008
15 years 6 months ago
2008
An ad hoc grid is a wireless heterogeneous computing environment without a fixed infrastructure. This study considers wireless devices that have different capabilities, have limite...