• DocumentCode
    2424712
  • Title

    Absolute and relative temporal constraints in hard real-time databases

  • Author

    Audsley, N.C. ; Burns, A. ; Richardson, M.F. ; Wellings, A.J.

  • Author_Institution
    University of York,
  • fYear
    1992
  • fDate
    3-5 June 1992
  • Firstpage
    148
  • Lastpage
    153
  • Abstract
    Application of a conventional database to a hard realtime system requires two inter-related NP-complete problems to be solved: database concurrency control and task scheduling. Starting from temporal constraints on data objects in the database, the techniques described in this paper can be used to reduce the problem to a single NP-complete scheduling problem. Standard scheduling theory can then be applied.
  • Keywords
    Application software; Concurrency control; Data engineering; Database systems; NP-complete problem; Processor scheduling; Real time systems; Timing; Transaction databases;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Real-Time Systems, 1992. Proceedings., Fourth Euromicro workshop on
  • Conference_Location
    Athens, Greece
  • Print_ISBN
    0-8186-2815-4
  • Type

    conf

  • DOI
    10.1109/EMWRT.1992.637486
  • Filename
    637486
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2424712