2PC 模式实现代码
分布式事务的 2PC（两阶段提交）模式通过协调者（Coordinator）和参与者（Participant）实现。以下是一个简化的 Java 实现示例：
public interface Participant { boolean prepare(); boolean commit(); boolean rollback(); } public class Coordinator { private List<Participant> participants; public boolean executeTransaction() { // Phase 1: Prepare for (Participant participant : participants) { if (!participant.prepare()) { // Phase 2: Rollback participants.forEach(Participant::rollback); return false; } } // Phase 2: Commit for (Participant participant : participants) { if (!participant.commit()) { // Rollback if any commit fails participants.forEach(Participant::rollback); return false; } } return true; } }https://www.zhihu.com/zvideo/1994255009265779578/
https://www.zhihu.com/zvideo/1994255009265779578
https://www.zhihu.com/zvideo/1994255004966598304/
https://www.zhihu.com/zvideo/1994255004966598304
https://www.zhihu.com/zvideo/1994254999589495973/
https://www.zhihu.com/zvideo/1994254999589495973
https://www.zhihu.com/zvideo/1994254998457046795/
https://www.zhihu.com/zvideo/1994254998457046795
https://www.zhihu.com/zvideo/1994254996347311189/
https://www.zhihu.com/zvideo/1994254996347311189
https://www.zhihu.com/zvideo/1994254989732889508/
https://www.zhihu.com/zvideo/1994254989732889508
https://www.zhihu.com/zvideo/1994254982837458175/
https://www.zhihu.com/zvideo/1994254982837458175
https://www.zhihu.com/zvideo/1994254979255513552/
https://www.zhihu.com/zvideo/1994254979255513552
https://www.zhihu.com/zvideo/1994254975883319037/
https://www.zhihu.com/zvideo/1994254975883319037
https://www.zhihu.com/zvideo/1994254975820379847/
https://www.zhihu.com/zvideo/1994254975820379847
https://www.zhihu.com/zvideo/1994254973169603529/
https://www.zhihu.com/zvideo/1994254973169603529
https://www.zhihu.com/zvideo/1994254972846638016/
https://www.zhihu.com/zvideo/1994254972846638016
https://www.zhihu.com/zvideo/1994254969709286509/
https://www.zhihu.com/zvideo/1994254969709286509
https://www.zhihu.com/zvideo/1994254968882996284/
https://www.zhihu.com/zvideo/1994254968882996284
https://www.zhihu.com/zvideo/1994254967280773003/
https://www.zhihu.com/zvideo/1994254967280773003
https://www.zhihu.com/zvideo/1994254960695739745/
https://www.zhihu.com/zvideo/1994254960695739745
https://www.zhihu.com/zvideo/1994254954123265697/
https://www.zhihu.com/zvideo/1994254954123265697
https://www.zhihu.com/zvideo/1994254952277770972/
https://www.zhihu.com/zvideo/1994254952277770972
https://www.zhihu.com/zvideo/1994254947596923547/
https://www.zhihu.com/zvideo/1994254947596923547
TCC 模式实现代码
TCC（Try-Confirm-Cancel）模式通过业务逻辑的拆分实现分布式事务。以下是 TCC 的 Java 实现示例：
public interface TccService { boolean tryAction(); boolean confirmAction(); boolean cancelAction(); } public class TccCoordinator { private List<TccService> services; public boolean execute() { // Try Phase for (TccService service : services) { if (!service.tryAction()) { // Cancel Phase services.forEach(TccService::cancelAction); return false; } } // Confirm Phase for (TccService service : services) { if (!service.confirmAction()) { // Cancel if any confirm fails services.forEach(TccService::cancelAction); return false; } } return true; } }SAGA 模式实现代码
SAGA 模式通过正向操作和补偿操作实现最终一致性。以下是 SAGA 的 Java 实现示例：
public interface SagaAction { boolean execute(); boolean compensate(); } public class SagaCoordinator { private List<SagaAction> actions; public boolean execute() { List<SagaAction> executedActions = new ArrayList<>(); for (SagaAction action : actions) { if (!action.execute()) { // Compensate executed actions in reverse order for (int i = executedActions.size() - 1; i >= 0; i--) { executedActions.get(i).compensate(); } return false; } executedActions.add(action); } return true; } }注意事项
- 2PC 模式依赖于协调者的可靠性，适用于强一致性场景，但存在阻塞问题。
- TCC 模式需要业务逻辑支持 Try-Confirm-Cancel 三阶段，适用于高一致性要求的业务。
- SAGA 模式通过补偿机制实现最终一致性，适用于长事务和弱一致性场景。
以上代码为简化示例，实际应用中需结合具体框架（如 Seata、Spring Cloud）和业务需求调整。
