Fisher–Yates shuffle Algorithm

Can we reduce the no.of calls being made to rand(n) in Fisher–Yates shuffle Algorithm. If not, how do we know that the no.of calls we are making is reasonable.