source: doc/proposals/concurrency/text/intro.tex @ db0fa7c

aaron-thesisarm-ehcleanup-dtorsdeferred_resndemanglerjacob/cs343-translationjenkins-sandboxnew-astnew-ast-unique-exprnew-envno_listpersistent-indexerresolv-newwith_gc
Last change on this file since db0fa7c was db0fa7c, checked in by Thierry Delisle <tdelisle@…>, 5 years ago

Moved files and did some cleanup in the directories

  • Property mode set to 100644
File size: 1.3 KB
Line 
1% ### #     # ####### ######  #######
2%  #  ##    #    #    #     # #     #
3%  #  # #   #    #    #     # #     #
4%  #  #  #  #    #    ######  #     #
5%  #  #   # #    #    #   #   #     #
6%  #  #    ##    #    #    #  #     #
7% ### #     #    #    #     # #######
8
9\chapter{Introduction}
10This proposal provides a minimal core concurrency API that is both simple, efficient and can be reused to build higher-level features. The simplest possible concurrency core is a thread and a lock but this low-level approach is hard to master. An easier approach for users is to support higher-level constructs as the basis of the concurrency in \CFA. Indeed, for highly productive parallel programming, high-level approaches are much more popular~\cite{HPP:Study}. Examples are task based, message passing and implicit threading.
11
12There are actually two problems that need to be solved in the design of the concurrency for a programming language: which concurrency tools are available to the users and which parallelism tools are available. While these two concepts are often seen together, they are in fact distinct concepts that require different sorts of tools~\cite{Buhr05a}. Concurrency tools need to handle mutual exclusion and synchronization, while parallelism tools are more about performance, cost and resource utilization.
Note: See TracBrowser for help on using the repository browser.