Global halting algorithm consisting of distributed systems with bounded latency time

Parallel programming usually require tools for halting distributed systems. Several Work had been carried out in order to build such tools. However, the number of messages generated by these algorithms makes them inefficient, The current work which improve a previous one, proposes an algorithm for consistent global breakpoints. It generates a number of message bounded and free from the process number.