Sciweavers

2924 search results - page 296 / 585
» Lower Bounds in Distributed Computing
Sort
View
IPPS
2005
IEEE
15 years 10 months ago
Processor Allocation for Tasks that is Robust Against Errors in Computation Time Estimates
Heterogeneous computing systems composed of interconnected machines with varied computational capabilities often operate in environments where there may be sudden machine failures...
Prasanna Sugavanam, Howard Jay Siegel, Anthony A. ...
COLCOM
2005
IEEE
15 years 10 months ago
Scheduling algorithms for peer-to-peer collaborative file distribution
—Peer-to-Peer file sharing applications in the Internet, such as BitTorrent, Gnutella, etc., have been immensely popular. Prior research mainly focuses on peer and content discov...
Jonathan S. K. Chan, Victor O. K. Li, King-Shan Lu...
184
Voted
SIAMSC
2011
177views more  SIAMSC 2011»
14 years 11 months ago
Computing f(A)b via Least Squares Polynomial Approximations
Given a certain function f, various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly comp...
Jie Chen, Mihai Anitescu, Yousef Saad
166
Voted
SIAMCOMP
2011
14 years 11 months ago
The Complexity of Early Deciding Set Agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon
TSP
2008
120views more  TSP 2008»
15 years 4 months ago
Distributed Average Consensus With Dithered Quantization
In this paper, we develop algorithms for distributed computation of averages of the node data over networks with bandwidth/power constraints or large volumes of data. Distributed ...
Tuncer C. Aysal, Mark Coates, Michael Rabbat