Pavel Klavík, A. Cristiano I. Malossi, et al.
Philos. Trans. R. Soc. A
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.
Pavel Klavík, A. Cristiano I. Malossi, et al.
Philos. Trans. R. Soc. A
Guojing Cong, David A. Bader
Journal of Parallel and Distributed Computing
Danila Seliayeu, Quinn Pham, et al.
CASCON 2024
R. Sebastian, M. Weise, et al.
ECPPM 2022