Welcome to the InfoSci Platform
Reference Hub3
MDTF: A Most Dependent Transactions First Priority Assignment Heuristic

MDTF: A Most Dependent Transactions First Priority Assignment Heuristic

Sarvesh Pandey, Udai Shanker
Copyright: © 2021 |Pages: 15
ISBN13: 9781799834731|ISBN10: 1799834735|EISBN13: 9781799834748
DOI: 10.4018/978-1-7998-3473-1.ch054
Cite Chapter Cite Chapter

MLA

Pandey, Sarvesh, and Udai Shanker. "MDTF: A Most Dependent Transactions First Priority Assignment Heuristic." Encyclopedia of Organizational Knowledge, Administration, and Technology, edited by Mehdi Khosrow-Pour D.B.A., IGI Global, 2021, pp. 742-756. https://doi.org/10.4018/978-1-7998-3473-1.ch054

APA

Pandey, S. & Shanker, U. (2021). MDTF: A Most Dependent Transactions First Priority Assignment Heuristic. In M. Khosrow-Pour D.B.A. (Ed.), Encyclopedia of Organizational Knowledge, Administration, and Technology (pp. 742-756). IGI Global. https://doi.org/10.4018/978-1-7998-3473-1.ch054

Chicago

Pandey, Sarvesh, and Udai Shanker. "MDTF: A Most Dependent Transactions First Priority Assignment Heuristic." In Encyclopedia of Organizational Knowledge, Administration, and Technology, edited by Mehdi Khosrow-Pour D.B.A., 742-756. Hershey, PA: IGI Global, 2021. https://doi.org/10.4018/978-1-7998-3473-1.ch054

Export Reference

Mendeley
Favorite

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.