Uploaded byESUG
PDF, PPTX175 views

Design Principles for a High-Performance Smalltalk

The document discusses design principles for a high-performance Smalltalk implementation using Zig, focusing on multi-core support, memory management, and code generation strategies. It emphasizes maintaining compatibility with OpenSmalltalk systems while optimizing for performance through techniques like immediate values, global collectors, and method dispatch. The architecture aims to enhance execution speed, particularly in multi-threaded environments, while minimizing disruption to existing userland code.

Embed presentation

Download as PDF, PPTX
Design Principles for a High-Performance Smalltalk Dave Mason Toronto Metropolitan Universityi ©2022 Dave Mason
Design Principles Large memories 64-bit and IEEE-768 Multi-core and threading Fast execution
Design Principles Large memories 64-bit and IEEE-768 Multi-core and threading Fast execution
Design Principles Large memories 64-bit and IEEE-768 Multi-core and threading Fast execution
Design Principles Large memories 64-bit and IEEE-768 Multi-core and threading Fast execution
Zag Smalltalk from-scratch implementation low-level is implemented in Zig goal is to support existing OpenSmalltalk systems don’t want to rewrite userland!
Zag Smalltalk from-scratch implementation low-level is implemented in Zig goal is to support existing OpenSmalltalk systems don’t want to rewrite userland!
Zag Smalltalk from-scratch implementation low-level is implemented in Zig goal is to support existing OpenSmalltalk systems don’t want to rewrite userland!
Zag Smalltalk from-scratch implementation low-level is implemented in Zig goal is to support existing OpenSmalltalk systems don’t want to rewrite userland!
Immediate Values 64 bit NaN-boxing double-floats, 51-bit SmallInteger, Booleans, nil, Unicode characters, Symbols room for instances of any type with single 32-bit value
Immediate Values 64 bit NaN-boxing double-floats, 51-bit SmallInteger, Booleans, nil, Unicode characters, Symbols room for instances of any type with single 32-bit value
Immediate Values 64 bit NaN-boxing double-floats, 51-bit SmallInteger, Booleans, nil, Unicode characters, Symbols room for instances of any type with single 32-bit value
Immediate Values 64 bit NaN-boxing double-floats, 51-bit SmallInteger, Booleans, nil, Unicode characters, Symbols room for instances of any type with single 32-bit value
S+E F F F Type 0000 0000 0000 0000 double +0 0000-7FEF xxxx xxxx xxxx double (positive) 7FF0 0000 0000 0000 +inf 7FF0-F xxxx xxxx xxxx NaN (unused) 8000 0000 0000 0000 double -0 8000-FFEF xxxx xxxx xxxx double (negative) FFF0 0000 0000 0000 -inf FFF0-5 xxxx xxxx xxxx NaN (currently unused) FFF6 xxxx xxxx xxxx heap object FFF7 0001 xxxx xxxx reserved (tag = Object) FFF7 0002 xxxx xxxx reserved (tag = SmallInteger) FFF7 0003 xxxx xxxx reserved (tag = Double) FFF7 0004 0001 0000 False FFF7 0005 0010 0001 True FFF7 0006 0100 0002 UndefinedObject FFF7 0007 aaxx xxxx Symbol FFF7 0008 00xx xxxx Character FFF8-F xxxx xxxx xxxx SmallInteger FFF8 0000 0000 0000 SmallInteger minVal FFFC 0000 0000 0000 SmallInteger 0 FFFF FFFF FFFF FFFF SmallInteger maxVal
Multi-core support only way to speed up applications minimal blocking computational/mutator threads - typically 1 per core I/O threads - one per open “file” global collector thread
Multi-core support only way to speed up applications minimal blocking computational/mutator threads - typically 1 per core I/O threads - one per open “file” global collector thread
Multi-core support only way to speed up applications minimal blocking computational/mutator threads - typically 1 per core I/O threads - one per open “file” global collector thread
Multi-core support only way to speed up applications minimal blocking computational/mutator threads - typically 1 per core I/O threads - one per open “file” global collector thread
Multi-core support only way to speed up applications minimal blocking computational/mutator threads - typically 1 per core I/O threads - one per open “file” global collector thread
Memory management mutator threads copying collector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
Memory management mutator threads copying collector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
Memory management mutator threads copying collector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
Memory management mutator threads copying collector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
Memory management mutator threads copying collector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
Memory management mutator threads copying collector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
Memory management mutator threads copying collector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
Memory management mutator threads copying collector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
Memory management mutator threads copying collector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
Memory management mutator threads copying collector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
Memory management mutator threads copying collector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
Memory management mutator threads copying collector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
Memory management mutator threads copying collector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
Memory management mutator threads copying collector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
Memory management mutator threads copying collector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
Memory management mutator threads copying collector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
... Memory management global collector for non-moving mark-&-sweep uses Fibonacci heap (similar to Mist) large objects (e.g. 16Kib) have separately mapped pages (allows mmap of large files) to minimize memory creep
... Memory management global collector for non-moving mark-&-sweep uses Fibonacci heap (similar to Mist) large objects (e.g. 16Kib) have separately mapped pages (allows mmap of large files) to minimize memory creep
... Memory management global collector for non-moving mark-&-sweep uses Fibonacci heap (similar to Mist) large objects (e.g. 16Kib) have separately mapped pages (allows mmap of large files) to minimize memory creep
Heap objects header Bits What Characteristics 12 length number of long-words beyond the header 4 age 0 - nursery, 1-7 teen, 8+ global 8 format 24 identityHash 16 classIndex LSB recognize pointer-free instance variables and arrays separately length of 4095 - forwarding pointer - copying, become:, promoted format is somewhat similar to SPUR encoding - various-sized non-object arrays strings stored in UTF-8
Heap objects header Bits What Characteristics 12 length number of long-words beyond the header 4 age 0 - nursery, 1-7 teen, 8+ global 8 format 24 identityHash 16 classIndex LSB recognize pointer-free instance variables and arrays separately length of 4095 - forwarding pointer - copying, become:, promoted format is somewhat similar to SPUR encoding - various-sized non-object arrays strings stored in UTF-8
Heap objects header Bits What Characteristics 12 length number of long-words beyond the header 4 age 0 - nursery, 1-7 teen, 8+ global 8 format 24 identityHash 16 classIndex LSB recognize pointer-free instance variables and arrays separately length of 4095 - forwarding pointer - copying, become:, promoted format is somewhat similar to SPUR encoding - various-sized non-object arrays strings stored in UTF-8
Heap objects header Bits What Characteristics 12 length number of long-words beyond the header 4 age 0 - nursery, 1-7 teen, 8+ global 8 format 24 identityHash 16 classIndex LSB recognize pointer-free instance variables and arrays separately length of 4095 - forwarding pointer - copying, become:, promoted format is somewhat similar to SPUR encoding - various-sized non-object arrays strings stored in UTF-8
Heap objects header Bits What Characteristics 12 length number of long-words beyond the header 4 age 0 - nursery, 1-7 teen, 8+ global 8 format 24 identityHash 16 classIndex LSB recognize pointer-free instance variables and arrays separately length of 4095 - forwarding pointer - copying, become:, promoted format is somewhat similar to SPUR encoding - various-sized non-object arrays strings stored in UTF-8
Unified dispatch single level of hashing for method dispatch each class dispatch table has entry for every method it has been sent - regardless of place in hierarchy near-perfect hash using Φ hashing standard SPUR/OpenVM optimizations don’t work well in multi-core environments
Unified dispatch single level of hashing for method dispatch each class dispatch table has entry for every method it has been sent - regardless of place in hierarchy near-perfect hash using Φ hashing standard SPUR/OpenVM optimizations don’t work well in multi-core environments
Unified dispatch single level of hashing for method dispatch each class dispatch table has entry for every method it has been sent - regardless of place in hierarchy near-perfect hash using Φ hashing standard SPUR/OpenVM optimizations don’t work well in multi-core environments
Unified dispatch single level of hashing for method dispatch each class dispatch table has entry for every method it has been sent - regardless of place in hierarchy near-perfect hash using Φ hashing standard SPUR/OpenVM optimizations don’t work well in multi-core environments
High performance Inlining references to self / super code are inlined methods with small number of implementations are inlined - rather than heuristic prevents creation of many blocks provides large compilation units for optimization
High performance Inlining references to self / super code are inlined methods with small number of implementations are inlined - rather than heuristic prevents creation of many blocks provides large compilation units for optimization
High performance Inlining references to self / super code are inlined methods with small number of implementations are inlined - rather than heuristic prevents creation of many blocks provides large compilation units for optimization
High performance Inlining references to self / super code are inlined methods with small number of implementations are inlined - rather than heuristic prevents creation of many blocks provides large compilation units for optimization
Code Generation no interpreter, 3 code generation models threaded-execution method is sequence of Zig function addresses uses Zig tail-call-elimination - passes pc, sp, hp, thread, context primitives and control implementations stand-alone generator generates Zig code for methods depends on Zig inlining and excellent code generation JIT future LLVM jitter
Code Generation no interpreter, 3 code generation models threaded-execution method is sequence of Zig function addresses uses Zig tail-call-elimination - passes pc, sp, hp, thread, context primitives and control implementations stand-alone generator generates Zig code for methods depends on Zig inlining and excellent code generation JIT future LLVM jitter
Code Generation no interpreter, 3 code generation models threaded-execution method is sequence of Zig function addresses uses Zig tail-call-elimination - passes pc, sp, hp, thread, context primitives and control implementations stand-alone generator generates Zig code for methods depends on Zig inlining and excellent code generation JIT future LLVM jitter
Code Generation no interpreter, 3 code generation models threaded-execution method is sequence of Zig function addresses uses Zig tail-call-elimination - passes pc, sp, hp, thread, context primitives and control implementations stand-alone generator generates Zig code for methods depends on Zig inlining and excellent code generation JIT future LLVM jitter
Code Generation no interpreter, 3 code generation models threaded-execution method is sequence of Zig function addresses uses Zig tail-call-elimination - passes pc, sp, hp, thread, context primitives and control implementations stand-alone generator generates Zig code for methods depends on Zig inlining and excellent code generation JIT future LLVM jitter
Code Generation no interpreter, 3 code generation models threaded-execution method is sequence of Zig function addresses uses Zig tail-call-elimination - passes pc, sp, hp, thread, context primitives and control implementations stand-alone generator generates Zig code for methods depends on Zig inlining and excellent code generation JIT future LLVM jitter
Code Generation no interpreter, 3 code generation models threaded-execution method is sequence of Zig function addresses uses Zig tail-call-elimination - passes pc, sp, hp, thread, context primitives and control implementations stand-alone generator generates Zig code for methods depends on Zig inlining and excellent code generation JIT future LLVM jitter
Code Generation no interpreter, 3 code generation models threaded-execution method is sequence of Zig function addresses uses Zig tail-call-elimination - passes pc, sp, hp, thread, context primitives and control implementations stand-alone generator generates Zig code for methods depends on Zig inlining and excellent code generation JIT future LLVM jitter
Code Generation no interpreter, 3 code generation models threaded-execution method is sequence of Zig function addresses uses Zig tail-call-elimination - passes pc, sp, hp, thread, context primitives and control implementations stand-alone generator generates Zig code for methods depends on Zig inlining and excellent code generation JIT future LLVM jitter
Code Generation no interpreter, 3 code generation models threaded-execution method is sequence of Zig function addresses uses Zig tail-call-elimination - passes pc, sp, hp, thread, context primitives and control implementations stand-alone generator generates Zig code for methods depends on Zig inlining and excellent code generation JIT future LLVM jitter
Code Generation no interpreter, 3 code generation models threaded-execution method is sequence of Zig function addresses uses Zig tail-call-elimination - passes pc, sp, hp, thread, context primitives and control implementations stand-alone generator generates Zig code for methods depends on Zig inlining and excellent code generation JIT future LLVM jitter
Conclusions while the intent of this paper is to provide design principles, also described some implementation this is preliminary work, so some open questions many experiments to run to validate my intuitions
Conclusions while the intent of this paper is to provide design principles, also described some implementation this is preliminary work, so some open questions many experiments to run to validate my intuitions
Conclusions while the intent of this paper is to provide design principles, also described some implementation this is preliminary work, so some open questions many experiments to run to validate my intuitions
Questions? @DrDaveMason dmason@ryerson.ca https://github.com/dvmason/Zag-Smalltalk

More Related Content

PPTX
Cc module 3.pptx
byssuserbead51
 
PDF
Simon Peyton Jones: Managing parallelism
bySkills Matter
 
PDF
GPU programming
byRoberto Bonvallet
 
PDF
01. introduction to embedded systems
byayush1313
 
PDF
Peyton jones-2011-parallel haskell-the_future
byTakayuki Muranushi
 
PDF
Introducing Parallel Pixie Dust: Advanced Library-Based Support for Paralleli...
byJason Hearne-McGuiness
 
PPTX
Gpu archi
byPiyush Mittal
 
PDF
C++ Data-flow Parallelism sounds great! But how practical is it? Let’s see ho...
byJason Hearne-McGuiness
 
Cc module 3.pptx
byssuserbead51
 
Simon Peyton Jones: Managing parallelism
bySkills Matter
 
GPU programming
byRoberto Bonvallet
 
01. introduction to embedded systems
byayush1313
 
Peyton jones-2011-parallel haskell-the_future
byTakayuki Muranushi
 
Introducing Parallel Pixie Dust: Advanced Library-Based Support for Paralleli...
byJason Hearne-McGuiness
 
Gpu archi
byPiyush Mittal
 
C++ Data-flow Parallelism sounds great! But how practical is it? Let’s see ho...
byJason Hearne-McGuiness
 

Similar to Design Principles for a High-Performance Smalltalk

PDF
High Performance computing Parallel Hardware and Software.pdf
byAIET, Mijar
 
PPTX
Data oriented design and c++
byMike Acton
 
PDF
reductio [ad absurdum]
byShakacon
 
PPTX
Cuda Architecture
byPiyush Mittal
 
PPTX
digital principles and computer organization
bymadumac
 
PDF
IAP09 CUDA@MIT 6.963 - Lecture 01: GPU Computing using CUDA (David Luebke, NV...
bynpinto
 
PPT
Multi core-architecture
byPiyush Mittal
 
PPT
Migration To Multi Core - Parallel Programming Models
byZvi Avraham
 
PPT
Massively Parallel Architectures
byJason Hearne-McGuiness
 
PPTX
Parallel architecture &programming
byIsmail El Gayar
 
PPTX
Parallel architecture-programming
byShaveta Banda
 
PPT
Supercomputers
byMehmet Demir
 
PPT
Coding for multiple cores
byLee Hanxue
 
PPT
Supercomputers
byMehmet Demir
 
PPT
Supercomputers
byMehmet Demir
 
PDF
Multi-core Parallelization in Clojure - a Case Study
byelliando dias
 
PDF
Parallel and Distributed Computing on Low Latency Clusters
byVittorio Giovara
 
PDF
73
bysrimoorthi
 
PDF
Dynamic Overriding
byrentzsch
 
PPTX
DesignPatterns-IntroPresentation.pptx
byMariusIoacara2
 
High Performance computing Parallel Hardware and Software.pdf
byAIET, Mijar
 
Data oriented design and c++
byMike Acton
 
reductio [ad absurdum]
byShakacon
 
Cuda Architecture
byPiyush Mittal
 
digital principles and computer organization
bymadumac
 
IAP09 CUDA@MIT 6.963 - Lecture 01: GPU Computing using CUDA (David Luebke, NV...
bynpinto
 
Multi core-architecture
byPiyush Mittal
 
Migration To Multi Core - Parallel Programming Models
byZvi Avraham
 
Massively Parallel Architectures
byJason Hearne-McGuiness
 
Parallel architecture &programming
byIsmail El Gayar
 
Parallel architecture-programming
byShaveta Banda
 
Supercomputers
byMehmet Demir
 
Coding for multiple cores
byLee Hanxue
 
Supercomputers
byMehmet Demir
 
Supercomputers
byMehmet Demir
 
Multi-core Parallelization in Clojure - a Case Study
byelliando dias
 
Parallel and Distributed Computing on Low Latency Clusters
byVittorio Giovara
 
73
bysrimoorthi
 
Dynamic Overriding
byrentzsch
 
DesignPatterns-IntroPresentation.pptx
byMariusIoacara2
 

More from ESUG

PDF
Encoding for Objects Matters (IWST 2025)
byESUG
 
PDF
ESUG 2009: [Project planning], by Tim Mackinnon
byESUG
 
PDF
FASTTypeScript metamodel generation using FAST traits and TreeSitter project
byESUG
 
PDF
Migrating Katalon Studio Tests to Playwright with Model Driven Engineering
byESUG
 
PDF
Even Lighter Than Lightweiht: Augmenting Type Inference with Primitive Heuris...
byESUG
 
PDF
Identification of unnecessary object allocations using static escape analysis
byESUG
 
PDF
Clean Blocks (IWST 2025, Gdansk, Poland)
byESUG
 
PDF
Control flow-sensitive optimizations In the Druid Meta-Compiler
byESUG
 
PDF
ChatPharo: an Open Architecture for Understanding How to Talk Live to LLMs
byESUG
 
PDF
Immersive experiences: what Pharo users do!
byESUG
 
PDF
Composing and Performing Electronic Music on-the-Fly with Pharo and Coypu
byESUG
 
PDF
An Analysis of Inline Method Refactoring
byESUG
 
PDF
Evaluating Benchmark Quality: a Mutation-Testing- Based Methodology
byESUG
 
PDF
Directing Generative AI for Pharo Documentation
byESUG
 
PDF
ShowUs: Pharo Stream Deck (ESUG 2025, Gdansk)
byESUG
 
PDF
Challenges of Transpiling Smalltalk to JavaScript
byESUG
 
PDF
Package-Aware Approach for Repository-Level Code Completion in Pharo
byESUG
 
PDF
Analysing Python Machine Learning Notebooks with Moose
byESUG
 
PDF
Gamifying Agent-Based Models in Cormas: Towards the Playable Architecture for...
byESUG
 
PDF
Micromaid: A simple Mermaid-like chart generator for Pharo
byESUG
 
Encoding for Objects Matters (IWST 2025)
byESUG
 
ESUG 2009: [Project planning], by Tim Mackinnon
byESUG
 
FASTTypeScript metamodel generation using FAST traits and TreeSitter project
byESUG
 
Migrating Katalon Studio Tests to Playwright with Model Driven Engineering
byESUG
 
Even Lighter Than Lightweiht: Augmenting Type Inference with Primitive Heuris...
byESUG
 
Identification of unnecessary object allocations using static escape analysis
byESUG
 
Clean Blocks (IWST 2025, Gdansk, Poland)
byESUG
 
Control flow-sensitive optimizations In the Druid Meta-Compiler
byESUG
 
ChatPharo: an Open Architecture for Understanding How to Talk Live to LLMs
byESUG
 
Immersive experiences: what Pharo users do!
byESUG
 
Composing and Performing Electronic Music on-the-Fly with Pharo and Coypu
byESUG
 
An Analysis of Inline Method Refactoring
byESUG
 
Evaluating Benchmark Quality: a Mutation-Testing- Based Methodology
byESUG
 
Directing Generative AI for Pharo Documentation
byESUG
 
ShowUs: Pharo Stream Deck (ESUG 2025, Gdansk)
byESUG
 
Challenges of Transpiling Smalltalk to JavaScript
byESUG
 
Package-Aware Approach for Repository-Level Code Completion in Pharo
byESUG
 
Analysing Python Machine Learning Notebooks with Moose
byESUG
 
Gamifying Agent-Based Models in Cormas: Towards the Playable Architecture for...
byESUG
 
Micromaid: A simple Mermaid-like chart generator for Pharo
byESUG
 

Recently uploaded

PDF
Healthcare Mobile App Development: Features & Benefits
byjoealwyn38
 
PDF
Driving Finance Growth with Business Central ERP
byNavision India
 
PDF
CatoCoin (CATO) – Smart Contract Security Audit Report by EtherAuthority
byEtherAuthority
 
PDF
Python Core Interview Cheat Sheet for a Senior Interview
byStanislav Lazarenko
 
PDF
DSD-INT 2025 Groundwater table lowering due to surface water lowering - Reusen
byDeltares
 
PDF
Hack&Verse Kick-off and infor session Event ppt
bysanidhyasahu1120
 
PPTX
Build Smarter with Google: A Workshop on MediaPipe, Firebase, Gemini and Anti...
byvanshikaprakash05
 
PDF
DSD-INT 2025 iMOD Parallel coupler development plan - Verkaik
byDeltares
 
PDF
Problem Solving_20241203_220045_0000.pdf
bythakurayush00991
 
PPTX
Lect 1 Number systems and base conversions. [Autosaved].pptx
byzainiman8511
 
PDF
Inside An AI Powered ERP System for Process Manufacturers
byBatchMaster Software Pvt. Ltd.
 
PPTX
Introduction to Software Development and Modern Practices
byM Munim
 
PPTX
Performance Engineering: New and Conflicting Trends
byAlexander Podelko
 
PDF
Building Strong IT Systems Using the Site Reliability Engineering
byAvekshaa Technologies
 
PPTX
Best Way to Convert PST File to MBOX Format
bykyla142000
 
PDF
Cloud Engineering Services | Infysion Technologies
bysolutioninginfysion
 
PPTX
Inside An AI Powered ERP System for Process Manufacturers
byBatchMaster Software Pvt. Ltd.
 
PPTX
UAE-Based Insurer Transforms Operations with InsureEdge
byInsurance Tech Services
 
PPTX
EMR Software for Pulmonology Clinics Why EasyClinic Supports Accuracy, Contin...
byEasy Clinic
 
PPTX
How Swiggy Assure Scaled B2B Procurement for the HORECA Supply Chain
byIT IDOL Technologies
 
Healthcare Mobile App Development: Features & Benefits
byjoealwyn38
 
Driving Finance Growth with Business Central ERP
byNavision India
 
CatoCoin (CATO) – Smart Contract Security Audit Report by EtherAuthority
byEtherAuthority
 
Python Core Interview Cheat Sheet for a Senior Interview
byStanislav Lazarenko
 
DSD-INT 2025 Groundwater table lowering due to surface water lowering - Reusen
byDeltares
 
Hack&Verse Kick-off and infor session Event ppt
bysanidhyasahu1120
 
Build Smarter with Google: A Workshop on MediaPipe, Firebase, Gemini and Anti...
byvanshikaprakash05
 
DSD-INT 2025 iMOD Parallel coupler development plan - Verkaik
byDeltares
 
Problem Solving_20241203_220045_0000.pdf
bythakurayush00991
 
Lect 1 Number systems and base conversions. [Autosaved].pptx
byzainiman8511
 
Inside An AI Powered ERP System for Process Manufacturers
byBatchMaster Software Pvt. Ltd.
 
Introduction to Software Development and Modern Practices
byM Munim
 
Performance Engineering: New and Conflicting Trends
byAlexander Podelko
 
Building Strong IT Systems Using the Site Reliability Engineering
byAvekshaa Technologies
 
Best Way to Convert PST File to MBOX Format
bykyla142000
 
Cloud Engineering Services | Infysion Technologies
bysolutioninginfysion
 
Inside An AI Powered ERP System for Process Manufacturers
byBatchMaster Software Pvt. Ltd.
 
UAE-Based Insurer Transforms Operations with InsureEdge
byInsurance Tech Services
 
EMR Software for Pulmonology Clinics Why EasyClinic Supports Accuracy, Contin...
byEasy Clinic
 
How Swiggy Assure Scaled B2B Procurement for the HORECA Supply Chain
byIT IDOL Technologies
 

Design Principles for a High-Performance Smalltalk

  • 1.
    Design Principles fora High-Performance Smalltalk Dave Mason Toronto Metropolitan Universityi ©2022 Dave Mason
  • 2.
    Design Principles Large memories 64-bitand IEEE-768 Multi-core and threading Fast execution
  • 3.
    Design Principles Large memories 64-bitand IEEE-768 Multi-core and threading Fast execution
  • 4.
    Design Principles Large memories 64-bitand IEEE-768 Multi-core and threading Fast execution
  • 5.
    Design Principles Large memories 64-bitand IEEE-768 Multi-core and threading Fast execution
  • 6.
    Zag Smalltalk from-scratch implementation low-levelis implemented in Zig goal is to support existing OpenSmalltalk systems don’t want to rewrite userland!
  • 7.
    Zag Smalltalk from-scratch implementation low-levelis implemented in Zig goal is to support existing OpenSmalltalk systems don’t want to rewrite userland!
  • 8.
    Zag Smalltalk from-scratch implementation low-levelis implemented in Zig goal is to support existing OpenSmalltalk systems don’t want to rewrite userland!
  • 9.
    Zag Smalltalk from-scratch implementation low-levelis implemented in Zig goal is to support existing OpenSmalltalk systems don’t want to rewrite userland!
  • 10.
    Immediate Values 64 bit NaN-boxing double-floats,51-bit SmallInteger, Booleans, nil, Unicode characters, Symbols room for instances of any type with single 32-bit value
  • 11.
    Immediate Values 64 bit NaN-boxing double-floats,51-bit SmallInteger, Booleans, nil, Unicode characters, Symbols room for instances of any type with single 32-bit value
  • 12.
    Immediate Values 64 bit NaN-boxing double-floats,51-bit SmallInteger, Booleans, nil, Unicode characters, Symbols room for instances of any type with single 32-bit value
  • 13.
    Immediate Values 64 bit NaN-boxing double-floats,51-bit SmallInteger, Booleans, nil, Unicode characters, Symbols room for instances of any type with single 32-bit value
  • 14.
    S+E F FF Type 0000 0000 0000 0000 double +0 0000-7FEF xxxx xxxx xxxx double (positive) 7FF0 0000 0000 0000 +inf 7FF0-F xxxx xxxx xxxx NaN (unused) 8000 0000 0000 0000 double -0 8000-FFEF xxxx xxxx xxxx double (negative) FFF0 0000 0000 0000 -inf FFF0-5 xxxx xxxx xxxx NaN (currently unused) FFF6 xxxx xxxx xxxx heap object FFF7 0001 xxxx xxxx reserved (tag = Object) FFF7 0002 xxxx xxxx reserved (tag = SmallInteger) FFF7 0003 xxxx xxxx reserved (tag = Double) FFF7 0004 0001 0000 False FFF7 0005 0010 0001 True FFF7 0006 0100 0002 UndefinedObject FFF7 0007 aaxx xxxx Symbol FFF7 0008 00xx xxxx Character FFF8-F xxxx xxxx xxxx SmallInteger FFF8 0000 0000 0000 SmallInteger minVal FFFC 0000 0000 0000 SmallInteger 0 FFFF FFFF FFFF FFFF SmallInteger maxVal
  • 15.
    Multi-core support only wayto speed up applications minimal blocking computational/mutator threads - typically 1 per core I/O threads - one per open “file” global collector thread
  • 16.
    Multi-core support only wayto speed up applications minimal blocking computational/mutator threads - typically 1 per core I/O threads - one per open “file” global collector thread
  • 17.
    Multi-core support only wayto speed up applications minimal blocking computational/mutator threads - typically 1 per core I/O threads - one per open “file” global collector thread
  • 18.
    Multi-core support only wayto speed up applications minimal blocking computational/mutator threads - typically 1 per core I/O threads - one per open “file” global collector thread
  • 19.
    Multi-core support only wayto speed up applications minimal blocking computational/mutator threads - typically 1 per core I/O threads - one per open “file” global collector thread
  • 20.
    Memory management mutator threads copyingcollector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
  • 21.
    Memory management mutator threads copyingcollector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
  • 22.
    Memory management mutator threads copyingcollector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
  • 23.
    Memory management mutator threads copyingcollector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
  • 24.
    Memory management mutator threads copyingcollector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
  • 25.
    Memory management mutator threads copyingcollector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
  • 26.
    Memory management mutator threads copyingcollector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
  • 27.
    Memory management mutator threads copyingcollector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
  • 28.
    Memory management mutator threads copyingcollector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
  • 29.
    Memory management mutator threads copyingcollector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
  • 30.
    Memory management mutator threads copyingcollector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
  • 31.
    Memory management mutator threads copyingcollector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
  • 32.
    Memory management mutator threads copyingcollector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
  • 33.
    Memory management mutator threads copyingcollector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
  • 34.
    Memory management mutator threads copyingcollector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
  • 35.
    Memory management mutator threads copyingcollector private nursery (includes stack) 2 teen arenas - n copies before promotion when prompted, finds next 100 refs to global stack, then blocks, repeat then can proceed I/O threads maintains list of current shared buffers while I/O blocked global collector thread non-moving mark/sweep arena periodically does mark marks known shared structures (class table, symbol table, dispatch tables) asks mutators for global roots processes them until all roots have been found then can proceed to sweep ...
  • 36.
    ... Memory management globalcollector for non-moving mark-&-sweep uses Fibonacci heap (similar to Mist) large objects (e.g. 16Kib) have separately mapped pages (allows mmap of large files) to minimize memory creep
  • 37.
    ... Memory management globalcollector for non-moving mark-&-sweep uses Fibonacci heap (similar to Mist) large objects (e.g. 16Kib) have separately mapped pages (allows mmap of large files) to minimize memory creep
  • 38.
    ... Memory management globalcollector for non-moving mark-&-sweep uses Fibonacci heap (similar to Mist) large objects (e.g. 16Kib) have separately mapped pages (allows mmap of large files) to minimize memory creep
  • 39.
    Heap objects header Bits WhatCharacteristics 12 length number of long-words beyond the header 4 age 0 - nursery, 1-7 teen, 8+ global 8 format 24 identityHash 16 classIndex LSB recognize pointer-free instance variables and arrays separately length of 4095 - forwarding pointer - copying, become:, promoted format is somewhat similar to SPUR encoding - various-sized non-object arrays strings stored in UTF-8
  • 40.
    Heap objects header Bits WhatCharacteristics 12 length number of long-words beyond the header 4 age 0 - nursery, 1-7 teen, 8+ global 8 format 24 identityHash 16 classIndex LSB recognize pointer-free instance variables and arrays separately length of 4095 - forwarding pointer - copying, become:, promoted format is somewhat similar to SPUR encoding - various-sized non-object arrays strings stored in UTF-8
  • 41.
    Heap objects header Bits WhatCharacteristics 12 length number of long-words beyond the header 4 age 0 - nursery, 1-7 teen, 8+ global 8 format 24 identityHash 16 classIndex LSB recognize pointer-free instance variables and arrays separately length of 4095 - forwarding pointer - copying, become:, promoted format is somewhat similar to SPUR encoding - various-sized non-object arrays strings stored in UTF-8
  • 42.
    Heap objects header Bits WhatCharacteristics 12 length number of long-words beyond the header 4 age 0 - nursery, 1-7 teen, 8+ global 8 format 24 identityHash 16 classIndex LSB recognize pointer-free instance variables and arrays separately length of 4095 - forwarding pointer - copying, become:, promoted format is somewhat similar to SPUR encoding - various-sized non-object arrays strings stored in UTF-8
  • 43.
    Heap objects header Bits WhatCharacteristics 12 length number of long-words beyond the header 4 age 0 - nursery, 1-7 teen, 8+ global 8 format 24 identityHash 16 classIndex LSB recognize pointer-free instance variables and arrays separately length of 4095 - forwarding pointer - copying, become:, promoted format is somewhat similar to SPUR encoding - various-sized non-object arrays strings stored in UTF-8
  • 44.
    Unified dispatch single levelof hashing for method dispatch each class dispatch table has entry for every method it has been sent - regardless of place in hierarchy near-perfect hash using Φ hashing standard SPUR/OpenVM optimizations don’t work well in multi-core environments
  • 45.
    Unified dispatch single levelof hashing for method dispatch each class dispatch table has entry for every method it has been sent - regardless of place in hierarchy near-perfect hash using Φ hashing standard SPUR/OpenVM optimizations don’t work well in multi-core environments
  • 46.
    Unified dispatch single levelof hashing for method dispatch each class dispatch table has entry for every method it has been sent - regardless of place in hierarchy near-perfect hash using Φ hashing standard SPUR/OpenVM optimizations don’t work well in multi-core environments
  • 47.
    Unified dispatch single levelof hashing for method dispatch each class dispatch table has entry for every method it has been sent - regardless of place in hierarchy near-perfect hash using Φ hashing standard SPUR/OpenVM optimizations don’t work well in multi-core environments
  • 48.
    High performance Inlining referencesto self / super code are inlined methods with small number of implementations are inlined - rather than heuristic prevents creation of many blocks provides large compilation units for optimization
  • 49.
    High performance Inlining referencesto self / super code are inlined methods with small number of implementations are inlined - rather than heuristic prevents creation of many blocks provides large compilation units for optimization
  • 50.
    High performance Inlining referencesto self / super code are inlined methods with small number of implementations are inlined - rather than heuristic prevents creation of many blocks provides large compilation units for optimization
  • 51.
    High performance Inlining referencesto self / super code are inlined methods with small number of implementations are inlined - rather than heuristic prevents creation of many blocks provides large compilation units for optimization
  • 52.
    Code Generation no interpreter,3 code generation models threaded-execution method is sequence of Zig function addresses uses Zig tail-call-elimination - passes pc, sp, hp, thread, context primitives and control implementations stand-alone generator generates Zig code for methods depends on Zig inlining and excellent code generation JIT future LLVM jitter
  • 53.
    Code Generation no interpreter,3 code generation models threaded-execution method is sequence of Zig function addresses uses Zig tail-call-elimination - passes pc, sp, hp, thread, context primitives and control implementations stand-alone generator generates Zig code for methods depends on Zig inlining and excellent code generation JIT future LLVM jitter
  • 54.
    Code Generation no interpreter,3 code generation models threaded-execution method is sequence of Zig function addresses uses Zig tail-call-elimination - passes pc, sp, hp, thread, context primitives and control implementations stand-alone generator generates Zig code for methods depends on Zig inlining and excellent code generation JIT future LLVM jitter
  • 55.
    Code Generation no interpreter,3 code generation models threaded-execution method is sequence of Zig function addresses uses Zig tail-call-elimination - passes pc, sp, hp, thread, context primitives and control implementations stand-alone generator generates Zig code for methods depends on Zig inlining and excellent code generation JIT future LLVM jitter
  • 56.
    Code Generation no interpreter,3 code generation models threaded-execution method is sequence of Zig function addresses uses Zig tail-call-elimination - passes pc, sp, hp, thread, context primitives and control implementations stand-alone generator generates Zig code for methods depends on Zig inlining and excellent code generation JIT future LLVM jitter
  • 57.
    Code Generation no interpreter,3 code generation models threaded-execution method is sequence of Zig function addresses uses Zig tail-call-elimination - passes pc, sp, hp, thread, context primitives and control implementations stand-alone generator generates Zig code for methods depends on Zig inlining and excellent code generation JIT future LLVM jitter
  • 58.
    Code Generation no interpreter,3 code generation models threaded-execution method is sequence of Zig function addresses uses Zig tail-call-elimination - passes pc, sp, hp, thread, context primitives and control implementations stand-alone generator generates Zig code for methods depends on Zig inlining and excellent code generation JIT future LLVM jitter
  • 59.
    Code Generation no interpreter,3 code generation models threaded-execution method is sequence of Zig function addresses uses Zig tail-call-elimination - passes pc, sp, hp, thread, context primitives and control implementations stand-alone generator generates Zig code for methods depends on Zig inlining and excellent code generation JIT future LLVM jitter
  • 60.
    Code Generation no interpreter,3 code generation models threaded-execution method is sequence of Zig function addresses uses Zig tail-call-elimination - passes pc, sp, hp, thread, context primitives and control implementations stand-alone generator generates Zig code for methods depends on Zig inlining and excellent code generation JIT future LLVM jitter
  • 61.
    Code Generation no interpreter,3 code generation models threaded-execution method is sequence of Zig function addresses uses Zig tail-call-elimination - passes pc, sp, hp, thread, context primitives and control implementations stand-alone generator generates Zig code for methods depends on Zig inlining and excellent code generation JIT future LLVM jitter
  • 62.
    Code Generation no interpreter,3 code generation models threaded-execution method is sequence of Zig function addresses uses Zig tail-call-elimination - passes pc, sp, hp, thread, context primitives and control implementations stand-alone generator generates Zig code for methods depends on Zig inlining and excellent code generation JIT future LLVM jitter
  • 63.
    Conclusions while the intentof this paper is to provide design principles, also described some implementation this is preliminary work, so some open questions many experiments to run to validate my intuitions
  • 64.
    Conclusions while the intentof this paper is to provide design principles, also described some implementation this is preliminary work, so some open questions many experiments to run to validate my intuitions
  • 65.
    Conclusions while the intentof this paper is to provide design principles, also described some implementation this is preliminary work, so some open questions many experiments to run to validate my intuitions
  • 66.