ACM Home Page
Please provide us with feedback. Feedback
Managing memory for real-time queries
Full text PdfPdf (1.59 MB)
Source International Conference on Management of Data archive
Proceedings of the 1994 ACM SIGMOD international conference on Management of data table of contents
Minneapolis, Minnesota, United States
Pages: 221 - 232  
Year of Publication: 1994
ISBN:0-89791-639-5
Also published in ...
Authors
Hwee Hwa Pang  Institute of Systems Sciences, NUS and Computer Sciences Department, University of Wisconsin - Madison, Madison, WI
Michael J. Carey  Computer Sciences Department, University of Wisconsin - Madison, Madison, WI
Miron Livny  Computer Sciences Department, University of Wisconsin - Madison, Madison, WI
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 30,   Citation Count: 10
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

The demanding performance objectives that real-time database systems (RTDBS) face necessitate the use of priority resource scheduling. This paper introduces a Priority Memory Management (PMM) algorithm that is designed to schedule queries in RTDBS. PMM attempts to minimize the number of missed deadlines by adapting both its multiprogramming level and its memory allocation strategy to the characteristics of the offered workload. A series of simulation experiments confirms that PMM's admission control and memory allocation mechanisms are very effective for real-time query scheduling.


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.

 
Abbo88
 
Abbo89
 
Abbo90
R. Abbott, H. Garcia-Molina, "Scheduling I/O Requests with Deadlines, A Performance Evaluation", Proc. 1990 RTSS Syrup.
 
Bitt88
D. Bitton, J. Gray, "Disk Shadowing", Proc. 1989 VLDB Conf.
 
Brow93
 
Care89
 
Chen91
S. Chen, J.A. Stankovlc, J.F, Kurose, D. Towsley, "Performance Evaluation of Two New Disk Scheduling Algorithms for Real- Time Systems", Real-Time Systems Journal 3(3), 1991
 
Corn89
 
Devo91
J.L. Devore, Probability and Stattstics for Engmeering and the Sciences, Brooks/Cole Pub. Co., 1991, pp. 283-301,326-335.
 
Drap81
N.R Draper, H. Smith, Apphed Regresston Analysis, John Wiley & Sons, Inc., 1981, pp. 70-136.
Hari90
 
Huan89
J. Huang, J.A. Stankovic, D. Towsley, K. Ramamritham, "Experimental Evaluation of Real-Time Transaction Processing", Proc. 1989 RTSS Symp.
 
Kim91
W. Kim, J. Srivastava, "Enhancing Real-Time DBMS Performance with Multiversion Data and Priority Based Disk Scheduling", PrQ#,, 1991 RTSS S_ymp.
Liu73
 
Livn90
M. Livny, "DeNet User's Guide, Version 1.5", Computer Sclences Department. University of Wisconsin, Madison, 1990
Pang93a
 
Pang93b
Sarg76
Shap86
 
Yu93

CITED BY  10

Collaborative Colleagues:
Hwee Hwa Pang: colleagues
Michael J. Carey: colleagues
Miron Livny: colleagues