Scheduling in Real-Time Distributed Systems - A Review.

Abstract

The scheduling problem is considered to be a crucial part in the design of real-time distributed computer systems. This paper gives an extensive survey of the research performed in the area of real-time scheduling, which includes localized and centralized scheduling and allocation techniques. We classify the scheduling strategies into four basic categories: static and dynamic priorities, heuristic approaches, scheduling with precedures relations, allocation policies and strategies.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1987
Accession Number
ADA192540

Entities

People

  • Ashok Agrawala
  • Satish K. Tripathi
  • Xiaoping Yuan

Organizations

  • University of Maryland

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Addressing
  • Algorithms
  • Batch Processing
  • Classification
  • Clustering
  • Computations
  • Computer Science
  • Computers
  • Couplings
  • Guarantees
  • Heuristic Methods
  • Maryland
  • Operating Systems
  • Parallel Computing
  • Simulations
  • Trees (Data Structures)
  • Universities

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Operations Research
  • Systems Analysis and Design