Data Buffering and Caching

Similar Posts

  • Scheduling of Batch Processes

    A batch process performs a long-running and generally repetitive task that does not require any intervention from the user. Ex: Payroll, insurance claims processing, weather prediction, scientific calculations. These are typically run on a server and not a desktop user machine. The FIFO (First-In-First-Out) algorithm, also known as FCFS (First-Come-First-Serve), schedules processes strictly according to the process arrival…

  • Deadlock Detection

    A deadlock in a resource allocation graph can be detected by executing a graph reduction algorithm by repeating this process: Select an unblocked process p. Remove p, including all request and allocation edges connected to p. Anything left is blocked, and risks deadlock. However, it is considered completely reducible if there are no processes left…

  • Combined Approaches

    If you work with a system that only has batch processes, or only does real time applications, then your scheduling algorithm selection is much easier. You pick an appropriate choice and go with it… However, the modern desktop OS will often include a combination of batch, interactive, and real-time applications. Therefore picking “a” solution isn’t…

  • The OS structure

    The modern OS is a complex structure comprised of millions of lines of code. Not all information is released, and is this core components, or everything including additional apps that have been included? Mac OS X Tiger (10.4) ~ 84 Million Lines of Code Windows Vista (2009) ~50 Million Lines of Code Debian 7.0 (2012)…