Programming with Futures, Lattices and Quiescence

on YouTube ↗53m

" summary

Extends Scala futures into cells and cell completers that hold elements of a lattice and accept join-based monotonic updates (multiple puts instead of single completion), adds a handler pool with onQuiescent quiescence detection to resolve cyclic dataflow, and plugs into OPAL static analysis. Applied to JDK8 (rt.jar, ~150k methods) for purity/immutability checks, yields ~15% faster runs on a small machine and roughly halves analysis code size while enabling deterministic resolution of strongly connected components via pluggable resolution policies.

AI-written summary · about

" chapters (23)

1. 0:00Introduction
2. 1:13Programming Models
3. 2:42Other Projects
4. 3:31Why Concurrent Programming
5. 4:14Nondeterminism
6. 5:41Concurrent Set
7. 7:17Deterministic Concurrent
8. 8:25Restrictions
9. 9:33Approach
10. 12:02Reactive Programming
11. 14:07Example
12. 23:59Handler Pools
13. 24:38Data Flow
14. 26:37Data Flow Cycles
15. 28:33Resolution Policies
16. 30:01Lattice Purity
17. 32:42Lattice Purity Analysis
18. 34:41Opal Framework
19. 36:02Results
20. 38:16Future work
21. 40:00Conclusion
22. 45:11Phases
23. 47:29Quiet

" related talks

• 52mNew Concurrency Utilities in Java 8Angelika Langer · GOTO Berlin 2014
• 44mConcurrency in Scala and on the JVMAdam Warski · Scala Days 2023 Madrid
• 42mBuilding Bulletproof Concurrent Applications on the JVMJohn A De Goes · Craft Conference 2022
• 32mProject Loom? Better Futures? What’s next for JVM concurrent programmingAdam Warski · Scale By the Bay 2020
• 01h 05mLawful Asynchronous ProgrammingDaniel Spiewak · Scala World 2015
• 01h 00mProject Loom? Better Futures? What’s next for JVM concurrent programmingAdam Warski · Global Summit for Java Devs 2020
• 01h 06mProject Lambda: Simplifying Concurrent Programming in Java SE 8Simon Ritter · JavaDay Riga 2012
• 48mConcurrency: It’s Harder (and Easier) Than You ThinkPaul Butcher · Philly ETE 2015