Work-in-Progress: Lock-Based Software Transactional Memory for Real-Time Systems

Catherine E. Nemitz, James H. Anderson
{"title":"Work-in-Progress: Lock-Based Software Transactional Memory for Real-Time Systems","authors":"Catherine E. Nemitz, James H. Anderson","doi":"10.1109/RTSS.2018.00026","DOIUrl":null,"url":null,"abstract":"We propose a method for designing software transactional memory that relies on the use of locking protocols to ensure that transactions will never be forced to retry. We discuss our approaches to implementing this method and tunable parameters that may be able to improve schedulability on an application-specific basis.","PeriodicalId":294784,"journal":{"name":"2018 IEEE Real-Time Systems Symposium (RTSS)","volume":"2 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Real-Time Systems Symposium (RTSS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RTSS.2018.00026","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We propose a method for designing software transactional memory that relies on the use of locking protocols to ensure that transactions will never be forced to retry. We discuss our approaches to implementing this method and tunable parameters that may be able to improve schedulability on an application-specific basis.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
正在进行的工作:实时系统中基于锁的软件事务性内存
我们提出了一种设计软件事务性内存的方法,该方法依赖于锁定协议的使用,以确保事务永远不会被强制重试。我们将讨论实现此方法的方法和可调参数,这些参数可能能够在特定于应用程序的基础上提高可调度性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
NoCo: ILP-Based Worst-Case Contention Estimation for Mesh Real-Time Manycores Distributed Real-Time Shortest-Paths Computations with the Field Calculus Dynamic Channel Selection for Real-Time Safety Message Communication in Vehicular Networks An Efficient Knapsack-Based Approach for Calculating the Worst-Case Demand of AVR Tasks Schedulability Analysis of Adaptive Variable-Rate Tasks with Dynamic Switching Speeds
×
引用
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