[vox] Moore's law coming to an end

[Eric Rasmussen]

Haskell is definitely worth a look for parallel programming. In a
nutshell, Haskell separates code with side effects from "pure" code in
a way that isn't possible with imperative languages. When you're
dealing with pure data structures it's actually very easy to take
advantage of parallel processing:
http://www.haskell.org/haskellwiki/Haskell_in_5_steps

Most languages support concurrent (multi-threaded) programming, but
that doesn't always translate well to parallel (multi-core)
processing.

-Eric, Haskell evangelist


On Tue, Nov 8, 2011 at 10:07 AM, Brian Lavender <brian at brie.com> wrote:
>
> My point is that single threaded programming models we so often depend upon
> will come to an end because we will have to program more so in parallel.
> I am saying that we will see a growth of language development to better
> address concurrent programming.
>
> brian
>
> On Mon, Nov 07, 2011 at 09:41:54PM -0800, Alex Mandel wrote:
> > The wikipedia peanut gallery seems to agree/disagree and it all depends
> > on your definition of what Moore's law really means. If you talk about
> > the literal definition of the shrinking of transistors, that end may
> > come at some pt, but that doesn't mean transistors won't be replaced by
> > something else or that performance will still grow at the same rate due
> > to other methods. Personally I like the point on the page that now that
> > transistors have gotten so small you can start making bigger chips that
> > pack more in.
> > http://en.wikipedia.org/wiki/Moore%27s_law
> >
> > Enjoy,
> > Alex
> >
> > On 11/07/2011 03:58 PM, Darth Borehd wrote:
> > > People have been saying its coming to an end for years.  It hasn't happened
> > > yet and I doubt it ever will.
> > >
> > >
> > > On 7 November 2011 11:36, Brian Lavender <brian at brie.com> wrote:
> > >
> > >> As Moore's Law comes to a close, it appears that we will see more
> > >> concurrent programming!
> > >> Simple Concurrent Object-Oriented Programming (SCOOP) looks very
> > >> interesting.
> > >> http://docs.eiffel.com/book/solutions/concurrent-eiffel-scoop
> > >>
> > >> I have long been an admirer of Eiffel, but I have yet to work with it in
> > >> detail.
> > >>
> > >> brian
> > >> --
> > >> Brian Lavender
> > >> http://www.brie.com/brian/
> > >>
> > >> "There are two ways of constructing a software design. One way is to
> > >> make it so simple that there are obviously no deficiencies. And the other
> > >> way is to make it so complicated that there are no obvious deficiencies."
> > >>
> > >> Professor C. A. R. Hoare
> > >> The 1980 Turing award lecture
> >
> > _______________________________________________
> > vox mailing list
> > vox at lists.lugod.org
> > http://lists.lugod.org/mailman/listinfo/vox
>
> --
> Brian Lavender
> http://www.brie.com/brian/
>
> "There are two ways of constructing a software design. One way is to
> make it so simple that there are obviously no deficiencies. And the other
> way is to make it so complicated that there are no obvious deficiencies."
>
> Professor C. A. R. Hoare
> The 1980 Turing award lecture
> _______________________________________________
> vox mailing list
> vox at lists.lugod.org
> http://lists.lugod.org/mailman/listinfo/vox