Sciweavers

735 search results - page 53 / 147
» Randomization in Parallel Stringology
Sort
View
IPPS
2006
IEEE
15 years 8 months ago
Modelling job allocation where service duration is unknown
In this paper a novel job allocation scheme in distributed systems (TAG) is modelled using the Markovian process algebra PEPA. This scheme requires no prior knowledge of job size ...
Nigel Thomas
SPAA
2000
ACM
15 years 6 months ago
An experimental study of a simple, distributed edge coloring algorithm
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
Madhav V. Marathe, Alessandro Panconesi, Larry D. ...
PE
2006
Springer
115views Optimization» more  PE 2006»
15 years 2 months ago
Optimal processor allocation to differentiated job flows
In this paper, we study the problem of dynamic allocation of the resources of a general parallel processing system, comprised of M heterogeneous processors and M heterogeneous tra...
Kimberly M. Wasserman, George Michailidis, Nichola...
DAIS
2011
14 years 6 months ago
Gozar: NAT-Friendly Peer Sampling with One-Hop Distributed NAT Traversal
Gossip-based peer sampling protocols have been widely used as a building block for many large-scale distributed applications. However, Network Address Translation gateways (NATs) c...
Amir H. Payberah, Jim Dowling, Seif Haridi
166
Voted
ICDCN
2011
Springer
14 years 6 months 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...