article

Free access

Priority inversion in Ada

Authors:

Dennis Cornhill,

Lui ShaAuthors Info & Claims

ACM SIGAda Ada Letters, Volume VII, Issue 7

Pages 30 - 32

https://doi.org/10.1145/36072.36073

Published: 01 November 1987 Publication History

PDF eReader

References

[1]

[1] Burns, A. Using Large Families for Handling Priority Requests. Ada Letters, January, February 1987.

Digital Library

Google Scholar

[2]

[2] Cornhill, D. T., Sha, L., Lehoczky, J. P., Rajkumar, R., Tokuda, H. Limitations of Ada for Real-Time Scheduling. International Workshop on Real-Time Ada Issues, 1987.

Digital Library

Google Scholar

[3]

[3] Liu, C. L. and Layland J. W. Scheduling Algorithms for Multiprogramming in a Hard Real Time Environment. JACM 20 (1): 46-61, 1973.

Digital Library

Google Scholar

Cited By

View all

Muller SSinger KKeeney DNeth AAgrawal KLee IAcar U(2023)Responsive Parallelism with SynchronizationProceedings of the ACM on Programming Languages10.1145/35912497:PLDI(712-735)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591249
Faldella ELoreti D(2021)Precise Worst-Case Blocking Time of Tasks Under Priority Inheritance ProtocolIEEE Transactions on Computers10.1109/TC.2020.302932870:11(1901-1913)Online publication date: 1-Nov-2021
https://doi.org/10.1109/TC.2020.3029328
Muller SAcar UHarper R(2018)Competitive parallelism: getting your priorities rightProceedings of the ACM on Programming Languages10.1145/32367902:ICFP(1-30)Online publication date: 30-Jul-2018
https://dl.acm.org/doi/10.1145/3236790
Show More Cited By

Index Terms

Priority inversion in Ada
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types

Recommendations

Deterministic priority inversion in Ada selective waits

Priority inversion is any situation where low priority tasks are served before higher priority tasks. It is recognized as a serious problem for real-time systems. In the course of building a performance model for multi-tasking Ada software, we have ...
The impact of priority generations in a multi-priority queueing system: a simulation approach
WSC '09: Winter Simulation Conference

In this paper, we consider a preemptive (multiple) priority queueing model in which arrivals occur according to a Markovian arrival process (MAP). An arriving customer belongs to priority type i, 1 ≤ i ≤ m+1, with probability p_i. The highest priority, ...
An N-Server Cutoff Priority Queue

We consider a multi-priority, nonpreemptive, multi-server queueing system, with Poisson arrivals and negative exponential service times. In order to save available servers for higher priority customers, the system deliberately queues arriving lower ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ACM SIGAda Ada Letters Volume VII, Issue 7

November/December 1987

52 pages

ISSN:1094-3641

DOI:10.1145/36072

Editor:
Cammie Donaldson
Software Productivity Solutions, Melbourne, FL

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 1987

Published in SIGADA Volume VII, Issue 7

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

21
Total Citations
View Citations
219
Total Downloads

Downloads (Last 12 months)53
Downloads (Last 6 weeks)16

Reflects downloads up to 25 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Muller SSinger KKeeney DNeth AAgrawal KLee IAcar U(2023)Responsive Parallelism with SynchronizationProceedings of the ACM on Programming Languages10.1145/35912497:PLDI(712-735)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591249
Faldella ELoreti D(2021)Precise Worst-Case Blocking Time of Tasks Under Priority Inheritance ProtocolIEEE Transactions on Computers10.1109/TC.2020.302932870:11(1901-1913)Online publication date: 1-Nov-2021
https://doi.org/10.1109/TC.2020.3029328
Muller SAcar UHarper R(2018)Competitive parallelism: getting your priorities rightProceedings of the ACM on Programming Languages10.1145/32367902:ICFP(1-30)Online publication date: 30-Jul-2018
https://dl.acm.org/doi/10.1145/3236790
Cucinotta TAbeni LLelli JLipari G(2017)Improving responsiveness of time‐sensitive applications by exploiting dynamic task dependenciesSoftware: Practice and Experience10.1002/spe.255748:4(820-841)Online publication date: 29-Dec-2017
https://doi.org/10.1002/spe.2557
Levine G(2012)Priority inversion with fungible resourcesACM SIGAda Ada Letters10.1145/2148436.214843831:2(9-14)Online publication date: 22-Feb-2012
https://dl.acm.org/doi/10.1145/2148436.2148438
Levine G(2009)Ada for the control of degradation of serviceACM SIGAda Ada Letters10.1145/1620593.162059629:2(20-27)Online publication date: 25-Sep-2009
https://dl.acm.org/doi/10.1145/1620593.1620596
Naeser G(2005)Priority inversion in multi processor systems due to protected actionsACM SIGAda Ada Letters10.1145/1064303.1064304XXV:1(43-47)Online publication date: 1-Mar-2005
https://dl.acm.org/doi/10.1145/1064303.1064304
Battini FMantovani PMattavelli M(2005)Evaluation of a SPARC board equipped with the Ada Tasking Coprocessor (ATAC)Ada in Europe10.1007/BFb0015509(379-388)Online publication date: 9-Jun-2005
https://doi.org/10.1007/BFb0015509
Boriani D(1995)Object-oriented Ada-based development of highly reusable control softwareISA Transactions10.1016/0019-0578(94)00049-R34:1(39-51)Online publication date: Mar-1995
https://doi.org/10.1016/0019-0578(94)00049-R
Audsley NBurns ADavis RTindell KWellings A(1995)Fixed priority pre-emptive schedulingReal-Time Systems10.1007/BF010943428:2-3(173-198)Online publication date: 1-Mar-1995
https://dl.acm.org/doi/10.1007/BF01094342
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

Deterministic priority inversion in Ada selective waits

The impact of priority generations in a multi-priority queueing system: a simulation approach

An N-Server Cutoff Priority Queue

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations