发明授权
US06205464B1 System for building optimal commit trees in a distributed transaction processing system
失效
用于在分布式事务处理系统中构建最佳提交树的系统
- 专利标题: System for building optimal commit trees in a distributed transaction processing system
- 专利标题(中): 用于在分布式事务处理系统中构建最佳提交树的系统
-
申请号: US08307212申请日: 1994-09-16
-
公开(公告)号: US06205464B1公开(公告)日: 2001-03-20
- 发明人: Edward Ellis Cobb , Simon Antony James Holdsworth , Iain Stuart Caldwell Houston , Stanley Alan Smith
- 申请人: Edward Ellis Cobb , Simon Antony James Holdsworth , Iain Stuart Caldwell Houston , Stanley Alan Smith
- 主分类号: G06F900
- IPC分类号: G06F900
摘要:
A system and method for reducing message traffic during two phase commitment in a distributed transaction processing system. Transactional objects manage transactions in a distributed system. A coordinator object is responsible for ensuring data consistency by enforcing atomic transaction changes. Any change to one or more resources by a transaction is either made at all or none of the resources. Distributed transactions use interposition to create subordinate coordinator for domains other than the primary domain. Each subordinate coordinator controls transaction commitment of all resources within that domain via a single message sequence per coordinator. Dynamic registration of subordinate coordinator resources ensures that the subordinate coordinator is not added to the commit tree of the root coordinator unless it has recoverable resources. Dynamic registration minimizes the size of the commit tree thereby minimizing the number of messages transmitted during commitment processing.
信息查询