We point out the significance of a few multimedia instructions in fundamental combinatorial problems such as hashing, sorting, minimum spanning tree and single source shortest paths. The hope is convince the processor design community to give these instructions a more central role so that they will be supported consistently as a standard in future multimedia processors. At the same time, we provide a simple model of multimedia processors for the algorithms community, highlighting the aspects of relevance in combinatorial algorithms.
/lp/association-for-computing-machinery/combinatorial-power-in-multimedia-processors-8fLnKbXkyT