Linux Kernel Architecture
Chapter 17: Data Synchronization If the inode access counter (i_count) has a value greater than 1, the kernel inserts the inode ...
Chapter 17: Data Synchronization 17.11.2 Thresholds When does the kernel regard a queue as being congested and when does it give ...
Chapter 17: Data Synchronization 50 100 150 200 250 60 80 100 120 140 160 180 200 220 240 260 nr_requests congestion_on congesti ...
Chapter 17: Data Synchronization The implementation ofset_bdi_congestedis very simple. Only a single bit need be set in the requ ...
Chapter 17: Data Synchronization mm/backing-dev.c long congestion_wait(int rw, long timeout) { long ret; DEFINE_WAIT(wait); wait ...
Chapter 17: Data Synchronization nr_pages = global_page_state(NR_FILE_DIRTY) + global_page_state(NR_UNSTABLE_NFS); return pdflus ...
Chapter 17: Data Synchronization have created dirty pages on a mapping. If the number of dirty pages in the system becomes too l ...
Chapter 17: Data Synchronization laptop_timer_fnstartspdflushwithlaptop_flushas the worker function. This causes a full synchron ...
Chapter 17: Data Synchronization sync_filesystemssynchronizes the mounted filesystems by iterating once more over thesuper_block ...
Chapter 17: Data Synchronization whensync_sb_inodesis called. Ifsync_sb_inodeswere called withWB_SYNC_NONEin the first pass, the ...
Chapter 17: Data Synchronization This is what__sync_inodesdoes: ❑ If the superblock is currently being synchronized from another ...
Chapter 17: Data Synchronization The implementation offsyncandfdatasyncdiffers only at a single point (to be more accurate, in a ...
Chapter 17: Data Synchronization The methods provided forfile_operations->fsyncare very similar for most filesystems. Figure ...
Chapter 17: Data Synchronization The implementation of the system call is remarkably simple. As documented in the manual page ms ...
Page Reclaim and Swapping The available RAM memory in a computer is never enough to meet user needs or to always satisfy memory- ...
Chapter 18: Page Reclaim and Swapping................................... Naturally, this procedure also has its limits. At some ...
Chapter 18: Page Reclaim and Swapping ❑ All pages that belong to the process heap and were reserved usingmalloc(and consequently ...
Chapter 18: Page Reclaim and Swapping 18.1.3 Page-Swapping Algorithms Over the last few decades, a whole host of algorithms has ...
Chapter 18: Page Reclaim and Swapping requiring an inordinate amount of time to organize data structures? The simplest LRU varia ...
Chapter 18: Page Reclaim and Swapping free page frames for upcoming needs and minimization of the time needed to perform swap op ...
«
48
49
50
51
52
53
54
55
56
57
»
Free download pdf