메뉴 건너뛰기




Volumn 12, Issue 4, 2007, Pages

ILP and heuristic techniques for system-level design on network processor architectures

Author keywords

Block multithreading; Multiprocessor

Indexed keywords

DATA MAPPING; HEURISTIC TECHNIQUES; NETWORK PROCESSOR ARCHITECTURES; PROCESS TRANSFORMATIONS;

EID: 34547310435     PISSN: 10844309     EISSN: 15577309     Source Type: Journal    
DOI: 10.1145/1278349.1278361     Document Type: Article
Times cited : (7)

References (34)
  • 1
    • 84888647254 scopus 로고    scopus 로고
    • 3GPP ORGANIZATIONAL PARTNERS. 2002. 3GPP confidentiality and integrity algorithms F8 and F9
    • 3GPP ORGANIZATIONAL PARTNERS. 2002. 3GPP confidentiality and integrity algorithms F8 and F9. http://www.3gpp.org/TB/ Other/algorithms.htm.
  • 3
    • 0029727771 scopus 로고    scopus 로고
    • BENDER, A. 1996. Milp based task mapping for heterogeneous multiprocessor systems. In Proceedings of the Conference on European Design Automation. IEEE Computer Society Press, 190-197.
    • BENDER, A. 1996. Milp based task mapping for heterogeneous multiprocessor systems. In Proceedings of the Conference on European Design Automation. IEEE Computer Society Press, 190-197.
  • 4
    • 0002346271 scopus 로고    scopus 로고
    • An Architecture for differentiated services
    • Internet Engineering Task Force IETF
    • BLAKE, S. 1998. An Architecture for differentiated services. Request for Comments - 2475, Internet Engineering Task Force (IETF).
    • (1998) Request for Comments , pp. 2475
    • BLAKE, S.1
  • 5
    • 84961640996 scopus 로고    scopus 로고
    • CAMPBELL, A., CHOU, S., KOUNAVIS, M., STACHTOS, V., AND VICENTE, J. 2002. Netbind: A binding tool for constructing data paths in network processor-based routers. In Proceedings of the IEEE Conference on Open Architectures and Network Programming. 91-103
    • CAMPBELL, A., CHOU, S., KOUNAVIS, M., STACHTOS, V., AND VICENTE, J. 2002. Netbind: A binding tool for constructing data paths in network processor-based routers. In Proceedings of the IEEE Conference on Open Architectures and Network Programming. 91-103
  • 6
    • 0038797846 scopus 로고    scopus 로고
    • Approximation algorithms for scheduling problems
    • Tech. Rep. CS-TR-98-116, Computer Science Department of Stanford University
    • CHEKURI, C. 2000. Approximation algorithms for scheduling problems. Tech. Rep. CS-TR-98-116, Computer Science Department of Stanford University.
    • (2000)
    • CHEKURI, C.1
  • 10
    • 84888701309 scopus 로고    scopus 로고
    • INTEL. 2007. Intel IXA SDK.
    • INTEL. 2007. Intel IXA SDK.
  • 16
    • 34548301614 scopus 로고    scopus 로고
    • An ILP formulation for system-level application mapping on network processor architectures. IEEE/ACM In
    • OSTLER, C. AND CHATHA, K.S. 2007. An ILP formulation for system-level application mapping on network processor architectures. IEEE/ACM In the Conference on Design, Automation, and Test in Europe.
    • (2007) the Conference on Design, Automation, and Test in Europe
    • OSTLER, C.1    CHATHA, K.S.2
  • 19
    • 26844460724 scopus 로고    scopus 로고
    • System level methodology for programming CMP based multi-threaded network processor architectures
    • RAMAMURTHI, V., MCCOLLUM, J., OSTLER, C., AND CHATHA, K.S. 2005. System level methodology for programming CMP based multi-threaded network processor architectures. In International Symposium on VLSI.
    • (2005) International Symposium on VLSI
    • RAMAMURTHI, V.1    MCCOLLUM, J.2    OSTLER, C.3    CHATHA, K.S.4
  • 20
    • 84882754986 scopus 로고    scopus 로고
    • Application analysis and resource mapping for heterogeneous network processor architectures
    • M.A. Franklin et al. eds. Morgan Kaufmann Chapter 13
    • RAMASWAMY, R., WENG, N., AND WOLF, T. 2005. Application analysis and resource mapping for heterogeneous network processor architectures. In Network Processor Design: Issues and Practices, Vol. 3. M.A. Franklin et al. eds. Morgan Kaufmann Chapter 13, 277-306.
    • (2005) Network Processor Design: Issues and Practices , vol.3 , pp. 277-306
    • RAMASWAMY, R.1    WENG, N.2    WOLF, T.3
  • 22
    • 35148868279 scopus 로고
    • RFC, Internet Protocol Specification
    • RFC. 1981. Request for comments 791, Internet Protocol Specification, http://www.faqs.org/rfcs/rfc791.html.
    • (1981) Request for comments , vol.791
  • 23
    • 85008054190 scopus 로고    scopus 로고
    • Beyond Moore's law: Internet growth trends
    • ROBERTS, L.G. 2000. Beyond Moore's law: Internet growth trends. IEEE Comput., 117-119.
    • (2000) IEEE Comput , pp. 117-119
    • ROBERTS, L.G.1
  • 25
  • 28
    • 0004538010 scopus 로고
    • Scheduling and Load Balancing in Parallel and Distributed Systems
    • SHIRAZI, B.A, KAVI, K.M, AND HURSON, A.R, eds, Los Alamitos, CA
    • SHIRAZI, B.A., KAVI, K.M., AND HURSON, A.R., eds. 1995. Scheduling and Load Balancing in Parallel and Distributed Systems. IEEE Computer Society Press, Los Alamitos, CA.
    • (1995) IEEE Computer Society Press
  • 30
    • 8844226734 scopus 로고    scopus 로고
    • Optimization and benchmark of cryptographic algorithms on network processors
    • TAN, Z., LIN, C., YIN, H., AND LI, B. 2004. Optimization and benchmark of cryptographic algorithms on network processors. IEEE Micro. 24, 5, 55-69.
    • (2004) IEEE Micro , vol.24 , Issue.5 , pp. 55-69
    • TAN, Z.1    LIN, C.2    YIN, H.3    LI, B.4
  • 34
    • 84888698410 scopus 로고    scopus 로고
    • sees broad-based expansion
    • WHEELER, B., BOLARIA, J., AND IYER, S. 2005. NPU market sees broad-based expansion. http://www.linleygroup.com/npu/ Newsletter/wire050420.html.
    • (2005) NPU market
    • WHEELER, B.1    BOLARIA, J.2    IYER, S.3


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