메뉴 건너뛰기




Volumn , Issue , 2009, Pages 169-180

Synchronization optimizations for efficient execution on multi-cores

Author keywords

Code motion; Compilers; Multithreading; Synchronization

Indexed keywords

CODE MOTION; CONCURRENT SOFTWARE; MULTI-THREADING; OPEN-SOURCE CODE; PARALLELIZATIONS; POSTGRESQL; REAL CODE; SYNCHRONIZATION PRIMITIVE; THREAD-LEVEL PARALLELISM;

EID: 70449709551     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1542275.1542303     Document Type: Conference Paper
Times cited : (9)

References (64)
  • 2
    • 0004230378 scopus 로고    scopus 로고
    • Kluwer Academic Publishers, Boston, MA
    • U. Banerjee. Dependence Analysis. Kluwer Academic Publishers, Boston, MA, 1997.
    • (1997) Dependence Analysis
    • Banerjee, U.1
  • 4
    • 70449710971 scopus 로고    scopus 로고
    • OpenMP Specification, version 2.5. http://www.openmp.org/drupal/mp- documents/spec25.pdf.
    • OpenMP Specification, version 2.5. http://www.openmp.org/drupal/mp- documents/spec25.pdf.
  • 6
    • 70449699831 scopus 로고    scopus 로고
    • PostgreSQL
    • PostgreSQL. http://www.postgresql.org/.
  • 8
    • 70449715312 scopus 로고    scopus 로고
    • SPEC CINT2006. http://www.spec.org/cpu2006/CINT2006.
    • (2006)
  • 12
    • 0019596071 scopus 로고
    • Trace Scheduling: A technique for global microcode compaction
    • July
    • J. A. Fisher. Trace Scheduling: A technique for global microcode compaction. IEEE Transactions on Computers, C-30(7):478-490, July 1981.
    • (1981) IEEE Transactions on Computers , vol.C-30 , Issue.7 , pp. 478-490
    • Fisher, J.A.1
  • 16
    • 35248880156 scopus 로고    scopus 로고
    • Predicate analysis based on path information
    • Advanced Parallel Processing Technologies
    • L. Shen, Z. Wang, and J. Lu. Predicate analysis based on path information. In Advanced Parallel Processing Technologies, LNCS, 2834, pages 147-151, 2003.
    • (2003) LNCS , vol.2834 , pp. 147-151
    • Shen, L.1    Wang, Z.2    Lu, J.3
  • 18
    • 0003782477 scopus 로고
    • On predicated execution
    • Technical Report 58-91, Hewlett Packard Laboratories
    • J. Park and M. Schlansker. On predicated execution. Technical Report 58-91, Hewlett Packard Laboratories, 1991.
    • (1991)
    • Park, J.1    Schlansker, M.2
  • 19
    • 0028202050 scopus 로고
    • Guarded execution and branch prediction in dynamic ILP processors
    • D. N. Pnevmatikatos and G. S. Sohi. Guarded execution and branch prediction in dynamic ILP processors. SIGARCH Computer Architecture News, 22(2):120-129, 1994.
    • (1994) SIGARCH Computer Architecture News , vol.22 , Issue.2 , pp. 120-129
    • Pnevmatikatos, D.N.1    Sohi, G.S.2
  • 21
    • 0003526180 scopus 로고    scopus 로고
    • Marmot: An optimizing compiler for Java
    • Technical report, Microsoft, November 1998
    • R. Fitzgerald, T. B. Knoblock, E. Ruf, B. Steensgaard, and D. Tarditi. Marmot: an optimizing compiler for Java. Technical report, Microsoft, November 1998.
    • Fitzgerald, R.1    Knoblock, T.B.2    Ruf, E.3    Steensgaard, B.4    Tarditi, D.5
  • 24
    • 0033203777 scopus 로고    scopus 로고
    • Removing unnecessary synchronization in java
    • J. Bogda and U. Hölzle. Removing unnecessary synchronization in java. SIGPLAN Notices, 34(10):35-46, 1999.
    • (1999) SIGPLAN Notices , vol.34 , Issue.10 , pp. 35-46
    • Bogda, J.1    Hölzle, U.2
  • 25
  • 31
    • 0029214850 scopus 로고
    • Beyond induction variables: Detecting and classifying sequences using a demand-driven SSA form
    • M. P. Gerlek, E. Stoltz, and M. Wolfe. Beyond induction variables: detecting and classifying sequences using a demand-driven SSA form. ACM Transactions on Programming Languages and Systems, 17(1):85-122, 1995.
    • (1995) ACM Transactions on Programming Languages and Systems , vol.17 , Issue.1 , pp. 85-122
    • Gerlek, M.P.1    Stoltz, E.2    Wolfe, M.3
  • 34
    • 70449730488 scopus 로고    scopus 로고
    • D. Gries. Compiler Construction for Digital Computers. John Wiley and Sons, 1971.
    • D. Gries. Compiler Construction for Digital Computers. John Wiley and Sons, 1971.
  • 35
    • 64149120045 scopus 로고
    • The theory of parsing, translation and compiling
    • Prentice-Hall, Englewood Cliffs, NJ
    • A. V. Aho and J. D. Ullman. The theory of parsing, translation and compiling. In Compiling. Prentice-Hall, Englewood Cliffs, NJ, 1973.
    • (1973) Compiling
    • Aho, A.V.1    Ullman, J.D.2
  • 38
    • 70449718910 scopus 로고
    • for fortran program manipulation in Polaris. Master's thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, May
    • S. Weatherford. High level pattern matching extension to C++ for fortran program manipulation in Polaris. Master's thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, May 1994.
    • (1994) High level pattern matching extension to C
    • Weatherford, S.1
  • 39
    • 70449720722 scopus 로고    scopus 로고
    • Wine. http://sourceforge.net/project/showfiles.php?group id=6241.
    • Wine
  • 40
    • 70449715311 scopus 로고    scopus 로고
    • SPEC CPU2006. http://www.spec.org/cpu2006.
    • (2006)
  • 53
    • 0012232158 scopus 로고    scopus 로고
    • Lock coarsening: Eliminating lock overhead in automatically parallelized object-based programs
    • P. C. Diniz and M. C. Rinard. Lock coarsening: eliminating lock overhead in automatically parallelized object-based programs. Journal of Parallel and Distributed Computing, 49(2):218-244, 1998.
    • (1998) Journal of Parallel and Distributed Computing , vol.49 , Issue.2 , pp. 218-244
    • Diniz, P.C.1    Rinard, M.C.2
  • 54
    • 0000151487 scopus 로고    scopus 로고
    • Effective fine-grain synchronization for automatically parallelized programs using optimistic synchronization primitives
    • M. Rinard. Effective fine-grain synchronization for automatically parallelized programs using optimistic synchronization primitives. ACM Transactions on Computer Systems, 17(4):337-371, 1999.
    • (1999) ACM Transactions on Computer Systems , vol.17 , Issue.4 , pp. 337-371
    • Rinard, M.1
  • 56
    • 70449701642 scopus 로고    scopus 로고
    • S. S. Bhattacharyya, S. Sriram, and E. A. Lee. Resynchronization of multiprocessor schedules Part I: Fundamental concepts and unbounded latency analysis. Memorandum UCB/ERL M96/55, Electronics Research Laboratory, U. C. Berkeley', October 1996.
    • S. S. Bhattacharyya, S. Sriram, and E. A. Lee. Resynchronization of multiprocessor schedules Part I: Fundamental concepts and unbounded latency analysis. Memorandum UCB/ERL M96/55, Electronics Research Laboratory, U. C. Berkeley', October 1996.
  • 59
    • 0031364381 scopus 로고    scopus 로고
    • Streamlining inter-operation memory communication via data dependence prediction
    • Research Triangle Park, NC
    • A. Moshovos and G. S. Sohi. Streamlining inter-operation memory communication via data dependence prediction. In Proceedings of the 30th International Symposium of Microarchitecture, pages 235-245, Research Triangle Park, NC, 1997.
    • (1997) Proceedings of the 30th International Symposium of Microarchitecture , pp. 235-245
    • Moshovos, A.1    Sohi, G.S.2
  • 60
    • 0033339208 scopus 로고    scopus 로고
    • Memory renaming: Fast, early and accurate processing of memory communication
    • G. S. Tyson and T. M. Austin. Memory renaming: Fast, early and accurate processing of memory communication. International Journal of Parallel Programming, 27(5):357-380, 1999.
    • (1999) International Journal of Parallel Programming , vol.27 , Issue.5 , pp. 357-380
    • Tyson, G.S.1    Austin, T.M.2


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