Differences

This shows you the differences between two versions of the page.

--- paradigms [2007/09/17 20:42] – niloo59
+++ paradigms [2007/09/18 18:46] (current) – niloo59
@@ Line 1: / Line 1: @@
+====== Concurrency paradigms ======
+===== Parallel Programming Models and Paradigms =====
+http://www.buyya.com/cluster/v2chap1.pdf
 ===== Shared variables =====
@@ Line 5: / Line 8: @@
 E.W. Dijkstra. [[http://www.cs.utexas.edu/users/EWD/ewd01xx/EWD123.PDF|Cooperating Sequential Processes]]. EWD 123. 1968.
-Languages that exploit shared variables include Java.
+Languages that exploit shared variables include //Java//.
@@ Line 26: / Line 29: @@
 ===== Concurrent constraint programming =====
 An example of a language that exploits this paradigm is //ccp// - concurrent constraint programming language.
@@ Line 33: / Line 37: @@
 [[http://citeseer.ist.psu.edu/rd/64820993,95082,1,0.25,Download/http://citeseer.ist.psu.edu/cache/papers/cs/3086/http:zSzzSzwww.isg.sfu.cazSzdfki-pszSzPPCP93.pdf/object-oriented-concurrent-constraint.pdf|Object-Oriented Concurrent Constraint Programming in Oz]]
 One extension of this language has also been introduced with temporal/timed constraints and is called //tccp// - timed concurrent constraint programming language. The motivation was to use this language in real-time/reactive systems.
@@ Line 41: / Line 43: @@
 A Timed Concurrent Constraint Language - DOI: http://dx.doi.org/10.1006/inco.1999.2879
@@ Line 51: / Line 56: @@
 Communications of the ACM(1992),Carriero Nicholas
-Design of a Linda Kernel using Causal Multicast
+Wells, George. Coordination Languages: Back to the Future with Linda. Rhodes University.
-http://delivery.acm.org/10.1145/330000/326908/p518-shearer.pdf?key1=326908&key2=9351600911&coll=GUIDE&dl=GUIDE,ACM&CFID=35483893&CFTOKEN=89210600
+http://wcat05.unex.es/Documents/Wells.pdf
+[[http://delivery.acm.org/10.1145/330000/326908/p518-shearer.pdf?key1=326908&key2=9351600911&coll=GUIDE&dl=GUIDE,ACM&CFID=35483893&CFTOKEN=89210600|Design of a Linda Kernel using Causal Multicast]]
 ===== Actor Model =====
@@ Line 62: / Line 70: @@
-====== Promise pipelining ======
+===== Promise pipelining =====
 Promise refers to an object that acts as a proxy for a result that is initially not known, usually because the computation of its value has not yet completed.
-Languages also supporting promise pipelining include: Joule and E
+It was introduced in 1977 in a paper by Henry Baker and Carl Hewitt: Laws for Communicating Parallel Processes.
+Languages also supporting promise pipelining include:
+[[http://www.agorics.com/Library/joule.html | Joule ]] and [[http://erights.org/| E ]]