GPG 6권 1부 참고자료

1.1 무잠금 알고리즘들

• [Alexandrescu04] Alexandrescu, Andrei, Hans Boehm, Kevlin Henney, Doug Lea, Bill Pugh, “Memory Model for Multithreaded C++.” C++ Standard Committee, WG21/N1680=J16/04-0120, 2004년 9월.
• [Fober05] Fober, Dominique, Yann Orlarey, Stéphane Letz, “Optimized Lock-Free FIFO Queue continued.” Laboratoire de Recherche en Informatique Musicale, Technical Report TR-050523, 2005.
• [Glinker04] Glinker, Paul, “Fight Memory Fragmentation with Templated Freelists.” Game Programming Gems 4, Charles River Media, 2004. 번역서는 “자유목록 템플릿을 이용한 메모리 단편화 해결”, Game Programming Gems 4, 정보문화사, 2005.
• [Herlihy91] Herlihy, Maurice, “Wait-Free Synchronization.” ACM Transactions on Programming Languages and Systems, 13(1): pp. 124–149, 1991년 1월.
• [Michael96] Michael, Maged and Michael Scott, “Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms.” 15th ACM Symp. on Principles of Distributed Computing, 1996년 5월.
• [Michael04a] Michael, Maged, “Scalable Lock-Free Dynamic Memory Allocation.” The 2004 ACM SIGPLAN Conference on Programming Language Design (2004년 6월): pp. 25–46.
• [Michael04b] Michael, Maged, “Hazard Pointers: Safe Memory Reclaimation for Lock-Free Objects.” IEEE Transactions on Parallel and Distributed Systems, 15(6): pp. 491–504, 2004년 6월.
• [Grove04] Groves, Lindsay, Simon Doherty, Mark Moir, and Victor Luchangco. “A Practical Lock-Free Queue Implementation and its Verification.” FM in NZ, 2004.
• [Pugh90] Pugh, William. “Skip Lists: A Probabilistic Alternative to Balanced Trees.” Communications of the ACM, 33(6):668–676, 1990년 6월.
• [Sutter05] Sutter, Herb. “The Free Lunch Is Over: A Fundamental Turn Toward Concurrency in Software.” Dr. Dobbs Journal. 2005년 3월.

1.2 OpenMP를 이용한 다중 코어 프로세서 활용

• [OpenMP05] OpenMP C/C++ specification. 웹 http://www.OpenMP.org.
• [Chandra00] Chandra, Rohit, Parallel Programming in OpenMP, Morgan Kaufmann, 2000.
• [Gaitlin05] Gaitlin, Kang Su, Pete Isensee, “Writing Multithreaded Applications with OpenMP in Visual Studio 2005,” MSDN Magazine (2005년 10월): pp. 78―91.
• [Isensee05] Isensee, Pete, “Effective Use of OpenMP in Games,” Game Developer Conference 2005, 웹 http://www.c,pevents.com/Sessions/GD/EffectiveUse.ppt.
• [Sutter04] Sutter, Herb, “The Free Lunch Is Over: A Fundamental Turn Toward Concurrency in Software,” Dr. Dobb’s Journal, 2005년 3월: pp 16―22, 웹 http://www.gotw.ca/publications/concurrency-ddj.htm.

1.3 OpenCV 라이브러리를 이용한 게임에서의 게임 컴퓨터 시각 활용

• [HSVspace] HSV 색공간에 대한 Wikipedia 기사. 웹 http://www.en.wikipedia.org/wiki/HSB_color_space
• [IntelIPP] Intel Integrated Performance Primitives에 대한 좀 더 자세한 자료가 http://www.intel.com/cd/software/products/asmo-na/eng/perflib/ipp/index.htm 과 http://www.support.intel.com/support/performancetools/libraries/ipp/sb/cs-010656.htm 에 있다.
• [OpenCV04] Intel의 Open Computer Vision Library 베타 4 (2004년 8월 14일). 웹 http://www.sourceforge.net/projects/opencvlibrary.
• [Sandeep02] Sandeep, K., A. N. Rajagopalan, “Human Face Detection in Cluttered Color Images Using Skin Color and Edge Information.” 2002. 웹 http://www.ee.iitb.ac.in/~icvgip/PAPERS/166.pdf.
• [Sedlacek04] Marián Sedláček, “Evaluation of RGB and HSV models in Human Faces Detection.” 2004. 웹 http://www.cg.tuwien.ac.at/studentwork/CESCG/CESCG-2004/web/Sedlacek-Marian
• [Vezhnevets03] Vezhnevets, V., V. Sazonov, A. Andreeva, “A survey on pixel-based skin color detection techniques.” Graphicon-2003, Moscow, 2003.

1.4 게임 객체의 지리 격자 등록

• [Ferraris01] Ferraris, Jonathan, “Quadtrees.” GameDev.net. 2001년 1월. 웹 http://www.gamedev.net/reference/articles/article1303.asp.
• [Frisken03] Frisken, S., R. Perry, “Simple and Efficient Traversal Methods for Quadtrees and Octrees.” Journal of Graphics Tools, Vol. 7, Issue 3. 2003년 5월.
• [Kelleghan97] Kelleghan, M., “Octree Partitioning Techniques.” Game Developer, 1997년 7월.
• [Pritchard01] Pritchard, M., “A High-Performance Tile-Based Line-of-Sight and Search System.” Game Programming Gems 2, Charles River Media, 2001. 번역서는 “고성능 타일 기반 시선 및 검색 시스템 ”, Game Programming Gems 2, 정보문화사, 2002.
• [Svarovsky00] Svarovsky, Jan, “Multi-Resolution Maps for Interaction Detection.” Game Programming Gems, Charles River Media, 2000. 번역서는 “다해상도 맵을 이용한 충돌 판정”, Game Programming Gems, 정보문화사, 2001.

1.5 BSP 기법들

• [Abrash97] Abrash, Michael, Graphics Programming Black Book. Coriolis Group Books 1997.

1.6 최근접 문자열 부합 알고리즘

• [Wikipedia05] “Levenshtein distance.” Wikipedia 2005년 9월 20일자, 웹 http://en.wikipedia.org/wiki/Levenshtein_distance.

1.7 CppUnit을 이용한 단위 검사 구현

• [CppUnit05] ?CppUnit. 웹 http://cppunit.sourceforge.net/cgi-bin/moin.cgi

1.8 저작권 침해의 억제 및 검출을 위한 출시 전 빌드 지문 적용

• [Wu04] Wu, Min, Wade Trappe, Z. Jane Wang, K. J. Ray Liu, “Collusion-Resistant Fingerprinting for Multimedia,” IEEE Signal Processing Magazine, March 2004. 웹 http://www.ece.umd.edu/~minwu/public_paper/Jnl/0403FPcollusion_IEEEfinal_SPM.pdf.

1.9 접근 기반 파일 재배치를 이용한 더 빠른 파일 적재

• [History03] “The History of Computer Data Storage: The timeline :),” 2003. 웹 http://www.usbyte.com/common/history_of_storage.htm.
• [Mansur05] Mansur, Mark, “DVD Layout and Load-Time Tips and Tricks,” 웹 https://xds.xbox.com, 2005년 3월 18일자.
• [Olsen00] Olsen, John, “Fast Data Load Trick.” Game Programming Gems 3, Charles River Media, 2002. 번역서는 “빠른 데이터 로드 기법”, Game Programming Gems 3, 정보문화사, 2003.
• [Zlib05] zlib, 2005. 웹 http://www.zlib.net.

1.10 빠른 반복을 위한 실행시점 자산 즉석적재

• Bloom, Charles, “The making of Oddworld: Stranger’s Wrath.” GameTech 2005. 웹 http://www.cbloom.com/3d/game_tech_04.zip.
• Hawkins, Brian, “Handle-Based Smart Pointers.” Game Programming Gems 3, Charles River Media, 2002. 번역서는 “핸들 기반의 똑똑한 포인터”, Game Programming Gems 3, 정보문화사, 2003.
• Johnstone, Mark S., “The Memory Fragmentation Problem: Solved?” ISMM98.
• Llopis, Noel, “The Beauty of Weak Reference and Null Objects.” Game Programming Gems 4, Charles River Media, 2003. 번역서는 “약한 참조와 널 객체의 미덕”, Game Programming Gems 4, 정보문화사, 2005.