279 search results - page 5 / 56 » Low Overhead Parallel Schedules for Task Graphs |
DAC
1996
ACM
13 years 12 months ago
1996
ACM
Abstract: Introspection, a zero-overhead binding technique during self-diagnosing microarchitecture synthesis is presented. Given a scheduled control data ow graph (CDFG) introspec...
ICDCS
2003
IEEE
14 years 1 months ago
2003
IEEE
Mobile code carried by a mobile agent can automatically travel to several data sources in order to complete a designated program. Traditionally, most mobile agent systems [7][8][1...
IWOMP
2007
Springer
14 years 1 months ago
2007
Springer
OpenMP is widely used for shared memory parallel programming and is especially useful for the parallelisation of loops. When it comes to task parallelism, however, OpenMP is less p...
PDP
2010
IEEE
14 years 18 hour ago
2010
IEEE
Scheduling large amounts of tasks in distributed computing platforms composed of millions of nodes is a challenging goal, even more in a fully decentralized way and with low overhe...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...