Schedulability criteria for fixed priority scheduling of real- time systems /

Abstract: "There are two major approaches to guaranteeing hard real-time deadlines for periodic tasks using scheduling algorithms based on fixed priorities: utilization bound checks, which check the total expected processor utilization, and do not require detailed information about the taskse...

Full description

Bibliographic Details
Main Author: Park, Dong-Won
Other Authors: Natarajan, Swaminathan, Kanevsky, Arkady, 1961-
Format: Book
Language:English
Published: College Station, Tex. : Texas A & M University, Computer Science Dept., [1992]
Series:Technical report (Texas A & M University. Computer Science Department) ; 92-036.
Subjects:

MARC

Tag First Indicator Second Indicator Subfields
LEADER 00000cam a2200000 a 4500
001 in00001243921
005 20151003083056.0
008 940211s1992 txu tb 000 0 eng d
035 |a (OCoLC)29787607 
035 |9 AGU7383AM 
040 |a PMC  |c PMC  |d TXA  |d UtOrBLW 
049 |a TXAS [tamu] 
090 |a QA76  |b .C656 92-036 
100 1 |a Park, Dong-Won. 
245 1 0 |a Schedulability criteria for fixed priority scheduling of real- time systems /  |c Dong-Won Park, Swaminathan Natarajan, Arkady Kanvesky. 
264 1 |a College Station, Tex. :  |b Texas A & M University, Computer Science Dept.,  |c [1992] 
300 |a 11 leaves ;  |c 28 cm. 
336 |a text  |b txt  |2 rdacontent 
337 |a unmediated  |b n  |2 rdamedia 
338 |a volume  |b nc  |2 rdacarrier 
490 1 |a Technical report. Texas A & M University. Computer Science Dept. ;  |v TAMU 92-036 
500 |a "December 1992." 
500 |a "Laboratory for Algorithms Design, LAD 92-07." 
520 |a Abstract: "There are two major approaches to guaranteeing hard real-time deadlines for periodic tasks using scheduling algorithms based on fixed priorities: utilization bound checks, which check the total expected processor utilization, and do not require detailed information about the taskset; and exact schedulability checks, which use detailed information. In this work, we present a technique for determining period-specific utilization bounds, which use task period information, generally available at design time, but not task computation time information, which is hard to determine accurately. The technique we use for determining the bound is an innovative approach which makes use of linear programming." 
504 |a Includes bibliographical references. 
650 0 |a Real-time data processing. 
700 1 |a Natarajan, Swaminathan. 
700 1 |a Kanevsky, Arkady,  |d 1961- 
830 0 |a Technical report (Texas A & M University. Computer Science Department) ;  |v 92-036. 
999 |a MARS 
999 f f |s 812cf844-8f87-3503-ac8c-6a9f9dd699be  |i a798b472-e716-3e22-ae97-25f92e41a1a5  |t 0 
952 f f |p noncirc  |a Texas A&M University  |b College Station  |c Cushing Memorial Library & Archives  |d Cushing: Texas A&M (Does not check out)  |t 0  |e QA76 .C656 92-036  |h Library of Congress classification  |i unmediated -- volume 
998 f f |a QA76 .C656 92-036  |t 0  |l Cushing: Texas A&M (Does not check out)