720 search results - page 38 / 144 » Broadcast scheduling: algorithms and complexity |
176
click to vote
IJFCS
2006
15 years 6 months ago
2006
In this paper we present an efficient algorithm for compile-time scheduling and clustering of parallel programs onto parallel processing systems with distributed memory, which is ...
146
click to vote
AIM
2004
15 years 5 months ago
2004
Satellite domains are becoming a fashionable area of research within the AI community due to the complexity of the problems that these domains need to solve. With the current US a...
168
click to vote
ICN
2005
Springer
15 years 11 months ago
2005
Springer
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
161
click to vote
HPCA
2004
IEEE
16 years 6 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...
151
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
This paper presents a multicore-cache model that reflects the reality that multicore processors have both per-processor private (L1) caches and a large shared (L2) cache on chip. ...