Homework 2

Homework 2 - Hw 2 Page 1 of 2 CS 503 Fall 2008 HW 2 Process...

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

View Full Document Right Arrow Icon
CS 503 Fall 2008 HW 2: Process Behavior and Kernel Design (70 pts) Due: Friday 03/07/2008, 11:59 PM Problem (25 + 25 + 20 pts) 1. In Xinu, back-to-back layout of process stack memory implies that stack overflow in one process may corrupt the process stack of another. Without MMU (memory management hardware) support, it is difficult to prevent stack overflow corruption. To what extent can increased kernel vigilance such as checking of stack pointer values during context switching help avoid stack overflow? Can such a solution guarantee that stack overflow does not occur? An alternative approach that does not require hardware support is compiler based stack overflow prevention. Please keep in mind that the primary goal is to contain the impact that an ill-behaving (by bug or malicious intent) process can have on other processes. For example, a compiler might inject extra range checking code when compiling function calls with the aim of detecting stack overflow at run-time before it occurs. Is this approach guaranteed to work? How does it compare against the kernel based run-time "stack monitor" approach? In your assessment, is the overhead introduced
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.

This note was uploaded on 05/14/2008 for the course CS 503 taught by Professor Kihongpark during the Spring '07 term at Purdue.

Page1 / 2

Homework 2 - Hw 2 Page 1 of 2 CS 503 Fall 2008 HW 2 Process...

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