Question.docx – Assignment: – EssaysForYou

I want you to identify the paper that was the best one of the semester, and the paper that was the worst one of all these papers below. You should name each of them, and provide just a couple of sentences describing why you choose them. Then use the scholarly search tools we listed early in the semester to find current papers (2020 onward) on the same two general topics. For example, if one of your choices is the paper that focused on Multics virtual memory, you probably wouldn’t find much that is current and specifically references Multics, but you could certainly find papers on some aspect of virtual memory. So again, find a current paper on each of those two topics. Then write the usual summary and reaction for each of them with the headings. (Note: don’t forget which papers you chose for best and worst.)
Paper 1: Read this paper: Peter Chen, Edward Lee, Garth Gibson, Randy Katz, and David Patterson, “RAID: High-Performance, Reliable Secondary Storage”, ACM Computing Surveys, volume 26, number 2, June 1994. 
Paper 2: Mendel Rosenblum and John Ousterhout, “The Design and Implementation of a Log Structured File System”, Proceedings of the Symposium on Operating Systems Principles, 1991.
Paper 3: John Howard, Michael Kazarm Sherri Menees, David Nichols, M. Satyanarayanan, Robert Sidebotham, and Michael West, “Scale and Performance in a Distributed File System”, ACM Transactions on Computer Systems, Volume 6, Number 1, February 1988. 
Paper 4: The paper is A. Bensoussan and R. Daley, “The Multics Virtual Memory: Concepts and Design”, Proceedings of the Symposium on Operating Systems Principles, 1969.”
Paper 5: Peter Denning, “The Working Set Model for Program Behavior”, Communications of the ACM, 1968.
Paper 6: Richard Carr and John Hennessy, “WSClock — A Simple and Effective Algorithm for Virtual Memory Management”, Proceedings of the Symposium on Operating Systems Principles, 1981.
Paper 7: Judy Kay and Piers Lauder, A fair share scheduler, Communications of the ACM 31.1, 1988
Paper 8: Carl Waldspurger and Weihl William, Lottery scheduling: Flexible proportional-share resource management,  In Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation,  1994
Paper 9: Dabek, Frank, et al. “Event-driven programming for robust software.” Proceedings of the 10th workshop on ACM SIGOPS European workshop. 2002.
Paper 10: Rob von Behren, Jeremy Condit, and Eric Brewer, Why Events Are A Bad Idea (for high-concurrency servers), Workshop on Hot Topics in Operating Systems, 2003.

Is this the question you were looking for? Place your Order Here