Sciweavers

264 search results - page 42 / 53
» Bounding the number of tolerable faults in majority-based sy...
Sort
View
ICCS
2005
Springer
15 years 2 months ago
Super-Scalable Algorithms for Computing on 100, 000 Processors
In the next five years, the number of processors in high-end systems for scientific computing is expected to rise to tens and even hundreds of thousands. For example, the IBM Blu...
Christian Engelmann, Al Geist
CLUSTER
2003
IEEE
15 years 2 months ago
A Case Study of Parallel I/O for Biological Sequence Search on Linux Clusters
In this paper we analyze the I/O access patterns of a widely-used biological sequence search tool and implement two variations that employ parallel-I/O for data access based on PV...
Yifeng Zhu, Hong Jiang, Xiao Qin, David R. Swanson
OPODIS
2004
14 years 10 months ago
Optimal Resilience Asynchronous Approximate Agreement
Consider an asynchronous system where each process begins with an arbitrary real value. Given some fixed > 0, an approximate agreement algorithm must have all non-faulty process...
Ittai Abraham, Yonatan Amit, Danny Dolev
HPDC
2010
IEEE
14 years 9 months ago
Toward high performance computing in unconventional computing environments
Parallel computing on volatile distributed resources requires schedulers that consider job and resource characteristics. We study unconventional computing environments containing ...
Brent Rood, Nathan Gnanasambandam, Michael J. Lewi...
MS
2003
14 years 10 months ago
Model-based Optimization of an Infrared Gas Sensor
Manufacturing test structures of microsensors and microactuators is very expensive in terms of time and materials. In a conventional design process, this limits the number of desi...
Ingo Sieber, Karl-Heinz Suphan