Filter
Exclude
Time range
-
Near
๐Ÿ”ง Sessions covered low-level and peephole optimizations, illustrating how backend compilers refine instruction selection, remove redundant loads/stores and unreachable code, and apply algebraic simplifications and strength reduction for faster machine code. #CompilerOptimization
1
18
Thrilled to see SlimeCompiler hit Zenodo today! ๐Ÿš€ Hiroshi Sasaki's groundbreaking paper applies noncommutative ring theory to compilersโ€”mapping instructions to ring elements & using commutators [A,B]=AB-BA to prove when ops commute (order-free for reordering/parallelization) vs. don't (flagging bugs & races). Key wins: 1.5-3x speedups via algebraic guarantees. 50% fewer order bugs, 80% concurrency fixes. LLVM integration for real-world impact. Extends SlimeTree ecosystem: "When roles are marked, order is redundant." Dive in: zenodo.org/records/17946400 #SlimeCompiler #CompilerOptimization #RingTheory #AI #LLVM #Parallelization
1
2
92
SlimeCompilerใŒZenodoใซใ‚ขใƒƒใƒ—๏ผ ๐Ÿš€ ไฝใ€…ๆœจๅฎ่‡ณใฎ็”ปๆœŸ็š„ใช่ซ–ๆ–‡ใ€้žๅฏๆ›็’ฐ็†่ซ–ใ‚’ใ‚ณใƒณใƒ‘ใ‚คใƒฉใซๅฟœ็”จโ€”ๅ‘ฝไปคใ‚’็’ฐ่ฆ็ด ใซใƒžใƒƒใƒ”ใƒณใ‚ฐใ—ใ€ไบคๆ›ๅญ[A,B]=AB-BAใงๆผ”็ฎ—ใŒๅฏๆ›๏ผˆ้ †ๅบ็„ก่ฆ–ใงๅ†้…็ฝฎ/ไธฆๅˆ—ๅŒ–ๅฏ่ƒฝ๏ผ‰ใ‹้žๅฏๆ›๏ผˆใƒใ‚ฐ/ใƒฌใƒผใ‚นๆคœ็Ÿฅ๏ผ‰ใ‚’่จผๆ˜Žใ€‚ ไธปใชๆˆๆžœ: ไปฃๆ•ฐ็š„ไฟ่จผใง1.5-3ๅ€้ซ˜้€ŸๅŒ–ใ€‚ ้ †ๅบใƒใ‚ฐ50%ๆธ›ใ€ไธฆ่กŒใƒใ‚ฐ80%ๅ‰Šๆธ›ใ€‚ LLVM็ตฑๅˆใงๅฎŸไธ–็•Œใ‚คใƒณใƒ‘ใ‚ฏใƒˆใ€‚ SlimeTreeใ‚จใ‚ณใ‚ทใ‚นใƒ†ใƒ ๆ‹กๅผต: ใ€Œๅฝนๅ‰ฒใŒใƒžใƒผใ‚ฏใ•ใ‚Œใ‚Œใฐใ€้ †ๅบใฏๅ†—้•ทใ€ใ€‚ ่ฉณ็ดฐ: zenodo.org/records/17946400 #SlimeCompiler #CompilerOptimization #RingTheory #AI #LLVM #Parallelization
1
5
130
โš™๏ธ The core session focused on SSAPRE (SSA-based Partial Redundancy Elimination), exploring RCVs, ฮฆ-insertion, renaming, and analyses like down-safety & availability. Hands-on labs reinforced systematic elimination of redundant computations. #CompilerOptimization #SSAPRE
26
This research introduces Evolution of Kernels (EoK), a new way to automatically design efficient code for RISC-V chips using artificial intelligence. EoK learns from past successful code designs and uses this knowledge to create even better code. It was tested on 80 different coding challenges and showed impressive results compared to other methods. This could lead to faster and more powerful software running on RISC-V devices in the future. #RISCV #AI #CompilerOptimization arxiv.org/abs/2509.14265 #ArtificialIntelligence
1
1
17
We are delighted to welcome Dr. Sorav Bansal โ€” Graviton Fellow at Graviton Research Capital LLP and Professor at IIT Delhi โ€” as a keynote speaker at IICT 2025. His talk, ๐ˆ๐ฆ๐š๐ ๐ข๐ง๐ข๐ง๐  ๐š ๐๐ž๐ฑ๐ญ-๐†๐ž๐ง๐ž๐ซ๐š๐ญ๐ข๐จ๐ง ๐’๐ฎ๐ฉ๐ž๐ซ๐จ๐ฉ๐ญ๐ข๐ฆ๐ข๐ณ๐ž๐ซ, will open new perspectives on the future of compiler optimization. ๐Ÿ”— Learn more about Dr. Bansalโ€™s work: sorav.compiler.ai ๐Ÿ“ Join us at IISc Bangalore | Sept 27โ€“28, 2025 ๐ŸŒ Event details: compilertech.org #IICT2025 #KeynoteTalk #CompilerTech #IITDelhi #Superoptimization #CompilerOptimization #TechConference #ACMIndia #IIScBangalore
1
5
217
2 Aug 2025
Day 43: Started working on optimizations. First up: constant folding โ€“ 3 5 becomes 8 at compile-time! #CompilerOptimization
2
45
๐–๐ž'๐ซ๐ž ๐ญ๐ก๐ซ๐ข๐ฅ๐ฅ๐ž๐ ๐ญ๐จ ๐ฐ๐ž๐ฅ๐œ๐จ๐ฆ๐ž ๐ƒ๐ซ. ๐ƒ๐ข๐›๐ฒ๐ž๐ง๐๐ฎ ๐ƒ๐š๐ฌ ๐ญ๐จ ๐ญ๐ก๐ž ๐ˆ๐ˆ๐‚๐“ ๐Ÿ๐ŸŽ๐Ÿ๐Ÿ“ ๐๐ซ๐จ๐ ๐ซ๐š๐ฆ ๐‚๐จ๐ฆ๐ฆ๐ข๐ญ๐ญ๐ž๐ž! As a Senior Principal Engineer at Intel, Dr. Das brings exceptional expertise in program analysis and compiler technology, with deep knowledge in areas such as SSA form and DJ-graphs. His insights will play a key role in shaping a high-quality technical program. ๐Ÿ“… September 27โ€“28, 2025 ๐Ÿ”— Learn more: compilertech.org/ #IICT2025 #CompilerTech #ProgramCommittee #Intel #ProgrammingLanguages #CompilerOptimization #TechConference #ACMIndia #IISCBangalore
1
84
8 Jul 2025
The internal execution process of JavaScript's V8 engine exhibits considerable unpredictability. Even when running a simple single-line script like console.log("hello world"), the internal execution flow shows significant variations each time. This goes well beyond mere address randomization - even the called VM C functions can vary substantially. This reminds me of LuaJIT, which behaves similarly. In LuaJIT's case, randomness was deliberately added to increase the chances of hitting more efficient code paths. Of course, another reason is security (the more unpredictable the behavioral details are, the more secure it becomes). #JavaScript #V8Engine #LuaJIT #ProgrammingLanguages #SoftwareSecurity #CompilerOptimization #TechEngineering
136
4 Jul 2025
The V8 engine authors designed their own "mini-language" called Torque, which has TypeScript-like syntax and can automatically generate part of the virtual machine (VM) implementation during V8's build process. The Torque compiler generates a large amount of C code, which then internally generates the corresponding assembly code. Several hundred large C compilation units in the VM are generated this way. It's quite an interesting design approach. However, debugging this automatically generated C code and the resulting assembly code isn't quite as pleasant! Clearly, even V8's developers got tired of writing too much tedious C code. Programs that write programs can always be much more convenient. This reminds me of how LuaJIT's author also designed his own dynamic high-level assembly language called DynAsm, which he used to hand-craft LuaJIT's interpreter implementation. I (and some other folks) have also used this mini-language to implement some simple JIT compilers, which was quite interesting. DynAsm operates directly at the machine code level, making it a much lower level than Torque - even significantly lower level than C. #V8Engine #JavaScript #Torque #CompilerDesign #ProgrammingLanguages #LuaJIT #DynAsm #JITCompiler #CodeGeneration #SystemProgramming #VirtualMachine #CPlusPlus #TechnicalComputing #CompilerOptimization #LowLevelProgramming
162
10 Dec 2024
5/19 Many believe that -O3 always produces faster code than -O2. However, studies show little statistical difference, especially in Clang. Benchmarking is essential to determine the best optimization level. #CompilerOptimization โฌ‡๏ธ
1
12