• Notes for assignment 4b

    October 19, 2011

    Dear Students,   For the assignment 4b, please be sure that you show – sufficient proofs that you could get all the things working such as your ps – required changes in syscall_table_32.S (you might already changed it for your previous assignment, but you have to submit the patch file for assignment 4b too) – […]

  • Processes

    October 12, 2011

    A fundamental abstraction provided by the operating system is that of a process. A process corresponds roughly to an application, say Word. To run an application, a process is created and the application is run inside the process. A process contains two sorts of things, data assets, which are called its context and the potential […]

  • Semaphores and Monitors

    October 12, 2011

    Semaphores and monitors are software constructs which make synchronization more convenient. Each has a certain nice model of synchronization. Semaphores, in various forms, are provided as kernel services by all operating systems. They are the basis for synchronized access to data structures in the kernel. Monitors are higher level. They integrate into a programming languages. […]

  • Synchronization algorithms

    October 11, 2011

    Peterson’s Algorithm Peterson’s algorithm is a software-only solution to the synchronization of two processes. In particular, it assures that one and only one of the two processes is in a critical section at a time. In addition to enforcing mutual exclusions, i.e. that at most one of the two processes is in the critical section […]

  • Synchronization

    October 11, 2011

    Programmers must be concerned about the concurrent access to shared data. The correctness of a program is usually considered with the restriction that only the program is manipulating the data. If a program places a certain number in a variable, it expects to retrieve that same number from that variable later on. When multiple threads […]

Powered by Wordpress and MySQL. Theme by Shlomi Noach, openark.org