Date of Publication

4-1995

Document Type

Master's Thesis

Degree Name

Master of Science in Computer Science

Subject Categories

Computer Sciences | Theory and Algorithms

College

College of Computer Studies

Department/Unit

Computer Science

Thesis Adviser

Arnulfo P. Azcarraga

Defense Panel Chair

Kelsey Hartigan Go

Defense Panel Member

Raymond C. Sison
Roshan Tarar

Abstract/Summary

Because academic interest in distributed computer systems is expected to continually grow, software professionals can benefit from understanding the special challenges posed by distributed software development. Distributed software system design requires that the system be divided into several software processes and data files and that these be allocated to the distributed system's various processors. In the design, the task allocation activity is the assignment of each processes and data file to one or more system processors. One of the keys to task allocation is to establish a model in terms of minimizing the total execution and interprocessor communication cost and taking both deadlines and queuing delays into consideration. The category to which the proposed model falls is the heuristic approach where optimality is being traded off for speed and is useful when an optimal solution is not required or not obtainable within a time limit. Process algebra is the mathematical tool used to represent the operations during task assignment as well as the results.

Abstract Format

html

Language

English

Format

Electronic

Accession Number

TG02575

Shelf Location

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

Physical Description

90 leaves; 28 cm.

Keywords

Algorithms; Heuristic programming; Algebra--Computer programs

Upload Full Text

wf_yes

Download

Share

COinS