Results 1 to 2 of 2
  1. #1
    Join Date
    Sep 2012
    Posts
    1

    Transaction Management

    Hello to everyone,

    I 've stumbled upon deadlock and transaction management type of problems, like:

    "Produce a wait-for-graph for the following transaction scenario and determine whether deadlock exists."

    Transaction:

    T1
    T2
    T3
    T4
    T5
    T6
    T7
    T8
    T9
    T10

    Data items locked by transaction:

    X1,X2,X3
    X4,X5,X6
    X7,X8
    X9,X10
    X11,X12
    X13,X14
    X15
    X1111
    X115
    X199

    Data items transaction is waiting for:

    X4,X5,X6,X7
    X7,X8,X9
    X1,X10,X111
    X7,X11,X12
    X5 X6,X1,X2,X3,X11,X12
    X5
    X1,X115
    X1
    X11,X12


    I am doing a research, and found some documents which explain very briefly few solutions to similar but simpler exercises, however, nothing too much useful. I would appreciate any references given on this forum, or help, on how to solve exercises like this.

  2. #2
    Join Date
    Oct 2009
    Location
    221B Baker St.
    Posts
    486
    I believe you need to show the transaction ids in the lists of data item ids.

    Do you intent to manyally plot the intersections between the locked items and the waiting-for items?

    How did you "stumble" upon this or is this a homework assignment?

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •