Instead of reading books I decided to screw around on the internet (sad face) , I don’t know much about kernel development but I have been writing in C for about 15 years
But let’s say you have a data structure that holds information about a io structure, and we take it to 2 arrays to 2 dimension, making a matrice or some sort of graph A function organizes it by char *description, and an ID system, like PIDS, I know it’ll consume a lot of ram but it provides a layer of parallization, and can be used as a cache Does this sound plausible? I have to go read that Linux kernel book, my intent was to rewrite the scheduler so here I go Thank you for reading Unidef Sent from my iPhone
