Date of Publication

9-14-1994

Document Type

Master's Thesis

Degree Name

Master of Science in Computer Science

Subject Categories

Computer Sciences

College

College of Computer Studies

Department/Unit

Computer Science

Thesis Adviser

Arnulfo Azcarraga

Defense Panel Chair

Raymund Sison

Defense Panel Member

Kelsey Hartigan Go
Roshan Tarar

Abstract/Summary

Given n processes submitted to a system for execution, there are n! possible ways to schedule the n processes. However, some of these schedules are not feasible due to time constraints. To lessen the number of candidate schedules, the infeasible schedules must be removed. By using defined process algebra axioms and theorems, the problem of reducing the combinatorial complexity of a process graph corresponding to a process expression that represents the possible schedules for n processes is resolved. Existing and new sets of notations and nomenclatures are used to describe processes and their time properties. These time properties are incorporated into the process graph representing a process expression. This process graph is then reduced through an algorithm that applies newly defined reduction theorems.

Abstract Format

html

Language

English

Format

Print

Accession Number

TG02317

Shelf Location

Archives, The Learning Commons, 12F Henry Sy Sr. Hall

Physical Description

57 leaves

Keywords

Algorithms; Combinatorial analysis; Graph theory--Data processing; Computational complexity; Electronic data processing; Machine theory

Upload Full Text

wf_yes

Download

Share

COinS