메뉴 건너뛰기




Volumn 4954 LNCS, Issue , 2008, Pages 157-164

Profile-guided composition

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONTEXT SENSITIVE GRAMMARS; DATA STRUCTURES; DYNAMIC PROGRAMMING; TABU SEARCH;

EID: 41549122791     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78789-1_12     Document Type: Conference Paper
Times cited : (12)

References (15)
  • 3
    • 41549161325 scopus 로고    scopus 로고
    • Eriksson, M., Kessler, C., Chalabine, M.: Load balancing of irregular parallel divide-and-conquer algorithms in group-spmd programming environments. In: PASA 2006, 8th Workshop on Parallel Systems and Algorithms. Lecture Notes in Informatics (LNI), GI P-81 (2006)
    • Eriksson, M., Kessler, C., Chalabine, M.: Load balancing of irregular parallel divide-and-conquer algorithms in group-spmd programming environments. In: PASA 2006, 8th Workshop on Parallel Systems and Algorithms. Lecture Notes in Informatics (LNI), GI vol. P-81 (2006)
  • 7
    • 0000713886 scopus 로고    scopus 로고
    • Aspect-oriented programming
    • Kiczales, G.: Aspect-oriented programming. ACM Comput. Surv. 28(4), 154 (1996)
    • (1996) ACM Comput. Surv , vol.28 , Issue.4 , pp. 154
    • Kiczales, G.1
  • 9
    • 0032591878 scopus 로고    scopus 로고
    • Robust dynamic exchange of implementation aspects. In: TOOLS 29-Technology of Object-Oriented Languages and Systems
    • Los Alamitos
    • Löwe, W., Neumann, R., Trapp, M., Zimmermann, W.: Robust dynamic exchange of implementation aspects. In: TOOLS 29-Technology of Object-Oriented Languages and Systems, pp. 351-360. IEEE Computer Society Press, Los Alamitos (1999)
    • (1999) IEEE Computer Society Press , pp. 351-360
    • Löwe, W.1    Neumann, R.2    Trapp, M.3    Zimmermann, W.4
  • 10
    • 0029184961 scopus 로고
    • Leda: A platform for combinatorial and geometric computing
    • Mehlhorn, K., Näher, S.: Leda: a platform for combinatorial and geometric computing. Commun. ACM 38(1), 96-102 (1995)
    • (1995) Commun. ACM , vol.38 , Issue.1 , pp. 96-102
    • Mehlhorn, K.1    Näher, S.2
  • 11
    • 10944222433 scopus 로고    scopus 로고
    • Practical predicate dispatch
    • Millstein, T.: Practical predicate dispatch. SIGPLAN Not. 39(10), 345-364 (2004)
    • (2004) SIGPLAN Not , vol.39 , Issue.10 , pp. 345-364
    • Millstein, T.1
  • 12
    • 84947906570 scopus 로고    scopus 로고
    • Towards automatic specialization of Java programs
    • Guerraoui, R, ed, ECOOP 1999, Springer, Heidelberg
    • Schultz, U., Lawall, J., Consel, C., Muller, G.: Towards automatic specialization of Java programs. In: Guerraoui, R. (ed.) ECOOP 1999. LNCS, vol. 1628, pp. 367-390. Springer, Heidelberg (1999)
    • (1999) LNCS , vol.1628 , pp. 367-390
    • Schultz, U.1    Lawall, J.2    Consel, C.3    Muller, G.4
  • 13
    • 84957631260 scopus 로고    scopus 로고
    • Implementing layered designs with mixin layers
    • Jul, E, ed, ECOOP 1998, Springer, Heidelberg
    • Smaragdakis, Y., Batory, D.: Implementing layered designs with mixin layers. In: Jul, E. (ed.) ECOOP 1998. LNCS, vol. 1445, pp. 550-570. Springer, Heidelberg (1998)
    • (1998) LNCS , vol.1445 , pp. 550-570
    • Smaragdakis, Y.1    Batory, D.2
  • 14
    • 34250487811 scopus 로고
    • Gaussian elimination is not optimal
    • Strassen, V.: Gaussian elimination is not optimal. Numerische Mathematik 14(3), 354-356 (1969)
    • (1969) Numerische Mathematik , vol.14 , Issue.3 , pp. 354-356
    • Strassen, V.1
  • 15
    • 33947389595 scopus 로고    scopus 로고
    • An adaptive algorithm selection framework for reduction parallelization
    • Yu, H., Rauchwerger, L.: An adaptive algorithm selection framework for reduction parallelization. IEEE Transactions on Parallel and Distributed Systems PDS-17(10), 1084-1096 (2006)
    • (2006) IEEE Transactions on Parallel and Distributed Systems , vol.PDS-17 , Issue.10 , pp. 1084-1096
    • Yu, H.1    Rauchwerger, L.2


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