rafaeldff + systems + concurrency   6

Bell Labs and CSP Threads
This page is a slice of the history of concurrent programming, focusing on one particular lineage of Hoare's language of communicating sequential processes (CSP) [1] [1a]. Concurrent programming in this style is interesting for reasons not of efficiency but of clarity. That is, it is a widespread mistake to think only of concurrent programming as a means to increase performance, e.g., to overlap disk I/O requests, to reduce latency by prefetching results to expected queries, or to take advantage of multiple processors. Such advantages are important but not relevant to this discussion. After all, they can be realized in other styles, such as asynchronous event-driven programming. Instead, we are interested in concurrent programming because it provides a natural abstraction that can make some programs much simpler.
CSP  Hoare  C.A.R.Hoare  PiCalculus  concurrency  concurrent  programming  thread  theading  threads  Inferno  Plan9  Aleph  Squeak  Newsqueak  DougMcIlroy  Pan  Promela  Alef  Limbo  Libthread  Go  GoogleGo  language  languages  systems  SystemsProgramming  RobPike  history  BellLabs 
april 2012 by rafaeldff
Erik Engbrecht's Blog: What does I/O bound really mean?
More WideFinder commentary: I/O from the programmer's perspective is, or at least should be [] “everything that happens between when my program requests some data and when it receives it.”
blog  post  ErikEngbrecht  IO  programming  systems  I/O  String  Strings  text  Unicode  LeakyAbstractions  regex  WideFinder  Scala  Java  LeakyAbstraction  peformance  concurrency  processing 
june 2008 by rafaeldff
Joe Armstrong, Erlang, and RPC :: Steve Vinoski’s Blog
Joe Armstrong commenting on a blog post by Steve Vinoski highlighting a blog post on Joe Armstrong's blog expanding on the RPC vs Message Passing topic brought about by Steve Vinoski replying to the Erlang mailing list. (href breadcrumbs)
blog  post  comment  JoeArmstrong  SteveVinoski  Erlang  distributed  systems  distributedsystems  reliability  concurrency  history  programming  language  RPC  messaging  MessagePassing  OTP  actors 
may 2008 by rafaeldff
Improved Means for Achieving Deteriorated Ends / The State of State
Tim Sweeney (Unreal architect and occasional LtU participant) talks about how STM is more appropriate for large mutable-state-heavy apps and Erlang-like message passing is better for distributed computation where latency is a big deal.
blog  post  email  message  TimSweeney  BritButler  concurrency  STM  messaging  MessagePassing  Erlang  Haskell  functional  programming  state  stateful  computation  distributed  computing  systems 
august 2007 by rafaeldff
Making reliable distributed systems in the presence of software errors
Joe Armstrong's - one of Erlang's creators - thesis on fault-tolerant highly concurrent distributed software develpment. The text also apparently gives a good overview of Erlang' and it's main development model.
thesis  paper  JoeArmstrong  Erlang  language  distributed  system  systems  computing  distributedsystems  concurrency  messaging  resiliency  fault-tolerance  fault-tolerant  reliability  durability  ilities  overview  tutorial  server  middleware  pdf 
august 2006 by rafaeldff

Copy this bookmark:



description:


tags: