SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Jonsson Stefan) ;lar1:(hh)"

Sökning: WFRF:(Jonsson Stefan) > Högskolan i Halmstad

  • Resultat 1-3 av 3
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Hoang, Hoai, 1976-, et al. (författare)
  • Computing the minimum EDF feasible deadline in periodic systems
  • 2006
  • Ingår i: 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, 2006. Proceedings. - Los Alamitos, Calif. : IEEE Press. - 0769526764 ; , s. 125-134
  • Konferensbidrag (refereegranskat)abstract
    • In most real-time applications, deadlines are artifices that need to be enforced to meet different performance requirements. For example, in periodic task sets, jitter requirements can be met by assigning suitable relative deadlines and guaranteeing the feasibility of the schedule. This paper presents a method (called minD) for calculating the minimum EDF-feasible deadline of a real-time task. More precisely, given a set of periodic tasks with hard real-time requirements, which is feasible under EDF, the proposed algorithm allows computing the shortest deadline that can be assigned to an arbitrary task in the set, or to a new incoming task (periodic or aperiodic), still preserving the EDF feasibility of the new task set. The algorithm has a pseudo polynomial complexity and handles arbitrary relative deadlines, which can be less than, equal to, or greater than periods.
  •  
2.
  • Hoang, Hoai, et al. (författare)
  • Minimum EDF-feasible deadline calculation with low-time complexity
  • 2004
  • Ingår i: RTSS 2004 WIP Proceedings, The 25th IEEE International Real-Time Systems Symposium, Lisbon, Portugal, Dec. 5-8, 2004.
  • Konferensbidrag (refereegranskat)abstract
    • We present a method for calculating the minimum EDF-feasible deadline. The algorithm targets periodic tasks with hard real-time guarantees, that are to be feasibly scheduled with EDF (Earliest Deadline First). The output is the smallest possible deadline required for feasibility, of the task most recently requested. The good thing with our algorithm is that it has the same timecomplexity as the regular EDF feasibility test, when deadlines are not assumed to be equal to the periods of the periodic tasks.
  •  
3.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-3 av 3

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy