Before revision: Parallel iterative maximal matching algorithms (adapted for switching) has long been recognized as a cost-effective family for crossbar scheduling .
After revision: Parallel iterative maximal matching algorithms (adapted for switching) appear to have stricken the best such tradeoff .