See this document in CiteSeerX!

Skip-Over: Algorithms and Complexity for Overloaded Systems that Allow Skips (1996)  (Make Corrections)  (57 citations)
Gilad Koren, Dennis Shasha



  Home/Search   Context   Related

 
View or download:
de/pub/languages/nyu.edu/...tr715.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  de/pub/languages/nyu.ed...reports (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In applications ranging from video reception to telecommunications and packet communication to aircraft control, tasks enter periodically and have fixed response time constraints, but missing a deadline is acceptable, provided most deadlines are met. We call such tasks "occasionally skippable". We look at the problem of uniprocessor scheduling of occasionally skippable periodic tasks in an environment having periodic tasks. We show that making optimal use of skips is NP-hard. We then look at... (Update)

Cited by:   More
Value-Driven Multi-Class Overload Management - Hansson And Andler (1999)   (Correct)
Flexible Scheduling for Media Processing in Resource Constrained.. - Isovic (2004)   (Correct)
Dynamic Window-Constrained Scheduling of Real-Time.. - West, Zhang.. (2004)   (Correct)

Similar documents (at the sentence level):
55.7%:   Skip-Over: Algorithms and Complexity for Overloaded Systems.. - Koren, Shasha (1996)   (Correct)

Active bibliography (related documents):   More   All
0.5:   Vehicle Internal Architecture BASEMENT Real-Time System.. - Hansson, Lawson (1995)   (Correct)
0.1:   Statistical Quality Of Service For Variable, Periodic, Real-Time.. - Atlas (1998)   (Correct)
0.1:   Graduate Course: Reactive and Real-Time Systems - Koren, Tyszberowicz   (Correct)

Similar documents based on text:   More   All
0.4:   Exploiting Skips In Periodic Tasks For Enhancing Aperiodic.. - Caccamo, Buttazzo (1997)   (Correct)
0.1:   The Number of Distinct Alignments of Two Strings - Covington, Canfield (1996)   (Correct)
0.1:   Competitive On-Line Scheduling for Overloaded Real-Time Systems - Koren (1993)   (Correct)

Related documents from co-citation:   More   All
42:   Scheduling Algorithms for Multiprogramming in a Hard Real-time Environment - Liu, Layland - 1973
36:   A dynamic priority assignment technique for streams with - Hamdaoui, Ramanathan - 1995
29:   hard deadlines and dual priority scheduling (context) - Bernat, Burns - 1997

BibTeX entry:   (Update)

Gilad Koren and Dennis Shasha. Skip-over: Algorithms and complexity for overloaded systems that allow skips. In Real-Time Systems Symposium, 1995. http://citeseer.ist.psu.edu/article/koren96skipover.html   More

@techreport{ koren96skipover,
    author = "G. Koren and D. Shasha",
    title = "Skip-Over: Algorithms and Complexity for Overloaded Systems that Allow Skips",
    number = "TR1996-715",
    month = ",",
    year = "1996",
    url = "citeseer.ist.psu.edu/article/koren96skipover.html" }
Citations (may not include all citations):
4212   Computers and Intractability: a guide to the theory of NPCom.. (context) - Garey, Johnson - 1979
1582   Scheduling algorithms for multiprogramming in a hard real-ti.. - Liu, Layland - 1973
336   The rate monotonic scheduling algorithm -- exact characteriz.. (context) - Lehoczky, Sha et al. - 1989
127   Control robotics: The procedural control of physical process.. (context) - Dertouzos - 1974
120   Fixed priority scheduling of periodic task sets with arbitra.. (context) - Lehoczky - 1990
113   An optimal algorithm for scheduling soft-aperiodic tasks in .. (context) - Lehoczky, Ramos-Thuel - 1992
86   Some results of the earliest deadline scheduling algorithm (context) - Chetto, Chetto - 1989
62   Scheduling slack time in fixed priority preemptive systems - Davis, Tindell et al. - 1993
51   Algorithms and complexity concerning the preemptive scheduli.. - Baruah, Rosier et al. - 1990
46   A note on preemptive scheduling of periodic (context) - Leung, Merrill - 1980
45   Accounting for interrupt handling costs in dynamic priority .. - Jeffay, Stone - 1993
30   Performance of realtime bus scheduling algorithms (context) - Lehoczky, Sha - 1986
13   A new algorithm for scheduling periodic (context) - Leung - 1989
11   Aperiodic scheduling for hard real-time system (context) - Sprunt, Sha et al. - 1989
7   A new performance measure for scheduling independent real-ti.. (context) - Peng, Shin - 1989
2   BASEMENT: A Distributed Real-Time Architecture for Safety Cr.. (context) - Lawson, Lindgren et al. - 1993
1   Computer science department technical report (context) - Davis, scheduling - 1995



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://ftp.gwdg.de/pub/languages/nyu.edu/tech-reports/reports.html):   More
Closed Hashing is Computable and Optimally Randomizable with.. - Siegel, Schmidt   (Correct)
Preconditioners for Indefinite Problems - Klawonn (1995)   (Correct)
On the Singular Limit of the Quantum-Classical Molecular.. - Bornemann, Schütte (1996)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC