Sciweavers

17541 search results - page 352 / 3509
» Complexity in scalable computing
Sort
View
FOCS
1991
IEEE
15 years 8 months ago
Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
Anna Gál
EDOC
2004
IEEE
15 years 8 months ago
Evaluating the Performance of Middleware Load Balancing Strategies
This paper presents three contributions to research on middleware load balancing. First, it describes the design of Cygnus, which is an extensible open-source middleware framework...
Jaiganesh Balasubramanian, Douglas C. Schmidt, Law...
IPPS
1998
IEEE
15 years 8 months ago
Performance Range Comparison via Crossing Point Analysis
Parallel programming is elusive. The relative performance of di erent parallel implementations varies with machine architecture, system and problem size. How to compare di erent i...
Xian-He Sun