Free Republic
Browse · Search
General/Chat
Topics · Post Article

Skip to comments.

No, it’s not always quicker to do things in memory (computer)
ITworld ^ | March 25, 2015 | Phil Johnson

Posted on 03/26/2015 8:27:11 PM PDT by Utilizer

click here to read article


Navigation: use the links below to view more comments.
first previous 1-2021-4041-6061-68 last
To: Squawk 8888

Yes, they are faster than hard disks. And they are reliable enough, now.


61 posted on 03/30/2015 7:59:37 PM PDT by mbj
[ Post Reply | Private Reply | To 33 | View Replies]

To: tacticalogic

What if there’s little contention because you use queuing (a bus) and also scale out?

What if your algorithm is smart enough to somehow prevent contention?


62 posted on 03/30/2015 8:06:12 PM PDT by mbj
[ Post Reply | Private Reply | To 54 | View Replies]

To: Utilizer

Anyone who uses a buffered database knows this is nonsense.


63 posted on 03/30/2015 8:08:20 PM PDT by AppyPappy (If you are not part of the solution, there is good money to be made prolonging the problem.)
[ Post Reply | Private Reply | To 1 | View Replies]

To: mbj
I don't know how you'd do that unless you could reliable predict what other process are going to run along side it, and what resources they're going to require.

You might be able to adjust for contention, allocating more space to write buffers when the disk queue length increases but memory is available.

64 posted on 03/30/2015 8:12:07 PM PDT by tacticalogic ("Oh, bother!" said Pooh, as he chambered his last round.)
[ Post Reply | Private Reply | To 62 | View Replies]

To: tacticalogic

Maybe scale out and have a separate dedicated server machines, like the BigData solutions? (Hadoop and so on...) Connect multiple machines with a fast fiber optic back plane.

SANs, after all, partition loads in exactly this fashion with LUNs, right? That’s why they can handle more throughput, right?

As far as adjusting for contention, why not use something that partitions the writes based on some natural key in the data?


65 posted on 03/30/2015 8:21:57 PM PDT by mbj
[ Post Reply | Private Reply | To 64 | View Replies]

To: mbj
Sure, you can throw more resources at it, (procs, memory, and disk channels), but in a real world scenario if you're adding more hardware you're probably adding more load to go with it.

I think the bottom line is that there's is not a "one size fits all" answer to the question.

66 posted on 03/30/2015 8:28:47 PM PDT by tacticalogic ("Oh, bother!" said Pooh, as he chambered his last round.)
[ Post Reply | Private Reply | To 65 | View Replies]

To: AppyPappy

Maybe not for this specific scenario: writing the same string over and over. In fact, concatenating the same string, over and over.

After all, don’t many disk controllers (most in fact?) have their own onboard caching mechanism, including a write caching mechanism?

And isn’t it possible that the controller might in fact be able to operate in parallel with the CPU, with this specific scenario? Isn’t there an assembler command under the old DOS that used to use interrupt 25H that allowed writing sectors and would in fact write more than one sector with the same buffer?

Therefore if the *same* write command (with the same untouched buffer) were repeated over and over, perhaps there is in fact some truth to this.


67 posted on 03/30/2015 8:30:15 PM PDT by mbj
[ Post Reply | Private Reply | To 63 | View Replies]

To: mbj

Huh? What?


68 posted on 03/30/2015 8:53:53 PM PDT by Born to Conserve
[ Post Reply | Private Reply | To 60 | View Replies]


Navigation: use the links below to view more comments.
first previous 1-2021-4041-6061-68 last

Disclaimer: Opinions posted on Free Republic are those of the individual posters and do not necessarily represent the opinion of Free Republic or its management. All materials posted herein are protected by copyright law and the exemption for fair use of copyrighted works.

Free Republic
Browse · Search
General/Chat
Topics · Post Article

FreeRepublic, LLC, PO BOX 9771, FRESNO, CA 93794
FreeRepublic.com is powered by software copyright 2000-2008 John Robinson