2924 search results - page 368 / 585 » Lower Bounds in Distributed Computing |
141
click to vote
ASPDAC
2008
ACM
15 years 6 months ago
2008
ACM
In modern circuit design, it is difficult to provide reliable parametric yield prediction since the real distribution of process data is hard to measure. Most existing approaches ...
143
click to vote
IPPS
2009
IEEE
15 years 11 months ago
2009
IEEE
We consider the operator mapping problem for in-network stream processing, i.e., the application of a tree of operators in steady-state to multiple data objects that are continuou...
142
click to vote
FORMATS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
124
click to vote
HPDC
2003
IEEE
15 years 10 months ago
2003
IEEE
In systems consisting of multiple clusters of processors which employ space sharing for scheduling jobs, such as our Distributed ASCI1 Supercomputer (DAS), coallocation, i.e., the...
159
click to vote
ICDCS
1998
IEEE
15 years 9 months ago
1998
IEEE
Exceptions are one of the most pervasive problems in process support systems. In installations expected to handle a large number of processes, having exceptions is bound to be a n...