357 search results - page 6 / 72 » Analysis of Transposition-Table-Driven Work Scheduling in Di... |
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper, we propose a methodology for developing component-based real-time systems based on the concept of hierarchical scheduling. Recently, much work has been devoted to t...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
— Schedule synthesis based on reachability analysis of timed automata has received attention in the last few years. The main strength of this approach is that the expressiveness ...
PDP
2010
IEEE
14 years 2 months ago
2010
IEEE
Abstract—This paper proposes a strategy to organize metricspace query processing in multi-core search nodes as understood in the context of search engines running on clusters of ...
KBS
2007
13 years 7 months ago
2007
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
HPDC
2007
IEEE
14 years 1 months ago
2007
IEEE
Utility functions can be used to represent the value users attach to job completion as a function of turnaround time. Most previous scheduling research used simple synthetic repre...