000136824 001__ 136824
000136824 005__ 20190416055733.0
000136824 037__ $$aREP_WORK
000136824 245__ $$aConcurrent Programming Paradigms, A Comparison in Scala
000136824 269__ $$a2009
000136824 260__ $$c2009
000136824 336__ $$aReports
000136824 520__ $$aThere is a rapid rise of multi-cores in recent hardware architectures. To exploit computational power of multi-core architectures, software should shift to be as concurrent as possible; and therefore should have concurrency control mechanisms. There are different concurrency programming paradigms such as locking and conditions, non-blocking algorithms, actors and software transactional memory (STM). There is a need to compare these approaches in terms of ease of use and performance. This work implements three fundamental cases of credit transfer, producer-consumer and token ring with different paradigms in Scala and the quantitative and qualitative results of the experiments are presented. Besides an STM implementation in Scala is presented.
000136824 6531_ $$aConcurrent Programming
000136824 6531_ $$aActors
000136824 6531_ $$aSTM
000136824 700__ $$aLesani, Mohsen
000136824 700__ $$0241835$$g126003$$aOdersky, Martin
000136824 700__ $$aGuerraoui, Rachid
000136824 8564_ $$uhttps://infoscience.epfl.ch/record/136824/files/Formatted%20Report.pdf$$zn/a$$s259794
000136824 909C0 $$xU10409$$0252187$$pLAMP
000136824 909CO $$ooai:infoscience.tind.io:136824$$qGLOBAL_SET$$pIC$$preport
000136824 937__ $$aLAMP-REPORT-2009-002
000136824 973__ $$sPUBLISHED$$aEPFL
000136824 980__ $$aREPORT