Performance model of interference avoidance policy using stochastic Petri nets

Takashi Kobayashi, K. Kurihara
{"title":"Performance model of interference avoidance policy using stochastic Petri nets","authors":"Takashi Kobayashi, K. Kurihara","doi":"10.1109/PNPM.1991.238775","DOIUrl":null,"url":null,"abstract":"A new method is described for analyzing scheduling policy for interference avoidance. The traditional queuing theory assuming a first-come-first-served policy is not suitable for analyzing scheduling policy. Stochastic Petri net (SPN) is suitable for analyzing scheduling policy, because with it job arrival states, resource assignment states, and job flow due to these states can be modeled. However, if the scheduling logic is described in detail with SPN, a combinatorial explosion is soon encountered. Therefore, a new method is proposed to cut down the size of SPN model and to analyze the control policy of a magnetic tape library.<<ETX>>","PeriodicalId":137470,"journal":{"name":"Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PNPM.1991.238775","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A new method is described for analyzing scheduling policy for interference avoidance. The traditional queuing theory assuming a first-come-first-served policy is not suitable for analyzing scheduling policy. Stochastic Petri net (SPN) is suitable for analyzing scheduling policy, because with it job arrival states, resource assignment states, and job flow due to these states can be modeled. However, if the scheduling logic is described in detail with SPN, a combinatorial explosion is soon encountered. Therefore, a new method is proposed to cut down the size of SPN model and to analyze the control policy of a magnetic tape library.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于随机Petri网的干扰避免策略性能模型
提出了一种新的抗干扰调度策略分析方法。传统的排队理论假设先到先得的策略不适合分析调度策略。随机Petri网(Stochastic Petri net, SPN)适用于调度策略分析,因为它可以对作业到达状态、资源分配状态以及由这些状态引起的作业流进行建模。然而,如果用SPN详细描述调度逻辑,很快就会遇到组合爆炸。为此,提出了一种减小SPN模型大小和分析磁带库控制策略的新方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Estimating the mean cycle time for stochastic safe marked graphs A parallel algorithm for computing invariants of Petri net models Throughput lower bounds for Markovian Petri nets: transformation techniques On periodic schedules for deterministically timed Petri net systems Reliability modeling of the MARS system: a case study in the use of different tools and techniques
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1