Accession Number:

ADA019661

Title:

Semantic Models for Parallel Systems

Descriptive Note:

Interim rept.

Corporate Author:

CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE

Personal Author(s):

Report Date:

1975-01-01

Pagination or Media Count:

34.0

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.

Subject Categories:

  • Computer Programming and Software
  • Computer Hardware

Distribution Statement:

APPROVED FOR PUBLIC RELEASE