{"id":108902,"date":"2023-06-09T21:10:23","date_gmt":"2023-06-09T19:10:23","guid":{"rendered":"https:\/\/prohoster.info\/?p=108902"},"modified":"2023-06-13T09:45:19","modified_gmt":"2023-06-13T07:45:19","slug":"kompaniya-cisco-predlozhila-fajlovuyu-sistemu-puzzlefs-dlya-yadra-linux","status":"publish","type":"post","link":"https:\/\/prohoster.info\/en\/blog\/news\/kompaniya-cisco-predlozhila-fajlovuyu-sistemu-puzzlefs-dlya-yadra-linux","title":{"rendered":"Cisco has introduced the PuzzleFS file system for the Linux kernel","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"
Cisco has introduced a new file system, PuzzleFS, implemented as a module for the Linux kernel, written in Rust. The file system is designed for use with isolated containers and continues to develop the ideas proposed in the Atomfs file system. The implementation is currently at the prototype stage, supports building with the Linux kernel rust-next branch, and is open under the Apache 2.0 and MIT licenses. <\/p>\n
The project aims to circumvent the limitations that arise when using container images in the OCI (Open Container Initiative) format. PuzzleFS addresses issues such as efficient storage of duplicate data, direct mounting capability, repeatable image building, and safe memory operations. <\/p>\n
For deduplicating repeating data across different containers, the FastCDC (Fast Content-Defined Chunking) algorithm is employed, which works by breaking data into chunks of arbitrary size and maintaining an index with hashes of the processed chunks. Duplicate chunks are stored once and are jointly indexed for all layers of the file system, meaning that deduplication can span different mount points (a new file system layer can be started based on an existing one, utilizing the chunks of data it contains during deduplication). <\/p>\n
Repeatable image building for containers is achieved through defining a canonical representation of the container image format. Direct mounting allows the mounting of an OCI container image from a global shared storage without prior unpacking, using the content hash from the container manifest as an identifier. To verify data integrity in a shared storage environment, the fs-verity mechanism can be employed, which checks the conformity of specified hashes in the binary index with the actual content when accessing files. <\/p>\n
Rust is chosen for its combination of high performance in the resulting code and the ability to safely handle memory, which reduces the risk of vulnerabilities caused by issues such as accessing memory after it has been freed and buffer overflows. The application of Rust for the kernel module also allows for code sharing between the kernel and user-space components, creating a unified secure implementation. <\/p>\n
Among other goals of the project are very fast image building and mounting, the ability to use an optional intermediate stage for image transformation (canonicalization), the non-requirement of full passes through the FS tree in mtree style when using a layered structure, changes overlay in the style of casync, and a straightforward architecture to implement. \n Source: opennet.ru<\/a> <\/p>","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"excerpt":{"rendered":"