DOCSLIB.ORG

091028 Belle Grid 구축.Hwp

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
091028 Belle Grid 구축.Hwp gLite 3.1기반 Belle Grid 구축 보고서 머리말 본 책자는2008 년 노벨물리학상을 배출한 KEK 의 Belle 실험을 위한 그리드 인프라를 구축하는 과정을 기술하고 있습니다. Belle 실험의 그리드 인프라는 주로MC(Mote Carlo) Production 을 수행하고 있으며 최근 후속 실험인 Belle II 에서는 기하급수적으로 늘어나는 데이터량과 프로세스량을 처리하기 위해 적극 적으로 그리드 도입을 서두르고 있습니다. 이 책자를 통해 향후 국내 연구자 들을 위한Belle 및 Belle II 실험 지원에 도움이 될 수 있기를 기원합니다 . 이 책자를 만들어내기까지 도움을 주신 모든 분들께 감사드립니다. 2009년 11 월 15 일 작 성 자: 김 법 균 (KISTI) 유 진 승 (KISTI) 윤 희 준 (KISTI) 권 석 면 (KISTI) Christophe Bonnaud (KISTI) 박 형 우 (KISTI) 장 행 진 (KISTI) gLite 3.1기반 Belle Grid 구축 보고서 제목 차례 Glossary ······························································································································· 1 Ⅰ. 개요 ······························································································································· 4 1. KEK 소개 ······················································································································· 4 Ⅱ. Belle Grid 구축 ··········································································································· 9 1. Belle Grid 구축 개요 ··································································································· 9 2. CE (with lcg-CE) ·········································································································· 9 (1) VOMS인증서 설치 (Installation of VOMS Certificate) ································· 10 (2) Belle VO 가입 ······································································································ 10 (3) VO Parameter Setting ·························································································· 10 (4) Pool Account 생성 ······························································································· 11 (5) GIP (Generic Information Service) 설정 ··························································· 14 (6)로컬 큐 (Local Queue) 확인 및 Job Submission 설정 ··································· 15 3. WN (Worker Nodes) ····································································································· 16 4. 설치 테스트 ··················································································································· 16 (1) 로컬 스케쥴러 ······································································································ 16 (2) Information System ······························································································· 17 (3) 그리드 작업 수행 ································································································· 18 5. Belle Application Test ·································································································· 19 (1) Belle Application을 위한 NFS 요구사항 ·························································· 19 (2) NFS 서버 ·············································································································· 19 (3) WN및 CE ············································································································ 21 Appendix A. site-info.def for Belle VO ·········································································· 23 gLite 3.1기반 Belle Grid 구축 보고서 표 차례 <표 1> Current Belle Computing ····················································································· 8 gLite 3.1기반 Belle Grid 구축 보고서 그림 차례 그림1 KEK 에서 배출한 2008 년 노벨물리학상 ··························································· 5 그림2 Belle 실험 검출기 ································································································ 5 그림 3 KEK Organization Chart ······················································································ 6 그림4 KEKB 가속기 및 Belle 검출기 ·········································································· 7 그림 5 Belle Collaboration ······························································································· 7 그림6 2009 년 10 월 현재 Belle VO 지원 그리드 사이트 ·········································· 22 그림7 Belle Grid 활용 현황 1 ······················································································· 22 gLite 3.1기반 Belle Grid 구축 보고서 Glossary □ AFS : Andrew File System □ API : Application Programming Interface □ BDII : Berkeley Database Information Index □ CASTOR : CERN Advanced STORage manager □ CE : Computing Element □ CERN : European Laboratory for Particle Physics □ ClassAd : Classified advertisement (Condor) □ CLI : Command Line Interface □ CNAF : INFN's National Center for Telematics and Informatics □ CREAM : Computing Resource Execution And Management □ dcap : dCache Access Protocol □ DIT : Directory Information Tree (LDAP) □ DLI : Data Location Interface □ DN : Distinguished Name □ EDG : European DataGrid □ EDT : European DataTAG □ EGEE : Enabling Grids for E-sciencE □ ESM : Experiment Software Manager □ FCR : Freedom of Choice for Resources □ FNAL : Fermi National Accelerator Laboratory □ FTS : File Transfer Service □ GFAL : Grid File Access Library □ GG : Grid Gate (aka gatekeeper) □ GGF : Global Grid Forum (now called OGF) □ GGUS : Global Grid User Support □ GIIS : Grid Index Information Server □ GLUE : Grid Laboratory for a Uniform Environment □ GMA : Grid Monitoring Archictecture □ GOC : Grid Operations Centre □ GRAM : Grid Resource Allocation Manager - 1 - gLite 3.1기반 Belle Grid 구축 보고서 □ GRIS : Grid Resource Information Service □ GSI : Grid Security Infrastructure □ gsidcap : GSI-enabled version of the dCache Access Protocol □ gsirfio : GSI-enabled version of the Remote File Input/Output protocol □ GUI : Graphical User Interface □ GUID : Grid Unique ID □ HSM : Hierarchical Storage Manager □ ICE : Interface to CREAM Environment □ ID : Identifier □ INFN : Istituto Nazionale di Fisica Nucleare □ IS : Information Service □ JDL : Job Description Language □ kdcap : Kerberos-enabled version of the dCache Access Protocol □ LAN : Local Area Network □ LB : Logging and Bookkeeping Service □ LDAP : Lightweight Directory Access Protocol □ LFC : LCG File Catalogue □ LFN : Logical File Name □ LHC : Large Hadron Collider □ LCG : LHC Computing Grid □ LRC : Local Replica Catalogue □ LRMS : Local Resource Management System □ LSF : Load Sharing Facility □ MDS : Monitoring and Discovery Service □ MPI : Message Passing Interface □ MSS : Mass Storage System □ NS : Network Server □ OGF : Open Grid Forum (formerly called GGF) □ OS : Operating System □ PBS : Portable Batch System □ PFN : Physical File name □ PID : Process IDentifier □ POOL : Pool of Persistent Objects for LHC - 2 - gLite 3.1기반 Belle Grid 구축 보고서 □ PPS : Pre-Production Service □ RAL : Rutherford Appleton Laboratory □ RB : Resource Broker □ RFIO : Remote File Input/Output □ R-GMA : Relational Grid Monitoring Archictecture □ RLI : Replica Location Index □ RLS : Replica Location Service □ RM : Replica Manager □ RMC : Replica Metadata Catalogue □ RMS : Replica Management System □ ROC : Regional Operations Centre □ ROS : Replica Optimization Service □ SAM : Service Availability Monitoring □ SASL : Simple Authorization & Security Layer (LDAP) □ SE : Storage Element □ SFN : Site File Name □ SMP : Symmetric Multi Processor □ SN : Subject Name □ SRM : Storage Resource Manager □ SURL : Storage URL □ TURL : Transport URL □ UI : User Interface □ URI : Uniform Resource Identifier □ URL : Uniform Resource Locator □ UUID : Universal Unique ID □ VDT : Virtual Data Toolkit □ VO : Virtual Organization □ WLCG : Worldwide LHC Computing Grid □ WMS : Workload Management System □ WN : Worker Node □ WPn : Work Package #n - 3 - gLite 3.1기반 Belle Grid 구축 보고서 Ⅰ 개요 1. KEK 소개 □ KEK :高エネルギー 加速器研究機構 Kō Enerugī Kasokuki Kenkyū Kikō ○ High Energy Accelerator Research Organization ○ 일본쯔꾸바(Tsukuba) 에위치한고에너지물리연구기관 ○ 1955년설립된 INS(Institute of Nuclear Study) 를모태로하여 1971 년 KEK 가 설립되어 오늘에 이름 ○ 전자양전자충돌가속기인- KEKB 검출기를활용한 Belle 실험을진행 ○ Kobayashi-Maskawa가 1975 년에발표한이론을최근 Belle 실험에서증명하여 Kobayshi와 Maskawa 가 2008 년노벨물리학상을수상 ○ 2009년초까지 KEKB 검출기를통해데이터획득후 3 년간 shutdown 기간을 통해가속기를upgrade 하여 2012 년부터기존의가속기보다 50 배이상많은 양의데이터를생산하는Belle II 실험을수행할계획임 ○ KEK는 High Energy Physics 를연구하는기관으로가속기를활용하여생성되 는 데이터를 분석하는 연구를 하고 있음 ○ Belle실험은 KEK 의여러실험중의하나이며 KEK 내의 IPNS(Institute of Particle and Nuclear Studies)에서 취급하고 있음 □ KEK의 컴퓨팅 기능 구성 ○ 다양한실험을동시에지원하는CRC(Computing Research Center) 와각실험별 컴퓨팅 센터가 존재함 ○ Belle실험의 경우 별도의 컴퓨팅 자원을 보유하고 있으며 B-Factory Computer 또는B-Computer 라 불림 ○ Belle Grid는 CRC 에서구축ㆍ 담당하고있음 – Belle Grid와관련한협력은 CRC 를통해이루어짐 – 실험데이터확보는Belle Computing 담당자와의협의를통해이루어져야 함 ○ Belle Computing의 책임자는 Nobuhiko Katayama 임 - 4 - gLite 3.1기반 Belle Grid 구축 보고서 노벨 물리학상 2008 16 Citation: 5483 그림 1. KEK에서 배출한 2008 년 노벨물리학상 그림 2 Belle 실험 검출기 - 5 - gLite 3.1기반 Belle Grid 구축 보고서 그림 3 KEK Organization Chart - 6 - gLite 3.1기반 Belle Grid 구축 보고서 그림 4 KEKB가속기 및 Belle 검출기 그림 5 Belle Collaboration - 7 - gLite 3.1기반 Belle Grid 구축 보고서 1999~ 2001~ 2006~ 2009~ (4 years) (5 years) (6 years) (continued) ~ 100 ~ 1200 ~ 42500 ~ 115200 CPU (SI2K) (WS) (WS + PC) (PC) (PC) Disk (TB) 4 9 1000 1500 Tape (TB) 160 620 3500 3500 80 80 Workgroup 3 + 9 11 (+16 (+26 server (# hosts) file servers) file servers) User 23WS + Workstation (# 28WS + 68X 128PC 128PC 100PC hosts) 표 1 Current Belle Computing - 8 - gLite 3.1기반 Belle Grid 구축 보고서 Ⅱ Belle Grid 구축 1. Belle Grid 구축 개요 □ Belle Grid는 WLCG 인프라에서 동작하므로 기본적으로 gLite 미들웨어를 기반으 로 그리드가 구축된다. ○ 즉기존의, LCG-CE (gLite3.1) 를 Belle VO 가이용할수있도록설정해주어야 한다. □ Belle VO가 로컬 자원을 이용할 수 있도록 하기 위해 필요한 절차를 요약하면 다음과 같다. ○ CE (with lcg-CE) – Install VOMS Certificate – Join Belle VO – VO Parameter Setting – Create Pool accounts – Configure Information Service (GIP) – Check Local Queue & Configure Job Submission ○ WN – Install VOMS Certificate – VO
Load more

Recommended publications
  • Issue 16, June 2019 -...CHESSPROBLEMS.CA
    ...CHESSPROBLEMS.CA Contents 1 Originals 746 . ISSUE 16 (JUNE 2019) 2019 Informal Tourney....... 746 Hors Concours............ 753 2 Articles 755 Andreas Thoma: Five Pendulum Retros with Proca Anticirce.. 755 Jeff Coakley & Andrey Frolkin: Multicoded Rebuses...... 757 Arno T¨ungler:Record Breakers VIII 766 Arno T¨ungler:Pin As Pin Can... 768 Arno T¨ungler: Circe Series Tasks & ChessProblems.ca TT9 ... 770 3 ChessProblems.ca TT10 785 4 Recently Honoured Canadian Compositions 786 5 My Favourite Series-Mover 800 6 Blast from the Past III: Checkmate 1902 805 7 Last Page 808 More Chess in the Sky....... 808 Editor: Cornel Pacurar Collaborators: Elke Rehder, . Adrian Storisteanu, Arno T¨ungler Originals: [email protected] Articles: [email protected] Chess drawing by Elke Rehder, 2017 Correspondence: [email protected] [ c Elke Rehder, http://www.elke-rehder.de. Reproduced with permission.] ISSN 2292-8324 ..... ChessProblems.ca Bulletin IIssue 16I ORIGINALS 2019 Informal Tourney T418 T421 Branko Koludrovi´c T419 T420 Udo Degener ChessProblems.ca's annual Informal Tourney Arno T¨ungler Paul R˘aican Paul R˘aican Mirko Degenkolbe is open for series-movers of any type and with ¥ any fairy conditions and pieces. Hors concours compositions (any genre) are also welcome! ! Send to: [email protected]. " # # ¡ 2019 Judge: Dinu Ioan Nicula (ROU) ¥ # 2019 Tourney Participants: ¥!¢¡¥£ 1. Alberto Armeni (ITA) 2. Rom´eoBedoni (FRA) C+ (2+2)ser-s%36 C+ (2+11)ser-!F97 C+ (8+2)ser-hsF73 C+ (12+8)ser-h#47 3. Udo Degener (DEU) Circe Circe Circe 4. Mirko Degenkolbe (DEU) White Minimummer Leffie 5. Chris J. Feather (GBR) 6.
    [Show full text]
  • Get in Touch with Jaap Van Den Herik
    28 ICCA Journal March 1992 NEWS, INFORMATION, TOURNAMENTS AND REPORTS A DATABASE AS A SECOND D.M. Breuker L.v. Allis I.S. Herschberg H.J. van den Herik University of Limburg Delft Unversity of Technology Dept. of Computer Science Dept. of Technical Mathematics Maastricht, The Netherlands and Informatics Delft, The Netherlands ABSTRACT Chess endgame databases have provided computer-chess researchers with perfect knowledge of many endgames. Grandmaster play, however, has been largely unaffected by their existence. In the 1992 Linares tournament, Timman and Speelman adjourned a posi- tion which could lead to the KBBKN endgame. With the aid of publications on computer analysis of this endgame, Timman successfully prepared for the human-to-human confronta- tion and defeated Speelman. This contribution describes the background of the KBBKN endgame, the sequence of events which led to Timman's victory, and presents analyses of the grandmasters' performance. 1. BACKGROUND More than a century ago, Kling and Horwitz (1851) published the first thorough study of the KBBKN endgame. Their analysis showed that in the position of Diagram 1, Black can hold out indefinitely against White's attacks. They concluded that King and two Bishops cannot win if the weaker side can obtain the posi- tion of Diagram 1. The essential feature of this position is the King and the Knight's making up a fortress near a comer of the board, it being crucial that the Knight is on b7; this essence is maintained upon reflection in one or both of the board's medial lines. Kling and Horwitz (1851) asserted that Diagram 1 and its reflections pro- vided an exception, and that, Black failing to achieve Diagram I, White was bound to win.
    [Show full text]
  • The Fredkin Challenge Match
    AI Magazine Volume 2 Number 2 (1981) (© AAAI) TheFredkin AI!+halhge..'*A.... M&h by Hans Berliner Computer Science Department Carnegie-Mellon University Pittsburgh, Pennsylvania 15213 Chairman, Fredkin Prize Committee On August 18 and 19, 1980, at Stanford University during at Stanford University, with the actual game on in a closed the AAAI conference, the first of a projected pair of annual room containing only the player, computer terminal operators chess competitions pitting the world’s best computer pro- (Larry Atkin and David Cahlander of Control Data Corpora- grams against rated human players of approximately the same tion) and the referee. Upstairs was a large demonstration strength was held. These matches are part of the Fredkin prize room where two boards, one for the actual position and one competition, wherein a sum of $100,000, established by the for analysis, were used to keep the audience abreast of what Fredkin Foundation of Cambridge, Mass , is to be awarded to was happening and could be expected to happen. The moves the creators of a program that can defeat the World Chess were communicated through a telecommunications setup Champion in official competition. linking the two rooms. The program in this match was CHESS 4.9 of Northwes- In the first game, CHESS 4.9 played the White side of a tern University, authored by David Slate and Larry Atkin. At Sicilian Defense very badly, as it had done on several the same time, it was the best computer chess program in the occasions previously Later, it refused to force a draw in an world (recently surpassed by BELLE), and was the winner of inferior position.
    [Show full text]
  • PICDEM-3 User's Guide
    PICDEM-3 User’s Guide Information contained in this publication regarding device applications and the like is intended through suggestion only and may be superseded by updates. No representation or warranty is given and no liability is assumed by Microchip Technology Incorporated with respect to the accuracy or use of such information, or infringement of patents or other intellectual property rights arising from such use or otherwise. Use of Microchip’s products as critical components in life support systems is not authorized except with express written approval by Microchip. No licenses are conveyed, implicitly or otherwise, under any intellectual property rights. The Microchip logo, name, PIC, PICMASTER, PICSTART, and PRO MATE are registered trademarks of Microchip Technology Incorporated in the U.S.A. and other countries. MPLAB is a trademark of Microchip in the U.S.A. Microchip Technology Incorporated 1996. Intel is a registered trademark of Intel Corporation. IBM PC/AT is a registered trademark of International Business Machines Corporation. MS Windows, Microsoft Windows, and Windows are trademarks of Microsoft Corporation. All rights reserved. All other trademarks mentioned herein are the property of their respective companies. 1996 Microchip Technology Inc. DS51079A PICDEM-3 USER’S GUIDE DS51079A 1996 Microchip Technology Inc. PICDEM-3 USER’S GUIDE Table of Contents Preface Welcome . .1 Documentation Layout . .1 Chapter 1. About PICDEM-3 Introduction . .3 Highlights . .3 Processor Sockets . .3 Liquid Crystal Display . .3 Power Supply . .3 RS-232 Serial Port . .4 Pushbutton Switches . .4 Oscillator Options . .4 Analog Inputs . .5 Keypad Header . .5 External LCD Panel Connector . .5 LCD Software Demultiplexer .
    [Show full text]
  • Chess As Played by Artificial Intelligence
    Chess as Played by Artificial Intelligence Filemon Jankuloski, Adrijan Božinovski1 University American College of Skopje, Skopje, Macedonia [email protected] [email protected] Abstract. In this paper, we explore the evolution of how chess machinery plays chess. The purpose of the paper is to discuss the several different algorithms and methods which are implemented into chess machinery systems to either make chess playing more efficient or increase the playing strength of said chess machinery. Not only do we look at methods and algorithms implemented into chess machinery, but we also take a look at the many accomplishments achieved by these machines over a 70 year period. We will analyze chess machines from their conception up until their absolute domination of the competitive chess scene. This includes chess machines which utilize anything from brute force approaches to deep learning and neural networks. Finally, the paper is concluded by discussing the future of chess machinery and their involvement in both the casual and competitive chess scene. Keywords: Chess · Algorithm · Search · Artificial Intelligence 1 Introduction Artificial intelligence has become increasingly prevalent in our current society. We can find artificial intelligence being used in many aspects of our daily lives, such as through the use of Smartphones and autonomous driving vehicles such as the Tesla. There is no clear and concise definition for Artificial Intelligence, since it is a subject which still has massive space for improvement and has only recently been making most of its significant advancements. Leading textbooks on AI, however, define it as the study of “intelligent agents”, which can be represented by any device that perceives its environment and takes actions that maximizes its chances of achieving its goals [1].
    [Show full text]
  • An Historical Perspective Through the Game of Chess
    On the Impact of Information Technologies on Society: an Historical Perspective through the Game of Chess Fr´ed´eric Prost LIG, Universit´ede Grenoble B. P. 53, F-38041 Grenoble, France [email protected] Abstract The game of chess as always been viewed as an iconic representation of intellectual prowess. Since the very beginning of computer science, the challenge of being able to program a computer capable of playing chess and beating humans has been alive and used both as a mark to measure hardware/software progresses and as an ongoing programming challenge leading to numerous discoveries. In the early days of computer science it was a topic for specialists. But as computers were democratized, and the strength of chess engines began to increase, chess players started to appropriate to themselves these new tools. We show how these interac- tions between the world of chess and information technologies have been herald of broader social impacts of information technologies. The game of chess, and more broadly the world of chess (chess players, literature, computer softwares and websites dedicated to chess, etc.), turns out to be a surprisingly and particularly sharp indicator of the changes induced in our everyday life by the information technologies. Moreover, in the same way that chess is a modelization of war that captures the raw features of strategic thinking, chess world can be seen as small society making the study of the information technologies impact easier to analyze and to arXiv:1203.3434v1 [cs.OH] 15 Mar 2012 grasp. Chess and computer science Alan Turing was born when the Turk automaton was finishing its more than a century long career of illusion1.
    [Show full text]
  • A Research UNIX Reader: Annotated Excerpts from the Programmer's
    AResearch UNIX Reader: Annotated Excerpts from the Programmer’sManual, 1971-1986 M. Douglas McIlroy ABSTRACT Selected pages from the nine research editions of the UNIX®Pro grammer’sManual illustrate the development of the system. Accompanying commentary recounts some of the needs, events, and individual contributions that shaped this evolution. 1. Introduction Since it beganatthe Computing Science Research Center of AT&T Bell Laboratories in 1969, the UNIX system has exploded in coverage, in geographic distribution and, alas, in bulk. It has brought great honor to the primary contributors, Ken Thompson and Dennis Ritchie, and has reflected respect upon many others who have built on their foundation. The story of howthe system came to be and howitgrewand prospered has been told manytimes, often embroidered almost into myth. Still, aficionados seem neverto tire of hearing about howthings were in that special circle where the system first flourished. This collection of excerpts from the nine editions of the research UNIX Programmer’sManual has been chosen to illustrate trends and some of the lively give-and-take—or at least the tangible results thereof—that shaped the system. It is a domestic study,aimed only at capturing the way things were in the system’soriginal home. To look further afield would require a tome, not a report, and possibly a more dis- passionate scholar,not an intimate participant. The rawreadings are supplemented by my own recollec- tions as corrected by the memories of colleagues. The collection emphasizes development up to the Seventh Edition (v7*) in 1979, providing only occasional peeks ahead to v8 and v9.
    [Show full text]
  • A Bibliography of Books and Articles About UNIX and UNIX Programming
    A Bibliography of Books and Articles about UNIX and UNIX Programming Nelson H. F. Beebe University of Utah Department of Mathematics, 110 LCB 155 S 1400 E RM 233 Salt Lake City, UT 84112-0090 USA Tel: +1 801 581 5254 FAX: +1 801 581 4148 E-mail: [email protected], [email protected], [email protected] (Internet) WWW URL: http://www.math.utah.edu/~beebe/ 02 July 2021 Version 4.44 Abstract General UNIX texts [AL92a, AL95a, AL95b, AA86, AS93b, Ari92, Bou90a, Chr83a, Chr88, CR94, Cof90, Coh94, Dun91a, Gar91, Gt92a, Gt92b, This bibliography records books and historical Hah93, Hah94a, HA90, Hol92, KL94, LY93, publications about the UNIX operating sys- LR89a, LL83a, MM83a, Mik89, MBL89, tem, and UNIX programming tools. It mostly NS92, NH91, POLo93, PM87, RRF90, excludes networks and network programming, RRF93, RRH94, Rus91, Sob89, Sob91, which are treated in a separate bibliography, Sob95, Sou92, TY82b, Tim93, Top90a, internet.bib. This bibliography was started Top90b, Val92b, SSC93, WMP92] from material in postings to the sunflash list, volume 46, number 17, October 1992, and volume 57, number 29, September 1993, by Samuel Ko (e-mail: [email protected]), and then significantly extended by the present Catalogs and book lists author. Entry commentaries are largely due to S. Ko. [O'R93, Spu92, Wri93] 1 2 Communications software History [Cam87, dC87, dG93, Gia90] [?, ?, Cat91, RT74, RT79a] Compilers Linux [DS88, JL78, Joh79, JL87a, LS79, LMB92, [BBD+96, BF97, HP+95, Kir95a, Kir95b, MB90, SF85] PR96b, Sob97, SU94b, SU95, SUM95, TGB95, TG96, VRJ95,
    [Show full text]
  • The Dawn of the Post-Deep Blue Era 2
    The Dawn of the Post-Deep Blue Era 2 With Deep Blue retired, the new monarch of the computer chess world was up for grabs. In 1995 and leading up to the first Deep Blue versus Kasparov match, the 8th World Computer Chess Championship (WCCC) was held in Hong Kong. IBM planned to use this event to showcase the new Deep Blue and to establish formal recognition of its position at the top of the computer chess world. Deep Blue’s ear- lier version called Deep Thought had won the 6th WCCC in 1989 in Edmonton, winning all five of its games and dominating the competition. Then in 1992, the Deep Blue team skipped participating in the 7th WCCC. The team preferred to dedicate itself to honing Deep Blue’s talents against human grandmasters while aiming for the ultimate target, Garry Kasparov. Now, while leading the field in Hong Kong and seeming to be a sure winner of the championship, Deep Blue – more specifically, an experimental version of Deep Blue, called Deep Blue Prototype – was upset in its final-round game by Fritz. Fritz ran on a far smaller 90 MHz Pentium 3 processor. The IBM engine wound up in third place, a major disappointment to the Deep Blue team and IBM. Fritz finished at the top of the pack tied with Star Socrates, each having four of five points. Fritz then defeated Star Socrates in a one-game playoff to claim the title. The computer chess pundits all recognized the IBM engine as the strongest, but it failed to capture the title.
    [Show full text]
  • 84872007.Pdf
    UNIVERSiTY OF, 'r.:.-:·i?'b.,~""'~M • ~ ..... a 1 • •A;;• d-.! BRITISH COLUMBIA lHJRF~RY Prince G"'orgo, ec Chess Software And Its Impact On Chess Players Khaldoon Dhou B.S., Jordon University of Science and Technology, 2004 Project Submitted In Partial Fulfillment Of The Requirements For The Degree Of Master Of Science m Mathematical, Computer, and Physical Sciences (Computer Science) The Uni versity of Northern British Columbia July 2008 © Khaldoon Dhou, 2008 ABSTRACT Computer-aided chess is an important teaching method, as it allows a student to play under every condition possible, and regulates the speed of his/her development at an incremental pace, measured against actual players in the rated chess community. It is also relatively inexpensive, and pervasive, and allows players to match themselves against competitors from across the world. The learning process extends beyond games, as interactive software has shown; it teaches several skills, such as opening, strategy, tactics, and chess-problem solving. Furthermore, current applications allow chess players to establish rankings via online chess tournaments, meet international grandmasters, and have access to training tools based on strategies from chess masters. Using 250 chess software packages, this research classifies them into distinct categories based mainly on the Gobet and Jansen's organization of the chess knowledge [4]. This is followed by extensive discussion that analyzes these training tools, in order to identify the best training techniques available building on a research on human computer interaction, cognjtive psychology, and chess theory. 11 TABLE OF CONTENTS ABSTRACT ii LIST OF FIGURES iv LIST OF TABLES v ACKNOWLEDGEMENT vi Chapter 1 -Introduction ...............................................................................
    [Show full text]
  • The Theory of Games
    The Theory of Games Andrea Schalk [email protected] School of Computer Science University of Manchester Copyright c A. Schalk 2013 i Preface A note to 2020{2019 students of COMP34120 from Jon Shapiro What follows is the 2013 version of a set of lecture notes Written by An- drea Schalk. This was produced by Andrea for the first semester (or more specifically weeks 2 { 5) of an earlier version of this course. It is a shortened and slightly refocused version of a beautiful set of notes for a full-semester course on the theory of games which Dr. Schalk used to teach. The course COMP34120 was devised by Andrea, Xiao-Jun, and me, and these notes were written by Andrea to support her part of the course. Now Andrea has moved on to other teaching, and I have taken over her part of the course. Andrea has very generously agreed to allow me to continue to use her lecture notes, and as I think they are extremely good, and very appropriate for this course, I intend to use them as a textbook. As students you need to note a few things. First, Andrea writes this as if she is teaching the course, which she no longer is. So, on page 2 where she writes \I expect", is not quite right. We are covering the material more quickly and in less depth than she did in the previous course, but are covering more material. I will try to make clear through Blackboard which parts of the notes are relevant for each week.
    [Show full text]
  • COMPUTING for BELLE Belle Collaboration Nobu Katayama, Oho 1-1, Tsukuba-Shi, 305-0801, Japan
    COMPUTING FOR BELLE Belle collaboration Nobu Katayama, Oho 1-1, Tsukuba-shi, 305-0801, Japan Abstract As shown in Figure 2, Belle does not stop data taking The Belle experiment operates at the KEKB accelerator, a during beam injections so that the beam currents, thus high luminosity asymmetric energy e+e− machine. KEKB instantaneous luminosity can be kept at nearly maximum has achieved the world highest luminosity of 1.39 times almost all the time. It results in an increase of integrated 1034 cm−2s−1. Belle accumulates more than one million B luminosity by 30%. meson anti-B meson pairs in one good day. This corresponds to about 1TB of raw data per day. The BELLE COLLABORATION amount of the raw and processed data accumulated so far The Belle collaboration consists of more than 400 exceeds 1.2PB. Belle’s computing model has been a physicists from 58 institutions from 13 countries as traditional one and very successful so far. The computing shown in Figure 3; Universities and HEP institutions from has been managed by minimal number of people using Russia, China, India, and universities from Japan, Korea, cost effective solutions. Looking at the future, KEKB and Taiwan, Australia, US and Europe. KEK dominates 35 /Belle plans to improve the luminosity to a few times 10 in one sense as 30~40 staffs work on Belle exclusively cm−2s−1, 10−24 times as much as we obtain now. This and most of construction and operating costs are paid by paper describes Belle’s efficient computing operations, KEK. However, universities dominate in another sense as struggle to manage large amount of raw and physics data, young students from the universities are to stay at KEK, and plans of Belle computing for Super KEKB/Belle.
    [Show full text]