Waiting line problems and ada tasking

Keywords

Ada tasking implementation, Interleaved scheduling, Waiting-line models, Processing-time and accuracy comparison, Memory usage analysis

Abstract

Solutions to real-world problems through software systems can typically be implemented, in part, through a number of concurrent tasks. Ada, a high-order language, supports multitasking applications which can be implemented on either multiprocessors or through interleaved execution on a single processor. This research project addresses the implementation of tasks in the software language Ada on a single processor. Specifically, the research develops models of waiting line systems and examines the solutions using Ada tasks. It then presents a solution to the waiting line systems using Ada procedures which cannot be executed in an interleaved fashion, but are executed sequentially. Finally, a comparison is made between the solution using Ada tasks and the solution using Ada procedures. The comparison examines the accuracy, processing time requirements, and memory requirements for each of the implementations.

Notes

This item is only available in print in the UCF Libraries. If this is your thesis or dissertation, you can help us make it available online for use by researchers around the world by STARS for more information.

Graduation Date

1989

Semester

Spring

Advisor

Linton, Darrell G.

Degree

Master of Science (M.S.)

College

College of Engineering

Department

Computer Engineering

Format

PDF

Pages

55 pages

Language

English

Length of Campus-only Access

None

Access Status

Masters Thesis (Open Access)

Identifier

DP0027027

Subjects

Dissertations; Academic -- Engineering; Engineering -- Dissertations; Academic; Queuing theory--Computer programs; Queuing theory--Simulation methods; Multitasking (Computer science); Sequential processing (Computer science); Parallel processing (Electronic computers)--Evaluation

Accessibility Status

Searchable text

This document is currently not available here.

Share

COinS
 

Accessibility Statement

This item was created or digitized prior to April 24, 2026, or is a reproduction of legacy media created before that date. It is preserved in its original, unmodified state specifically for research, reference, or historical recordkeeping. In accordance with the ADA Title II Final Rule, the University Libraries provides accessible versions of archival materials upon request. To request an accommodation for this item, please submit an accessibility request form.