Semantic Models for Parallel Systems

Abstract

This paper presents a semantic model for parallel systems with a scheduling mechanism that is useful for expressing and proving a wider range of properties than semantic models which do not consider scheduling. We formally describe a number of properties related to scheduling and deadlock, including 'Fairness' and 'Fullness', and show that schedulers with these properties behave in desireable ways. Lastly, we prove and conjecture some proof rules for scheduled systems and outline briefly the relation of this work to modelling protection in parallel systems.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1975
Accession Number
ADA019661

Entities

People

  • Ellis S. Cohen

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Artificial Intelligence
  • Computational Science
  • Computer Languages
  • Computer Programming
  • Computer Science
  • Computers
  • Language
  • Machines
  • Models
  • Operating Systems
  • Programming Languages
  • Scheduling (Production)
  • Scientific Research
  • Semantic Models
  • Semantics
  • Theory Of Computation

Fields of Study

  • Computer science

Readers

  • Computational Linguistics
  • Mathematical Modeling and Probability Theory.
  • Parallel and Distributed Computing.