Reading Jia-Wei Hong and H. T. Kung, I/O Complexity: The Red-Blue Pebble Game , STOC 1981, pp. 326–333. Original paper Imagine an infinitely fast processor whose workbench holds only ten numbers. To p…
Louis Aeilot's Blog 的其他文章
- How Close Is FlashAttention to the Limit? Understanding Attention Through Data Movement
- Beyond FLOPs: How COSMA Builds Parallel Matrix Multiplication from Communication Bounds
- Git Needs a Trash Can
- RoPE: Properties, Patterns, and Long-Context Behavior
- CS336 Assignment 1: Large Language Model Training and Inference
讨论
登录后参与讨论
还没有评论,来说第一句吧。