Sciweavers

1133 search results - page 10 / 227
» Modeling and Control of Distributed Asynchronous Computation...
Sort
View
ICDCN
2011
Springer
13 years 16 days ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...
PPOPP
2010
ACM
14 years 6 months ago
Applying the concurrent collections programming model to asynchronous parallel dense linear algebra
This poster is a case study on the application of a novel programming model, called Concurrent Collections (CnC), to the implementation of an asynchronous-parallel algorithm for c...
Aparna Chandramowlishwaran, Kathleen Knobe, Richar...
PODC
1999
ACM
14 years 1 months ago
Computing Anonymously with Arbitrary Knowledge
We provide characterizations of the relations that can be computed with arbitrary knowledge on networks where all processors use the same algorithm and start from the same state (...
Paolo Boldi, Sebastiano Vigna
ICAC
2007
IEEE
14 years 3 months ago
Approximation Modeling for the Online Performance Management of Distributed Computing Systems
—A promising method of automating management tasks in computing systems is to formulate them as control or optimization problems in terms of performance metrics. For an online op...
Dara Kusic, Nagarajan Kandasamy, Guofei Jiang
IPPS
2007
IEEE
14 years 3 months ago
STAMP: A Universal Algorithmic Model for Next-Generation Multithreaded Machines and Systems
We propose a generic algorithmic model called STAMP (Synchronous, Transactional, and Asynchronous MultiProcessing) as a universal performance and power complexity model for multit...
Michel Dubois, Hyunyoung Lee, Lan Lin