  The objective of the paper is to establish a computable upper bound on the
almost sure convergence rate for a class of ratio consensus algorithms. Our
result extends the works of Iutzeler et al. (2013) on similar bounds that have
been obtained in a more restrictive setup with limited conclusions. It also
complements the results of Gerencs\'er and Gerencs\'er (2021) about identifying
for the first time the exact convergence rate which is however not computable
in general.
