Operating Systems读后感摘抄
《Operating Systems》是一本由Remzi Arpaci-Dusseau / Andrea Ar著作，Arpaci-Dusseau Books出版的Paperback图书，本书定价：$21.00，页数：666，特精心从网络上整理的一些读者的读后感，希望对大家能有帮助。
《Operating Systems》精选点评：
●写的真心浅显易懂，每每读os的书都能有新的收获哇
●写得太好了，是我读过的最舒服的一本教材了。结合代码讲理论，而且讲的非常有趣，很适合作为学操作系统的第一本书。另外由于章节按照知识点划分得很清晰，拿来查缺补漏也是极好的。 虽然没有中译版，但是里面的句子都很简单，读起来比之前读过的一些原版专业书籍容易很多。
●或为os入门最佳！对process create, syscall, timer interrupt process scheduling, thread synchronization, raid, file system的讲解尤为精彩！
●看完了虚拟化的一半，觉得讲得太浅了，有些浪费时间，决定先不看了。
●The five starts are honest!
●简洁易懂，想看具体实现还得看代码
●这是我读过的最易懂最有启发的操作系统书了
●很庆幸以这本书作为系统学习OS的第一本书（也是完整啃完的第一本原版技术书）。全书以虚拟化、并发和持久化为总纲，以问题和解决方案为驱动，幽默浅显地讲述了操作系统的内容。让我明白了解原始问题对理解技术的重要性，而书中介绍的机制与策略、幂等、无状态等思想则是非常有启发性！值得多读几遍。但全书还是相对简单，覆盖面略小，还需要其他书籍深入学习。
●前半部分很生动形象，到后来持久化和分布式系统工程就越来越照本宣科了，断断续续看来三个月。
●作者喜欢卖萌 = =
《Operating Systems》读后感(一)：行文流畅讲解清晰，略失于简
花了几天读了一遍OSTEP，总体感觉行文流畅讲解清晰，是本好书无疑，而且是免费的，良心之作，值得推荐。印象比较深的有：开始部分的单cpu进程调度，由易到难一步一步演化出实用的调度机制，确实好；虚拟内存部分讲解的也比较清楚；文件系统部分也不错，内容很丰富讲解很清楚，特别是RAID、SSD。
有点遗憾的是：多CPU进程调度没有之前的讲得好，类似的还有线程调度；并发部分最不满意，没达到预期，还是有点单薄了，没讲memory barrier，没讲memory cache...
另外，每章最后推荐的文献质量很高，有空的时候好好读读！
《Operating Systems》读后感(二)：本书中文版翻译项目
2017.4.27更新：先给各位评论、点赞的朋友们道歉，这个项目可能会无限期搁置了；理由嘛，简单说呢就是懒，详细说呢就是懒，哈哈，玩笑的啦，其实是实在没时间，由于毕业后工作领域与此有较大变化，工作与学习的压力较大，精力无法投入此项目上！非常抱歉！
在学习MIT的一门分布式系统的课程时，无意间看到了这本书，大概翻了一下其中的并发性的部分，就被吸引住了。与大部分操作系统书籍不一样，本书从三个角度来讲解操作系统，虚拟化、并发性、持久化。这三个部分也是目前很多应用系统在开发中比较关注的三个方面。这样的角度还是很有意思的，看起来基本上不存在什么困难，非常的流畅舒服，也能够很容易理解，语言风格有些幽默，虽然有些幽默国人应该没有戳中国人的笑点。
突然间就有了想要把这本书翻译成中文的冲动，从看到这本书到有这个想法也就一两天的事儿吧！我知道自己的中文水平比较得渣，但还是想尝试翻译出来，一方面是最近在研究这方面的东西，顺便在翻译的过程中加深理解，另一方面是也是想翻译出来给想看而英文有点吃力的人提供点帮助（请原谅我的翻译水平，我会尽量润色的）。
翻译项目地址：https://github.com/EmbedXj/OperatingSystems.ThreeEasyPieces
阅读的话，只需要下载pdf文件即可。
若有兴趣一起翻译，可以邮件联系：xujun4038 AT 163.com
2015更新：目前翻译了并发性26、27、28、29章
2016-1-25更新：26-33共八章已完成，36、39正在进行中。
2016-3-10更新：39章已经提交至github
《Operating Systems》读后感(三)：操作系统只是开头
这本书的主题是操作系统，但更广泛地，我看到了各种计算机系统的内在相似性。从操作系统到文件系统，从虚拟内存到数据库，甚至计算机网络，都有着相似的组成和结构。
系统的有趣之处在于，从一团混沌里，加上几条约束条件，就组成了有用的结构，这大概也正是系统的本义。正是由于原始状态过于混沌，给工程师们发挥的空间很大，所以“系统是一门艺术，而非科学”。但系统也是有一些“科学”之处的——约束越多，设计越简单。而我们所设计的系统的目标是极为宏大的，面对的真实世界又是错综复杂的，于是我们必须做一定的取舍，所以“System is all about trade-offs”。这些 General idea，在这本书中俯仰皆是，潜移默化中教给我们系统设计的 general ideas 和 techniques。
这本书读起来非常有趣，令人不忍释卷。(1) 作者（们）的文笔极好，能把复杂的东西掰碎了讲清楚，典型例子是进程调度那里，从基本的目标和假设，一步一步导出 Solaris 的真实调度器：Multi-Level Feedback Queue；之后的并发部分，也是一步一步教你写互斥锁、条件变量、信号量。 (2) 行文风趣幽默，这个看了前几章就知道。不过后面慢慢变得生硬了，也不知道是不是“骗人入坑”之后就不管了，哈哈~ (3) 作业很有特色。 (4) 每章都给出大量大量大量的参考文献，而且作者鼓励你自己去读更多内容！刨根问底型的福利！一定要搜罗一下有哪些有趣的 ref 并且自己读！
总之，这是一本很优秀的操作系统入门书~ 读完后，会对计算机底层有更深刻的了解。（什么 CSAPP 在正规的 OS 课和组成原理课面前只能当导论书啦~）
：这本书作者（们）信奉“免费教科书主义”，所以这本书可以在官网上下载到免费的 PDF 版本。我注意到豆瓣上有很多人“想读”这本书，那为什么不现在就去官网上下载呢？ ;-)
《Operating Systems》读后感(四)：推荐
书很好，不仅仅讲了所有的技术，而且讲到了技术发展的历史，我印象最深刻的就是讲调度算法那一节，从FCFS，SJF到STCF再到RR，最后到MLFQ，按照顺序讲到，提到前一个算法的缺陷以及后一个算法如何改进，并且在最开始使用metric去度量算法的优异，我第一次把所有这些算法都记住了，不像很多书籍只是列举算法细节而已。基本上所有的章节都是这样排列，这样的教科书很容易让人理解。
另外就是我在看书过程中收集到的一些笑话（我知道这很无聊，只因为看到笑话太多所以收集了），有些很冷，有些黑M$，还有些只有技术宅才能看懂吧：
rofessor: Well, imagine we have a peach –
tudent: (interrupting) Peaches again! What is it with you and peaches？
rofessor: Ever read T.S. Eliot？ The Love Song of J. Alfred Prufrock, “Do I dare to eat a peach”, and all that fun stuff？
tudent: Oh yes! In English class in high school. Great stuff! I really liked the part where –
rofessor: (interrupting) This has nothing to do with that – I just like peaches. Anyhow, imagine there are a lot of peaches on a table, and a lot of people who wish to eat them. Let’s say we did it this way: each eater first identifies a peach visually, and then tries to grab it and eat it. What is wrong with this approach？
[CS97] “Inside Windows NT”
Helen Custer and David A. Solomon
Microsoft Press, 1997
The NT book, if you want to learn about something other than UNIX. Of course, why would you？ OK, we’re kidding; you might actually work for Microsoft some day you know.
For example, grocery stores commonly have a “ten-items-or-less” line to ensure that shoppers with only a few things to purchase don’t get stuck behind the family preparing for some upcoming nuclear winter.
rofessor: Ha! Yes. But persistence here means something else. Let me explain. Imagine you are outside, in a field, and you pick a –
tudent: (interrupting) I know! A peach! From a peach tree!
rofessor: I was going to say apple, from an apple tree. Oh well; we’ll do it your way, I guess.
tudent: (stares blankly)
rofessor: Anyhow, you pick a peach; in fact, you pick many many peaches, but you want to make them last for a long time. Winter is hard and cruel in Wisconsin, after all. What do you do？
In the early days, building computer systems was easy. Why, you ask？ Because users didn’t expect too much. It is those darned users with their expectations of “ease of use”, “high performance”, “reliability”, and so forth that really have led to all these headaches. Next time you meet one of those computer users, thank them for all the problems they have caused.
[DD68] “Virtual Memory, Processes, and Sharing in Multics”
Robert C. Daley and Jack B. Dennis
Communications of the ACM, Volume 11, Issue 5, May 1968
An early paper on how to perform dynamic linking in Multics, which was way ahead of its time. Dynamic linking finally found its way back into systems about 20 years later, as the large Xwindows libraries demanded it. Some say that these large X11 libraries were MIT’s revenge for removing support for dynamic linking in early versions of UNIX!
tudent: Sounds interesting. Time to learn something for real？
rofessor: It does seem so. Let’s get to work! But first things first ... (bites into peach he has been holding, which unfortunately is rotten)
[BNS69] “An anomaly in space-time characteristics of certain programs running in a
aging machine”
L. A. Belady and R. A. Nelson and G. S. Shedler
Communications of the ACM, 12:6, June 1969
Introduction of the little sequence of memory references known as Belady’s Anomaly. How do Nelson and Shedler feel about this name, we wonder？
[B02] “The FAT File System”
Andries Brouwer
eptember, 2002
A nice clean deｓｃｒｉｐｔion of FAT. The file system kind, not the bacon kind. Though you have to admit, bacon fat probably tastes better.
It should be noted that these heuristics are not based on extensive studies of file-system traffic or anything particularly nuanced; rather, they are based on good old-fashioned common sense (isn’t that what CS stands for after all？).
fsck Pronounced either “eff-ess-see-kay”, “eff-ess-check”, or, if you don’t like the tool, “eff-suck”. Yes, serious professional people use this term.
ecause the value of the semaphore simply alternates between 1 and 0, this usage is sometimes known as a binary semaphore. Yes, this is something you just have to remember; life is unfair that way sometimes.
The problem is famous because it is fun and somewhat intellectually interesting; however, its practical utility is low. However, its fame forces its inclusion here; indeed, you might be asked about it on some interview, and you’d really hate your OS professor if you miss that question and don’t get the job. Conversely, if you get the job, please feel free to send your OS professor a nice note, or some stock options.