• Proceedings of the Korea Information Processing Society Conference
• /
• 2022.11a
• /
• pp.57-59
• /
• 2022

대규모 분산시스템에서 실행되는 전역적인 스냅샷 알고리즘의 메시지 통신 비용을 낮추기 위해, 일관성 유지에 필요한 최소 프로세스만 스냅샷 갱신에 참여하는 분산 스냅샷 알고리즘을 제안한다. 기존의 알고리즘들과는 다르게 수신 메시지에 대해서만 스냅샷 갱신을 요청하고, 스냅샷 설정 중 송신되는 메시지의 수신 프로세스에 대한 알고리즘 참여도 제한한다.

• Smart Media Journal
• /
• v.10 no.4
• /
• pp.15-20
• /
• 2021

The distributed trigger counting problem is to notify the user when the total number of triggers received from a distributed system consisting of n nodes reaches a predefined value w. The distributed trigger counting problem is used for monitoring and global snapshots in various distributed systems. In this paper, we propose a simple and efficient algorithm for the distributed trigger counting problem. The proposed algorithm operates based on a tree structure of degree $\sqrt{n}$ and height 2. The proposed algorithm operates in three different phases based on the remaining number of triggers. Experimental results show that the proposed algorithm has a smaller message complexity than CoinRand, and MaxRcv also performed better when the number of nodes is not large.