Optimizing Your Code Execution: Case Study: Run-time...
summary
Built a LabVIEW runtime spellchecker and benchmarks real options: dictionary file of 76,976 words, test text of 67,341 words, 1,000 iterations per test. Binary file read is fastest, pick‑line is disastrously slow, sorted-array lookup beats database joins and variants for lookups. Precomputing Norvig edits costs ~19 minutes and naive full Levenshtein takes ~22 minutes, while symmetric delete precompute is ~21 seconds and a live correction returns in ~337 ms. Code is benchmarked on 32‑bit LabVIEW with SQLite and array/set primitives.
AI-written summary · about
chapters (13)
- 0:00Introduction
- 2:47Optimization categories
- 8:24Case study: Spell checker
- 11:31Game rules and scoring
- 13:44Round 1: Reading dictionary
- 17:21Round 2: Splitting words
- 21:26Round 3: Loading dictionary
- 23:54Round 4: Removing punctuation
- 28:39Round 5: Splitting text
- 31:10Round 6: Word lookups
- 34:49Preliminary scores
- 37:02Bonus round: Suggestions
- 46:45Summary and future
related talks
14mGreen Code Experiments
42mPractical Optimizations
37mRock Your Code Code and App Performance for Microsoft .Net
01h 29mWhen Nanoseconds Matter: Ultrafast Trading Systems in C++
47mBenchmarking C++, From video games to algorithmic trading
42mMeasure Twice, Optimize Once: Real-World .NET Profiling with Visual Studio
01h 02mFastware
26mHolistic Performance