Brief Announcement: Optimally work-competitive scheduling for cooperative computing with merging groups

The development of algorithms with guaranteed work efficiency for any pattern of fragmentations and merges of the underlying network is addressed. Current results are discussed for the abstract setting where asynchronous processors start performing tasks in isolation and where an adversary can force an arbitrary pattern of merges. Following a merge, processors are able to share their knowledge about the computational progress prior to the merge.