skip to main content
10.1145/58612.59370acmconferencesArticle/Chapter ViewAbstractPublication PagesirtawConference Proceedingsconference-collections
Article
Free Access

Comprehensive scheduling controls for Ada tasking

Published:01 June 1988Publication History

ABSTRACT

One of the functions for which Ada needs more expressive power is scheduling control. Scheduling controls provide a mechanism for comprehensive scheduling.

In order to evaluate any concurrent language for its ability to control a multi-events environment, we need to have a general set for classifying all possible controls. Such a classification can exploit the expressive power of any concurrent language, and thus be used to provide us with a priori knowledge regarding the capacity of the language to be used for a specific application. It will also enable us to suggest the best environment for the application at hand. Evaluating Ada against these control capacities will provide us with a scientific approach to the issue of forming an integrated design of comprehensive scheduling controls for Ada.

References

  1. C.D. Cornhil, "Tasking Session Summary" Proceeding of the 1st International Workshop on Real Time Ada Issues Moretonhampstead, Devon, UK. 1987 Ada Letters Vol. VII, Num. 6, Fall 1987.Google ScholarGoogle Scholar
  2. EM1.T. Elrad, F. Maymir-Ducharme "Introducing the Preference Control Primitive: "Experience with Controlling Nondeterminism in Ada", Proceedings of the 1986 Washington Ada Symposium in Lurel, Maryland, March 24 - 26, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. EM2.T. Elrad, F. Maymir-Ducharme, "Efficiently Controlling Communication in Ada Using Preference Control", Proceedings of the IEEE 1986 Military Communications Conference in Monterey, California, October 5-9, 1986.Google ScholarGoogle Scholar
  4. EM3.T. Elrad, F. Maymir " Satisfying Emergency Communication Requirements With Dynamic Preference Control" Proceeding of the Sixth Annual National Conference on Ada Technology , Mach 14-17 1988.Google ScholarGoogle Scholar
  5. GR.N. Gehani, W. Roome "Concurrent-C*" AT&T Bell Lab. Murray Hill, New Jersy. 07974, 1985.Google ScholarGoogle Scholar

Index Terms

  1. Comprehensive scheduling controls for Ada tasking

          Recommendations

          Comments

          Login options

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

          Sign in
          • Published in

            cover image ACM Conferences
            IRTAW '88: Proceedings of the second international workshop on Real-time Ada issues
            June 1988
            126 pages
            ISBN:0897912950
            DOI:10.1145/58612
            • cover image ACM SIGAda Ada Letters
              ACM SIGAda Ada Letters  Volume VIII, Issue 7
              Special edition: International Workshop on Real-Time Ada Issues
              June 1-3, 1988
              102 pages
              ISSN:1094-3641
              DOI:10.1145/59368
              Issue’s Table of Contents

            Copyright © 1988 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 June 1988

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader