Imagine an operating system that uses a pessimistic memory allocator for device drivers. This memory allocator assumes that the allocated memory will never be used and immediately pages the allocated memory to disk. As such, no memory is ever really allocated until the “allocated” memory is accessed.
Will the ballooning technique work as expected on such an operating system? Why or why not? If it will not work, how, then, will ESX handle overcommitment?
Local Stanford students should write up their response on a sheet of paper that includes their name. The sheet of paper with the response should be submitted immediately before lecture.
SCPD students should write up their response in a text file named
response.esx.txt and upload it via the submission and grades page. You’ll
need to sign in with your SUNetID to access the page. Responses will be accepted
until one week after the corresponding paper’s lecture.
In either case, the response should be short, likely only a pithy paragraph in length.
Tuesdays and Thursdays
4:30pm - 5:50pm
Gates B1
Dawson
Mondays
3:00pm - 5:00pm
Gates 314
Sergio
Mondays and Wednesdays
6:00pm - 7:30pm
Gates 288
Dawson Engler
Instructor
Gates 314
Sergio Benitez
Instructor
Gates 288
Spring 2015
Spring 2014
Winter 2013
Spring 2013
Spring 2012
Spring 2011
Spring 2010