메뉴 건너뛰기




Volumn 7, Issue 1, 2007, Pages

Interactive schedulability analysis

Author keywords

Interactive design; Nonfunctional constraints; Performance debugging; Recurring real time task model; Schedulability analysis

Indexed keywords

ITERATIVE DESIGN PROCESS; NONFUNCTIONAL CONSTRAINTS; PERFORMANCE DEBUGGING; REAL-TIME TASK MODEL; SCHEDULABILITY ANALYSIS; SYSTEM PARAMETERS;

EID: 38349177498     PISSN: 15399087     EISSN: 15583465     Source Type: Journal    
DOI: 10.1145/1324969.1324976     Document Type: Article
Times cited : (1)

References (17)
  • 1
    • 5644289693 scopus 로고    scopus 로고
    • An event stream driven approximation for the analysis of real-time systems
    • Catania, Italy. IEEE Computer Society, Los Alamitos, CA
    • ALBERS, K. AND SLOMKA, F. 2004. An event stream driven approximation for the analysis of real-time systems. In Proceedings of the Euromicro Conference on Real-Time Systems, Catania, Italy. IEEE Computer Society, Los Alamitos, CA.
    • (2004) Proceedings of the Euromicro Conference on Real-Time Systems
    • ALBERS, K.1    SLOMKA, F.2
  • 2
    • 34547226561 scopus 로고    scopus 로고
    • TIMES: A tool for schedulability analysis and code generation of real-time systems
    • International Workshop on Formal Modeling and Analysis of Timed Systems, Marseille, France, Springer-Verlag, New York
    • AMNELL, T., PERSMAN, E., MOKRUSHIN, L., PETTERSSON, P., AND YI, W. 2003. TIMES: A tool for schedulability analysis and code generation of real-time systems. In International Workshop on Formal Modeling and Analysis of Timed Systems. Lecture Notes in Computer Science 2791, Marseille, France, Springer-Verlag, New York.
    • (2003) Lecture Notes in Computer Science , vol.2791
    • AMNELL, T.1    PERSMAN, E.2    MOKRUSHIN, L.3    PETTERSSON, P.4    YI, W.5
  • 3
    • 35348848599 scopus 로고    scopus 로고
    • Feasibility analysis of recurring branching tasks
    • Berlin, Germany. IEEE Computer Society, Los Alamitos, CA
    • BARUAH, S. 1998a. Feasibility analysis of recurring branching tasks. In Proceedings of the Euromicro Workshop on Real-Time Systems, Berlin, Germany. IEEE Computer Society, Los Alamitos, CA.
    • (1998) Proceedings of the Euromicro Workshop on Real-Time Systems
    • BARUAH, S.1
  • 4
    • 0032299031 scopus 로고    scopus 로고
    • A general model for recurring real-time tasks
    • Madrid, Spain. IEEE Computer Society, Los Alamitos, CA
    • BARUAH, S. 1998b. A general model for recurring real-time tasks. In Proceedings of the IEEE Real-Time Systems Symposium, Madrid, Spain. IEEE Computer Society, Los Alamitos, CA.
    • (1998) Proceedings of the IEEE Real-Time Systems Symposium
    • BARUAH, S.1
  • 5
    • 0037269099 scopus 로고    scopus 로고
    • Dynamic- and static-priority scheduling of recurring real-time tasks
    • BARUAH, S. 2003. Dynamic- and static-priority scheduling of recurring real-time tasks. Real-Time Systems 24, 1, 93-128.
    • (2003) Real-Time Systems , vol.24 , Issue.1 , pp. 93-128
    • BARUAH, S.1
  • 7
    • 84879424389 scopus 로고    scopus 로고
    • Optimal task rate selection in fixed priority systems
    • Miami, FL. IEEE Computer Society, Los Alamitos, CA
    • BINI, E. AND NATALE, M. D. 2005. Optimal task rate selection in fixed priority systems. In Proceedings of the IEEE Real-Time Systems Symposium. Miami, FL. IEEE Computer Society, Los Alamitos, CA.
    • (2005) Proceedings of the IEEE Real-Time Systems Symposium
    • BINI, E.1    NATALE, M.D.2
  • 9
    • 84958042785 scopus 로고    scopus 로고
    • On the complexity of scheduling conditional real-time code
    • Proceedings of the International Workshop on Algorithms and Data Structures, Springer, New York
    • CHAKRABORTY, S., ERLEBACH, T., AND THIELE, L. 2001. On the complexity of scheduling conditional real-time code. In Proceedings of the International Workshop on Algorithms and Data Structures. Lecture Notes in Computer Science, vol. 2125. Springer, New York.
    • (2001) Lecture Notes in Computer Science , vol.2125
    • CHAKRABORTY, S.1    ERLEBACH, T.2    THIELE, L.3
  • 13
    • 33749040662 scopus 로고    scopus 로고
    • A polynomial-time approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines
    • Porto, Portugal. IEEE Computer Society, Los Alamitos, CA
    • FISHER, N. AND BARUAH, S. 2005. A polynomial-time approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines. In Proceedings of the Euromicro Conference on Real-Time Systems, Porto, Portugal. IEEE Computer Society, Los Alamitos, CA.
    • (2005) Proceedings of the Euromicro Conference on Real-Time Systems
    • FISHER, N.1    BARUAH, S.2
  • 14
    • 21644435559 scopus 로고    scopus 로고
    • Design space exploration and system optimization with SymTA/S - symbolic timing analysis for systems
    • Lisbon, Portugal. IEEE Computer Society, Los Alamitos, CA
    • HAMANN, A., JERSAK, M., RICHTER, K., AND ERNST, R. 2004. Design space exploration and system optimization with SymTA/S - symbolic timing analysis for systems. In IEEE Real-Time Systems Symposium, Lisbon, Portugal. IEEE Computer Society, Los Alamitos, CA.
    • (2004) IEEE Real-Time Systems Symposium
    • HAMANN, A.1    JERSAK, M.2    RICHTER, K.3    ERNST, R.4
  • 17
    • 0024143529 scopus 로고    scopus 로고
    • TOKUDA, H. AND KOTERA, M. 1988. Scheduler 1-2-3: An interactive schedulability analyzer for real-time systems. In Proceedings the IEEE International Computer Software and Applications Conference, Chicago, IL. IEEE Computer Society, Los Alamitos, CA
    • TOKUDA, H. AND KOTERA, M. 1988. Scheduler 1-2-3: An interactive schedulability analyzer for real-time systems. In Proceedings the IEEE International Computer Software and Applications Conference, Chicago, IL. IEEE Computer Society, Los Alamitos, CA.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.