On real-time transactions

Author:

Stankovic John A.1,Zhao Wei2

Affiliation:

1. University of Massachusetts, Boston

2. Amherst College, Amherst, MA

Abstract

Next generation real-time systems will require greater flexibility and predictability than is commonly found in today's systems. These future systems include the space station, integrated vision/robotics/AI systems, collections of humans/robots coordinating to achieve common objectives (usually in hazardous environments such as undersea exploration or chemical plants), and various command and control applications. The complexity of such systems due to timing constraints, concurrency, and distribution is high. It is accepted that the synchronization, failure atomicity, and permanence properties of transactions aid in the development of distributed systems. However, little work has been done in exploiting transactions in a real-time context. We have been attempting to categorize real-time data into classes depending on their time, synchronization, atomicity, and permanence properties. Then, using the semantics of the data and the applications, we are developing special, tailored, real-time transactions that only supply the minimal properties necessary for that class. This reduces the system overhead in supporting access to various types of data. The eventual goal is to verify that timing requirements can be met.

Publisher

Association for Computing Machinery (ACM)

Subject

Information Systems,Software

Reference8 articles.

1. {1} Biyabani S. "Criticalness Considerations in Task Allocation in Hard Real-Time Systems " Masters Thesis Univ. of Mass in preparation. {1} Biyabani S. "Criticalness Considerations in Task Allocation in Hard Real-Time Systems " Masters Thesis Univ. of Mass in preparation.

2. Deadline scheduling of tasks with ready times and resource constraints

3. Guaranteed Response Times in a Hard-Real-Time Environment

4. Virtual Time CSMA: Why Two Clocks are Better than One;Molle;IEEE transactions on Communications,1985

5. {5} Ramamritham K.: and J. Stankovic "Dynamic Task Scheduling in Distributed Hard Real-Time Systems " IEEE Software Vol. 1 No. 3 July 1984. {5} Ramamritham K.: and J. Stankovic "Dynamic Task Scheduling in Distributed Hard Real-Time Systems " IEEE Software Vol. 1 No. 3 July 1984.

Cited by 38 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. A Priority Inheritance Centered Locking Protocol for DRTDBS;Wireless Personal Communications;2023-03-11

2. STEP: A Concomitant Protocol for Real Time Applications;Wireless Personal Communications;2021-09-21

3. Priority Heuristic in MDRTDBS;International Journal of Sensors, Wireless Communications and Control;2020-12

4. Atomic Scheduling of Appliance Energy Consumption in Residential Smart Grids;Energies;2019-09-25

5. Design and Realization of WInternet;ACM Transactions on Cyber-Physical Systems;2017-02-21

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3