Australia doesn't have a "Bill of Rights". We work on the principle you have a right to everything, unless prohibited by law. There's no explicit listing of rights that you guys have.
Which do not impose constraints on the law, so every right could be denied by court.
It is very easy to overflow any amount of CAM/AM by using just matrix multiplication. For N^2 data items matrix multiplication produces N^3 multiplications that can be executed in parallel. So for reasonable N=1000 we get 10^9 multiplications, stored as 2*10^9 multiplicands in CAM.
We found a way to overcome that problem while I worked at IPMCE. We use "program time" to sort tokens out of the AM. Those that are "most far away in future" swapped out to free space for more needed ones. That way we control available parallelism and guarantee that tokens eventually meet their pairs so computation won't get stuck.
It's like "bubble sort" of tokens with a window instead of single element, so we called it sorting dataflow machine.
It is not unlike throttling which was used to control parallelism in CM-5/Id90 implementations (AFAIRC). The only difference is that usual dataflow throttling should be applied carefully as it is not guarantee computation progress (it can get stuck).
The model exhibits some architectural decisions to speed up the whole computation sorting process. Take a look at it as the source files are there (except they are in Haskell programming language;).
For first version of completely new architecture developed under three months of free time it worked pretty well. It do not stop, it sorts and it provides ~70% of "FPU" load in my testing tasks.
Slashdot Mirror
Which do not impose constraints on the law, so every right could be denied by court.
I don't think that's right.
And all programming is constructing proofs for whatever theorems our bosses throw at us.
That's my point of view.
I started lifting weights and now I'm either the smartest man or the strongest one.
(and I should note that lifting weights made me even more smart due to better body function.)
It's a hierarchy of unverses. ;)
And formal verification will point to all places where change should occur.
We lowly programmers often underestimate formal verification tools given to us as our languages type systems.
The hardest part for me is getting others to respect my zone. They just don't understand.
Somewhere in Russian area of Livejournal was an idea that programming very much like a dream while you sleeping.
If something wakes you up, you lose your dream and you have to sleep again to "watch it" (ie, to program).
This is the best explanation I ever heard.
Make these pictures automatically from very big (and slowly changing in time) alphabet so that bots will get hard time adapting to it.
Then you'll get two goals: CAPTCHA and high IQ audience.
It is very easy to overflow any amount of CAM/AM by using just matrix multiplication. For N^2 data items matrix multiplication produces N^3 multiplications that can be executed in parallel. So for reasonable N=1000 we get 10^9 multiplications, stored as 2*10^9 multiplicands in CAM.
We found a way to overcome that problem while I worked at IPMCE. We use "program time" to sort tokens out of the AM. Those that are "most far away in future" swapped out to free space for more needed ones. That way we control available parallelism and guarantee that tokens eventually meet their pairs so computation won't get stuck.
It's like "bubble sort" of tokens with a window instead of single element, so we called it sorting dataflow machine.
It is not unlike throttling which was used to control parallelism in CM-5/Id90 implementations (AFAIRC). The only difference is that usual dataflow throttling should be applied carefully as it is not guarantee computation progress (it can get stuck).
To verify our suggestions I developed a model of that architecture: http://thesz.mskhug.ru/browser/hiersort
The model exhibits some architectural decisions to speed up the whole computation sorting process. Take a look at it as the source files are there (except they are in Haskell programming language;).
For first version of completely new architecture developed under three months of free time it worked pretty well. It do not stop, it sorts and it provides ~70% of "FPU" load in my testing tasks.