| 摘要 |
Various implementations are disclosed for enabling transactions in which a reply constraint(s) is defined between a minimum and maximum number of a defined group of recipients that are requested to respond to a sender within a defined time limit. Further, a determination of whether the reply constraint is satisfied is made during a first phase of a two-phase transaction, in which the first phase represents an abbreviated version of the desired transaction, and is used to ensure fulfillment of the reply constraint before the fill transaction is allowed to proceed. In this way, flexibility may be obtained in executing an atomic multicast transaction, while a determination of a likely success of the transaction (as well as the resulting execution of the transaction) may be performed quickly, reliably, and efficiently. |
