charmzsulit.blogspot.com
CS-223 Operating System: November 2007
http://charmzsulit.blogspot.com/2007_11_01_archive.html
Thursday, November 29, 2007. How each emplements virtual memory? Is a great guide in better understanding and working with the entire kernel. How each handles page sizes? How each handles page fault? If the page is not available- a page fault occurs and the kernel either kills the process or loads the page from disk, depending on the value in the page table (which is up to the kernel to set). How each handles working set? How it reconciles thrashing issues? Sharmey O. Sulit. Wednesday, November 21, 2007.
delacruzjc18.blogspot.com
CS-223 Operating System: January 2008
http://delacruzjc18.blogspot.com/2008_01_01_archive.html
Tuesday, January 15, 2008. 1 The major difference between deadlock, starvation and race is that in deadlock, the problem occurs when the jobs are processed. Starvation, however is the allocation of resource that prevents one job to be executed. Race occurs before the process has been started. 2 Example of Deadlock: When two person are about to buy one product at the time. Example of Starvation: When one person borrowed a pen from his classmate and his. Classmate get his pen back. Jenifer Cris Dela Cruz.
delacruzjc18.blogspot.com
CS-223 Operating System: December 2007
http://delacruzjc18.blogspot.com/2007_12_01_archive.html
Thursday, December 13, 2007. What is the cause of thrashing? How does the system detect thrashing? Once it detects thrashing, what can the system do to eliminate this problem? Thrashing is caused by under allocation of the minimum number of pages required by a process, forcing it to continuously page fault. The system can detect thrashing by evaluating the level of CPU utilization as compared to the level of multiprogramming. It can be eliminated by reducing the level of multiprogramming. Http:/ ddumagui...
carpizmaricar43.blogspot.com
CS 223 Operating System: December 2007
http://carpizmaricar43.blogspot.com/2007_12_01_archive.html
CS 223 Operating System. Thursday, December 13, 2007. What is the cause of thrashing? For instance, if your computer has a slow. What is the cause of thrashing? How does the system detect thrashing? Once it detects thrashing, what can the system do to eliminate this problem? Q:Once thrashing is detected,what can the operating system do to eliminate it? AMultiprogramming. Why is it used? A multiprogramming is a technique used to utilize maximum CPU time by running multiple programs simultaneousl. The inte...
james716.blogspot.com
CS_223 operating system: Assingment #3
http://james716.blogspot.com/2007/12/assingment-3.html
Thursday, December 13, 2007. What is the cause of thrashing? How does the system detect thrashing? Once it detects thrashing, what can the system do to eliminate this problem? Thrashing is caused by under allocation of the minimum number of pages required by a process, forcing it to continuously page fault. The system can detect thrashing by evaluating the level of CPU utilization as compared to the level of multiprogramming. It can be eliminated by reducing the level of multiprogramming. CS 223 operatin...
james716.blogspot.com
CS_223 operating system: January 2008
http://james716.blogspot.com/2008_01_01_archive.html
Tuesday, January 15, 2008. 1 The major difference between deadlock, starvation and race is that in deadlock, the problem occurs when the jobs are processed. Starvation, however is the allocation of resource that prevents one job to be executed. Race occurs before the process has been started. 2 Example of Deadlock: When two trains approach each other at a crossing, both shall come to a full stop and neither shall start up again until the other has gone. Example of Race: A two car race for a price. Http:/...
delacruzjc18.blogspot.com
CS-223 Operating System: November 2007
http://delacruzjc18.blogspot.com/2007_11_01_archive.html
Thursday, November 29, 2007. On the 32-bit Windows platform, JVM programs can only ever use up to about 1.5–1.6 GiB of memory in RAM per Java VM process. Allocating a heap size greater than this amount will either not work, or force paging and poor performance. Normal memory access techniques used by 32-bit Windows programs use standard linear byte addressing, and so are limited to 4GiB of addressable memory, whether it is real or virtual. Sort of like the DOS 640KiB limit reborn! A reasonable approach t...