Lecture 18 | Programming Paradigms (Stanford)

Lecture by Professor Jerry Cain for Programming Paradigms (CS107) in the Stanford University Computer Science department. In this lecture, Prof. Cain discusses the synchronization directive by using the ice cream store simulation as an example.

Programming Paradigms (CS107) introduces several programming languages, including C, Assembly, C++, Concurrent Programming, Scheme, and Python. The class aims to teach students how to write code for each of these individual languages and to understand the programming paradigms behind these languages.

Complete Playlist for the Course:
http://www.youtube.com/view_play_list?p=9D558D49CA734A02

CS 107 Course Website:
http://www.CS107.stanford.edu/

Stanford University:
http://www.stanford.edu/

Stanford University Channel on YouTube:
http://www.youtube.com/stanford/

Category:

Education

Tags:

• science
• math
• engineering
• computer
• language
• source
• code
• technology
• programming
• paradigm
• C++
• bit
• byte
• synchronization
• directive
• thread
• semaphore
• struct
• signal

[EuclidsElements]

The TA does the "make sense?" thing too! He has a bright future!

[grigoriyz]

This guy is not so good as Jerry is ,but he is still good :)

[esepecesito]

Actually, regarding this question, the guy is right, you could do everything with the lock. The clerk locks the thread, and the supervisor checks the cone and returns unlocking the semaphore. If there was a problem (Cone disapproved) then the clerk can go back to the queue. With the scheme proposed by the lecturer, the clerk makes kind of busy wait (not really busy wait, but like it), taking the supervisor and not releasing it until he approves the cone. He basically hijacks the supervisor!

[imorio]

@alililiff Sorry for replying to an old post, but you're wrong. Requested is the exact opposite of lock and is therefor needed. The manager needs to start working when the lock turns 0, but you can't test for that in this implementation. You can only make the manager wait for a semaphore to be higher then 0. To go without "requested" you would need a semaphore wait function that waited untill a semaphore became non-zero and then did nothing to the semaphore.

[alililiff]

the question @ about 30.00 is right becouse if the lock is 1 so its opened it cant be 2 so no 2 clerks can be in the office at the same time so basically requested is the same is lock and requested isnt needed.