96 search results - page 13 / 20 » Executing task graphs using work-stealing |
112
Voted
EMSOFT
2010
Springer
14 years 10 months ago
2010
Springer
We propose the first polynomial-time code selection algorithm for minimising the worst-case execution time of a nonnested loop executed on a fully pipelined processor that uses sc...
100
Voted
AGTIVE
1999
Springer
15 years 4 months ago
1999
Springer
A suitable software architecture –for example in the area of distributed application– can be composed of known-to-work solutions. These are also known as design patterns. Howev...
109
Voted
AAAI
2011
14 years 10 days ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
87
Voted
ESCIENCE
2007
IEEE
15 years 6 months ago
2007
IEEE
Effective scheduling is a key concern for the execution of performance driven Grid applications. In this paper, we propose a Dynamic Critical Path (DCP) based workflow scheduling ...
82
Voted
IPPS
2000
IEEE
15 years 4 months ago
2000
IEEE
This paper examines the task of constructing boundedtime self-stabilizing rule-based systems that take their input from an external environment. Bounded response-time and self-sta...