Conference paper
Paper
Synergy in parallel algorithms
Abstract
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.
Related
Conference paper
TAPAS: Train-less accuracy predictor for architecture search
Conference paper