[REQUEST FOR CODE INTEGRATION - L4.25-L5.05] Parallelization and binary trees with huge dimensions

[abhja kaanlani]

When I have time I’ll have to read a few books and dig into the latest kernel to really understand what the Linux kernel is, but during that procrastination 





I want to rewrite the Linux scheduler using my code, it’s basically a binary tree with a bunch of fixed variables with a rotating DMA that cleans up excess pointers. It can be used as an integrated SQL database (because of char*’s and binary trees) and depending on what multidimension you init the arrays, it will take huge amounts of ram


You can easily go up one indice by adding a number to the indice that makes the array go up, im sorry its med time for me


But my intentions is to make my code its own operating system. The Quantum moniker is a marketing buzzword, its really made for binary trees with HUGE dimensions (im talking about bt[200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200][200]; (sorry if thats spammy)


If this isnt relevant to the Linux kernel, please disregard


My code is at GitHub, at unidef/quantum


for convenience: git clone https://github.com/unidef/quantum qwork/


I appreciate any feedback, and I would love to be actively involved in Linux kernel development



Also just like in EQ2, Linux could use a really memory hungry mode, I have 32gb of ram on all my computers and multitasking (especially in Linux) is really, really fun!


Abja