Files in this item

FilesDescriptionFormat

application/pdf

application/pdf9543600.pdf (5MB)Restricted to U of Illinois
(no description provided)PDF

Description

Title:Validating timing constraints in multiprocessor and distributed systems
Author(s):Ha, Rhan
Doctoral Committee Chair(s):Liu, Jane W.S.
Department / Program:Computer Science
Discipline:Computer Science
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:Ph.D.
Genre:Dissertation
Subject(s):Computer Science
Abstract:In multiprocessor and distributed real-time systems, scheduling jobs dynamically on processors is likely to achieve better performance. However, analytical and efficient validation methods for determining whether all the timing constraints are met do not yet exist for systems using modern dynamic scheduling strategies, and exhaustive methods are often infeasible or unreliable since the execution time and release time of each job may vary. In this thesis, we present solutions to the problem of how to validate systems in which jobs have arbitrary timing constraints and variable execution times and are scheduled on processors dynamically in a priority-driven manner. We begin by considering the simplest case of this problem where jobs are independent and processors are identical. We then generalize the validation problem to deal with the case where the processors are heterogeneous and the jobs are dependent. For each case we present conditions under which the jobs execute in a predictable manner, i.e., the completion times of jobs are no later when the execution times of some jobs decrease. We also present algorithms and bounds with which the latest completion times of all jobs can be bounded.
Issue Date:1995
Type:Text
Language:English
URI:http://hdl.handle.net/2142/23695
Rights Information:Copyright 1995 Ha, Rhan
Date Available in IDEALS:2011-05-07
Identifier in Online Catalog:AAI9543600
OCLC Identifier:(UMI)AAI9543600


This item appears in the following Collection(s)

Item Statistics