904 search results - page 79 / 181 » Scheduling task graphs optimally with A |
IEEEPACT
1998
IEEE
15 years 4 months ago
1998
IEEE
In order to achieve practical efficient execution on a parallel architecture, a knowledge of the data dependencies related to the application appears as the key point for building...
STOC
1990
ACM
15 years 3 months ago
1990
ACM
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
IJRR
2010
14 years 9 months ago
2010
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
DATE
2006
IEEE
15 years 6 months ago
2006
IEEE
This paper presents an efficient method to find the optimal intra-task voltage/frequency scheduling for single tasks in practical real-time systems using statistical workload in...
100
click to vote
CAAN
2006
Springer
15 years 3 months ago
2006
Springer
Gossiping is a communication primitive where each node of a network possesses a unique message that is to be communicated to all other nodes in the network. We study the gossiping ...