314 search results - page 13 / 63 » Reducing Parallel Overheads Through Dynamic Serialization |
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
Data flow and FSMs are used intensively to specify real-time systems in the field of mechatronics. Their implementation in FPGAs is discussed against the background of dynamic rec...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
A general approach to achieve anonymity on P2P networks is to construct an indirect path between client and server for each data transfer. The indirection, together with randomnes...
HIPC
2009
Springer
13 years 5 months ago
2009
Springer
Large scale compute clusters continue to grow to ever-increasing proportions. However, as clusters and applications continue to grow, the Mean Time Between Failures (MTBF) has redu...
ASPLOS
2011
ACM
12 years 11 months ago
2011
ACM
The power-efficient massively parallel Graphics Processing Units (GPUs) have become increasingly influential for scientific computing over the past few years. However, their ef...
CGO
2003
IEEE
14 years 24 days ago
2003
IEEE
Modern processors perform dynamic scheduling to achieve better utilization of execution resources. A schedule created at run-time is often better than one created at compile-time ...