Lines Matching full:are

7 .\" modification, are permitted provided that the following conditions are
30 .\" WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
134 Complex algorithms are used only if
152 the user and system processes are different
176 if two processes are
195 system are maintained from the
221 there are no I/O buffers in the
241 in the system data segment are:
260 Examples are
291 Processes are created by the system primitive
306 The processes are informed as to their part in the
322 The old segments are lost.
394 and the tables are updated.
425 Thus there are two specific algorithms
435 Processes that are waiting for slow events
441 The other processes are examined
443 but are not taken out unless they are
449 These swapping algorithms are the
468 Events are represented by arbitrary integers.
470 events are chosen to be addresses of
558 teletype events are low,
559 and time-of-day events are very low.
563 All user-process priorities are lower than the
565 User-process priorities are assigned
572 Because interactive processes are characterized
611 Devices are characterized by a major device number,
646 The blocks are uniformly addressed
652 The block I/O devices are accessed
663 the data are made available to the
669 data are made available.
670 Write requests are handled in an analogous manner.
679 of this scheme are substantial,
681 There are,
708 This means that there are times
709 when data structures on disk are inconsistent,
727 they are not used in a stereotyped way,
733 I/O requests from the user are sent to the
737 There are guidelines and conventions
743 Disk drivers are implemented
778 characters are currently on a queue.
814 There are two input queues (raw and canonical)
828 Characters are collected from the terminal and
843 there are devices that fit no general category.
844 These devices are set up as character I/O drivers.
847 Some devices are too
850 Examples are fast communications lines and
864 Files are attached anywhere
867 Directories are simply files that
916 50 disk blocks that are also free.
920 The disk allocation algorithms are
987 The space overhead properties of this scheme are quite good.
990 there are 25,000 files containing 130M bytes of data-file content.
1016 Modifications to the i-node are made to
1032 All I/O operations on files are carried out
1037 References to the file system are made in terms of
1057 The most common of these are
1065 The data structures maintained are shown in Fig. 2.
1110 The main file system primitives are implemented as follows.
1135 Reference counts are kept on the open file table entries and
1166 There are also checks and synchronization
1215 There are some other things that the system
1220 Most of these things are not very
1224 There are some features that are missed in some
1233 many features are
1235 other operating systems that are missing from the
1257 Many of these things are symptoms rather than features.
1258 Many of these things are implemented