1534 search results - page 161 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
127
Voted
ICPP
1998
IEEE
15 years 5 months ago
1998
IEEE
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...
113
Voted
DC
2008
15 years 27 days ago
2008
Fast algorithms are presented for performing computations in a probabilistic population model. This is a variant of the standard population protocol model--in which finite-state ag...
141
Voted
GCA
2009
14 years 10 months ago
2009
In this article a new algorithm for grid resource allocation based upon the theory of Algorithmic Mechanism Design (AMD) is presented. This algorithm is targeted at minimizing cost...
NOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract— In this paper, we discuss a real-time on-chip communication service with a priority-based wormhole switching policy. A novel off-line schedulability analysis approach i...
97
Voted
ICS
2004
Tsinghua U.
15 years 6 months ago
2004
Tsinghua U.
In contemporary out-of-order superscalar design, high IPC is mainly achieved by exposing high instruction level parallelism (ILP). Scaling issue window size can certainly provide ...