메뉴 건너뛰기




Volumn 6853 LNCS, Issue PART 2, 2011, Pages 250-262

New multithreaded ordering and coloring algorithms for multicore architectures

Author keywords

[No Author keywords available]

Indexed keywords

COLORING ALGORITHMS; GRAPH COLORINGS; MULTI-CORE MACHINES; MULTI-CORE PLATFORMS; MULTICORE ARCHITECTURES; MULTITHREADED; ORDERING ALGORITHMS; PARALLELIZATIONS; RUNTIME PERFORMANCE; SEQUENTIALITY; TECHNIQUES USED; VERTEX ORDERING;

EID: 80052307189     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23397-5_24     Document Type: Conference Paper
Times cited : (14)

References (9)
  • 1
    • 77955693754 scopus 로고    scopus 로고
    • Distributed-memory parallel algorithms for distance-2 coloring and related problems in derivative computation
    • Bozdaǧ, D., Catalyurek, U.V., Gebremedhin, A.H., Manne, F., Boman, E.G., Ozgunner, F.: Distributed-memory parallel algorithms for distance-2 coloring and related problems in derivative computation. SIAM J. Sci. Comput. 32(4), 2418-2446 (2010)
    • (2010) Siam J. Sci. Comput. , vol.32 , Issue.4 , pp. 2418-2446
    • Bozdaǧ, D.1    Catalyurek, U.V.2    Gebremedhin, A.H.3    Manne, F.4    Boman, E.G.5    Ozgunner, F.6
  • 4
    • 33745790274 scopus 로고    scopus 로고
    • Graph mining: Laws, generators, and algorithms
    • Chakrabarti, D., Faloutsos, C.: Graph mining: Laws, generators, and algorithms. ACM Comput. Surv. 38(1), 2 (2006)
    • (2006) ACM Comput. Surv. , vol.38 , Issue.1 , pp. 2
    • Chakrabarti, D.1    Faloutsos, C.2
  • 5
    • 28244465516 scopus 로고    scopus 로고
    • What color is your Jacobian? Graph coloring for computing derivatives
    • Gebremedhin, A.H., Manne, F., Pothen, A.: What color is your Jacobian? Graph coloring for computing derivatives. SIAM Review 47(4), 629-705 (2005)
    • (2005) SIAM Review , vol.47 , Issue.4 , pp. 629-705
    • Gebremedhin, A.H.1    Manne, F.2    Pothen, A.3
  • 7
    • 0028434026 scopus 로고
    • Scalable iterative solution of sparse linear systems
    • Jones, M.T., Plassmann, P.E.: Scalable iterative solution of sparse linear systems. Parallel Computing 20(5), 753-773 (1994)
    • (1994) Parallel Computing , vol.20 , Issue.5 , pp. 753-773
    • Jones, M.T.1    Plassmann, P.E.2
  • 8
    • 0001085784 scopus 로고    scopus 로고
    • ILUM: A multi- Elimination ILU preconditioner for general sparse matrices
    • Saad, Y.: ILUM: A multi- Elimination ILU preconditioner for general sparse matrices. SIAM J. Sci. Comput. 17, 830-847 (1996)
    • (1996) SIAM J. Sci. Comput. , vol.17 , pp. 830-847
    • Saad, Y.1
  • 9
    • 0021473698 scopus 로고
    • Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs
    • Tarjan, R.E., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13(3), 566-579 (1984)
    • (1984) SIAM J. Comput. , vol.13 , Issue.3 , pp. 566-579
    • Tarjan, R.E.1    Yannakakis, M.2


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