Operating Systems: Design and ImplementationPearson Prentice Hall, 2006 - 1054 Seiten Operating Systems Design and Implementation, 3e, is ideal for introductory courses on computer operating systems. Written by the creator of Minux, professional programmers will now have the most up-to-date tutorial and reference available today. Revised to address the latest version of MINIX (MINIX 3), this streamlined, simplified new edition remains the only operating systems text to first explain relevant principles, then demonstrate their applications using a Unix-like operating system as a detailed example. It has been especially designed for high reliability, for use in embedded systems, and for ease of teaching. |
Im Buch
Ergebnisse 1-3 von 64
Seite 122
... bitmap of pending notifications . When B finally does a receive , the first step is to check its pending notifications bitmap . It can learn of attempted notifications from multiple sources this way . The single bit is enough to ...
... bitmap of pending notifications . When B finally does a receive , the first step is to check its pending notifications bitmap . It can learn of attempted notifications from multiple sources this way . The single bit is enough to ...
Seite 380
... bitmap , which is 0 if the unit is free and 1 if it is occupied ( or vice versa ) . Figure 4-5 shows part of memory and the corresponding bitmap . The size of the allocation unit is an important design issue . The smaller the allocation ...
... bitmap , which is 0 if the unit is free and 1 if it is occupied ( or vice versa ) . Figure 4-5 shows part of memory and the corresponding bitmap . The size of the allocation unit is an important design issue . The smaller the allocation ...
Seite 381
... bitmap ) are free . ( b ) The corresponding bitmap . ( c ) The same information as a list . of 32n bits will use n map bits , so the bitmap will take up only 1/33 of memory . If the allocation unit is chosen large , the bitmap will be ...
... bitmap ) are free . ( b ) The corresponding bitmap . ( c ) The same information as a list . of 32n bits will use n map bits , so the bitmap will take up only 1/33 of memory . If the allocation unit is chosen large , the bitmap will be ...
Andere Ausgaben - Alle anzeigen
Operating Systems: Design and Implementation Andrew S. Tanenbaum,Albert S. Woodhull Keine Leseprobe verfügbar - 2009 |
Häufige Begriffe und Wortgruppen
_PROTOTYPE address space algorithm allocated array assembly language bitmap boot image boot monitor buffer bytes cache CD-ROM char character compiler copy critical region deadlock define device drivers disk driver endif entry example execute file descriptor file system flag floppy disk fork function handle handler hard disk hardware header files i-node I/O devices implement initialization input interrupt ioctl kernel call keyboard layer loaded loop machine macro memory MINIX MINIX 3 system mode needed notification operating system output parameters partition pointer POSIX priority proc procedure process manager process table processor queue RAM disk registers request scheduling segment semaphore server SETUID shown in Fig signal slot stack struct structure superuser system call system processes system task terminal threads timer typedef UNIX user processes user-space variable void waiting write