Quote: n lg n, earliest deadline first scheduling algorithm with dynamic feasibility analysis for new tasks; could use for an operating system

topics > all references > references sa-sz > QuoteRef: schwK8_1992 , p. 736

plan-based task scheduling

Quotation Skeleton

In this paper, we present a dynamic uniprocessor … built upon the well-known earliest deadline first scheduling … [Dertouzos, Proc. IFIP 1974]. However, in contrast to [the original], the presented algorithm not only … or rejects a task at the time of … we use a data structure termed a slot … [actual selection of tasks] is performed using an additional data structure: an earliest deadline … [p. 737] In addition, dynamic scheduling is shown possible … [it could replace priority-based scheduling in an operating system] [includes code]   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics up

Topic: plan-based task scheduling (13 items)

Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.