Snapshot algorithms are fundamental for many distributed applications and must often be executed repeatedly. We present three snapshot algorithms. The first one is based on the assumption of global time, it computes states of channels using several schemes. Taking consistent cut for global time instant, we show that the algorithm is applicable for existing snapshot algorithms. The second one is a real token based algorithm for non-FIFO asynchronous distributed systems. Its message complexity of control messages is O(n). The last one is the repeated version of the our second one. Using this algorithm, any process can get a consistent global state at its convenience. The algorithm is proved.