5183 search results - page 756 / 1037 » The Complexity of Distributions |
154
click to vote
MOBIHOC
2009
ACM
16 years 7 months ago
2009
ACM
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
162
click to vote
HPCA
2007
IEEE
16 years 7 months ago
2007
IEEE
With the advent of ubiquitous multi-core architectures, a major challenge is to simplify parallel programming. One way to tame one of the main sources of programming complexity, n...
185
click to vote
HPCA
2006
IEEE
16 years 7 months ago
2006
IEEE
Chip-multiprocessors are becoming the dominant vehicle for general-purpose processing, and parallel software will be needed to effectively utilize them. This parallel software is ...
154
click to vote
HPCA
2006
IEEE
16 years 7 months ago
2006
IEEE
Building processors with large instruction windows has been proposed as a mechanism for overcoming the memory wall, but finding a feasible and implementable design has been an elu...
173
click to vote
HPCA
2004
IEEE
16 years 7 months ago
2004
IEEE
Design of wakeup-free issue queues is becoming desirable due to the increasing complexity associated with broadcast-based instruction wakeup. The effectiveness of most wakeup-free...