一种新的无死锁系统资源管理技术。

Madhavi Devi Botlagunta, Smriti Agrawal, R Rajeswara Rao
{"title":"一种新的无死锁系统资源管理技术。","authors":"Madhavi Devi Botlagunta,&nbsp;Smriti Agrawal,&nbsp;R Rajeswara Rao","doi":"10.1007/s41870-021-00670-6","DOIUrl":null,"url":null,"abstract":"<p><p>Deadlock in a shared resource system is a well-known problem. It has been extensively studied and recently a new class of resource reservation technique is researched upon for deadlock free resource management. This class of technique reserves a portion of the resources. The unreserved resources are freely allocated to any process demanding it. When the unreserved resources are not sufficient for a process demand the reserve pool resources are used such that the process completes and releases all the resources it is holding. This paper presents a new resource reservation technique resource driven DFRR. This technique estimates the optimal number of resources needed for a deadlock free resource reservation policy. The correctness is proved in the form of theorem 1. The theorem 2, suggests the resource reservation with minimal resources. The overhead of the resource pool estimation is <math><mrow><mi>O</mi> <mfenced><mi>n</mi></mfenced> </mrow> </math> and that of resource management is <math><mrow><mi>O</mi> <mfenced><mi>m</mi></mfenced> </mrow> </math> which is optimal for any deadlock handling technique. The effectiveness of the proposed technique is shown in the form of examples and simulation results.</p>","PeriodicalId":73455,"journal":{"name":"International journal of information technology : an official journal of Bharati Vidyapeeth's Institute of Computer Applications and Management","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s41870-021-00670-6","citationCount":"0","resultStr":"{\"title\":\"A novel resource management technique for deadlock-free systems.\",\"authors\":\"Madhavi Devi Botlagunta,&nbsp;Smriti Agrawal,&nbsp;R Rajeswara Rao\",\"doi\":\"10.1007/s41870-021-00670-6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>Deadlock in a shared resource system is a well-known problem. It has been extensively studied and recently a new class of resource reservation technique is researched upon for deadlock free resource management. This class of technique reserves a portion of the resources. The unreserved resources are freely allocated to any process demanding it. When the unreserved resources are not sufficient for a process demand the reserve pool resources are used such that the process completes and releases all the resources it is holding. This paper presents a new resource reservation technique resource driven DFRR. This technique estimates the optimal number of resources needed for a deadlock free resource reservation policy. The correctness is proved in the form of theorem 1. The theorem 2, suggests the resource reservation with minimal resources. The overhead of the resource pool estimation is <math><mrow><mi>O</mi> <mfenced><mi>n</mi></mfenced> </mrow> </math> and that of resource management is <math><mrow><mi>O</mi> <mfenced><mi>m</mi></mfenced> </mrow> </math> which is optimal for any deadlock handling technique. The effectiveness of the proposed technique is shown in the form of examples and simulation results.</p>\",\"PeriodicalId\":73455,\"journal\":{\"name\":\"International journal of information technology : an official journal of Bharati Vidyapeeth's Institute of Computer Applications and Management\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1007/s41870-021-00670-6\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International journal of information technology : an official journal of Bharati Vidyapeeth's Institute of Computer Applications and Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s41870-021-00670-6\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2021/5/10 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International journal of information technology : an official journal of Bharati Vidyapeeth's Institute of Computer Applications and Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s41870-021-00670-6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2021/5/10 0:00:00","PubModel":"Epub","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

共享资源系统中的死锁是一个众所周知的问题。近年来,针对无死锁的资源管理,研究了一类新的资源预留技术。这类技术保留了一部分资源。未保留的资源被自由地分配给任何需要它的进程。当未预留的资源不足以满足进程的需求时,将使用预留池资源,以便进程完成并释放其持有的所有资源。提出了一种新的资源预留技术——资源驱动DFRR。该技术估计无死锁资源保留策略所需的最佳资源数量。用定理1的形式证明了其正确性。定理2,建议以最小的资源保留资源。资源池估计的开销为0 m,资源管理的开销为0 m,这对于任何死锁处理技术都是最优的。算例和仿真结果表明了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

A novel resource management technique for deadlock-free systems.

A novel resource management technique for deadlock-free systems.

A novel resource management technique for deadlock-free systems.

Deadlock in a shared resource system is a well-known problem. It has been extensively studied and recently a new class of resource reservation technique is researched upon for deadlock free resource management. This class of technique reserves a portion of the resources. The unreserved resources are freely allocated to any process demanding it. When the unreserved resources are not sufficient for a process demand the reserve pool resources are used such that the process completes and releases all the resources it is holding. This paper presents a new resource reservation technique resource driven DFRR. This technique estimates the optimal number of resources needed for a deadlock free resource reservation policy. The correctness is proved in the form of theorem 1. The theorem 2, suggests the resource reservation with minimal resources. The overhead of the resource pool estimation is O n and that of resource management is O m which is optimal for any deadlock handling technique. The effectiveness of the proposed technique is shown in the form of examples and simulation results.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信