Sciweavers

2924 search results - page 457 / 585
» Lower Bounds in Distributed Computing
Sort
View
INFOCOM
2010
IEEE
15 years 3 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...
MACOM
2010
14 years 11 months ago
On the Performance of Single LDGM Codes for Iterative Data Fusion over the Multiple Access Channel
One of the applications of wireless sensor networks currently undergoing active research focuses on the scenario where the information generated by a data source S is simultaneousl...
Javier Del Ser, Javier Garcia-Frias, Pedro M. Cres...
179
Voted
INFOCOM
2012
IEEE
13 years 7 months ago
SybilDefender: Defend against sybil attacks in large social networks
—Distributed systems without trusted identities are particularly vulnerable to sybil attacks, where an adversary creates multiple bogus identities to compromise the running of th...
Wei Wei, Fengyuan Xu, Chiu Chiang Tan, Qun Li
IPPS
2009
IEEE
15 years 11 months ago
Energy minimization for periodic real-time tasks on heterogeneous processing units
Adopting multiple processing units to enhance the computing capability or reduce the power consumption has been widely accepted for designing modern computing systems. Such confi...
Jian-Jia Chen, Andreas Schranzhofer, Lothar Thiele
IPPS
2007
IEEE
15 years 11 months ago
A Fault Tolerance Protocol with Fast Fault Recovery
Fault tolerance is an important issue for large machines with tens or hundreds of thousands of processors. Checkpoint-based methods, currently used on most machines, rollback all ...
Sayantan Chakravorty, Laxmikant V. Kalé