Sciweavers

3047 search results - page 14 / 610
» Randomized Parallel Selection
Sort
View
ICST
2010
IEEE
13 years 6 months ago
Satisfying Test Preconditions through Guided Object Selection
—A random testing strategy can be effective at finding faults, but may leave some routines entirely untested if it never gets to call them on objects satisfying their preconditi...
Yi Wei, Serge Gebhardt, Bertrand Meyer, Manuel Ori...
IEEEPACT
1997
IEEE
13 years 11 months ago
A Parallel Algorithm for Compile-Time Scheduling of Parallel Programs on Multiprocessors
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
Yu-Kwong Kwok, Ishfaq Ahmad
EUROPAR
2009
Springer
14 years 2 months ago
Uniform Sampling for Directed P2P Networks
Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms....
Cyrus P. Hall, Antonio Carzaniga
ICDCS
1999
IEEE
13 years 12 months ago
Interpreting Stale Load Information
In this paper we examine the problem of balancing load in a large-scale distributed system when information about server loads may be stale. It is well known that sending each req...
Michael Dahlin
WSC
1997
13 years 9 months ago
How Common Random Numbers Affect Multinomial Selection
We consider the effect of common random numbers (CRNs) among simulated systems in two different multinomial selection procedures; the classical procedure BEM (Bechhofer, Elmaghr...
John O. Miller, Kenneth W. Bauer Jr.