BibSonomy bookmarks for /user/draganigajic/concurrency

Scala Actors -- A Short Tutorial

draganigajic — 2011-07-13T18:13:52+02:00

With the advent of multi-core processors concurrent programming is becoming indispensable. Scala's primary concurrency construct is actors. Actors are basically concurrent processes that communicate by exchanging messages. Actors can also be seen as a form of active objects where invoking a method corresponds to sending a message. The Scala Actors library provides both asynchronous and synchronous message sends (the latter are implemented by exchanging several asynchronous messages). Moreover, actors may communicate using futures where requests are handled asynchronously, but return a representation (the future) that allows to await the reply. This tutorial is mainly designed as a walk-through of several complete example programs Our first example consists of two actors that exchange a bunch of messages and then terminate. The first actor sends "ping" messages to the second actor, which in turn sends "pong" messages back (for each received "ping" message one "pong" message).

Dr. Dobb's | CUDA, Supercomputing for the Masses: Part 1 | April 15, 2008

draganigajic — 2011-07-13T18:13:51+02:00

CUDA lets you work with familiar programming concepts while developing software that can run on a GP This is the first of a series of articles to introduce you to the power of CUDA -- through working code -- and to the thought process to help you map applications onto multi-threaded hardware (such as GPUs) to get big performance increases. Of course, not all problems can be mapped efficiently onto multi-threaded hardware, so part of my thought process will be to distinguish what will and what won't work, plus provide a common-sense idea of what might work "well-enough". "CUDA programming" and "GPGPU programming" are not the same (although CUDA runs on GPUs). CUDA permits working with familiar programming concepts while developing software that can run on a GPU. It also avoids the performance overhead of graphics layer APIs by compiling your software directly to the hardware (GPU assembly language, for instance), thereby providing great performance.

State Threads Library Documentation

draganigajic — 2011-07-13T18:13:41+02:00

State Threads Library Documentation

Coroutines in C

draganigajic — 2011-07-13T18:13:41+02:00

http://www.chiark.greenend.org.uk/~sgtatham/coroutines.html

Protothreads - Lightweight, Stackless Threads in C

draganigajic — 2011-07-13T18:13:41+02:00

http://www.sics.se/~adam/pt/

[Ask LTU] How to implement concurrent languages ? | Lambda the Ultimate

draganigajic — 2011-07-13T18:13:39+02:00

http://lambda-the-ultimate.org/node/2714#comment-40633

8.17. Concurrent and Parallel Haskell

draganigajic — 2011-07-13T18:13:39+02:00

http://www.haskell.org/ghc/dist/current/docs/users_guide/lang-parallel.html

The Erasmus Project

draganigajic — 2011-07-13T18:13:39+02:00

http://users.encs.concordia.ca/~grogono/Erasmus/erasmus.html

Protothreads - links

draganigajic — 2011-07-13T18:13:27+02:00

http://www.sics.se/~adam/pt/links.html

Introduction to Concurrent Programming with Sta...

draganigajic — 2011-07-13T18:13:26+02:00

http://members.verizon.net/olsongt/stackless/why_stackless.html

Algorithm + Strategy = Parallelism

draganigajic — 2011-07-13T18:13:12+02:00

http://www.macs.hw.ac.uk/~dsg/gph/papers/html/Strategies/strategies.html

Simple STM example - HaskellWiki

draganigajic — 2011-07-13T18:13:11+02:00

http://www.haskell.org/haskellwiki/Simple_STM_example

Process Algebra Diary

draganigajic — 2011-07-13T18:13:09+02:00

http://processalgebra.blogspot.com/

Conal Elliott » Future values

draganigajic — 2011-07-13T18:13:09+02:00

http://conal.net/blog/posts/future-values/

Sendmail Meets Erlang: Experiences Using Erlang for Email Applications

draganigajic — 2011-07-13T18:13:08+02:00

http://www.jetcafe.org/~npc/doc/euc00-sendmail.html

Unifying events and threads

draganigajic — 2011-07-13T18:13:07+02:00

The result is a unified concurrency model providing both thread abstractions and event abstractions. We implemented the unified concurrency model in Haskell Our implementation demonstrates how to use these techniques by building an application-level thread library with support for multiprocessing and asynchronous I/O mechanisms in Linux. The thread library is type-safe, is relatively simple to implement, and has good performance. Application-level threads are extremely lightweight (scaling to 10,000,000 threads!) and our scheduler, which is implemented as a modular and extensible event-driven system, outperforms NPTL in I/O benchmarks.

totally awesome programming languages

draganigajic — 2011-07-13T18:13:06+02:00

This is an Erlang solution to "The Santa Claus problem", % as discussed by Simon Peyton Jones (with a Haskell solution using % Software Transactional Memory) in "Beautiful code". % He quotes J.A.Trono "A new exercise in concurrency", SIGCSE 26:8-10, 1994.

Simon Peyton Jones

draganigajic — 2011-07-13T18:13:05+02:00

http://research.microsoft.com/~simonpj/

Narrative JavaScript

draganigajic — 2011-07-13T18:12:49+02:00

http://www.neilmix.com/narrativejs/doc/

Introduction to Arrowlets

draganigajic — 2011-07-13T18:12:49+02:00

http://www.cs.umd.edu/projects/PL/arrowlets/