{"id":183759,"date":"2026-10-12T16:53:43","date_gmt":"2026-10-12T14:53:43","guid":{"rendered":"https:\/\/prohoster.info\/blog\/news\/linus-torvalds-eksperimentiruet-s-generacziej-izmenenij-k-yadru-cherez-ai"},"modified":"2026-10-12T16:53:48","modified_gmt":"2026-10-12T14:53:48","slug":"linus-torvalds-experiments-with-ai-generated-kernel-changes","status":"publish","type":"post","link":"https:\/\/prohoster.info\/en\/blog\/news\/linus-torvalds-experiments-with-ai-generated-kernel-changes","title":{"rendered":"Linus Torvalds is experimenting with AI-driven kernel change generation.","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"
Linus Torvalds has prepared a set of patches for the memory management subsystem in the Linux kernel, implementing an optimization for reading small blocks of data from the page cache without an atomic change to the reference count (refcount) in the folio structure. The commit message indicates that the changes, related tests, and draft notes were created by the AI assistant Claude Code under Torvalds' supervision. The change has been added to a separate branch of the kernel named noref-filemap-read-with-llm, and it is still unclear whether it will be merged into the main branch or if this is merely an internal experiment.<\/p>\n
During testing, thanks to the patches, we were able to increase the read throughput of small files in the configuration with 8 threads from 9.9-10.4 to 30-33 million operations per second (a 3-fold increase); with 4 threads from 8.9-11.6 to 25-26 million\/sec (a 2-fold increase); and under single-threaded load from 7.9-8.1 to 8.8-8.9 million\/sec. The performance increase is explained by the fact that simultaneous access to the page cache creates severe competition among threads when accessing the cache. For example, when 8 threads attempt to read 16 bytes of data simultaneously, 99.92% of the time is spent not on reading itself, but on waiting for access to the reference counter.<\/p>\n
In the patch, to ensure data integrity, instead of setting individual locks, changing reference counts, or intermediate buffering, a workaround is used that employs deferred memory release with synchronization through the RCU (Read-Copy-Update) mechanism. The method proposed in the patch guarantees that a memory page will not be physically released until the reading thread has completed the data copy. \n Source: opennet.ru<\/a> <\/p>","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"excerpt":{"rendered":"