Not logged in : Login

About: Re:Developer Recruitment Exercise     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : atom:Entry, within Data Space : www.openlinksw.com associated with source document(s)
QRcode icon
http://www.openlinksw.com/describe/?url=http%3A%2F%2Fwww.openlinksw.com%2Fdataspace%2Fvdb%2Fweblog%2Fvdb%2527s%2520BLOG%2520%255B136%255D%2F1719%2F5433

AttributesValues
has container
Date Created
maker
topic
described by
Date Modified
link
id
  • aaaf40ca5abde553986dc11fee2e90ff
content
  • I agree. Deadlock and race conditions can still hapepn. One of the simple ways to create a deadlock is to have two generic servers call each other. If you haven't selected Timeout = infinity, at least you won't have to wait forever...I fact, some Erlang programmers have tried to avoid deadlock by changing (synchronous) calls to (asynchronous) casts. It's very important to understand that not only doesn't this eliminate deadlocks, it will make them much harder to detect!It's probably fair to say that Erlang greatly reduces the number of deadlocks and race conditions by eliminating low-level locks, a bit like it reduces the risk of memory leaks by eliminating explicit pointers. Erlang code can still deadlock, and it can still leak memory, since these things can hapepn at any level of abstraction.
  • I agree. Deadlock and race conditions can still hapepn. One of the simple ways to create a deadlock is to have two generic servers call each other. If you haven't selected Timeout = infinity, at least you won't have to wait forever...I fact, some Erlang programmers have tried to avoid deadlock by changing (synchronous) calls to (asynchronous) casts. It's very important to understand that not only doesn't this eliminate deadlocks, it will make them much harder to detect!It's probably fair to say that Erlang greatly reduces the number of deadlocks and race conditions by eliminating low-level locks, a bit like it reduces the risk of memory leaks by eliminating explicit pointers. Erlang code can still deadlock, and it can still leak memory, since these things can hapepn at any level of abstraction.<br />
reply of
Title
  • Re:Developer Recruitment Exercise
is described using
atom:source
atom:updated
  • 2012-10-23T04:38:40Z
atom:title
  • Re:Developer Recruitment Exercise
label
  • Re:Developer Recruitment Exercise
atom:published
  • 2012-10-23T04:38:40Z
type
is topic of
is link of
is has reply of
is atom:contains of
is atom:entry of
is container of of
is http://vocab.deri.ie/void#inDataset of
Faceted Search & Find service v1.17_git63 as of Apr 23 2021


Alternative Linked Data Documents: iSPARQL | ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3322 as of Jun 3 2021, on Linux (x86_64-generic-linux-glibc25), Single-Server Edition (30 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2021 OpenLink Software