• Can you provide a written example or diagram of a partitioned preprocessor that uses epochs? I am having trouble wrapping my head around what they would do.

  • Pingback: » links for 2010-09-03 (Dhananjay Nene)()

  • This is the great blog, I’m reading them for a while, thanks for the new posts!

  • Anonymous

    Hi Ariel: Say you have 2 coordinators, A and B. Incoming transactions go to either one of them. Initially, any transactions A receives in the first 50ms are numbered 0-999, and B numbers its transactions 1000-1999. (The workers process transactions in the global order designated by this numbering.) After 50ms, A & B move on to the next epoch: A starts numbering its transactions 2000-2999, and B starts numbering its transactions 3000-3999. And so on, so that every 50ms, transactions from both coordinators can be interleaved.

  • Very fascinating. Glad I stumbled across this info about deterministic distributed transaction management, definitely going to bookmark this to refer back again to it later this is an excellent collection of sites. management crm

  • AAA
  • AAA

    ???? ?????? ????? ??????? ???? ??????? 0500103995 ,???? ?? ?????? ???????,???? ????? ???????,???? ????? ???????,????? ????? ???????,???? ????? ????? ???????,???? ????? ??? ???????,???? ????? ????? ???????

  • AAA