David Carmel, Haggai Roitman, et al.
ACM TIST
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.
David Carmel, Haggai Roitman, et al.
ACM TIST
P.C. Yue, C.K. Wong
Journal of the ACM
Giuseppe Romano, Aakrati Jain, et al.
ECTC 2025
Fearghal O'Donncha, Albert Akhriev, et al.
Big Data 2021