Entry Lee:1995:SHA from sigplan1990.bib

Last update: Thu Apr 12 03:37:15 MDT 2012                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Lee:1995:SHA,
  author =       "Jongwon Lee and Sungyoung Lee and Hyungill Kim",
  title =        "Scheduling of hard aperiodic tasks in hybrid
                 static\slash dynamic priority systems",
  journal =      j-SIGPLAN,
  volume =       "30",
  number =       "11",
  pages =        "7--19",
  month =        nov,
  year =         "1995",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Sun Dec 14 09:17:12 MST 2003",
  bibsource =    "http://portal.acm.org/; http://www.acm.org/pubs/toc/",
  URL =          "http://www.acm.org:80/pubs/citations/proceedings/plan/216636/p7-lee/",
  abstract =     "We present a preemptive joint scheduling of hard
                 deadline periodic and hard deadline aperiodic tasks on
                 a uniprocessor real-time system. The scheduling has
                 extended the Critical Task Indicating (CTI) algorithm
                 which shows a considerable performance improvement over
                 the other soft aperiodic task schedulings, especially
                 under a heavy transient overload. Since a hard deadline
                 aperiodic task has its own deadline, the proposed
                 algorithm has a decision making mechanism that performs
                 the online acceptance/rejection test upon its arrival.
                 For simplicity and good performance, the algorithm
                 reuses the original CTI table being used in the CTI
                 algorithm as a slack search domain. Moreover, by
                 searching the CTI table similarly to a circular list,
                 it has removed the problem of search space limitation
                 caused by the hyperperiod bound.",
  acknowledgement = ack-nhfb,
  affiliation =  "Korea Telecom, Seoul, South Korea",
  classification = "C6150J (Operating systems)",
  confname =     "LCT-RTS '95. Proceedings of the ACM SIGPLAN 1995
                 workshop on Languages, compilers, \& tools for
                 real-time systems, June 21--22, 1995, La Jolla,
                 California",
  keywords =     "algorithms; Critical Task Indicating algorithm;
                 Deadline aperiodic tasks; Deadline periodic tasks;
                 design; Hard aperiodic task scheduling; Heavy transient
                 overload; Hybrid static/dynamic priority systems;
                 Hyperperiod bound; measurement; Online
                 acceptance/rejection test; performance; Performance
                 improvement; Preemptive joint scheduling; Slack search;
                 Soft aperiodic task schedulings; theory; Uniprocessor
                 real-time system",
  subject =      "{\bf F.2.2} Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Sequencing and scheduling.
                 {\bf D.4.1} Software, OPERATING SYSTEMS, Process
                 Management, Scheduling. {\bf D.4.7} Software, OPERATING
                 SYSTEMS, Organization and Design, Real-time systems and
                 embedded systems. {\bf C.3} Computer Systems
                 Organization, SPECIAL-PURPOSE AND APPLICATION-BASED
                 SYSTEMS, Real-time and embedded systems. {\bf I.1.2}
                 Computing Methodologies, SYMBOLIC AND ALGEBRAIC
                 MANIPULATION, Algorithms, Analysis of algorithms.",
  thesaurus =    "Online operation; Real-time systems; Scheduling;
                 Search problems",
}

Related entries