1257 search results - page 116 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
VLSID
2005
IEEE
16 years 2 months ago
2005
IEEE
Timing margin (slack) needs to be carefully managed to ensure a satisfactory timing yield. We propose a new design flow that combines a false-path-aware gate sizing and a statisti...
JSSPP
2009
Springer
15 years 8 months ago
2009
Springer
Scheduling a task graph onto several processors is a trade-off between maximising concurrency and minimising interprocessor communication. A technique to reduce or avoid interproc...
112
Voted
APPT
2007
Springer
15 years 7 months ago
2007
Springer
It is a great challenge to map network processing tasks to processing resources of advanced network processors, which are heterogeneous and multi-threading multiprocessor System-on...
123
click to vote
IPPS
2005
IEEE
15 years 7 months ago
2005
IEEE
We propose a cluster-based web server where a few computing nodes are separately reserved for high-performance computing applications, such as multimedia, SSL, and CGI. As an exam...
101
click to vote
STOC
2002
ACM
16 years 2 months ago
2002
ACM
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...