Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems

The authors solve the problem of scheduling a set of tasks whose operational precedence structure is representable as an acyclic directed graph and proof of an efficient algori thm for finding the minimal-length preemptive schedule for tree-structured computations.

Abstract

article Free Access Share on Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems Authors: R. R. Muntz Computer Science Department, University of California, Los Angeles, California and Princeton University, Princeton, New Jersey Computer Science Department, University of California, Los Angeles, California and Princeton University, Princeton, New JerseyView Profile , E. G. Coffman Princeton University, Princeton, New Jersey Princeton University, Princeton, New JerseyView Profile Authors Info & Claims Journal of the ACMVolume 17Issue 2pp 324–338https://doi.org/10.1145/321574.321586Published:01 April 1970Publication History 130citation1,498DownloadsMetricsTotal Citations130Total Downloads1,498Last 12 Months71Last 6 weeks8 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF