Learn More
We describe a family of MPI applications we call the Parallel Unix Commands. These commands are natural parallel versions of common Unix user commands such as ls, ps, and find, together with a few similar commands particular to the parallel environment. We describe the design and implementation of these programs and present some performance results on a(More)
Static source code analysis and software fault injection are two popular approaches to testing and verifying the robustness of software. We chose a set of commonly-used applications: CUPS, Berkeley DB, the GNU file utilities, Apache, MySQL, sudo and zlib, and tested them with both static analysis and fault injection tools to discover errors. The results of(More)
We develop a method for generating shared, secret, safe primes applicable to use in threshold RSA signature schemes such as the one developed by Shoup. We would like a scheme usable in practical settings, so our protocol is robust and efficient in asynchronous, hostile environments. We show that the techniques used for robustness need special care when they(More)
In this paper, we broaden the applicability of peer-to-peer storage infrastructures to weakly-connected clients. We present a client-side technique that exploits the com-monality between consecutive versions of a file to reduce the bandwidth required to store and retrieve files in a peer-to-peer storage infrastructure. We then present a novel data structure(More)
This study applies recent work on the approx-imability of multiobjective optimization problems to Internet services that provide dynamic, per-sonalized web content. Changing environmental conditions can prompt such services to make tradeoffs along quality-of-service axes such as response time, throughput, and the " completeness " of the data provided. We(More)
  • 1