Concurrent Languages
WS Presentations Main Page
Next:
Concurrent Languages
Up:
Document: tut
Previous:
Non-strict independence (examples)
Concurrent Languages
Seen so far: ``program parallelization.''
Alternative: writing directly a concurrent program
(in e.g., CC, AKL, &-Prolog/
Ciao
-Prolog, etc.).
Example:
p(X) :- tell(X=[a|T]), p(T). q(X) :- ask(X=[N|T]) -> q(T).
Some issues:
Combination with nondeterminism.
Sequential operators.
Atomic tell vs. eventual tell.
etc.
Analysis problem in principle more complex than for sequential programs: important challenge.
Analysis issues:
General frameworks. [Pisa, SICS, Soton]
Deadlock detection. [Pisa]
Program analysis for optimization. [Pisa]
Schedule / granularity analysis. [Soton]
Analysis of AKL. [SICS]
etc.
Thu Jan 18 11:21:33 MET 1996
<herme@fi.upm.es>
-
<webmaster@clip.dia.fi.upm.es>