Lecture16 - COP 4600 Operating Systems Fall 2010 Click to...

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

View Full Document Right Arrow Icon
Click to edit Master subtitle style 8/1/11 Lecture 16 COP 4600 Operating Systems Fall 2010 Dan C. Marinescu Office: HEC 439 B Office hours: Tu-Th 3:30-4:30 PM
Background image of page 1

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

View Full DocumentRight Arrow Icon
Lecture 16 8/1/11 n Last time: n Presentation of the paper “DNS Complexity” by Vixie n Threads, Virtual memory, Bounded buffers. Virtual Links. n Primitives for processor virtualization n Threads. The state of a thread. ¨ Thread manager. Interrupts. Interrupt handler. ¨ Race conditions and locks. n Today: n Threads ¨ Thread and processor layers ¨ Processor sharing; Scheduling; Switching the processor from one thread to another – YIELD. ¨ Implementation of YIELD and SCHEDULER ¨ Next time n More on threads and processor sharing. Lecture 16 – Thursday October 14, 2010 22
Background image of page 2
Lecture 16 8/1/11 33
Background image of page 3

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

View Full DocumentRight Arrow Icon
Lecture 16 8/1/11 44
Background image of page 4
Lecture 16 8/1/11 55
Background image of page 5

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

View Full DocumentRight Arrow Icon
Lecture 16 8/1/11 Switching the processor from one thread to another n Thread creation: thread_id & ALLOCATE_THREAD(starting_address_of_procedure, address_space_id); n YIELD & function implemented by the kernel to allow a thread to wait for an event. ¨ Save the state of the current thread ¨ Schedule another thread ¨ Start running the new thread – dispatch the processor to the new thread n YIELD ¨ cannot be implemented in a high level language, must be implemented in the machine language. ¨ can be called from the environment of the thread, e.g., C, C++, Java ¨ allows several threads running on the same processor to wait for a lock. It replaces the busy wait we have used before. 66
Background image of page 6
Lecture 16 8/1/11 Thread states and state transitions 77
Background image of page 7

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

View Full DocumentRight Arrow Icon
Lecture 16 8/1/11 The processor and the thread table 88
Background image of page 8
Lecture 16 8/1/11 Obj106 99
Background image of page 9

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

View Full DocumentRight Arrow Icon
Lecture 16 8/1/11 1010
Background image of page 10
Lecture 16 8/1/11 1111
Background image of page 11

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

View Full DocumentRight Arrow Icon
Lecture 16 8/1/11 1212
Background image of page 12
Image of page 13
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 07/30/2011 for the course COP 4600 taught by Professor Montagne during the Spring '08 term at University of Central Florida.

Page1 / 25

Lecture16 - COP 4600 Operating Systems Fall 2010 Click to...

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

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