MDTF: A Most Dependent Transactions First Priority Assignment Heuristic

View Sample PDF

Author(s): Sarvesh Pandey (Madan Mohan Malaviya University of Technology, India)and Udai Shanker (Madan Mohan Malaviya University of Technology, India)
Copyright: 2021
Pages: 15
Source title: Encyclopedia of Organizational Knowledge, Administration, and Technology
Source Author(s)/Editor(s): Mehdi Khosrow-Pour D.B.A. (Information Resources Management Association, USA)
DOI: 10.4018/978-1-7998-3473-1.ch054

Keywords: Administration & Leadership / Business & Management / Business and Organizational Research / Business Science Reference

Purchase

View MDTF: A Most Dependent Transactions First Priority Assignment Heuristic on the publisher's website for pricing and purchasing information.

Abstract

The Equal slack (EQS) heuristic is one of the widely used priority assignment heuristics. However, it severely suffers from the problems of intensive data contention, deadlock, and cyclic restart. To overcome some of the above problems, this chapter proposes a Most Dependent Transaction First (MDTF) priority heuristic that injects the size of dependent transactions of all directly competing transactions (that have requested access to the conflicting data item) in their priority computation. The MDTF heuristic efficiently reduces the data contentions among concurrently executing cohorts; and thus, it reduces the wastage of the system resources. This dynamic cohort priority assignment heuristic reduces the data contention considerably by utilizing the information about the dependency size of cohort(s). Doing this will make it easy for a currently executing cohort to better assess the level of data contention with absolutely no extra communication and time overhead. Such detailed dependency information is very useful to efficiently assign priorities to the cohorts.

The IRMA Community

Research IRM

MDTF: A Most Dependent Transactions First Priority Assignment Heuristic

Purchase

Abstract

Related Content

IRMA Sponsors