146 search results - page 27 / 30 » SAT-Based Complete Don't-Care Computation for Network Optimi... |
ISCA
2002
IEEE
13 years 7 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE
Tools for parallel systems today range from specification over debugging to performance analysis and more. Typically, they help the programmers of parallel algorithms from the ea...
NSDI
2004
13 years 8 months ago
2004
Reducing management costs and improving the availability of large-scale distributed systems require automatic replica regeneration, i.e., creating new replicas in response to repl...
SPAA
2005
ACM
14 years 29 days ago
2005
ACM
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
MOR
2008
13 years 7 months ago
2008
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...