Re: question about tasks, multithreading and multi-cpu machines

On Thu, 16 Mar 2006 19:03:00 +0100, Jean-Pierre Rosen wrote:

Maciej Sobczak a écrit :

The difference between sequential and paraller execution of two
instructions (or blocks of instructions, but that's obvious) should be
addressed at the level of control structures, not types (nor objects).
This means that if I want to have these:

A := 7;
B := 8;

executed sequentially, then I write them sequentially - just like above
(I already see posts claiming that the compiler or CPU can reorder these
instructions, but that's not the point; if the instructions have
side-effects, then the sequence is really a sequence and I'm talking
about expressing the programmer's intents here).
Actually, in Occam you would write (syntax not guaranteed):
cobegin
A:=7;
and
B:=8;
coend;

Don't you use a "par" statement here?

PAR
A := 7
B := 8

<rant>
I have been thinking about the design of programming languages with
regard to efficient execution on parallel hardware. I find that
most languages are virtually useless for addressing any major
form of parallelism. Ada *is* helpful in addressing distributed
and MIMD/SMP architectures. But there is no lightweight syntax
for simple concurrency :( Occam had the right idea. VHDL is good
here too.

In VHDL, we simply write:

A <= 7;
B <= 8;
C <= FancyFunction (Z);

And all the assignments run concurrently (and continuously!).

I would like to have seen Ada 2005 address parallel programming better,
but the lack of real experience on highly parallel hardware is the
cause (and effect) of the poor state of the (parallel) hardware industry.
This vicious circle is a deadlock to industry prograss.

In addition to lightweight concurrent statements (like Occam, VHDL),
I'd like to see a decent data parallel syntax and paradigm (like ZPL,
Data Parallel C (ANSI X3J11.1 report), or HPF).

Finally, I'd like to see the ability to mark subprograms as "pure"
to indicate permission to implement memoization (caching), to
eliminate duplicated calls, reordering and concurrent execution.
This would provide semantics to facilitate Cilk-like multithreading.

A major part of programming in most programming languages is the
analysis and transcription of a problem into fully sequential
steps. But the main objective of hardware design is to turn
the sequential steps back into concurrent activity - whether it is
by hardware pipelining, speculative execution, multithreading (SMT),
or multiprocessing (SMP). The objective is also shared by compiler
writers trying to un-sequentialize programs, and extract vector
operations. What a waste!

Surely the failure of modern programming languages to expose
problem parallism directly is one of the main causes of the "heroics"
going on in processor design today, and the failure of supercomputer
design to innovate with efficient, cost-effective solutions?

Ada offers a sound technical basis for the language innovations necessary.

Unfortunately, parallel computing has become a "Cinderella" subject
over the decades of commercial and technical failures. Always
five years away from ubiquity. How can the deadlock be broken?
</rant>
--
Adrian
.

Relevant Pages

  • Re: question about tasks, multithreading and multi-cpu machines
    ... instructions should be addressed at the level of control structures, not types. ... executed sequentially, then I write them sequentially - just like above (I already see posts claiming that the compiler or CPU can reorder these instructions, but that's not the point; if the instructions have side-effects, then the sequence is really a sequence and I'm talking about expressing the programmer's intents here). ... task body T1 is ... Another model of concurrency is for performing concurrent tasks. ...
    (comp.lang.ada)
  • Re: Paul Grahams Arc is released today... what is the long term impact?
    ... It's not a matter of characters it is a ... What makes you think that language is not intimately related to history? ... programming in machine code? ... allows for treating a sequence of words as a single unit and yet somehow ...
    (comp.lang.lisp)
  • Re: optimation, a black art?
    ... instructions may be completely subsumed by slower running ones. ... scheduling or List scheduling) is analogous to PERTing - the problem ... To do this the compiler has to estimate where the value lies in the ... permutation generate the actual sequence of instructions following ...
    (comp.lang.lisp)
  • Re: optimation, a black art?
    ... instructions may be completely subsumed by slower running ones. ... To do this the compiler has to estimate where the value lies in the ... permutation generate the actual sequence of instructions following ...
    (comp.lang.lisp)
  • Re: "Mastering C Pointers"....
    ... A program is a stream of instructions (pretend they ... to store a word from a CPU register to memory. ... All the instructions only work on CPU registers. ... the programming world, which makes it very hard for novices. ...
    (comp.lang.c)