We propose a non-preemptive, deadlock free concurrency control mechanism for distributed database systems. The algorithm uses a combination of transaction blocking and roll-back to achieve serialization. Unlike other locking mechanisms presented in the past, the algorithm proposed here uses dynamic attributes of transactions to resolve conflicts to achieve serialization. We argue that using the dynamic attributes of transactions economizes memory use and reduces conflict resolution time.