1 / 8

Parallel Programming: JCSP Dining Philosophers with Semaphores

Explore Assignment 7 solution and Mergesort implementation using JCSP. Learn about Semaphores, Special Integer variables, P() and V() operations, and Semaphore processes in JCSP. Study strategies for avoiding deadlock in Dining Philosophers scenario, including SecurityGuard and Asymmetric philosophers.

wenda
Download Presentation

Parallel Programming: JCSP Dining Philosophers with Semaphores

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Parallel Programming0024 Recitation Week 8 Spring Semester 2010

  2. Today‘s program • Assignment 7 • Assignment 8

  3. Assignment 7 Discuss sample solution

  4. Assignment 8 Mergesort with JCSP Dining philosophers with JCSP

  5. Semaphores Special Integer variable w/2 atomic operations • P() (Passeren, wait/up) • V() (Vrijgeven/Verhogen, signal/down) Map into JCSP by defining a semaphore process

  6. Semaphores in JCSP Semaphore CSProcess Two channels for P, V Two + Two channels P – request/confirm V – request/confirm

  7. Dining philosophers Strategies to avoid deadlock SecurityGuard – limits entry to dining hall Asymmetric philosophers …

More Related