GoConqr has a new look! Let us know what you think.

Flashcards

Untitled

Dylan Whitehurst Computer Science English 12 cards

Untitled

Cards in this deck (12)

  1. 1If a system is not in a safe state, will it deadlock?Maybe
  2. 2at T0: 3 drives are available. Is the system in a safe state?Yes (safe state: ).
    -P1 can be given 2 tape drives
    -When P1 releases its resources; there are 5 drives
    - P0 uses 5 and subsequently releases them.
    - P2 can then proceed.
    at T0: 3 drives are available. Is the system in a safe state?
  3. 3What is the resource allocation graph algorithm?A deadlock avoidance algorithm where only one instance of each resource type is available:What is the resource allocation graph algorithm?
  4. 4What is Banker's algorithm?A deadlock avoidance algorithm for multiple instances of each type. Uses Available, Max, Allocation, and Need Vectors:What is Banker's algorithm?
  5. 5How do you detect deadlocks?Single instance of each resource: use wait-for graph.
    Multiple instances: variation of baker's.
  6. 6What is Dynamic Loading, Linking, and Swapping?Dynamic loading: Routine is not loaded until it is called.
    Dynamic linking: Linking postponed until execution time.
    Swapping: a process can be swapped temporarily out of memory to a backing store and then brought back into memory for continued execution.
  7. 7How is a page table implemented?Page table is kept in main memory:
    -Page-table base register (PTBR) points to the page table,
    -length register (PTLR) indicates size of page table.
    Every data/instruction access requires 2 memory accesses:
    -1 for page table, 1 for data/instruction.
    - Two-memory access problem is solved by use of special fast-lookup hardware cache (i.e. cache page table in registers.): Associative registers or TLBs.
  8. 8What is a diagram for page tables?What is a diagram for page tables?
  9. 9How do you calculate effective access time?How do you calculate effective access time?
  10. 10What are the different paging methods?What are the different paging methods?
  11. 11What is the diagram that shows how a page table accesses memory?What is the diagram that shows how a page table accesses memory?
  12. 12What are the advantages of virtual memory?- Separation of user logical memory from physical memory.
    - Only PART of the program needs to be in memory or execution.
    - Logical address space can therefor be much larger than physical address space.
    - Need to allow pages to be swapped in and out.

Information

Description
Computer Science Flashcards on Untitled, created by Dylan Whitehurst on 06/05/2022.
Views
0
Rating

Feedback

What is it about?

What do you think of the new look?

How do you like it?