LWN.net Logo

latency can be hidden with enough parallelism

latency can be hidden with enough parallelism

Posted Nov 15, 2007 2:52 UTC (Thu) by elanthis (guest, #6227)
In reply to: latency can be hidden with enough parallelism by stevenj
Parent article: Memory part 8: Future technologies

I imagine you could get quite a huge performance boost out of many applications by just
writing them to not be so inefficient.  That being one of the primary purposes of this series
of articles.  A lot of modern software blows through cycles completely needlessly.  This has
gone on because of the increase in processor speed - software could expand to fill the
available increase in speed and reduce the complexity of the software in the process.  Now
that the choice is between the complexity of efficient software designs or the complexity of
intense parallelism, maybe we'll see a shift back towards efficient code instead of
quickly-written code.

Then again, probably not - it seems like it might end up being easier to make simple tools for
parallel code than educating developers to write efficient code. :/

Call me crazy, but I take pride in being able to write single-threaded daemons that outperform
heavily threaded implementations for even moderately high workloads. :p


(Log in to post comments)

latency can be hidden with enough parallelism

Posted Nov 20, 2007 2:42 UTC (Tue) by nagual_sorcerer (guest, #49143) [Link]

    You are not crazy.:) But when there are multiple cpu cores, you still write single
threaded daemons? Or just one thread per cpu core? I don't know if that goes faster, or there
is some other way of doing things faster?

Copyright © 2013, Eklektix, Inc.
Comments and public postings are copyrighted by their creators.
Linux is a registered trademark of Linus Torvalds