Content deleted Content added
GreenC bot (talk | contribs) Move 1 url. Wayback Medic 2.5 per WP:URLREQ#ieee.org |
|||
(44 intermediate revisions by 30 users not shown) | |||
Line 1:
{{Infobox programming language
| name = Ease
| logo = <!-- (filename) -->
| logo caption =
|paradigm = [[concurrent programming language|concurrent]]▼
| screenshot = <!-- (filename) -->
| screenshot caption =
|designer = [[Steven Ericsson-Zenith]]▼
| paradigms = [[Concurrent computing|Concurrent]], [[communicating sequential processes]]
| family =
|latest release version = ▼
|latest release date =▼
| developer = <!-- or: | developers = -->
| released = {{Start date and age|1991}}
|implementations = various▼
▲| latest release version =
|dialects = [[C-with-Ease]]▼
| latest release date = <!-- {{Start date and age|YYYY|MM|DD|df=yes/no}} -->
|influenced =▼
| latest preview date = <!-- {{Start date and age|YYYY|MM|DD|df=yes/no}} -->
| typing = [[Strong and weak typing|Strong]]
| scope =
| programming language =
| discontinued =
| operating system =
| license =
| file ext =
| file format = <!-- or: | file formats = -->
| website = <!-- {{url|www.example.com}} -->
▲| influenced =
}}
'''Ease''' is a general purpose [[parallel computing|parallel]] [[programming language]]. It is designed by Steven Ericsson-Zenith, a researcher at [[Yale University]], the Institute for Advanced Science & Engineering in Silicon Valley, California, the [[Mines ParisTech|Ecole Nationale Supérieure des Mines de Paris]], and the [[Pierre and Marie Curie University]], the science department of the [[University of Paris (post-1970)|Sorbonne]].<ref>{{cite book |last=Ericsson-Zenith |first=Steven |date=1 July 2011 |orig-year=July 1992 |title=Process Interaction Models |___location=Seattle, Washington, U.S. |publisher=CreateSpace Independent Publishing Platform |isbn=978-1463777913 }}</ref>
The book ''
The language includes two process constructors.
A ''cooperation'' includes an explicit barrier synchronization and is written:
::<math>\parallel P() \parallel Q() ;</math>
If one process finishes before the other, then it will wait until the other processes are finished.
A ''subordination'' creates a process that shares the ''contexts'' that are in scope when created and finishes when complete (it does not wait for other processes) and is written:
::<math>\big /\!\!/ P() ;</math>
Subordinate processes stop if they attempt to interact with a ''context'' that has completed because the parent process has stopped. This enables speculative processes to be created that will finish if their result is not needed.
Powerful ''replication'' syntax allows multiple processes to be created. For example,
::<math>\parallel {i}\; \mathrm{for}\; {n} : P(i) ;</math>
creates ''n'' synchronized processes each with a local constant ''i''.
Processes cannot share ''local'' variables and cooperate in the construction of shared ''contexts.'' Certain context types, called ''resources'', ensure call-reply semantics.
There are four functions upon contexts:
* {{mono|''read
* {{mono|''write
* {{mono|''put
* {{mono|''get
Context types are ''Singletons'', ''Bags'' or ''Streams'' and can be subscripted arrays.
Ease has a ''[[Semiotics|semiotic]] definition
== References ==
{{Reflist}}
==
* [https://books.google.com/books?id=8GssNAAACAAJ John Redman, An Implementation of the Ease Programming Language, University of Western Australia, 1991]
* [https://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=590304 T.H. MacKenzie, T.I. Dix, "A distributed memory multiprocessor implementation of C-with-Ease," IEEE International Conference on Parallel and Distributed Systems, 2002]
* [http://doi.ieeecomputersociety.org/10.1109/ICPADS.1998.741145 T.H. MacKenzie, T.I. Dix, "Object-Oriented Ease-Based Parallel Primitives in C++," icpads, p. 623, 1998 International Conference on Parallel and Distributed Systems (ICPADS'98), 1998]
[[Category:Concurrent programming languages]]
▲[[Category:Parallel computing]]
[[Category:Concurrency control]]
|