Author Country (or Countries)



In this paper we first show how to compute the probability that a particular candidate c out of m candidates, 1 ≤ c ≤ m, wins by plurality voting an election conducted by n voters, where each voter either votes for a single candidate i, 1 ≤ i ≤ m, with probability Pi, or abstains with probability P0 = 1−?mi =1 Pi.We then show how this result is involved in the computation of the average execution time of a set (“frame”) of n simultaneous requests, where each request randomly asks for exclusive access to any of m available non-shareable resources with probability Pi,1 ≤ i ≤ m, or for non-exclusive access to a common fully shareable resource with probability P0 = 1−?mi =1 Pi. We also allow that each resource access has a different duration Di,0 ≤ i ≤ m. The formulas that we develop have application in the analysis and evaluation of ensemble classifiers in pattern recognition and classification, and in systems performance evaluation (critical sections in multithreaded programs with barrier synchronization, switch delay in computer networks and interconnection networks).

Digital Object Identifier (DOI)