The Open Source Swiss Army Knife

/programmingToolBox/oper_systems/
/programmingToolBox/oper_systems/ + sub-categories
http://www.sirfsup.com/
web directory content
    
      

Not logged in
Chat Register Login
return to:  http:/www.sirfsup.com      /programmingToolBox   /oper_systems 
sub-categories and articles

                                                  
dir3733 add
dirPSJF_advanced process simulator shows when PSJF is better than SJF
dirPSJF_advanced2 failed attempt to use complicated experiments and run sheets for the process simulator
dirPSJF_basic gannt charts of PSJF versus SJF; used java process simulator
dirPSJF_better PSJF better than SJF in these cases because it doesn't let the longer, less cpu time one run at all.
dirrec add
dirrec8 add
dirsimulator add
dirunix_c unix c system calls and programming: pipes, fd, sockets, threads
   --->create new sub-category


connection_communication.txt
add

moved it all over to thanks delete after one year forgetful

context_switch_time.html
add


critical.txt
add

critical sections

  1. uses
  2. definitions
  3. requirements of a successful solution
  4. producer and consumer problem
  5. hardware setAndTest atomic operation
  6. monitors

disk_head_scheduling.txt
add

algorithms for disk access ========================== silberschatz one page how is IO scheduled

filesystems.txt
add

see http://www.cim.mcgill.ca/~franco/OpSys-304-427/lecture-notes/node27.html

final.txt
add

question on interpreting the critical section by looking at the code, tell how it works like it does final exam operating systems 3343 ================================= write a signal handler which ignores a signal

linux_scheduling.txt
add

scheduling ========== quantum =======

load_average.html
load_average = total_wait_time / total_run_time


memory.txt
TLB virtaul memory physical memory translation

memory.txt

  1. memory_advanced.txt: memory_advanced.txt
  2. relocatable_modules.txt: relocatable_modules.txt

memory_advanced.txt
linux specific memory management from "linux kernel" book

memory addressing not covered in class

  1. memory.txt: memory management excluding the below
  2. relocatable_modules.txt: compiling, linking, loading

midterm1.txt
add

midterm1 ======== emphasis on concepts not on code (but see below for notes on knowing syntax of read/write functions) diff bw buffering and spooling as far as basic OS are concerned

monitor.txt
add

monitors ======== hard to understand. After having studied semaphores and critical sections, lots of stuff of monitors is different. monitors are like classes but

movements.txt
add

rec7 was moved to /unix_c/pipes/token_ring connection_communication.txt moved to /languages/c/unix_c/socket_libs/uici/ signals.txt moved to /languages/c/unix_c/signals/signals.txt semaphore section of critical.txt to /languages/c/unix_c/sem/sem.txt

mutex.txt
add

mutexes ======= for mutex discussion, deal with their application not their, uh, how-they-work mutexes and semaphores

openbsd.glob.c
add

/*

program_mem_addresses.txt
add

how programs manage memory: 1. memory references are symbolic 2. symbolic references must be changed 3. compiler responsible for some of the binding process.

relocatable_modules.txt
compilers linking loading dynamic loading

relocatable program modules

  1. memory_advanced.txt: memory_advanced.txt
  2. memory.txt: memory.txt
  3. programs_mem relocatable program modules
  4. when does address translation take place
  5. loading dynamically
  6. linking dynamically

scheduling.txt
process scheduling algorithms used by the cpu

  1. queues
  2. criteria for comparisons of the algorithms
  3. algorithms list
  4. fcfs fcfs
  5. sjf sjf
  6. sjfa sjfa
  7. rr rr
  8. multilevel queues and feedback queues

wait_time_loadAvg.txt
add

1. dont set duration less than cpu bursts this will not work :) 2. PSJF has avg wait time 50% less than SJF given when: answer: part 3a: PSJF will do better than SJF if a short job (small CPU burst) enters the ready queue when a long job (large remaining CPU burst) is running. The short processes will have to wait. If the long job is not preempted all the short CPU bursts must wait for the longer burst to finish. 3c. parameters required to know:
   --->upload your article


User submitted category site links


(None)

-->submit a page from your site dealing with oper_systems to the sirfsup! web directory for listing

return to top