6105 search results - page 750 / 1221 » A Parallel Algorithm for Bound-Smoothing |
180
click to vote
IPPS
2000
IEEE
16 years 3 days ago
2000
IEEE
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs , such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
201
click to vote
IPPS
2000
IEEE
16 years 3 days ago
2000
IEEE
We have developed an instrumentation scheme that enables programs written in multithreaded languages to compute a critical path at run time.Our scheme gives not only the length (ex...
190
click to vote
CONCUR
2000
Springer
16 years 1 days ago
2000
Springer
Abstract. In this paper, we introduce weak bisimulation in the framework of Labeled Concurrent Markov Chains, that is, probabilistic transition systems which exhibit both probabili...
192
click to vote
HCW
1999
IEEE
16 years 11 hour ago
1999
IEEE
This paper describes a simulation tool for the analysis of complex jobs described in the form of task graphs. The simulation procedure relies on the PN-based topological represent...
171
click to vote
ICDCS
1999
IEEE
16 years 7 hour ago
1999
IEEE
We describe imprecise calendars, a way to organize and schedule clusters of nodes in a computation grid. Imprecise calendars permit the easy and efficient sharing of resources bet...