We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...
Abstract— Many problems associated with networked systems can be formulated as network utility maximization (NUM) problems. NUM problems maximize a global separable measure of ne...
Idle workstations in a network represent a significant computing potential. In particular, their processing power can be used by parallel-distributed programs that treat the netwo...
Michael J. Feeley, Brian N. Bershad, Jeffrey S. Ch...
We present a parallel algorithm for exact division of sparse distributed polynomials on a multicore processor. This is a problem with significant data dependencies, so our solutio...
Distributed systems increasingly span organizational boundaries and, with this, system and service management domains. Web services are the primary means of exposing services to c...
Bruno Wassermann, Heiko Ludwig, Jim Laredo, Kamal ...