The “Dining Philosophers” problem is a classic example used to illustrate various challenges with concurrency. We will approach this problem by incrementally designing the actors which model the problem and its solution in Humus. Through this example we will explore the avoidance of deadlock and starvation in the design of actor-based systems. Basic Thinking/Eating Cycle […]
Reference Pages
Tag Cloud
actor asynchronous blocking capability channel composition concurrency consistency data-flow deadlock debugging distribution Erlang evaluation extensibility functional grammar Humus imperative JavaScript Kernel lambda-calculus language message-passing object-oriented pair pattern-matching PEG POLA primitive protocol queue recursion scalability Scheme security sequence serializer starvation state-machine streams synchronization synchronous value vau-calculusPost Calendar
Meta