Name
Abstract | ||
|---|---|---|
T-R Plane Abstraction (TRPA) proposed in this paper is an abstraction technique of real-time scheduling on multiprocessors. This paper presents that NNLF (No Nodal Laxity First) based on TRPA is work-conserving and optimally solves the problem of scheduling periodic tasks on a multiprocessor system. TRPA can accommodate to dynamic environments due to its dynamic time reservation, while T-N Plane Abstraction (TNPA) and Extended TNPA (E-TNPA) reserve processor time statically at every task release. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/RTCSA.2008.15 | RTCSA |
Keywords | Field | DocType |
real-time scheduling,multiprocessor system,new abstraction,reserve processor time statically,optimal real-time scheduling,nodal laxity first,dynamic time reservation,extended tnpa,t-r plane abstraction,t-n plane abstraction,dynamic environment,abstraction technique,scheduling,real time systems,schedules,fluids,artificial neural networks | Reservation,Abstraction,Scheduling (computing),TRPA,Computer science,Parallel computing,Multiprocessing,Real-time computing,Schedule,Artificial neural network,Periodic graph (geometry),Distributed computing | Conference |
Citations | PageRank | References |
4 | 0.51 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kenji Funaoka | 1 | 91 | 5.32 |
| Shinpei Kato | 2 | 951 | 62.18 |
| Nobuyuki Yamasaki | 3 | 338 | 30.45 |