P. Trespeuch, Y. Fournier, et al.
Civil-Comp Proceedings
A property of algorithms called synergy is introduced, and a quantity s, of synergy is defined. When synergized, both parallel and serial algorithms run faster, the parallel algorithms benefiting from a cooperation between processors. Examples show that synergy is a useful concept in the design of parallel algorithms. © 1989.
P. Trespeuch, Y. Fournier, et al.
Civil-Comp Proceedings
Ankit Vishnubhotla, Charlotte Loh, et al.
NeurIPS 2023
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Zhikun Yuen, Paula Branco, et al.
DSAA 2023