CS170 Discussion – 2009-05-01 Bryce Boe. Outline Project 4 Overview Midterm Information Midterm questions / project 3 questions.

Slides:

Advertisements

Similar presentations

For(int i = 1; i

Advertisements

3.1 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Process An operating system executes a variety of programs: Batch system.

CAS3SH3 Midterm Review. The midterm 50 min, Friday, Feb 27 th Materials through CPU scheduling closed book, closed note Types of questions: True & False,

The Building Blocks: Send and Receive Operations

1 Synchronization 2: semaphores and more… 1 Operating Systems, 2011, Danny Hendler & Amnon Meisels.

Module 20 Troubleshooting Common SQL Server 2008 R2 Administrative Issues.

Page 1 Mutual Exclusion* Distributed Systems *referred to slides by Prof. Paul Krzyzanowski at Rutgers University and Prof. Mary Ellen Weisskopf at University.

Templates and the STL Bryce Boe 2012/09/10 CS32, Summer 2012 B.

UC Santa Barbara Project 2 Discussion Bryce Boe 2011/04/26 and 2011/04/29.

Interprocess Communications

CS533 Concepts of Operating Systems Class 11 System Structuring using Layers.

5.6.2 Thread Synchronization with Semaphores Semaphores can be used to notify other threads that events have occurred –Producer-consumer relationship Producer.

Inter Process Communication:  It is an essential aspect of process management. By allowing processes to communicate with each other: 1.We can synchronize.

Computer Science 162 Section 1 CS162 Teaching Staff.

Tuple Spaces and JavaSpaces CS 614 Bill McCloskey.

S A B D C T = 0 S gets message from above and sends messages to A, C and D S.

CS533 Concepts of Operating Systems Class 7 Integrated Task and Stack Management.

Asynchronous Message Passing EE 524/CS 561 Wanliang Ma 03/08/2000.

VAVLPVCTYMAUS PSABLADDERZSB EBSANTESHTICL RLDUDSKTTVSRA EDEARCENEAUOD CRFNORSASINTD TPEUUOCPTDATP UNRTMTRBEEXME MIEUSUULSNSNN USNMEMNISAIIT AESXSVPENNISI.

Discussion Week 3 TA: Kyle Dewey. Overview Concurrency overview Synchronization primitives Semaphores Locks Conditions Project #1.

Distributed Mutex EE324 Lecture 11.

QPLNHTURBIOTS CADAIASOINCOS OSTPOSTLGVAGT AJRLFKLEROUEA CLARITYSOLSTB HTEAMVSRUVAHI INTERACTPELEL NAPKSOCIALIRI GSOCIOGRAMTST CONFORMITYYTY 14 WORDS ANSWERS.

Minix Jeff Ward, Robert Burghart, Jeb Collins, Joe Creech.

Semaphores. Readings r Silbershatz: Chapter 6 Mutual Exclusion in Critical Sections.

(a) Alice and Bob are back together. Today Alice wants to send Bob a message that is secret and also authenticated, so that Bob "knows" the message came.

STEPS FOR MULTIPLYING A 2-DIGIT NUMBER BY ANOTHER 2-DIGIT NUMBER With Partial Products.

More on Semaphores Andy Wang Operating Systems COP 4610 / CGS 5765.

CE Operating Systems Lecture 13 Linux/Unix interprocess communication.

Semantics of Send and Receive Can be blocking or nonblocking –called “synchronous” and “asynchronous” –remember: procedure call is synchronous thread fork.

Discussion Week 2 TA: Kyle Dewey. Overview Concurrency Process level Thread level MIPS - switch.s Project #1.

Overview of Operating Systems Introduction to Operating Systems: Module 0.

CS603 Basics of underlying platforms January 9, 2002.

Operating Systems ECE344 Ashvin Goel ECE University of Toronto Unix System Calls and Posix Threads.

CS 838: Pervasive Parallelism Introduction to pthreads Copyright 2005 Mark D. Hill University of Wisconsin-Madison Slides are derived from online references.

ITEC 502 컴퓨터 시스템 및 실습 Chapter 3-2: Process Synchronization Mi-Jung Choi DPNM Lab. Dept. of CSE, POSTECH.

SATMathVideos.Net A set S consists of all multiples of 4. Which of the following sets are contained within set S? A) S2 only B) S4 only C) S2 and S4 D)

CS 241 Section Week #7 (10/22/09). Topics This Section  Midterm Statistics  MP5 Forward  Classical Synchronization Problems  Problems.

Cover Slide. Landforms Overview Landform 1 Text Picture.

CS533 Concepts of Operating Systems Jonathan Walpole.

Example 3 In parts of New York City, the blocks between streets are called short blocks. There are 20 short blocks per mile. Blocks between avenues are.

UNIX Sockets Outline UNIX sockets CS 640.

Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Chapter 4: Threads.

Project 3. “System Call and Synchronization” By Dongjin Kim

Barnes Hut – A Broad Review Abhinav S Bhatele The 27th day of April, 2006.

© Janice Regan, CMPT 300, May CMPT 300 Introduction to Operating Systems Mutual Exclusion Mutexes, Semaphores.

Lecture 11: Coordination and Agreement Central server for mutual exclusion Election – getting a number of processes to agree which is “in charge” CDK4:

“Request /Reply Communication”

Operating Systems Chapter 2 - Processes Vrije Universiteit Amsterdam

Async or Parallel? No they aren’t the same thing!

Bing Liu (Ed.) , Guangying Zheng Nov 2014

Advanced Topics in Software Engineering 1

Multiplication Properties

HW1 and Synchronization & Queuing

Distributed Mutex EE324 Lecture 11.

Condition Variable Implementation (**with correction of signal**)

Problem-Solving Steps Solve Problem-Solving Steps Solve

Sequence Diagrams Getting the Message.

Unix System Calls and Posix Threads

CIS 720 Message Passing.

Bond-Jini Interoperability

Lecture 10: Coordination and Agreement

CS533 Concepts of Operating Systems Class 11

CIS 720 Message Passing.

CIS 720 Message Passing.

Lecture 11: Coordination and Agreement

Pipes One-way channel joining two processes

POSIX Threads(pthreads)

How to use Open study By blm1.

CS 514 Class presentation template [Replace it with the title of your project] Xiaowei Yang.

Synchronization and liveness

Presentation transcript:

CS170 Discussion – Bryce Boe

Outline Project 4 Overview Midterm Information Midterm questions / project 3 questions

Project 4 1) Implement a semaphore server in minix ▫Add server to the boot process ▫Add functions to posix library ▫Add message passing permissions ▫Service needs to automatically restart if killed 2) Solve a synchronization problem

Semaphore Service API int sema_init(int semaphore_number, int start_value) int sema_down(int semaphore_number) int sema_up(int semaphore_number) int sema_release(int semaphore_number) Valid semaphore_numbers: 0-9

Hint, hint Sending a message in minix is blocks until the reply is received -04/openpdfs/herder.pdf -- read ithttp:// -04/openpdfs/herder.pdf

Synchronization Problem Many students want to ask a single professor a question Synchronize the questions so the professor doesn’t go crazy, and the students have their questions answered

Midterm 5 Questions, each with multiple parts Covers material up to and including slide 24 of the deadlocks set (cs pdf) Review _all_ slides and projects

Questions, comments or answers?