lists.openwall.net   lists  /  announce  owl-users  owl-dev  john-users  john-dev  passwdqc-users  yescrypt  popa3d-users  /  oss-security  kernel-hardening  musl  sabotage  tlsify  passwords  /  crypt-dev  xvendor  /  Bugtraq  Full-Disclosure  linux-kernel  linux-netdev  linux-ext4  linux-hardening  linux-cve-announce  PHC 
Open Source and information security mailing list archives
 
Hash Suite: Windows password security audit tool. GUI, reports in PDF.
[<prev] [next>] [day] [month] [year] [list]
Message-ID: <BYAPR02MB570463AFB1E4D5DDCB6FEA3983FC0@BYAPR02MB5704.namprd02.prod.outlook.com>
Date:   Fri, 28 Jun 2019 02:09:53 +0000
From:   abhja kaanlani <unidef_rogue@...e.com>
To:     "torvalds@...ux-foundation.org" <torvalds@...ux-foundation.org>,
        "linux-kernel@...r.kernel.org" <linux-kernel@...r.kernel.org>
Subject: Effect of multidimensional arrays on the Linux kernel?

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

Powered by blists - more mailing lists

Powered by Openwall GNU/*/Linux Powered by OpenVZ