메뉴 건너뛰기




Volumn , Issue , 2007, Pages 1557-1564

Online resource management in a multiprocessor with a network-on-chip

Author keywords

Multiprocessors on chip; Networks on chip; Real time systems

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTATIONAL COMPLEXITY; MICROPROCESSOR CHIPS; NETWORK ARCHITECTURE; PROGRAM PROCESSORS; REAL TIME SYSTEMS; RESOURCE ALLOCATION; ROUTERS;

EID: 35248881549     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1244002.1244335     Document Type: Conference Paper
Times cited : (51)

References (21)
  • 2
    • 0030412147 scopus 로고    scopus 로고
    • Modeling Multicomputer Task Allocation as a Vector Packing Problem
    • J.E. Beck and D.P. Siewiorek. "Modeling Multicomputer Task Allocation as a Vector Packing Problem," Proceedings of the ISSS, 1996.
    • (1996) Proceedings of the ISSS
    • Beck, J.E.1    Siewiorek, D.P.2
  • 7
    • 0042534136 scopus 로고    scopus 로고
    • Guaranteeing The Quality of Services in Networks on Chip
    • edited by A. Jantsch and H. Tenhunen, Kluwer
    • K. Goossens et al. "Guaranteeing The Quality of Services in Networks on Chip", Networks on Chip, edited by A. Jantsch and H. Tenhunen, 2003. Kluwer
    • (2003) Networks on Chip
    • Goossens, K.1
  • 8
    • 0036644455 scopus 로고    scopus 로고
    • Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
    • Kluwer
    • R. Govindarajan, G.R. Gao, and P. Desai. "Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks," Journal of VLSI Signal Processing, Kluwer, 2002.
    • (2002) Journal of VLSI Signal Processing
    • Govindarajan, R.1    Gao, G.R.2    Desai, P.3
  • 9
    • 27644490224 scopus 로고    scopus 로고
    • A Unified Approach to Constraint Mapping and Routing on Network-on-Chip Architectures
    • A. Hansson, K. Goossens, and A. Radulescu. "A Unified Approach to Constraint Mapping and Routing on Network-on-Chip Architectures," Proceedings of the ISSS, 2005.
    • (2005) Proceedings of the ISSS
    • Hansson, A.1    Goossens, K.2    Radulescu, A.3
  • 11
    • 0009715602 scopus 로고    scopus 로고
    • Approximating Disjoing-Path Problems Using Greedy Algorithms and Packing Integer Programs
    • S.G. Kolliopoulos and C. Stein. "Approximating Disjoing-Path Problems Using Greedy Algorithms and Packing Integer Programs", Proceedings of the IPCO, 1998.
    • (1998) Proceedings of the IPCO
    • Kolliopoulos, S.G.1    Stein, C.2
  • 14
    • 84974687699 scopus 로고
    • Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
    • CL. Liu and J.W. Layland. "Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment," Journal of the ACM, 1973.
    • (1973) Journal of the ACM
    • Liu, C.L.1    Layland, J.W.2
  • 19
    • 18844419984 scopus 로고    scopus 로고
    • Task-level Timing Models for Guaranteed Performance in Multiprocessor Networks-on-Chip
    • P. Poplavko et al. "Task-level Timing Models for Guaranteed Performance in Multiprocessor Networks-on-Chip," Proceedings of the International Conference CASES, 2003.
    • (2003) Proceedings of the International Conference CASES
    • Poplavko, P.1


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