Memory allocation optimized bitwise

[Ricky58]

Does any one know if there is an allocation that can be optimized in terms of bits?

Usually, when I declare int i = 5, for example, I use only 3 bits of the 32 (or 64). Is there any allocation function that can be used to retrieve the remaining 29 bits for other benefits? Having already tried without much success I plan to write this feature myself, but that seems rather complicated, because I would use masks to retrieve the values stored in a memory word. What do you think?

[Zecho]

If you want to lose your time, you can use a char a minimum size of 8 bits (not 32). Also if you want to lose your time, you can have fun by using bit masks and shifts. In any case, I doubt very much that you can have rough int aligned.

[Ricky58]

For a simulator of distributed neural network. The goal is to run a maximum of neurons on each machine.

So do you think it's something difficult and unnecessary? Is there anyone who think that it is feasible? The solution that I would store a number mask (from 1 to 36 for one byte, for example) to use for each benefit, but it seems a little heavy. Do you have ideas to propose to me?

[Zecho]

I think that in the first place, a memory that would be more profitable. If there has ever been and that the code is consistent, then that is definitely memory leaks, or releases ever made, or unnecessarily greedy algorithms. Correct can improve things at lower costs (in addition to stabilize the product).

Then, if you are already distributed and you have already pulled the string, then it is only cutting into smaller tasks for lots more severe. Along with a good task scheduler is a more pay in any case it was with us.