메뉴 건너뛰기




Volumn 42, Issue 2, 2008, Pages 233-243

Optimistic parallelism benefits from data partitioning

Author keywords

Data partitioning; Irregular programs; Locality; Lock coarsening; Optimistic parallelism; Over decomposition

Indexed keywords

FINITE ELEMENT METHOD; MESH GENERATION; PARALLEL PROCESSING SYSTEMS; SYSTEMS ANALYSIS;

EID: 77957808385     PISSN: 01635980     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1353535.1346311     Document Type: Conference Paper
Times cited : (44)

References (31)
  • 1
    • 33746427122 scopus 로고    scopus 로고
    • An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision
    • Yuri Boykov and Vladimir Kolmogorov. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. International Journal of Computer Vision (IJCV), 70(2):109-131, 2006.
    • (2006) International Journal of Computer Vision (IJCV) , vol.70 , Issue.2 , pp. 109-131
    • Boykov, Y.1    Kolmogorov, V.2
  • 4
    • 0004116989 scopus 로고    scopus 로고
    • Thomas Cormen, Charles Leiserson, Ronald Rivest, and Clifford Stein, editors, MIT Press
    • Thomas Cormen, Charles Leiserson, Ronald Rivest, and Clifford Stein, editors. Introduction to Algorithms. MIT Press, 2001.
    • (2001) Introduction to Algorithms
  • 5
    • 0024090156 scopus 로고
    • A new approach to the maximum-flow problem
    • Andrew V. Goldberg and Robert E. Tarjan. A new approach to the maximum-flow problem. J ACM, 35(4):921-940, 1988.
    • (1988) J ACM , vol.35 , Issue.4 , pp. 921-940
    • Goldberg, A.V.1    Tarjan, R.E.2
  • 9
    • 0027262011 scopus 로고    scopus 로고
    • Maurice Herlihy and J. Eliot B. Moss. Transactional, memory: architectural support for lock-free data structures. In ISCA '93: Proceedings of the 20th annual international symposium on Computer architecture, 1993.
    • Maurice Herlihy and J. Eliot B. Moss. Transactional, memory: architectural support for lock-free data structures. In ISCA '93: Proceedings of the 20th annual international symposium on Computer architecture, 1993.
  • 15
    • 84990479742 scopus 로고
    • An effective heuristic procedure for partitioning graphs
    • February
    • B. W. Kernighan and S. Lin. An effective heuristic procedure for partitioning graphs. The Bell System Technical Journal, pages 291-308, February 1970.
    • (1970) The Bell System Technical Journal , pp. 291-308
    • Kernighan, B.W.1    Lin, S.2
  • 16
    • 0033348795 scopus 로고    scopus 로고
    • A chip-multiprocessor architecture with speculative multithreading
    • Venkata Krishnan and Josep Torrellas. A chip-multiprocessor architecture with speculative multithreading. IEEE Trans. Comput., 48(9):866-880, 1999.
    • (1999) IEEE Trans. Comput , vol.48 , Issue.9 , pp. 866-880
    • Krishnan, V.1    Torrellas, J.2
  • 17
    • 42549111870 scopus 로고    scopus 로고
    • SIGPLAN Not. (Proceedings of PLDI 2007)
    • 211-222
    • Milind Kulkarni, Keshav Pingali, Bruce Walter, Ganesh Ramanarayanan, Kavita Bala, and L. Paul Chew. Optimistic parallelism requires abstractions. SIGPLAN Not. (Proceedings of PLDI 2007), 42(6):211-222, 2007.
    • (2007) , vol.42 , Issue.6
    • Kulkarni, M.1    Pingali, K.2    Walter, B.3    Ramanarayanan, G.4    Bala, K.5    Paul Chew, L.6
  • 20
    • 0029195585 scopus 로고
    • Extending high performance fortran for the support of unstructured computations
    • New York, NY, USA, ACM Press
    • Andreas Müller and Roland Rühl. Extending high performance fortran for the support of unstructured computations. In ICS '95: Proceedings of the 9th international conference on Supercomputing, pages 127-136, New York, NY, USA, 1995. ACM Press.
    • (1995) ICS '95: Proceedings of the 9th international conference on Supercomputing , pp. 127-136
    • Müller, A.1    Rühl, R.2
  • 22
    • 0033076827 scopus 로고    scopus 로고
    • The LRPD test: Speculative run-time parallelization of loops with privatization and reduction parallelization
    • Lawrence Rauchwerger and David A. Padua. The LRPD test: Speculative run-time parallelization of loops with privatization and reduction parallelization. IEEE Trans. Parallel Distrib. Syst., 10(2):160-180, 1999.
    • (1999) IEEE Trans. Parallel Distrib. Syst , vol.10 , Issue.2 , pp. 160-180
    • Rauchwerger, L.1    Padua, D.A.2
  • 27
    • 84940605935 scopus 로고    scopus 로고
    • Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
    • Applied Computational Geometry: Towards Geometric Engineering, of, Springer-Verlag
    • Jonathan Richard Shewchuk. Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator. In Applied Computational Geometry: Towards Geometric Engineering, volume 1148 of Lecture Notes in Computer Science, pages 203-222. Springer-Verlag, 1996.
    • (1996) Lecture Notes in Computer Science , vol.1148 , pp. 203-222
    • Richard Shewchuk, J.1
  • 28
    • 42549153054 scopus 로고    scopus 로고
    • S-HARP: A parallel dynamic spectral partitioner
    • A. Sohn and H. D. Simon. S-HARP: A parallel dynamic spectral partitioner. Lecture Notes in Computer Science, 1457:376-385, 1998.
    • (1998) Lecture Notes in Computer Science , vol.1457 , pp. 376-385
    • Sohn, A.1    Simon, H.D.2
  • 29
    • 25144439604 scopus 로고    scopus 로고
    • Pang-Ning Tan, Michael Steinbach, and Vipin Kumar, editors, Pearson Addison Wesley
    • Pang-Ning Tan, Michael Steinbach, and Vipin Kumar, editors. Introduction to Data Mining. Pearson Addison Wesley, 2005.
    • (2005) Introduction to Data Mining
  • 30
    • 0025467711 scopus 로고
    • A bridging model for parallel computation
    • Leslie G. Valiant. A bridging model for parallel computation. Commun. ACM, 33(8):103-111, 1990.
    • (1990) Commun. ACM , vol.33 , Issue.8 , pp. 103-111
    • Valiant, L.G.1


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