13 - 15 June, 20013rd ROOT Workshop1 PROOF and ROOT Grid Features Fons Rademakers.

Slides:



Advertisements
Similar presentations
Current methods for negotiating firewalls for the Condor ® system Bruce Beckles (University of Cambridge Computing Service) Se-Chang Son (University of.
Advertisements

Cross-site data transfer on TeraGrid using GridFTP TeraGrid06 Institute User Introduction to TeraGrid June 12 th by Krishna Muriki
Dr. Kalpakis CMSC 621, Advanced Operating Systems. Fall 2003 URL: Distributed System Architectures.
CCNA – Network Fundamentals
PROOF and AnT in PHOBOS Kristjan Gulbrandsen March 25, 2004 Collaboration Meeting.
CHEP031 Analysis of CMS Heavy Ion Simulation Data Using ROOT/PROOF/Grid Jinghua Liu for Pablo Yepes, Jinghua Liu Rice University, Houston, TX Maarten Ballintijn,
Job submission architectures in GRID environment Masamichi Ando M1 Student Taura Lab. Department of Information Science and Technology.
1 PROOF & GRID Update Fons Rademakers. 2 Parallel ROOT Facility The PROOF system allows: parallel execution of scripts parallel analysis of trees in a.
Distributed components
Network Operating System By Elena Otte Distributed Data Processing.
COS 420 DAY 25. Agenda Assignment 5 posted Chap Due May 4 Final exam will be take home and handed out May 4 and Due May 10 Latest version of Protocol.
June 21, PROOF - Parallel ROOT Facility Maarten Ballintijn, Rene Brun, Fons Rademakers, Gunter Roland Bring the KB to the PB.
The new The new MONARC Simulation Framework Iosif Legrand  California Institute of Technology.
© 2010 VMware Inc. All rights reserved VMware ESX and ESXi Module 3.
Network File System (NFS) in AIX System COSC513 Operation Systems Instructor: Prof. Anvari Yuan Ma SID:
 Distributed Software Chapter 18 - Distributed Software1.
10 Oct. 2001CMS/ROOT Workshop1 Networking, Remote Access, SQL, PROOF and GRID Fons Rademakers René Brun.
Hjemmeeksamen 1 INF3190. Oppgave Develop a monitoring/administration tool which allows an administrator to use a client to monitor all processes running.
Chapter 4 Windows NT/2000 Overview. NT Concepts  Domains –A group of one or more NT machines that share an authentication database (SAM) –Single sign-on.
PROOF - Parallel ROOT Facility Kilian Schwarz Robert Manteufel Carsten Preuß GSI Bring the KB to the PB not the PB to the KB.
June 2001ROOT 2001 FNAL1 What Else is New Since ROOT 2000? Fons Rademakers.
Pooja Shetty Usha B Gowda.  Network File Systems (NFS)  Drawbacks of NFS  Parallel Virtual File Systems (PVFS)  PVFS components  PVFS application.
Remote Access Chapter 4. Learning Objectives Understand implications of IEEE 802.1x and how it is used Understand VPN technology and its uses for securing.
Remote Access Chapter 4. Learning Objectives Understand implications of IEEE 802.1x and how it is used Understand VPN technology and its uses for securing.
WAN technologies and routing Packet switches and store and forward Hierarchical addresses, routing and routing tables Routing table computation Example.
ROOT Tutorials - Session 101 PROOT Tutorials – Session 10 PROOF, GRID, AliEn Fons Rademakers Bring the KB to the PB not the PB to the KB.
RELATIONAL FAULT TOLERANT INTERFACE TO HETEROGENEOUS DISTRIBUTED DATABASES Prof. Osama Abulnaja Afraa Khalifah
File and Object Replication in Data Grids Chin-Yi Tsai.
Mr C Johnston ICT Teacher BTEC IT Unit 05 - Lesson 05 Network Protocols.
Introduction to dCache Zhenping (Jane) Liu ATLAS Computing Facility, Physics Department Brookhaven National Lab 09/12 – 09/13, 2005 USATLAS Tier-1 & Tier-2.
1 Marek BiskupACAT2005PROO F Parallel Interactive and Batch HEP-Data Analysis with PROOF Maarten Ballintijn*, Marek Biskup**, Rene Brun**, Philippe Canal***,
Computer Networking From LANs to WANs: Hardware, Software, and Security Chapter 13 FTP and Telnet.
ROOT for Data Analysis1 Intel discussion meeting CERN 5 Oct 2003 Ren é Brun CERN Distributed Data Analysis.
ROOT and Federated Data Stores What Features We Would Like Fons Rademakers CERN CC-IN2P3, Nov, 2011, Lyon, France.
1 Linux Networking and Security Chapter 5. 2 Configuring File Sharing Services Configure an FTP server for anonymous or regular users Set up NFS file.
ROOT-CORE Team 1 PROOF xrootd Fons Rademakers Maarten Ballantjin Marek Biskup Derek Feichtinger (ARDA) Gerri Ganis Guenter Kickinger Andreas Peters (ARDA)
FTP File Transfer Protocol Graeme Strachan. Agenda  An Overview  A Demonstration  An Activity.
CEOS Working Group on Information Systems and Services - 1 Data Services Task Team Discussions on GRID and GRIDftp Stuart Doescher, USGS WGISS-15 May 2003.
HIGUCHI Takeo Department of Physics, Faulty of Science, University of Tokyo Representing dBASF Development Team BELLE/CHEP20001 Distributed BELLE Analysis.
1 Microsoft Windows 2000 Network Infrastructure Administration Chapter 4 Monitoring Network Activity.
MySQL and GRID status Gabriele Carcassi 9 September 2002.
Linux Operations and Administration
March, PROOF - Parallel ROOT Facility Maarten Ballintijn Bring the KB to the PB not the PB to the KB.
Super Scaling PROOF to very large clusters Maarten Ballintijn, Kris Gulbrandsen, Gunther Roland / MIT Rene Brun, Fons Rademakers / CERN Philippe Canal.
1 Status of PROOF G. Ganis / CERN Application Area meeting, 24 May 2006.
March 13, 2006PROOF Tutorial1 Distributed Data Analysis with PROOF Fons Rademakers Bring the KB to the PB not the PB to the KB.
File Transfer And Access (FTP, TFTP, NFS). Remote File Access, Transfer and Storage Networks For different goals variety of approaches to remote file.
September, 2002CSC PROOF - Parallel ROOT Facility Fons Rademakers Bring the KB to the PB not the PB to the KB.
Latest Improvements in the PROOF system Bleeding Edge Physics with Bleeding Edge Computing Fons Rademakers, Gerri Ganis, Jan Iwaszkiewicz CERN.
Latest Improvements in the PROOF system Bleeding Edge Physics with Bleeding Edge Computing Fons Rademakers, Gerri Ganis, Jan Iwaszkiewicz CERN.
Sept. 2000CERN School of Computing1 PROOF and ROOT Grid Features Fons Rademakers.
Run-time Adaptation of Grid Data Placement Jobs George Kola, Tevfik Kosar and Miron Livny Condor Project, University of Wisconsin.
Sockets A popular API for client-server interaction.
A System for Monitoring and Management of Computational Grids Warren Smith Computer Sciences Corporation NASA Ames Research Center.
PROOF on multi-core machines G. GANIS CERN / PH-SFT for the ROOT team Workshop on Parallelization and MultiCore technologies for LHC, CERN, April 2008.
XtreemOS IP project is funded by the European Commission under contract IST-FP Scientific coordinator Christine Morin, INRIA Presented by Ana.
VMware ESX and ESXi Module 3.
Administration Tools Cluster.exe is a command line tool that you can use for scripting or remote administration through slow WAN links. Cluadmin.exe is.
PROOF – Parallel ROOT Facility
LINUX ADMINISTRATION 1
SUBMITTED BY: NAIMISHYA ATRI(7TH SEM) IT BRANCH
File Transfer and access
TYPES OFF OPERATING SYSTEM
Chapter 3: Windows7 Part 4.
Application layer Lecture 7.
CGS 3763 Operating Systems Concepts Spring 2013
Kristjan Gulbrandsen March 25, 2004 Collaboration Meeting
Support for ”interactive batch”
PROOF - Parallel ROOT Facility
STATEL an easy way to transfer data
Presentation transcript:

June, 20013rd ROOT Workshop1 PROOF and ROOT Grid Features Fons Rademakers

June, 20013rd ROOT Workshop2 PROOF - Parallel ROOT Facility Bring the KB to the PB not the PB to the KB

June, 20013rd ROOT Workshop3 Parallel ROOT Facility The PROOF system allows: parallel execution of scripts parallel analysis of chains of trees on clusters of heterogeneous machines Its design goals are: transparency, scalability, adaptivity Prototype developed in 1997 as proof of concept (only for simple queries resulting in 1D histograms)

June, 20013rd ROOT Workshop4 Parallel Script Execution root Remote PROOF Cluster proof TNetFile TFile Local PC $ root ana.C stdout/obj node1 node2 node3 node4 $ root root [0].x ana.C $ root root [0].x ana.C root [1] gROOT->Proof(“remote”) $ root root [0].x ana.C root [1] gROOT->Proof(“remote”) root [2] gProof->Exec(“.x ana.C”) ana.C proof proof = slave server proof proof = master server #proof.conf slave node1 slave node2 slave node3 slave node4 *.root TFile

June, 20013rd ROOT Workshop5 PROOF Aware ROOT Script void ana { if (gROOT->IsProofServ()) { if (gProofServ->IsMaster()) { printf("Macro running on master server\n"); // single remote init } else { printf("Macro running on %d of %d\n", gProofServ->GetGroupId(), gProofServ->GetGroupSize()); // parallel remote init } } else { printf("Macro running in local ROOT session\n"); // local init }... }

June, 20013rd ROOT Workshop6 Parallel Tree Analysis root [0].! ls -l run846_tree.root -rw-r-r-- 1 rdm cr Feb 1 16:20 run846_tree.root root [1] TFile f("run846_tree.root") root [2] gROOT->Time() root [3] T49->Draw("fPx") Real time 0:0:11, CP time root [4] gROOT->Proof() *** Proof slave server : pcna49a.cern.ch started *** *** Proof slave server : pcna49b.cern.ch started *** *** Proof slave server : pcna49c.cern.ch started *** *** Proof slave server : pcna49d.cern.ch started *** *** Proof slave server : pcna49e.cern.ch started *** Real time 0:0:4, CP time root [5] T49->Draw("fPx") Real time 0:0:3, CP time 0.240

June, 20013rd ROOT Workshop7 Workflow For Tree Analysis Initialization Process Wait for next command Slave 1 Tree->Draw() Packet generator Initialization Process Wait for next command Slave NMaster Tree->Draw() GetNextPacket () SendObject(histo) Add histograms Display histograms 0, , , , , ,40 440,50 590,60

June, 20013rd ROOT Workshop8 PROOF Session Statistics root [6] T49->Print("p") Total events processed: Total number of packets: 147 Default packet size: 100 Smallest packet size: 20 Average packet size: Total time (s): 2.78 Average time between packets (ms): Shortest time for packet (ms): 99 Number of active slaves: 5 Number of events processed by slave 0: 1890 Number of events processed by slave 1: 2168 Number of events processed by slave 2: 2184 Number of events processed by slave 3: 2667 Number of events processed by slave 4: 1676

June, 20013rd ROOT Workshop9 PROOF Error Handling Handling death of PROOF servers death of master fatal, need to reconnect death of slave master will resubmit packets of death slave to other slaves Handling of ctrl-c OOB message is send to master, and forwarded to slaves, causing soft/hard interrupt

June, 20013rd ROOT Workshop10 PROOF Authentication PROOF supports secure and un-secure authentication mechanisms Un-secure mangled password send over network Secure SRP, Secure Remote Password protocol (Stanford Univ.), public key technology Soon: Globus authentication

June, 20013rd ROOT Workshop11 PROOF Grid Interface PROOF can use Grid Resource Broker to detect which nodes in a cluster can be used in the parallel session PROOF can use Grid File Catalogue and Replication Manager to map LFN’s to chain of PFN’s PROOF can use Grid Monitoring Services

June, 20013rd ROOT Workshop12 Setting Up PROOF Install ROOT system For automatic execution of daemons add proofd and rootd to /etc/inetd.conf and /etc/services (not mandatory, servers can be started by users) The rootd (1094) and proofd (1093) port numers have been officially assigned by IANA Setup proof.conf file describing cluster Setup authentication files (globally, users can override)

June, 20013rd ROOT Workshop13 PROOF and the GRID Selection Parameters DB1 DB4 DB5 DB6 CPU Local Remote Procedure Proc.C PROOF CPU TagDB RDB DB3 DB2 Proc.C Results

June, 20013rd ROOT Workshop14 New Grid Features in ROOT

June, 20013rd ROOT Workshop15 Main Grid Issues Distributed computing over wide area networks (WAN’s). Requires: efficient use of WAN pipes user authentication file catalogue and file replication resource allocation and brokering resource monitoring etc.

June, 20013rd ROOT Workshop16 Long Fat Pipes Long fat pipes are WAN links with a large bandwidth*delay product For optimal performance keep pipe full By default this is not the case maximum TCP buffer size is 64KB for a pipe with a 192KB bandwidth*delay product the pipe is empty 60% of the time SourceDestination ACK

June, 20013rd ROOT Workshop17 TCP Window Scaling (RFC 1323) A solution is to use a TCP buffer size equal to the bandwidth*delay product This support for large TCP buffers (window scaling) is described in RFC 1323 Problem: system administrators are needed to change maximum TCP buffer sizes on source and destination machines, e.g. for Linux: echo > /proc/sys/net/core/rmem_max SourceDestination ACK

June, 20013rd ROOT Workshop18 Parallel Sockets Buffer is striped over multiple sockets in equal parts Ideal number of parallel sockets depends on bandwidth*delay product (assuming default 64KB TCP buffer size). No system manager needed to tune network Same performance as with large buffers SourceDestination ACK

June, 20013rd ROOT Workshop19 New Grid Features in ROOT Parallel socket classes, TPSocket and TPServerSocket, that derive from TSocket and TServerSocket TNetFile and rootd daemon modified to use parallel sockets New TFTP class using parallel sockets and rootd daemon

June, 20013rd ROOT Workshop20 Parallel FTP Parallel FTP via the TFTP class and the rootd daemon Uses the TPSocket class Supports all standard ftp commands Anonymous ftp Performance, CERN - GSI: wu-ftp: 1.4 MB/s TFTP: 2.8 MB/s

June, 20013rd ROOT Workshop21 Coming soon… Interface to Grid authentication service Interface to Grid file catalog Interface to Grid resource broker