GTU MCA MATERIAL FOR DBMS II

RSS
  • Home
  • Quick Review
  • Assignment
  • Backup and Recovery
  • Differences
  • About Me

Monday, March 21, 2011

Starvation Vs Deadlock


Starvation
Deadlock
Starvation happens if same transaction is always choosen as victim.
A deadlock is a condition in which two or more transaction are waiting for each other.
It occurs if the waiting scheme for locked items in unfair, giving priority to some transactions over others.
A situation where two or more transactions are unable to proceed because each is waiting for one of the other to do something.
Starvation is also known as lived lock.
Deadlock is also known as circular waiting.
Avoidance:
->switch priorities so that every thread has a chance to have high priority.
-> Use FIFO order among competing request.
Avoidance:
->Acquire locks are predefined order.
->Acquire locks at once before starting.
It means that transaction goes in a state where transaction never progress.
It is a situation where transactions are waiting for each other.
Example :
Example :
Posted by Dr. Parag Shukla at 11:59:00 PM
Email This BlogThis! Share to X Share to Facebook

0 comments:

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments (Atom)

Total Pageviews

255040

Blog Archive

  • ►  2019 (1)
    • ►  March (1)
  • ►  2016 (7)
    • ►  August (6)
    • ►  July (1)
  • ▼  2011 (16)
    • ►  May (2)
    • ►  April (6)
    • ▼  March (5)
      • Starvation Vs Deadlock
      • Lost Update Vs Uncommitted Data
      • Serial Schedule Vs Non-Serial Schedule
      • Dirty Read Vs Unrepeatable Read
      • Assignment - 3 Database Backup and Recovery
    • ►  February (3)
  • ►  2010 (9)
    • ►  May (4)
    • ►  March (5)
  • ►  2009 (1)
    • ►  December (1)

Followers

Blog List

Search

Parag Shukla. Powered by Blogger.

Popular Posts

  • Serial Schedule Vs Non-Serial Schedule
    Serial Schedule Non-Serial Schedule A serial schedule is a sequence of operat...
  • Dirty Read Vs Unrepeatable Read
    Dirty Read Unrepeatable Read A dirty read problem occurs when one transaction updates a ...
  • Log Based Recovery
    Log Based Recovery The most widely used structure for recording database modification is the log. The log is a sequence of log ...
  • Lost Update Vs Uncommitted Data
    Lost Update Uncommitted Data This problem is also known as “Multiple Update...
  • Shadow Paging
    Shadow Paging This technique does not require LOG in single user environment In mult...
  • Starvation Vs Deadlock
    Starvation Deadlock Starvation happens if same transaction is always choosen ...
  • Checkpoints
    Checkpoints When System failure occurs o We must consult log to determine those transaction that need to be redone and those tra...
  • Defferred Update method
    Deferred update Do not physically update the database on disk until after a transaction reaches its commit point; Then updates are r...
  • Assignment - 7 Query Processing & Optimization
    Assignment – 7         Query Processing & optimization    Submission Date 30-05-11   Q-1. Explain th...
  • Immediate Update Method
    Immediate update technique Database may be updated by some operations of a transaction before the transaction reaches its commit poi...
Copyright © 2010 GTU MCA MATERIAL FOR DBMS II