Time Constraints in Interrupt-Driven Programs.

Abstract

Relations are derived representing the constraints on processing time in a program with K interrupt levels. Any set of K minimum interrupt intervals and maximum processing times between interrupts which satisfy the relations will assure task completion for each level. The relations may be used to find the minimum interrupt interval which can be serviced by a given program/processor combination, or alternatively to find the maximum available processing time between interrupts at a given level. An application of the relations to a multiplexor program is given. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1971
Accession Number
AD0732296

Entities

People

  • Richard Binder

Organizations

  • University of HawaiĘ»i System

Tags

DTIC Thesaurus Topics

  • Intervals

Readers

  • Computer Science/Computer Engineering/Data Science/Digital Signal Processing.
  • Mathematical Modeling and Probability Theory.