The article discusses the shift away from the thread-per-core model in programming towards more dynamic concurrency models like work-stealing, highlighting the implications for performance and efficiency in async runtimes. It argues that with increasing core counts and improved IO latencies, traditional data processing paradigms are being reconsidered, suggesting a need for more flexible, shared-state concurrency approaches.