96 search results - page 9 / 20 » Executing task graphs using work-stealing |
IAT
2005
IEEE
14 years 1 months ago
2005
IEEE
We are interested by contributing to stochastic problems of which the main distinction is that some tasks may create other tasks. In particular, we present a first approach which...
IPL
2010
13 years 6 months ago
2010
The Floyd-Warshall algorithm is a simple and widely used algorithm to compute shortest paths between all pairs of vertices in an edge weighted directed graph. It can also be used ...
SIGSOFT
2007
ACM
14 years 8 months ago
2007
ACM
Because of the growing complexity of wireless sensor network applications (WSNs), traditional software development tools are being developed that are specifically designed for the...
CLUSTER
2006
IEEE
13 years 7 months ago
2006
IEEE
Application scheduling plays an important role in high-performance cluster computing. Application scheduling can be classified as job scheduling and task scheduling. This paper pre...
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
This paper presents an exploration algorithm which examines execution time and energy consumption of a given application, while considering a parameterized memory architecture. Th...