CS140: Operating Systems
CS140: Operating Systems This is the home page for CS140 in Autumn 2007. If you need help, please use the class newsgroup (preferred) or email the staff mailing list rather than individual TAs or the instructor. (This helps ensure you get timely and consistent responses from us.) Friday sections will be held periodically, as announced in class, mostly to coincide with programming assignments. Loca
CS 140 Exams and Solutions
( 2007 Final Solutions) Archived CS140 Exams and Solutions Disclaimer: These exams are for study purposes only. Because they were written by previous professors, there is no guarantee that the format/topics this year will be the same. Old Final Exams Winter 1999 (pdf) (solutions) Fall 1999 (pdf) (solutions) Winter 2000 (pdf) (solutions) Fall 2000 (pdf) (solutions) Fall 2001 (pdf) Winter 2002 (pdf)
CS140 Lecture notes
CS140 lecture notes Introduction [6up, src], type.c Processes & Threads [6up, src], minish.c, redirsh.c, pipesh.c Concurrency [6up, src] Scheduling [6up, src] Virtual memory HW [6up, src] Virtual memory OS [6up, src] Synchronization 1 [6up, src] Synchronization 2 [6up, src] Memory allocation [6up, src] Linking [6up, src], hello.tar.gz I/O and disks [6up, src] File systems [6up, src] Advanced file
CS140: Operating Systems
Lecture: Mondays and Wednesdays, 3:00pm-4:20pm, Skilling Auditorium Section: 10:30-11:20 AM, Gates B01 Instructor: David Mazières Office hours: Friday 3/16 2-3pm Address: Gates, Room 290 Phone: (415) 490-9451 CA: Ashok Cutkosky Office hours: Monday 12:30-2:30, Tuesday 5:00-7:00 Address: Huang Basement Phone/Hangouts/etc.: TBD CA: Matthew Denton Office hours: Wednesday 7:00pm-9:00pm, Thursday 12:30
CS140: Operating Systems
Lecture: Mondays and Wednesdays, 3:00pm-4:20pm, Skilling Auditorium Section: Some Fridays (check Syllabus) 12:30pm-1:20pm, Skilling Auditorium Instructor: David Mazières Special pre-exam office hours: Friday 3/17 1:30pm-4:30pm Address: Gates, Room 290 Phone: (415) 490-9451 CA: Mahesh Agrawal Office hours: Tue/Sun 8-10pm SCPD: Please send Google Hangout invite on my below email Address: Lathrop Lou
CS140 – Operating Systems
Overview of previous and current lectures • Locks create serial code - Serial code gets no speedup from multiprocessors • Test-and-set spinlock has additional disadvantages - Lots of traffic over memory bus - Not fair on NUMA machines • Idea 1: Avoid spinlocks - We saw lock-free algorithms last lecture - Discussing RCU very quickly last time (review today) • Idea 2: Design better spinlocks - Less
CS140 Lecture notes
CS140 lecture notes Introduction [6up, src], type.c Processes & Threads [6up, src], minish.c, redirsh.c, pipesh.c Concurrency [6up, src] Scheduling [6up, src] Virtual memory HW [6up, src] Virtual memory OS [6up, src] Synchronization 1 [6up, src] Synchronization 2 [6up, src] Memory allocation [6up, src] Linking [6up, src], hello.tar.gz I/O and disks [6up, src] File systems [6up, src] Advanced file
FP @ FB
Bad actors on the internet The attack landscape is constantly evolving: Fake accounts, account cloning Social engineering Hacked accounts posting spam Malicious browser extensions …and many more Why does spam appear to be “solved”? Massive automation Fast engineering triage of breaking attacks Continuous deployment of code to respond Fighting spam at Facebook Sigma is a rule execution engine Every
Folds and parallelism
Folds and parallelism A Monday recap Someone asked a thoughtful question on Monday about folds, specifically about foldr vs foldl and foldl'. I wasn't very happy with the answers I came up with, because I was in a bit of a rush. Always be suspicious of teachers who get into a muddle if you spring an unexpected question! Do they really know what they're talking about, or are they just good at readi
Blind Return Oriented Programming (BROP)
When hacking software, there are three exploit scenarios: Open-source (e.g., Apache) Open-binary (e.g., Internet Explorer) Closed-binary and source (e.g., some proprietary network service) This work studies whether it is possible to attack the third case. The BROP attack makes it possible to write exploits without possessing the target's binary. It requires a stack overflow and a service that rest
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
http://www.scs.stanford.edu/17wi-cs140/sched/readings/unix.pdf
http://www.scs.stanford.edu/brop/braille.rb
http://www.scs.stanford.edu/11au-cs240h/notes/iteratee.html
http://www.scs.stanford.edu/brop/bittau-brop.pdf