메뉴 건너뛰기




Volumn 5896 LNCS, Issue , 2009, Pages 308-327

COLA: Optimizing stream processing applications via graph partitioning

Author keywords

Graph partitioning; Operator fusion; Optimization; Scheduling; Stream processing

Indexed keywords

COMPILE TIME; FUSION OPTIMIZATION; GRAPH PARTITIONING; GRAPH-BASED; HIERARCHICAL PARTITIONING; HIGH QUALITY; MAXIMIZE THROUGHPUT; MIDDLEWARE SYSTEM; OPTIMIZATION SCHEME; PROCESSING COSTS; PROCESSING ELEMENTS; RATIO CUT; REAL-WORLD SYSTEM; RUN-TIME SOFTWARE; SOLUTION APPROACH; STREAM PROCESSING; DISTRIBUTED STREAM PROCESSING;

EID: 70549086842     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10445-9_16     Document Type: Conference Paper
Times cited : (52)

References (26)
  • 1
  • 7
    • 84959045524 scopus 로고    scopus 로고
    • Thies, W., Karczmarek, M., Amarasinghe, S.: StreamIt: A language for streaming applications. In: Horspool, R.N. (ed.) CC 2002. LNCS, 2304, p. 179. Springer, Heidelberg (2002)
    • Thies, W., Karczmarek, M., Amarasinghe, S.: StreamIt: A language for streaming applications. In: Horspool, R.N. (ed.) CC 2002. LNCS, vol. 2304, p. 179. Springer, Heidelberg (2002)
  • 9
    • 70549083969 scopus 로고    scopus 로고
    • Coral8 (2007), http://www.coral8.com
    • (2007) Coral8
  • 10
    • 70549098951 scopus 로고    scopus 로고
    • StreamBaseSystems
    • StreamBaseSystems (2007), http://www.streambase.com/
    • (2007)
  • 12
    • 77951493020 scopus 로고    scopus 로고
    • Douglis, F., Palmer, J., Richards, E., Tao, D., Tetzlaff, W., Tracey, J., Yin, J.: Position: Short object lifetimes require a delete-optimized storage system. In: ACM SIGOPS European Workshop (2004)
    • Douglis, F., Palmer, J., Richards, E., Tao, D., Tetzlaff, W., Tracey, J., Yin, J.: Position: Short object lifetimes require a delete-optimized storage system. In: ACM SIGOPS European Workshop (2004)
  • 18
    • 58049113792 scopus 로고    scopus 로고
    • SODA: An optimizing scheduler for large-scale stream-based distributed computer systems
    • Issarny, V, Schantz, R, eds, Middleware 2008, Springer, Heidelberg
    • Wolf, J., Bansal, N., Hildrum, K., Parekh, S., Rajan, D., Wagle, R., Wu, K.L., Fleischer, L.: SODA: An optimizing scheduler for large-scale stream-based distributed computer systems. In: Issarny, V., Schantz, R. (eds.) Middleware 2008. LNCS, vol. 5346, pp. 306-325. Springer, Heidelberg (2008)
    • (2008) LNCS , vol.5346 , pp. 306-325
    • Wolf, J.1    Bansal, N.2    Hildrum, K.3    Parekh, S.4    Rajan, D.5    Wagle, R.6    Wu, K.L.7    Fleischer, L.8
  • 23
    • 33745659811 scopus 로고    scopus 로고
    • On the NP-completeness of some graph cluster measures
    • Wiedermann, J, Tel, G, Pokorný, J, Bieliková, M, Štuller, J, eds, SOFSEM 2006, Springer, Heidelberg
    • Síma, J., Schaeffer, S.E.: On the NP-completeness of some graph cluster measures. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds.) SOFSEM 2006. LNCS, vol. 3831, pp. 530-537. Springer, Heidelberg (2006)
    • (2006) LNCS , vol.3831 , pp. 530-537
    • Síma, J.1    Schaeffer, S.E.2
  • 24
    • 0000651166 scopus 로고    scopus 로고
    • Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
    • Leighton, F.T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46, 787-832 (1999)
    • (1999) J. ACM , vol.46 , pp. 787-832
    • Leighton, F.T.1    Rao, S.2
  • 25
    • 42549097902 scopus 로고    scopus 로고
    • Faster and simpler algorithms for multicommodity flow and other fractional packing problems
    • Garg, N., Könemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. SIAM J. Comput. 37, 630-652 (2007)
    • (2007) SIAM J. Comput , vol.37 , pp. 630-652
    • Garg, N.1    Könemann, J.2


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