v2stanford.edu-Concurrency

v2stanford.edu-Concurrency - Concurrency http:/w w w

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
http://w w w .stanford.edu/~ouster/cgi-bin/cs140-w inter12/lecture.php?topic=concurrency January 11, 2012 Concurrency Concurrency Lecture Notes for CS 140 Winter 2012 John Ousterhout Readings for this topic from Operating System Concepts : Sections 6.1-6.3. Independent and Cooperating Threads Independent thread: one that can't affect or be affected by the rest of the universe. Its state isn't shared in any way by any other thread. Deterministic: input state alone determines results. Reproducible. Can stop and restart with no bad effects (only time varies). There are many different ways in which a collection of independent threads might be executed on a Threador: Uniprogramming: each thread runs to completion before the next one starts. Multiprogramming: share one processor among several threads. If no shared state, then order of dispatching doesn't affect behavior. Multiprocessing: run independent threads in parallel on separate processors. A given thread runs on only one processor at a time. A thread may run on different processors at different times (move state, assume processors are identical). Cannot distinguish multiprocessing from multiprogramming on a very fine grain.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 4

v2stanford.edu-Concurrency - Concurrency http:/w w w

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online