assigns distributed transaction ids by logical clock per node and round-robin assigned node numbers, where the sequence number (round robin count) is high order, then the node number, then the logical clock QuoteRef: rahiSK_1982
QuoteRef: rahiSK_1982
Related Topics
Topic: task scheduling (49 items) ThesaHelp: references p-r (245 items)