The problem with threads

By Edward A. Lee. Computer, 2006

1,042 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Hardware and Architecture

View Paper: https://www.semanticscholar.org/paper/d64c47cba449c6d2b0582d1b0223768962b629e9

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Hardware and Architecture

Citations in the corpus

This paper is included in the Proceedings of the 2022 USENIX Annual Technical Conference. (neutral): “As common wisdom, synchronous programming (using threads instead of callbacks) is easy to follow, but tends to have unstable performance due to the overhead of OS threads [15,25,26,37,42,43,52,53].”
DMP: deterministic shared memory multiprocessing (2009, background): “…Shared Memory Multiprocessing Joseph Devietti Brandon Lucia Luis Ceze Mark Oskin Computer Science & Engineering, University of Washington {devietti,blucia0a,luisceze,oskin}@cs.washington.edu Abstract Current shared memory multicore and multiprocessor systems are nondeterministic.”
The Past, Present and Future of Cyber-Physical Systems: A Focus on Models (2015, methodology): “This modified modeling paradigm could also apply to multithreaded programs, where it results in equally useless models [6].”
Cyber Physical Systems: Design Challenges (2008, methodology): “If we step outside C and use operating system primitives to perform I/O or to set up concurrent threads, we immediately move from essentially perfect predictability and reliability to wildly nondeterministic behavior that must be carefully reigned in by the software designer [19].”
Modeling Cyber–Physical Systems (2012, methodology): “The result is a family of far better concurrency models than the widely used thread-based models that dominate software engineering [39].”
Scala Actors: Unifying thread-based and event-based programming (2009, background): “This is known to be particularly hard using shared-memory locks [32].”
CPS foundations (2010, background): “These languages offer concurrency models that are much more understandable and analyzable than those prevalent in software engineering, based for instance on threads [19].”