Andrew S. TanenbaumBesprekingen

Bleh.

Bleh.

Old, outdated and obsolete, which is of course inevitable with pretty much every technology book. Nonetheless, it was pretty good in its time and still may be a good historical or foundational resource for some people.

Pretty solid work that I've referred to often, no matter how many OS books I read.

More of a primer on Networks, but does the job. again things have moved on since this book was written, so new protocols, etc are not mentioned. But Wires are still wires, and switches are still switches. Used it to network my first two computers together as well as bought for Degree.

excellent coverage of the principles and components of an OS. Note that it is targeting the developer, not the sys-admin so I had to adjust the content for my students.

An awesome book with very clearly laid out information, specially for the beginner in computer networks. It presents some subjects that, while do not seem absolutely relevant, are still rather interesting (history of origins of the internet as we know it comes to mind). Specially great for clearing concepts one has doubts about, and an infinetely useful accompanying tool to study for finals related to the subject.

The book gives an elaborate description of the major algorithms and concepts which are used in operating systems.

Most of the book is written on a very abstract level which often makes the descriptions hard to understand. Often the text raises questions which are then left unanswered. This is done to illustrate that certain concepts may lead to problem at a later point. However, this lack of specificity often gave me a bad feeling. The last two chapters try to be more specific by looking at Linux and Windows. Unfortunately, especially the last chapter on Windows only skims through this extremely complicated software system, which I then again perceived as too abstract (to be fair, in this chapter I only read the first 20 pages). On the other hand, some of the concepts are well and carefully explained on this abstract level.

In my opinion the text is long winded. In part this may be because it contains information that I already knew or did not find interesting (e.g., Section 4.1. on file naming conventions). Another reason may be that there is quite a bit repetition between the chapters (I would have found it sufficient to learn once that the RockRidge CD-ROM standard is named after some town from a Hollywood movie; also several technicalities are repeated over and over). Often the wording is wired, so that you have to read things twice to get an idea (which is normal with technical texts), but then you still think: "Why would anyone choose these words?"

As a final pro: Small parts of the book contain ironical or queer remarks which are really funny. However, until now I could not figure out why chapter 13 is placed before chapters 10 and 11. And what happened to chapter 12? (It is not in the book; maybe the publisher is to blame)

I only looked at the exercises (note: there are quite a few) in Chapter 1 and the first few in Chapter 2, but they showed the same lack specificity as the main text and are hardly enlightening.

An awesome book with very clearly laid out information, specially for the beginner in computer networks. It presents some subjects that, while do not seem absolutely relevant, are still rather interesting (history of origins of the internet as we know it comes to mind). Specially great for clearing concepts one has doubts about, and an infinetely useful accompanying tool to study for finals related to the subject.

Indeholder "Preface", "1 Introduction", "1.1 The Uses of Computer Networks", "1.1.1 Network Goals", "1.1.2 Applications of Networks", "1.2 Network Structure", "1.3 Network Architectures", "1.3.1 Protocol Hierarchies", "1.3.2 Design Issues for the Layers", "1.4 The OSI Reference Model", "1.4.1 The Physical Layer", "1.4.2 The Data Link Layer", "1.4.3 The Network Layer", "1.4.4 The Transport Layer", "1.4.5 The Transport Layer", "1.4.6 The Transport Layer", "1.4.7 The Application Layer", "1.5 ARPANET, SNA, DECNET, and Public Networks", "1.5.1 Introduction to the ARPANET", "1.5.2 Introduction to SNA", "1.5.3 Introduction to DECNET", "1.5.4 Introduction to Public Networks and X.25", "1.6 Outline of the Rest of the Book", "1.7 Summary", "2 Network Topology", "2.1 Introduction to the Topology Design Problem", "2.1.1 Formulation of the Problem", "2.1.2 Hierarchical Networks", "2.2 Connectivity Analysis", "2.2.1 Introduction to Graph Theory", "2.2.2 Cuts and Network Flow", "2.2.3 The Max-Flow Algorithm", "2.2.4 Disjoint Paths", "2.2.5 Monte Carlo Connectivity Analysis", "2.3 Delay Analysis", "2.3.1 Introduction to Queueing Theory", "2.3.2 The M/M/1 Queues", "2.3.3 Networks of M/M/1 Queues", "2.4 Backbone Design", "2.4.1 The Design Process", "2.4.2 Generating Starting Topologies", "2.4.3 Flow and Capacity Assignment", "2.4.4 Pertubation Heuristics", "2.5 Local Access Network Design", "2.5.1 Assigning Sites to Concentrators", "2.5.2 The Concentrator Location Problem", "2.5.3 The Terminal Layout Problem", "2.6 Summary", "3 The Physical Layer", "3.1 The Theoretical Basis for Data Communications", "3.1.1 Fourier Analysis", "3.1.2 Bandwidth-Limited Signals", "3.1.3 The Maximum Data Rate of a Channel", "3.2 The Telephone System", "3.2.1 Who's Who in the Telecommunication World", "3.2.2 Structure of the Telephone System", "3.2.3 The Local Loop", "3.3 Transmission and Multiplexing", "3.3.1 Frequency Division and Time Division Multiplexing", "3.3.2 Digital Transmission", "3.3.3 The X.21 Digital Interface", "3.3.4 Communication Satellites", "3.3.5 Circuit Switching and Packet Switching", "3.4 Terminal Handling", "3.4.1 Polling", "3.4.2 Multiplexing versus Concentration", "3.4.3 The Packet Assembler/Disassembler", "3.5 Errors", "3.5.1 The Nature of Transmission Errors", "3.5.2 Error-Correcting Codes", "3.5.3 Error-Detecting Codes", "3.6 Summary", "4 The Data Link Layer", "4.1 Elementary Data Link Protocols", "4.1.1 Some Declarations Needed by the Protocols", "4.1.2 An Unrestricted Simplex Protocol", "4.1.3 A Simplex Stop-and-Wait Protocol", "4.1.4 A Simplex Protocol for a Noisy Channel", "4.2 Sliding Window Protocols", "4.2.1 A One Bit Sliding Window Protocol", "4.2.2 A Protocol with Pipelining", "4.2.3 A Protocol That Accepts Frames Out of Order", "4.3 Examples of the Data Link Layer", "4.3.2 The Data Link Layer in the ARPANET", "4.3.3 The Data Link Layer in SNA and X.25", "4.3.4 The Data Link Layer in DECNET", "4.4 Analysis of Protocols", "4.4.1 Protocol Efficiency", "4.4.2 Protocol Verification", "4.5 Summary", "5 The Network Layer I: Point-to-Point Networks", "5.1 Virtual Circuits and Datagrams", "5.1.1 The Service Provided by the Network Layer", "5.1.2 Comparison of Virtual Circuit and Datagram Service", "5.1.3 The Internal Structure of the Subnet", "5.1.4 Comparison of VCs and Datagrams within the Subnet", "5.1.5 Independence of Subnet Service and Subnet Structure", "5.2 Routing Algorithms", "5.2.1 Flooding", "5.2.2 Static Routing", "5.2.3 Centralized Routing Algorithms", "5.2.4 Isolated Routing", "5.2.5 Distributed Routing Algorithms", "5.2.6 The Topology Update Problem", "5.2.7 Hierarchical Routing", "5.2.8 Broadcast Routing", "5.3 Congestion", "5.3.1 Preallocation of Buffers", "5.3.2 Packet Discarding", "5.3.3 Isarithmic Congestion Control", "5.3.4 Flow Control", "5.3.5 Choke Packets", "5.3.6 Deadlocks", "5.4 Examples of the Network Layer", "5.4.1 The Network Layer in the ARPANET", "5.4.2 The Network Layer in SNA", "5.4.3 The Network Layer in DECNET", "5.4.3 The Network Layer in X.25", "5.5 Summary", "6 The Network Layer II: Satellite and Packet Radio Networks", "6.1 Satellite Packet Broadcasting", "6.1.1 Conventional Channel Allocation Methods", "6.1.2 Pure ALOHA and Slotted ALOHA", "6.1.3 Finite Population ALOHA", "6.1.4 Delay and Throughput of Slotted ALOHA", "6.1.5 Stability of Slotted ALOHA", "6.1.6 Controlled ALOHA", "6.1.7 Reservation ALOHA", "6.2 Packet Radio", "6.2.1 The University of Hawaii ALOHA System", "6.2.3 Design Issues for Packet Radio Networks", "6.3 Summary", "7 The Network Layer III: Local Networks", "7.1 Carrier Sense Networks", "7.1.1 Persistent and Nonpersistent CSMA", "7.1.2 Ethernet", "7.1.3 Collision-Free Protocols", "7.1.4 Limited-Contention Protocols", "7.2 Ring Networks", "7.2.1 Token Rings", "7.2.2 Contention Rings", "7.2.3 Slotted Rings", "7.2.4 Register Insertion Rings", "7.3 Shared Memory Systems", "7.3.1 Processor-Memory Interconnection", "7.3.2 Examples of Shared Memory Systems", "7.4 Summary", "8 The Transport and Session Layers", "8.1 Transport Protocol Design Issues", "8.1.1 Transport Services", "8.1.2 Addressing and Connection Establishment", "8.1.3 Flow Control and Buffering", "8.1.4 Multiplexing", "8.1.5 Synchronization in the Presence of Delayed Packets", "8.1.6 Crash Recovery", "8.2 Interconnection of Packet Switching Networks", "8.2.1 Gateways", "8.2.2 The Level og Interconnecion", "8.2.3 The X.75 Model versus the Datagram Model", "8.2.4 Internetwork Packet Fragmentation", "8.3 The Session Layer", "8.4 Examples of the Transport and Session Layers", "8.4.1 The Transport Layer in the ARPANET", "8.4.2 The Transport Layer in SNA", "8.4.3 The Transport Layer in DECNET", "8.5 Summary", "9 The Presentation Layer", "9.1 Network Security and Privacy", "9.1.1 Traditional Cryptography", "9.1.2 The Data Encryption Standard", "9.1.3 The Key Distribution Problem", "9.1.4 Public Key Cryptography", "9.1.5 Authentication and Digital Signatures", "9.2 Text Compression", "9.2.1 Encoding a Finite Set of Equally Likely Symbols", "9.2.2 Huffman Coding", "9.2.3 Context Dependent Coding", "9.3 Virtual Terminal Protocols", "9.3.1 Classes of Terminals", "9.3.2 The Data Structure Model", "9.3.3 Design Principles", "9.3.4 An Example Virtual Terminal Protocol", "9.4 File Transfer Protocols", "9.5 Examples of the Presentation Layer", "9.5.1 The Presentation Layer in the ARPANET", "9.5.2 The Presentation Layer in SNA ", "9.5.3 The Presentation Layer in DECNET", "9.6 Summary", "10 The Application Layer", "10.1 Distributed Data Base Systems", "10.1.1 The Relational Data Base Model", "10.1.2 The Relation Distribution Problem", "10.1.3 Query Processing", "10.1.4 Concurrency Control", "10.1.5 Crash Recovery", "10.2 Distributed Computation", "10.2.1 The Hierarchical Model", "10.2.2 The CPU Cache Model", "10.2.3 The User-Server Model", "10.2.4 The Pool Processor Model", "10.2.5 The Data Flow Model", "10.3 Network and Distributed Operating Systems", "10.3.1 Network Operating Systems", "10.3.2 Distributed Operating Systems", "10.4 Summary", "11 Reading List and Bibliography", "11.1 Suggestions for Further Reading", "11.1.1 Introduction", "11.1.2 Network Topology", "11.1.3 The Physical Layer", "11.1.4 The Data Link Layer", "11.1.5 The Network Layer I: Point-to-Point Networks", "11.1.6 The Network Layer II: Satellite and Packet Radio Networks", "11.1.7 The Network Layer III: Local Networks", "11.1.8 The Transport and Session Layers", "11.1.9 The Presentation Layer", "11.1.10 The Application Layer", "11.2 Alphabetical Bibliography", "Index".

Indeholder et væld af oplysninger om både teori og praksis. Glimrende bog. Dog uden helt skarp korrekturlæsning, fx er der på side xii en 10.3 Summary, som nok skulle være 10.4. Men den slags fejl viser jo bare at der er redigeret i bogen helt frem til deadline.

Indeholder "Preface", "1 Introduction", "1.1 The Uses of Computer Networks", "1.1.1 Network Goals", "1.1.2 Applications of Networks", "1.2 Network Structure", "1.3 Network Architectures", "1.3.1 Protocol Hierarchies", "1.3.2 Design Issues for the Layers", "1.4 The OSI Reference Model", "1.4.1 The Physical Layer", "1.4.2 The Data Link Layer", "1.4.3 The Network Layer", "1.4.4 The Transport Layer", "1.4.5 The Transport Layer", "1.4.6 The Transport Layer", "1.4.7 The Application Layer", "1.4.8 Data Transmission in the OSI Model", "1.5 Services", "1.5.1 OSI Terminology", "1.5.2 Connection-Oriented and Connectionless Services", "1.5.3 Service Primitives", "1.5.4 The Relationship of Services to Protocols", "1.6 Network Standardization", "1.6.1 Who's Who in the Telecommunications World", "1.6.2 Who's Who in the Standards World", "1.6.3 Discussion of the Standardization of the OSI model", "1.7 Example Networks", "1.7.1 Public Networks", "1.7.2 The ARPANET", "1.7.3 MAP and TOP", "1.7.4 USENET", "1.7.5 CSNET", "1.7.6 BITNET", "1.7.7 SNA", "1.8 Outline of the Rest of the Book", "1.9 Summary", "2 The Physical Layer", "2.1 The Theoretical Basis for Data Communications", "2.1.1 Fourier Analysis", "2.1.2 Bandwidth-Limited Signals", "2.1.3 The Maximum Data Rate of a Channel", "2.2 Transmission Media", "2.2.1 Magnetic Media", "2.2.2 Twisted Pair", "2.2.3 Baseband Coaxial Cable", "2.2.4 Broadband Coaxial Cable", "2.2.5 Fiber Optics", "2.2.6 Line-of-Sight Transmission", "2.2.7 Communication Satellites", "2.3 Analog Transmission", "2.3.1 The Telephone System", "2.3.2 Modems", "2.3.3 RS-232-C and RS-449", "2.4 Digital Transmission", "2.4.1 Pulse Code Modulation", "2.4.2 Encoding Systems", "2.4.3 X.21 Digital Interface", "2.5 Transmission and Switching", "2.5.1 Frequency Division and Time Division Multiplexing", "2.5.2 Circuit Switching", "2.5.3 Packet Switching", "2.5.4 Hybrid Switching", "2.6 ISDN - Integrated Services Digital Network", "2.6.1 ISDN Services", "2.6.2 Evolution of ISDN", "2.6.3 ISDN System Architecture", "2.6.4 The Digital PBX", "2.6.5 The ISDN Interface", "2.6.6 ISDN Signaling - SS#7", "2.6.7 Perspective on ISDN", "2.7 Terminal Handling", "2.7.1 Polling", "2.7.2 Multiplexing versus Concentration", "2.8 Summary", "3 The Medium Access Sublayer", "3.1 Local and Metropolitan Area Networks", "3.1.1 Static Channel Allocation in LANs and WANs", "3.1.2 Dynamic Channel Allocation in LANs and WANs", "3.2 The ALOHA Protocols", "3.2.1 Pure ALOHA and Slotted ALOHA", "3.2.2 Finite Population ALOHA", "3.3 Local Area Network Protocols", "3.3.1 Persistent and Nonpersistent CSMA", "3.3.2 CSMA with Collision Detection", "3.3.3 Collision-Free Protocols", "3.3.4 BRAP - Broadcast Recognition with Alternating Priorities", "3.3.5 MLMA - The Multi-Level Multi-Access Protocol", "3.3.6 Binary Countdown", "3.3.7 Limited-Contention Protocols", "3.3.8 The Adaptive Tree Walk Protocol", "3.3.9 The Urn Protocol", "3.4 IEEE Standard 802 for Local Area Networks", "3.4.1 IEEE Standard 802.2 and Ethernet", "3.4.2 IEEE Standard 802.4: Token Bus", "3.4.3 IEEE Standard 802.5: Token Ring", "3.4.4 Comparison of Local Area Networks", "3.5 Fiber Optic Networks", "3.5.1 FDDI", "3.5.2 Fibernet II", "3.5.3 S/NET", "3.5.4 FASNET and EXPRESSNET", "3.5.5 DATAKIT", "3.6 Satellite Networks", "3.6.1 SPADE", "3.6.2 ALOHA Revisited", "3.6.3 Reservation ALOHA", "3.7 Packet Radio Networks", "3.7.1 The University of Hawaii ALOHA System", "3.7.2 Design Issues for Packet Radio Networks", "3.8 Examples of the MAC Sublayer", "3.8.1 The MAC Sublayer in Public Networks", "3.8.2 The MAC Sublayer in the ARPANET", "3.8.3 The MAC Sublayer in MAP and TOP", "3.8.4 The MAC Sublayer in USENET", "3.9 Summary", "4 The Data Link Layer", "4.1 Data Link Layer Design Issues", "4.1.1 Services Provided in the Network Layer", "4.1.2 Framing", "4.1.3 Error Control", "4.1.4 Flow Control", "4.1.5 Link management", "4.2 Error Detection and Correction", "4.2.1 Error-Correcting Codes", "4.2.2 Error-Detecting Codes", "4.3 Elementary Data Link Protocol", "4.3.1 An Unrestricted Simplex Protocol", "4.3.2 A Simplex Stop-and-Wait Protocol", "4.3.3 A Simplex Protocol for a Noisy Channel", "4.4 Sliding Window Protocols", "4.4.1 A One Bit Sliding Window Protocol", "4.4.2 A Protocol Using Go Back n", "4.4.3 A Protocol Using Selective Repeat", "4.5 Protocol Performance", "4.5.1 Performance of the Stop-and-Wait Protocol", "4.5.2 Performance of the Sliding Window Protocol", "4.6 Protocol Specification and Verification", "4.6.1 Finite State Machine Models", "4.6.2 The Estelle Protocol Specification Language", "4.6.3 Petri Net Models", "4.7 Examples of the Data Link Layer", "4.7.1 The Data Link Layer in Public Networks", "4.7.2 The Data Link Layer in the ARPANET", "4.7.3 The Data Link Layer in MAP and TOP", "4.7.4 The Data Link Layer in USENET", "4.8 Summary", "5 The Network Layer", "5.1 Network Layer Design Issues", "5.1.1 Services Provided in the Transport Layer", "5.1.2 Internal Organization of the Network Layer", "5.1.3 Routing", "5.1.4 Congestion", "5.1.5 Internetworking", "5.2 Routing Algorithms", "5.2.1 Shortest Path Routing", "5.2.2 Multipath Routing", "5.2.3 Centralized Routing", "5.2.4 Isolated Routing", "5.2.5 Flooding", "5.2.6 Distributed Routing", "5.2.7 Optimal Routing", "5.2.8 Flow-Based Routing", "5.2.9 Hierachical Routing", "5.2.10 Broadcast Routing", "5.3 Congestion Control Algorithms", "5.3.1 Preallocation of Buffers", "5.3.2 Packet Discarding", "5.3.3 Isarithmic Congestion Control", "5.3.4 Flow Control", "5.3.5 Choke Packets", "5.3.6 Deadlocks", "5.4 Internetworking", "5.4.1 OSI and Internetworking", "5.4.2 Bridges", "5.4.3 Gateways", "5.4.4 Comparison of Connection-Oriented and Connectionless Gateways", "5.4.5 Bridge and Gateway Software", "5.5 Examples of the Network Layer", "5.5.1 The Network Layer in Public Networks", "5.5.2 The Network Layer in the ARPANET", "5.5.3 The Network Layer in MAP and TOP", "5.5.4 The Network Layer in USENET", "5.6 Summary", "6 The Transport Layer", "6.1 Transport Layer Design Issues", "6.1.1 Services Provided to the Session Layer", "6.1.2 Quality of Service", "6.1.3 The OSI Transport Service Primitives", "6.1.4 Transport Protocols", "6.1.5 Elements of Transport Protocols", "6.2 Connection Management", "6.2.1 Addressing", "6.2.2 Establishing a Connection", "6.2.3 Releasing a Connection", "6.2.4 Timer-Based Connection Management", "6.2.5 Flow Control and Buffering", "6.2.6 Multiplexing", "6.2.7 Crash Recovery", "6.3 A Simple Transport Protocol on Top of X.25", "6.3.1 The Example Service Primitives", "6.3.2 The Example Transport Entity", "6.3.3 The Example as a Finite State Machine", "6.4 Examples of the Transport Layer", "6.4.1 The Transport Layer in Public Networks", "6.4.2 The Transport Layer in the ARPANET", "6.4.3 The Transport Layer in MAP and TOP", "6.4.4 The Transport Layer in USENET", "6.5 Summary", "7 The Session Layer", "7.1 Session Layer Design Issues", "7.1.1 Services Provided to the Presentation Layer", "7.1.2 Data Exchange", "7.1.3 Dialog Management", "7.1.4 Synchronization", "7.1.5 Activity Management", "7.1.6 Exception Reporting", "7.1.7 The OSI Session Service Primitives", "7.2 Remote Procedure Call", "7.2.1 The Client-Server Model", "7.2.2 Implementation of Remote Procedure Call", "7.2.3 Semantics of Remote Procedure Call", "7.2.4 Orphans", "7.2.5 Disussion of RPC", "7.3 Examples of the Session Layer", "7.3.1 The Session Layer in Public Networks", "7.3.2 The Session Layer in the ARPANET", "7.3.3 The Session Layer in MAP and TOP", "7.3.4 The Session Layer in USENET", "7.4 Summary", "8 The Presentation Layer", "8.1 Presentation Layer Design Issues", "8.1.1 Data Representation", "8.1.2 Data Compression", "8.1.3 Network Security and Privacy", "8.1.4 The OSI Presentation Service Primitives", "8.2 Abstract Syntax Notation (ASN.1)", "8.2.1 Data Structures", "8.2.2 Abstract Syntax", "8.2.3 Transfer Syntax", "8.3 Data Compression Techniques", "8.3.1 Encoding a Finite Set of Equally Likely Symbols", "8.3.2 Frequency Dependent Coding", "8.3.3 Context Dependent Coding", "8.4 Cryptography", "8.4.1 Traditional Cryptography", "8.4.2 The Data Encryption Standard", "8.4.3 The Key Distribution Problem", "8.4.4 Public Key Cryptography", "8.4.5 Authentication and Digital Signatures", "8.5 Examples of the Presentation Layer", "8.5.1 The Presentation Layer in Public Networks", "8.5.2 The Presentation Layer in the ARPANET", "8.5.3 The Presentation Layer in MAP and TOP", "8.5.4 The Presentation Layer in USENET", "8.6 Summary", "9 The Application Layer", "9.1 Application Layer Design Issues", "9.1.1 File Transfer, Access and Management", "9.1.2 Electronic Mail", "9.1.3 Virtual Terminals", "9.1.4 Other Applications", "9.1.5 OSI Service Elements - ACSE and CCR", "9.2 File Transfer, Access and Management", "9.2.1 File Servers", "9.2.2 Concurrency Control", "9.2.3 Replicated Files", "9.2.4 Implementation Issues", "9.3 Electronic Mail", "9.3.1 Architecture and Services of MOTIS and X.400", "9.3.2 The User Agent", "9.3.3 The Message Transfer Agent", "9.4 Virtual Terminals", "9.4.1 Scroll Mode Terminals", "9.4.2 Page Mode Terminals", "9.4.3 Form Mode Terminals", "9.5 Other Applications", "9.5.1 Directory Service", "9.5.2 Job Transfer and Management", "9.5.3 Picture Storage and Transfer", "9.5.4 Teletext and Videotex", "9.6 Examples of The Application Layer", "9.6.1 The Application Layer in Public Networks", "9.6.2 The Application Layer in the ARPANET", "9.6.3 The Application Layer in MAP and TOP", "9.6.4 The Application Layer in USENET", "9.7 Summary", "10 Reading List and Bibliography", "10.1 Suggestions for Further Reading", "10.1.1 Introduction and General Works", "10.1.2 The Physical Layer", "10.1.3 The Medium Access Control Sublayer", "10.1.4 The Data Link Layer", "10.1.5 The Network Layer", "10.1.6 The Transport Layer", "10.1.7 The Session Layer", "10.1.8 The Presentation Layer", "10.1.9 The Application Layer", "10.2 Alphabetical Bibliography", "A Appendix: Queueing Theory", "Index".

Indeholder et væld af oplysninger om både teori og praksis. Glimrende bog.

Auf über 1200 Seiten wird alles über moderne Betriebssysteme gesagt. Aber eben aus der Sicht von Minix-Urgestein Andrew S. Tanenbaum. Das Buch ist ein echter Hammer, aber dem gestandenen Informatiker, der mehr als 30 Jahre "im Geschäft" ist, fallen doch einige Fehler und äußerst mutige Behauptungen auf. Im Kapitel 1.5 Betriebssystemkonzepte wird auch auf die Geschichte der Entwicklung von Hardware und Software eingegangen und es fällt auf, daß nicht sehr genau recherchiert wurde. Vieles scheint aus Wikipedia "erinnert" worden zu sein, ohne zu den Quellen vorzudringen. Tanenbaums Schreibstil ist an einigen Stellen für ein solches Buch, das wissenschaftlichen Anspruch erhebt (Umfang, Verlag, Preis), oft zu ausschweifend und unpräzise. Vielleicht ist das aber auch dem Übersetzerteam anzulasten, daß wohl - wenn man dem Vorwort der deutschen Ausgabe glaubt - unter höllischem Zeitdruck gearbeitet hat. Man merkt es an einigen Stellen überdeutlich. Aber insgesamt ein empfehlenswertes Buch, das nur wenige Fragen offen lässt, wenn man sich einen umfassenden Überblick und weitgehende Detailkenntnisse aneignen will. Wer aber auf dem neuesten Stand der Entwicklung sein will, kommt nicht umhin, sich (auch) anderweitig umzusehen. Die umfassende Darstellung von Symbian OS zeigt, wie schnell die aktuelle Entwicklung in der Computerbranche so manches "neue" Buch ganz schnell alt aussehen lassen kann. Das Betriebssystem Android wird mit keinem einzigen Wort erwähnt. Na ja, es ist ja eigentlich ein "kommerzialisiertes" Linux. Also wollen wir doch mal nicht so streng sein ...
Und die Linux-Textkonsole wird nicht durch das X-Window-System erzeugt. Wirklich nicht. Aber wer ein solches Buch kauft, lächelt nur über solche plumpen (Übersetzungs?)-Fehler, zu finden auf Seite 35.
Einem verbissenen Linguisten wie mir geht es allerdings gegen den Strich, daß permanent statt Benutzer-Oberfläche "Benutzungs-Oberfläche" geschrieben wird. Bin ich zu streng? Meinungen dazu bitte.

Livro totalmente acadêmico. Excelente ! Muito conteúdo, ótimo autor, ótimo texto, linguagem bem humorada. Ele conta a história das tecnologias e faz críticas, mas sem deixar de lado os mínimos detalhes técnicos. Livro muito maduro, vem sendo editado desde a década de 80.

Tanenbaum presents here, in Computer Networks, a very, very encompassing overview of computer networks, including the different layers that comprise it.

If you've ever wanted to know more information than you could possibly require on Computer Networks, including the history of just about every aspect of them, then this book is for you. Granted, the edition I read, the 4th, was published about 7 years ago, when handheld devices that connected to the internet were not ubiquitous. Likewise, other aspects of the book do not necessarily represent the "bleeding edge" of network technology.

But, this book will definitely satisfy your hunger with computer networks, and you may find yourself gorged with information, as sometimes it borders on giving you a little more information than you actually need. Recommended for those interested in the theory and practice of computer networks.½

Classic read!½

Old-school: it was the standard textbook at the time, but today it seems dated both in content and in approach.½

One of my favorite courses in college, this book was a reasonable addition to the course. Nothing too complex, easy to understand. Not much more you could ask for.½

Indeholder "Preface", "1 Introduction", "1.1 Languages, Levels, and Virtual Machines", "1.2 Contemporary Multilevel Machines", "1.3 Historical Evolution of Multilevel Machines", "1.4 Hardware, Software, and Multilevel Machines", "1.5 Processes", "1.6 Outline of this Book", "2 Computer Systems Organization", "2.1 Processors", "2.1.1 Instruction Execution", "2.1.2 Parallel Instruction Execution", "2.1.3 Processor Classification", "2.2 Memory", "2.2.1 Bits", "2.2.2 Memory Addresses", "2.2.3 Metabits", "2.2.4 Secondary Memory", "2.3 Input/output", "2.3.1 I/O devices", "2.3.2 I/O processors", "2.3.3 Character Codes", "2.3.4 Error-Correcting Codes", "2.3.5 Frequency-dependent codes", "2.4 Computer Networks and Distributed Systems", "2.4.1 Long-Haul Networks", "2.4.2 Telecommunication", "2.4.3 Local Networks", "2.4.4 Distributed Systems", "2.5 Summary", "3. The Digital Logic Level", "3.1 Gates and Boolean Algebra", "3.1.1 Gates", "3.1.2 Boolean Algebra", "3.1.3 Implementation of Boolean Functions", "3.1.4 Circuit Equivalence", "3.2 Basic Digital Logic Circuits", "3.2.1 Integrated Circuits", "3.2.2 Conventional Circuits", "3.2.3 Arithmetic Circuits", "3.2.4 Clocks", "3.3 Memory", "3.3.1 Latches", "3.3.2 Flip-Flops and Registers", "3.3.3 Memory Organization", "3.3.4 Memory Properties", "3.4 Microprocessors and Microcomputers", "3.4.1 Microprocessor Chips", "3.4.2 Microcomputer Buses", "3.4.3 The Z80 Microprocessor", "3.4.4 The 68000 Microprocessor", "3.5 Interfacing", "3.5.1 I/O Chips", "3.5.2 Address Decoding", "3.5.3 An Example Microcomputer", "4 The Microprogramming Level", "4.1 Review of the Digital Logic Level", "4.1.1 Registers", "4.1.2 Buses", "4.1.3 Multiplexers and Decoder", "4.1.4 ALUs and Shifters", "4.1.5 Clocks", "4.1.6 Main Memory", "4.1.7 Component Packaging", "4.2 An Example Microarchitecture", "4.2.1 The Data Path", "4.2.2 Microinstructions", "4.2.3 Microinstruction Timing", "4.2.4 Microinstruction Sequencing", "4.3 An Example Macroarchitecture", "4.3.1 Stacks", "4.3.2 The Macroinstruction Set", "4.4 An Example Microprogram", "4.4.1 The Micro Assembly Language", "4.4.2 The Example Microprogram", "4.4.3 Remarks about the Microprogram", "4.4.4 Perspective", "4.5 Design of the Microprogramming Level", "4.5.1 Horizontal versus Vertical Microprogramming", "4.5.2 Nanoprogramming", "4.5.3 Improving Performance", "4.6 The IBM 370/125 microprogramming level", "4.6.1 The IBM 370/125 Microarchitecture", "4.6.2 IBM 3125 Microinstructions", "4.7 The PDP-11/60 Microprogramming level", "4.7.1 The PDP-11/60 Microarchitecture", "4.7.2 The PDP-11/60 Microinstructions", "4.8 Summary", "5 The Conventional Machine Level", "5.1 Examples of the Conventional Machine Level", "5.1.1 IBM System/370", "5.1.2 DEC PDP-11", "5.1.3 Motorola MC68000", "5.1.4 Zilog Z80", "5.2 Instruction Formats", "5.2.1 Design Criteria for Instruction Formats", "5.2.2 Expanding Opcodes", "5.2.3 Examples of Instruction Formats", "5.3 Addressing", "5.3.1 Immediate Addressing", "5.3.2 Direct Addressing", "5.3.3 Register Addressing", "5.3.4 Indirect Addressing", "5.3.5 Indexing", "5.3.6 Base-Register Addressing", "5.3.7 Stack Addressing", "5.3.8 Addressing on the PDP-11 and the 68000", "5.3.9 Discussion of Addressing Modes", "5.4 Instruction Types", "5.4.1 Data Movement Instructions", "5.4.2 Dyadic Operations", "5.4.3 Monadic Operations", "5.4.4 Comparisons and Conditional Jumps", "5.4.5 Procedure Call Instructions", "5.4.6 Loop Control", "5.4.7 Input/Output", "5.5 Flow of Control", "5.5.1 Sequential Flow of Control and Jumps", "5.5.2 Procedures", "5.5.3 Coroutines", "5.5.4 Traps", "5.5.5 Interrupts", "5.6 Summary", "6 The Operating System Machine Level", "6.1 Implementation of the Operating System Machine Level", "6.2 Virtual I/O Instructions", "6.2.1 Sequential Files", "6.2.2 Random Access Files", "6.2.3 Implementation of Virtual I/O Instructions", "6.2.4 Directory Management Instructions", "6.2.5 IBM 370 Virtual I/O", "6.2.6 UNIX Virtual I/O", "6.2.7 CP/M Virtual I/O", "6.3 Virtual Instructions Used in Parallel Processing", "6.3.1 Process Creation", "6.3.2 Race Conditions", "6.3.3 Process Synchronization Using Semaphores", "6.4 Virtual Memory", "6.4.1 Paging", "6.4.2 Implementation of Paging", "6.4.3 Demand Paging and the Working Set Model", "6.4.4 Page Replacement Policy", "6.4.5 Page Size and Fragmentation", "6.4.6 Cache Memory", "6.4.7 Segmentation", "6.4.8 The MULTICS Virtual Memory", "6.4.9 Virtual Memory on the IBM/370", "6.4.10 Virtual Memory on the PDP-11", "6.4.11 Virtual Memory on the 68000", "6.5 Job Control Languages", "6.6 Summary", "7 The Assembly Language Level", "7.1 Introduction to Assembly Language", "7.1.1 What Is an Assembly Language?", "7.1.2 Format of an Assembly Language Statement", "7.1.3 Comparion of Assembly Languageand Problem-Oriented Languages", "7.1.4 Program Tuning", "7.2 The Assembly Process", "7.2.1 Two-Pass Assemblers", "7.2.2 Pass One", "7.2.3 Pass Two", "7.2.4 Symbol Table", "7.3 Macros", "7.3.1 Macro Definition, Call and Expansion", "7.3.2 Macros with Parameters", "7.3.3 Implementation of a Macro Facility in an Assembler", "7.4 Linking and Loading", "7.4.1 Tasks performed by the Linker", "7.4.2 Structure of an Object Module", "7.4.3 Binding Time and Dynamic Relocation", "7.4.4 Dynamic Linking", "7.5 Summary", "8 Multilevel Machines", "8.1 Methods of Implementing New Levels", "8.1.1 Interpretation", "8.1.2 Translation", "8.1.3 Procedural Extension", "8.2 Design Strategies for Multilevel Machines", "8.2.1 Top-down design", "8.2.2 Bottom-up design", "8.2.3 Middle-out design", "8.3 Program Portability", "8.3.1 A Universal Programming Language", "8.3.2 The Brute Force Approach", "8.3.3 UNCOL", "8.3.4 Abstract Machine Language", "8.3.5 Portable Compilers", "8.3.6 Emulation", "8.4 Self-Virtualizing Machines", "8.4.1 IBM VM/370 system", "8.4.2 Goals of self-virtualizing machines", "8.4.3 Implementation of a self-virtualizing machine", "8.5 The Compiler-Interpreter Interface", "8.5.1 High-Level Interfaces", "8.5.2 Discussion of High-Level Interfaces", "8.6 Summary", "9. Reading List and Bibliography", "9.1 Suggestions for Further Reading", "9.1.1 Introduction and General Works", "9.1.2 Computer Systems Organization", "9.1.3 The Digital Logic Level", "9.1.4 The Microprogramming Level", "9.1.5 The Conventional Machine Level", "9.1.6 The Operating System Machine Level", "9.1.7 The Assembly Language Level", "9.1.8 Multilevel computers", "9.1.9 Binary Numbers and Arithmetic", "9.2 Alphabetical Bibliography", "Appendix A Binary Numbers", "A.1 Finite Precision Numbers", "A.2 Radix Number Systems", "A.3 Conversion from One Radix to Another", "A.4 Negative Binary Numbers", "A.5 Binary Arithmetic", "Appendix B Floating-point Number", "Index".

Glimrende gennemgang af hvordan man designer computere fra transistorer og op til højniveausprog og virtuelle maskiner.

Indeholder "Preface", "Instructor's preface", "1 Introduction", "1.1 Languages, Levels, and Virtual Machines", "1.2 Contemporary Multilevel Machines", "1.3 Historical Evolution of Multilevel Machines", "1.4 Hardware, Software, and Multilevel Machines", "1.5 Processes", "1.6 Outline of this Book", "2 Computer Systems Organization", "2.1 Processors", "2.1.1 Instruction Execution", "2.1.2 Parallel Instruction Execution", "2.2 Memory", "2.2.1 Bits", "2.2.2 Memory Addresses", "2.2.3 Metabits", "2.2.4 Secondary Memory", " Magnetic tapes", " Magnetic disks", " Magnetic drums", " Optical Memories", "2.3 Input/output", "2.3.1 I/O devices", "2.3.2 I/O processors", "2.3.3 Character Codes", "2.3.4 Error-Correcting Codes", "2.3.5 Frequency-dependent codes", "2.4 Transfer of Information", "2.4.1 Data paths", "2.4.2 Telecommunication", " Modulation", " Asynchronous and synchronous transmission", " Simplex, half-duplex, and full-duplex transmission", "3. The Conventional Machine Level", "3.1 Examples of the Conventional Machine Level", "3.1.1 IBM System/360 and System/370", "3.1.2 CDC 6000, Cyber 70 and Cyber 170", "3.1.3 DEC PDP-11", "3.2 Instruction Formats", "3.2.1 Design criteria for instruction formats", "3.2.2 Expanding opcodes", "3.2.3 Examples of instruction formats", "3.3 Addressing", "3.3.1 Immediate addressing", "3.3.2 Direct addressing", "3.3.3 Register addressing", "3.3.4 Indirect addressing", "3.3.5 Indexing", "3.3.6 Base registers", "3.3.7 Stack addressing", " Reverse Polish", " Evaluation of reverse Polish formulas", "3.3.8 Addressing on the PDP-11", "3.3.9 Discussion of addressing modes", "3.4 Instruction Types", "3.4.1 Data movement instructions", "3.4.2 Dyadic operations", "3.4.3 Monadic operations", "3.4.4 Comparisons and conditional jumps", "3.4.5 Procedure call instructions", "3.4.6 Loop control", "3.4.7 Input/output", "3.5 Representation of Data", "3.5.1 Integers", "3.5.2 Floating-point numbers", "3.5.3 Booleans", "3.5.4 Characters", "3.5.5 Strings", "3.5.6 Arrays", " Dope vectors", " Marginal indexing", "3.6 Flow of Control", "3.6.1 Sequential flow of controls and jumps", "3.6.2 Procedures", "3.6.3 Coroutines", "3.6.4 Traps", "3.6.5 Interrupts", "4 The Microprogramming Level", "4.1 Processor components", "4.1.1 Registers", "4.1.2 Buses", "4.1.3 Gates", "4.1.4 Clocks", "4.1.5 Memory ports", "4.1.6 Arithmetic and logical units", "4.1.7 Packaging of processor components", "4.2 Basic Operations", "4.2.1 Register transfer", "4.2.2 Memory read/write", "4.2.3 Bit testing", "4.3 A Hypothetical Target Level", "4.4 A Hypothetical Host Level", "4.4.1 The host level's registers", "4.4.2 The host level's ALU", "4.4.3 The host level's gates and data paths", "4.5 Gate Sequences", "4.5.1 Subcycles", "4.5.2 Gate sequences for the ADD instruction", "4.6 Microprogrammed Gate Control", "4.6.1 Microinstructions", "4.6.2 Execution of microprograms", "4.6.3 A two-level machine", "4.7 A Language for Microprogramming", "4.7.1 Notation for GATE microinstructions", "4.7.2 Notation for TEST microinstructions", "4.8 The Interpreter for the Target Machine", "4.8.1 Interpretation of the multiplication instruction", "4.8.2 Interpretation of the division instruction", "4.8.3 Perspective", "4.9 Design of the Microprogramming Level", "4.9.1 Encoded fields", "4.9.2 Horizontal versus vertical organization", "4.9.3 Memory cycle ratios and overlapped execution", "4.9.4 Nanomemories", "4.9.5 Universal versus specific microprogramming levels", "4.9.6 Review of microprogramming level organization", "4.10 Advantages and Disadvantages of Microprogramming", "4.11 The IBM 370/125's microprogramming level", "4.11.1 Architecture of the IBM 370/125 microprogramming level", "4.11.2 IBM 3125 microinstructions", "4.12 The PDP-11/40 microprogramming level", "4.12.1 Architecture of the PDP-11/40 microprogramming level", "4.12.2 UNIBUS operation", "4.12.3 PDP-11/40 microinstructions", "4.13 The Burroughs B1700", "4.13.1 Architecture of the B1700", "4.13.2 The B1700 instruction set", "5 The Operating System Machine Level", "5.1 Implementation of the Operating System Machine Level", "5.2 Virtual I/O Instructions", "5.2.1 Sequential files", "5.2.2 Random access files", "5.2.3 Implementation of virtual i/o instructions", "5.2.4 IBM 370 virtual i/o", "5.3 Virtual Instructions Used in Parallel Processing", "5.3.1 Process creation and destruction", "5.3.2 Race conditions", "5.3.3 Process synchronization using semaphores", "5.3.4 Instructions for interprocess communication", "5.4 Other Level 3 Instructions", "5.4.1 Directory management instructions", "5.4.2 Reconfiguring the level 3 machine", "5.5 Virtual Memory", "5.5.1 Paging", "5.5.2 Implementation of paging", "5.5.3 Demand paging and the working set model", "5.5.4 Page replacement policy", "5.5.5 The dirty bit", "5.5.6 The hardware map", "5.5.7 Page size and fragmentation", "5.5.8 Cache memory", "5.5.9 Segmentation", "5.5.10 Virtual memory on the PDP-11", " Checkerboarding", "5.5.11 The MULTICS virtual memory", "5.5.12 Virtual memory on the IBM 370", "5.5.13 Segmented virtual memory and file i/o", "5.6 Job Control Languages", "6 The Assembly Language Level", "6.1 Introduction to Assembly Language", "6.1.1 What is an assembly language", "6.1.2 Format of an assembly language statement", "6.1.3 Comparison of assembly language and PL/I", "6.1.4 Program tuning", "6.2 The Assembly Process", "6.2.1 Two-pass assemblers", "6.2.2 Pass one", "6.2.3 Pass two", "6.3 Searching and Sorting", "6.3.1 Searching", "6.3.2 Linear searching", "6.3.3 Binary searching", "6.3.4 Sorting", "6.3.5 Hash coding", "6.3.6 Hasing functions and collisions", "6.3.7 Comparison of association techniques", "6.4 Macros", "6.4.1 Macro definition, call, and expansion", "6.4.2 Macros with parameters", "6.4.3 Condition macro expansion", "6.4.4 Nested macro calls", "6.4.5 Recursive macro calls", "6.4.6 Nested macro definitions", "6.4.7 Implementation of a macro facility in an assembler", "6.5 Linking and Loading", "6.5.1 Tasks performed by the linker", "6.5.2 Structure of an object module", "6.5.3 Binding time and dynamic relocation", "6.5.4 Dynamic linking", "7 Multilevel Machines", "7.1 Methods of Implementing New Levels", "7.1.1 Interpretation", "7.1.2 Translation", " General-purpose macro processors", "7.1.3 Procedural extension", "7.2 Design Strategies for Multilevel Machines", "7.2.1 Top-down design", "7.2.2 Bottom-up design", "7.2.3 Middle-out design", "7.3 Program Portability", "7.3.1 A univerversal programming language", "7.3.2 The brute force approach", "7.3.3 UNCOL", "7.3.4 Do-it-yourself virtual machines", "7.3.5 Emulation", "7.3.6 Networks", "7.4 Self-Virtualizing Machines", "7.4.1 IBM VM/370 system", "7.4.2 Goals of self-virtualizing machines", " Self-virtualizing machines and time sharing", " Operating system testing", " Protection of confidental data", "7.4.3 Implementation of a self-virtualizing machine", " Exceptions and virtual machine faults", " Simulation of virtual machine i/o", " Selv-modifying channel programs", " Shadow page tables", "7.5 High-Level Machine Architecture", "7.5.1 Addressing and descriptors", "7.5.2 High-level machine instructions", "7.5.3 Advantages and disadvantages of high-level machines", "8 Suggestions for Further Reading and Bibliography", "8.1 Suggestions for Further Reading", "8.1.1 Addressing and instructions", "8.1.2 Assemblers and assembly language programming", "8.1.3 Binary numbers and arithmetic", "8.1.4 Character codes, redundant and nonredundant", "8.1.5 Computer organization", "8.1.6 The conventional machine level", "8.1.7 Deadlocks", "8.1.8 File systems", "8.1.9 High-level machines", "8.1.10 Input/output", "8.1.11 Linkers and loaders", "8.1.12 Macros", "8.1.13 The microprogramming level", "8.1.14 Multilevel computers", "8.1.15 Networks", "8.1.16 Operating systems", "8.1.17 Parallel programming", "8.1.18 Self-virtualizing machines", "8.1.19 Symbol tables", "8.1.20 Telecommunications", "8.1.21 Virtual memory", "8.2 Alphabetical Bibliography", "Appendix A Finite-precision Arithmetic and binary numbers", "A.1 Finite-precision Numbers", "A.2 Radix Number Systems", "A.3 Conversion from One Radix to Another", "A.4 Negative Binary Numbers", "A.5 Binary Arithmetic", "Appendix B Floating-point Number", "Appendix C Boolean Algebra", "Index".

Standardlærebogen på Datalogi-2 i 1980. Alle eksempler er forældede nu til dags. Her i 2020 er det ARM og AMD64, der regerer verden. Flere cores med flere tråde i hver. Og stadigvæk er det svært at udnytte det på en smart måde. Heartbleed og lignende bugs ligger og lurer helt nede på cpu-niveau og gør det umuligt at lave helt sikre systemer.

Bravo!