Flexible scheduling of transactional memory on trees

Costas Busch, Bogdan S. Chlebus, Maurice Herlihy, Miroslav Popovic, Pavan Poudel, Gokarna Sharma

Abstract: Highlights•Studies transaction scheduling problem on Trees in the dual-flow model.•Allows flexibility for moving both transactions and objects during execution.•SINGLE-OBJECT algorithm provides optimal communication cost when all transactions access the same single shared object.•MULTIPLE-OBJECTS-CTRLMSG algorithm provides the schedule with O(1)<math><mi is="true">O</mi><mo stretchy="false" is="true">(</mo><mn is="true">1</mn><mo stretchy="false" is="true">)</mo></math>-approximation in communication cost.•MULTIPLE-OBJECTS-TXMIGR algorithm finds a schedule with O(k)<math><mi is="true">O</mi><mo stretchy="false" is="true">(</mo><mi is="true">k</mi><mo stretchy="false" is="true">)</mo></math>-approximation in communication cost.