ACM Home Page
Please provide us with feedback. Feedback
On real-time transactions
Full text PdfPdf (859 KB)
Source ACM SIGMOD Record archive
Volume 17 ,  Issue 1  (March 1988) table of contents
Special Issue on Real-Time Database Systems
Pages: 4 - 18  
Year of Publication: 1988
ISSN:0163-5808
Authors
John A. Stankovic  University of Massachusetts, Boston
Wei Zhao  Amherst College, Amherst, MA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 22,   Citation Count: 22
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/44203.44204
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
[1] Biyabani, S., "Criticalness Considerations in Task Allocation in Hard Real-Time Systems," Masters Thesis, Univ. of Mass, in preparation.
 
2
[2] Blazewicz, J., "Deadline Scheduling of Tasks with Ready Times and Resource Constraints", Information Processing Letters, Vol. 8, No. 2, February 1979.
 
3
[3] Leinbaugh, D., "Guaranteed Response Times in a Hard Real-Time Environment," IEEE Trans on Soft Eng., Vol. SE-6, January 1980.
 
4
[4] M. L. Molle and Lenonard Kleinrock, "Virtual Time CSMA: Why Two Clocks are Better than One", IEEE transactions on Communications, Vol. COM-33, No. 9, September 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.
 
6
[6] Stankovic, J. and K. Ramamritham, "The Design of the Spring Kernel," Proc 1987 Real Time Systems Symposium, 1987.
 
7
[7] Stankovic, J., and L. Sha, "The Principle of Segmentation," Technical Report, 1987.
 
8
 
9

CITED BY  22

Collaborative Colleagues:
John A. Stankovic: colleagues
Wei Zhao: colleagues