메뉴 건너뛰기




Volumn E89-D, Issue 6, 2006, Pages 1962-1966

Optimal scheduling for real-time parallel tasks

Author keywords

Bounded parallelism; Feasible schedule; Optimal algorithm; Real time scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MULTIPROCESSING PROGRAMS; REAL TIME SYSTEMS;

EID: 33745450921     PISSN: 09168532     EISSN: 17451361     Source Type: Journal    
DOI: 10.1093/ietisy/e89-d.6.1962     Document Type: Article
Times cited : (22)

References (13)
  • 1
    • 0345833412 scopus 로고
    • Parallel simulation of mechanical systems for real-time applications
    • U. Sailer, A. Wohnhaas, and U. Essers, "Parallel simulation of mechanical systems for real-time applications," Systems Anal. Modelling Simulation, vol.16, pp. 197-202, 1994.
    • (1994) Systems Anal. Modelling Simulation , vol.16 , pp. 197-202
    • Sailer, U.1    Wohnhaas, A.2    Essers, U.3
  • 3
    • 0348163904 scopus 로고    scopus 로고
    • On-line schduling of scalable real-time tasks on multiprocessor systems
    • W.Y. Lee, S.J. Hong, and J. Kim, "On-line schduling of scalable real-time tasks on multiprocessor systems," J. Parall. Dist. Comput., vol.63, no. 12, pp. 1315-1324, 2003.
    • (2003) J. Parall. Dist. Comput. , vol.63 , Issue.12 , pp. 1315-1324
    • Lee, W.Y.1    Hong, S.J.2    Kim, J.3
  • 5
    • 84879338948 scopus 로고    scopus 로고
    • The partitioned multiprocessor scheduling of sporadic task systems
    • S. Baruah and N. Fisher, "The partitioned multiprocessor scheduling of sporadic task systems," Proc. IEEE Real-Time Syst. Symp. (RTSS), vol.26, pp.321-329, 2005.
    • (2005) Proc. IEEE Real-time Syst. Symp. (RTSS) , vol.26 , pp. 321-329
    • Baruah, S.1    Fisher, N.2
  • 6
    • 0042332013 scopus 로고    scopus 로고
    • Real-time scheduling of linear speedup parallel tasks
    • M. Drozdowski, "Real-time scheduling of linear speedup parallel tasks," Inf. Process. Lett., vol.57, pp.35-40, 1996.
    • (1996) Inf. Process. Lett. , vol.57 , pp. 35-40
    • Drozdowski, M.1
  • 7
    • 84869593060 scopus 로고
    • New strategies for assigning real-time tasks to multiporcessor systems
    • A. Burchard, J. Liebeherr, Y. Oh, and S.H. Son, "New strategies for assigning real-time tasks to multiporcessor systems," IEEE Trans. Comput., vol.44, no. 12, pp. 1429-1442, 1995.
    • (1995) IEEE Trans. Comput. , vol.44 , Issue.12 , pp. 1429-1442
    • Burchard, A.1    Liebeherr, J.2    Oh, Y.3    Son, S.H.4
  • 8
    • 0024664628 scopus 로고
    • Characterizations of parallelism in applications and their use in scheduling
    • May
    • K. Sevcik, "Characterizations of parallelism in applications and their use in scheduling," Perform. Eval., vol.17, pp.171-180, May 1989.
    • (1989) Perform. Eval. , vol.17 , pp. 171-180
    • Sevcik, K.1
  • 9
    • 0037619247 scopus 로고    scopus 로고
    • Processor allocation and task scheduling of matrix chain products on parallel systems
    • H. Lee, J. Kim, S.J. Hong, and S. Lee, "Processor allocation and task scheduling of matrix chain products on parallel systems," IEEE Trans. Parallel Distrib. Syst., vol.14, no.4, pp.394-407, 2003.
    • (2003) IEEE Trans. Parallel Distrib. Syst. , vol.14 , Issue.4 , pp. 394-407
    • Lee, H.1    Kim, J.2    Hong, S.J.3    Lee, S.4
  • 12
    • 0016069667 scopus 로고
    • Fast algorithm for bin packing
    • D. Johnson, "Fast algorithm for bin packing," J. Comput. Syst. Sci., vol.8, pp.272-314, 1974.
    • (1974) J. Comput. Syst. Sci. , vol.8 , pp. 272-314
    • Johnson, D.1
  • 13
    • 0001500781 scopus 로고
    • Bin packing with divisible time sizes
    • E. Coffman, M. Garey, and D. Johnson, "Bin packing with divisible time sizes," J. Complexity, vol.3, pp.406-428, 1987.
    • (1987) J. Complexity , vol.3 , pp. 406-428
    • Coffman, E.1    Garey, M.2    Johnson, D.3


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