Neil Thompson
ABSTRACT
In this talk, I report on a large-scale census of algorithm improvement spanning 11 sub-fields of computer science, 57 textbooks and more than 1,100 research papers.
Across 113 algorithm problems, we find enormous variation in how fast algorithms have improved. Around half experience little or no improvement. At the other extreme, 13% experience transformative improvements, radically changing how and where they can be used. Overall, we find that, for moderate-sized problems, 30% to 45% of algorithmic problems had improvements comparable or greater than those that users experienced from Moore's Law and other hardware advances.
I will also discuss our comparison of the upper bounds and lower bounds for these algorithm problems, where we find that nearly two-thirds are already asymptomatically optimal --- representing a triumph for the field, but also a challenge for future progress.
Index Terms
- Keynote Talk: Algorithm Improvement: How Fast Has It Been and How Much Farther Can It Go?
Recommendations
Keynote talk III: A framework for modeling architectures and their properties
MEMOCODE '14: Proceedings of the Twelfth ACM/IEEE Conference on Formal Methods and Models for CodesignArchitectures are common means for organizing coordination between components in order to build complex systems and to make them manageable. Despite the progress of the state of the art over the past decades, there are still a lot of foundational issues ...
New Bounds and Constructions for Granular Media Coding
Improved lower and upper bounds on the size and the rate of grain-correcting codes are presented. The lower bound is Gilbert-Varshamov-like combined with a construction by Gabrys et al., and it improves on the previously best known lower bounds on the ...
An improved lower bound for the time complexity of mutual exclusion
Special issue: Selected papers from PODC '01We establish a lower bound of Ω(log N/ log log N) remote memory references for N-process mutual exclusion algorithms based on reads, writes, or comparison primitives such as test-and-set and compare-and-swap. Our bound improves an earlier lower bound of ...
Comments