Tag: system

ภาพประกอบในหนังสือ Operating System Concepts, Sixth editon เขียนโดย
Abraham Silberschatz, Bell Laboratories
Peter Baer Galvin, Corproate Technologies, Inc.
Greg Gagne, Westminster College
เลือกนำเสนอเพียง 62 ภาพ

1 figure 1.1 Abstract view of the components of a computer system
2 figure 1.2 Memory layout for a simple batch system
3 figure 1.3 Memory layout for a multiprogramming system
4 figure 1.4 symmetric multiprocessing architecture
5 figure 1.5 General structure of a client-server system
6 figure 2.1 A modern computer system
7 figure 2.3 Two I/O methods: (a) synchronous, and (b) asynchronous
8 figure 2.6 Storage-device hierachy
9 figure 2.7 migration of integer A from disk to register
10 figure 2.9 A base and a limit register define a logical address space
11 figure 2.10 Hardware address protection with base and limit registers
12 figure 3.3 MS-DOS execution. (a) At system startup. (b) Running a program
13 figure 3.4 UNIX running multiple programs
14 figure 3.5 Communications models. (a) Msg passing. (b) Shared memory.
15 figure 3.6 MS-DOS layer structure
16 figure 3.7 UNIX system structure
17 figure 3.11 System models. (a) Nonvirtual machine. (b) Virtual machine.
18 figure 3.12 The Java virtual machine
19 figure 4.1 Diagram of process state
20 figure 4.2 Process control block (PCB)
21 figure 4.5 Queueing-diagram representation of process scheduling
22 figure 4.12 Execution of a remote procedure call (RPC)
23 figure 5.1 Single and multithreaded processes
24 figure 5.2 Many-to-one model
25 p 157 First-Come, First-Served Scheduling
26 p 158 Shortest-Job-First Scheduling
27 p 162 Priority Scheduling
28 p 164 Round-Robin Scheduling
29 p 166 Multilevel Queue Scheduling
30 p 168 Multilevel Feedback Queue Scheduling
31 figure 7.16 The situation of the dining philosophers
32 figure 7.25 Schedule 2: A concurent Serializable schedule
33 figure 8.8 Traffic deadlock for Exercise 8.4
34 figure 9.1 Multistep processing of a user program
35 figure 9.4 Swapping of two processes using a disk as a backing store
36 figure 9.7 Paging model of logical and physical memory
37 figure 9.19 Example of segmentation
38 figure 10.1 Diagram showing virtual memory that is larger than physical memory
39 figure 10.9 FIFO page-replacement algorithm
40 figure 10.11 Optimal page-replacement algorithm
41 figure 10.12 LRU page-replacement algorithm
42 figure 10.14 Second-change (clock) page-replacement algorithm
43 figure 11.4 Example of index and relative files
44 figure 11.5 A typical file-system organization
45 figure 12.1 Layered file system
46 figure 12.5 Contiguous allocation of disk space
47 figure 12.6 Linked allocation of disk space
48 figure 13.1 A typical PC bus structure
49 figure 14.1 FCFS disk scheduling
50 figure 14.2 SSTF disk scheduling
51 figure 14.3 SCAN disk scheduling
52 figure 14.4 C-SCAN disk scheduling
53 figure 14.5 C-LOOK disk scheduling
54 figure 14.9 RAID levels
55 figure 15.1 A distributed system
56 figure 15.2 Network topology
57 figure 15.5 Two computers communicating via the ISO network model
58 figure 15.8 The TCP/IP protocol layers
59 figure 18.1 System with three protection domains
60 figure 18.4 Access matrix of figure 18.3 with domains as objects
61 figure 19.1 The Morris Internet worm
62 figure 21.1 Windows 2000 block diagram