1792 search results - page 286 / 359 » Improved scheduling in rings |
102
click to vote
IEEEPACT
2005
IEEE
15 years 4 months ago
2005
IEEE
Hiding communication latency is an important optimization for parallel programs. Programmers or compilers achieve this by using non-blocking communication primitives and overlappi...
103
click to vote
MICRO
2005
IEEE
15 years 4 months ago
2005
IEEE
Conventional processors use a fully-associative store queue (SQ) to implement store-load forwarding. Associative search latency does not scale well to capacities and bandwidths re...
ASPDAC
2005
ACM
15 years 4 months ago
2005
ACM
– Reducing power consumption through high-level synthesis has attracted a growing interest from researchers due to its large potential for power reduction. In this work we study ...
SAC
2004
ACM
15 years 4 months ago
2004
ACM
The amount of data handled by real-time and embedded applications is increasing. Also, applications normally have constraints with respect to freshness and timeliness of the data ...
142
click to vote
CP
2004
Springer
15 years 4 months ago
2004
Springer
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...