Sciweavers

2432 search results - page 30 / 487
» Using simple abstraction to reinvent computing for paralleli...
Sort
View
BIRTHDAY
2005
Springer
15 years 9 months ago
Compositional Reasoning for Probabilistic Finite-State Behaviors
Abstract. We study a process algebra which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s simple probabilistic automata. We consider...
Yuxin Deng, Catuscia Palamidessi, Jun Pang
123
Voted
TC
2002
15 years 3 months ago
Performance Modeling and Prediction of Nondedicated Network Computing
The low cost and wide availability of networks of workstations have made them an attractive solution for high performance computing. However, while a network of workstations may be...
Linguo Gong, Xian-He Sun, Edward F. Watson
138
Voted
DC
2008
15 years 3 months ago
Fast computation by population protocols with a leader
Fast algorithms are presented for performing computations in a probabilistic population model. This is a variant of the standard population protocol model--in which finite-state ag...
Dana Angluin, James Aspnes, David Eisenstat
134
Voted
TR
2008
117views more  TR 2008»
15 years 3 months ago
Redundancy Allocation for Series-Parallel Systems Using Integer Linear Programming
We consider the problem of maximizing the reliability of a series-parallel system given cost and weight constraints on the system. The number of components in each subsystem and th...
Alain Billionnet
106
Voted
EUROPAR
2004
Springer
15 years 9 months ago
Designing Parallel Operating Systems via Parallel Programming
Abstract. Ever-increasing demand for computing capability is driving the construction of ever-larger computer clusters, soon to be reaching tens of thousands of processors. Many fu...
Eitan Frachtenberg, Kei Davis, Fabrizio Petrini, J...