Home Forums Programming General Can eliminating blocking / deadlocking ever be BAD for performance? RE: Can eliminating blocking / deadlocking ever be BAD for performance?

  • May 20, 2016 at 4:26 pm

    #1880617

    GilaMonster (5/20/2016)

    It is possible to eliminate deadlocks in such a way that it degrades overall performance, I'm fixing a system which did just that.

    In order to eliminate deadlocks on ImportantTableA, they used applocks to ensure that only one session could ever be accessing ImportantTableA. Needless to say, that's made everything slooooow (hence why I'm fixing it)

    But that's not normally how one fixes deadlocks.

    There must be a disturbance in the Force. I'm going through that very same thing right now. It also uses/reserves extra blocks of memory ironically driving some of the faster code out of cache.

    --Jeff Moden

    RBAR is pronounced "ree-bar" and is a "Modenism" for Row-By-Agonizing-Row.
    First step towards the paradigm shift of writing Set Based code:
    ________Stop thinking about what you want to do to a ROW... think, instead, of what you want to do to a COLUMN.

    Change is inevitable... Change for the better is not.

    Helpful Links:
    How to post code problems
    How to Post Performance Problems
    Create a Tally Function (fnTally)