ACAT 2000 Fermilab Oct 19 2000 Large Scale

ACAT 2000, Fermilab, Oct 19, 2000 Large Scale Computations in Astrophysics: Towards a Virtual Observatory Alex Szalay Department of Physics and Astronomy The Johns Hopkins University

Nature of Astronomical Data • Imaging – 2 D map of the sky at multiple wavelengths • Derived catalogs – subsequent processing of images – extracting object parameters (400+ per object) • Spectroscopic follow-up – spectra: more detailed object properties – clues to physical state and formation history – lead to distances: 3 D maps • Numerical simulations • All inter-related!

Imaging Data

3 D Maps

N-body Simulations

Trends Future dominated by detector improvements • Moore’s Law growth in CCD capabilities • Gigapixel arrays on the horizon • Improvements in computing and storage will track growth in data volume • Investment in software is critical, and growing Total area of 3 m+ telescopes in the world in m 2, total number of CCD pixels in Megapix, as a function of time. Growth over 25 years is a factor of 30 in glass, 3000 in pixels.

The Age of Mega-Surveys • The next generation mega-surveys and archives will change astronomy, due to – – top-down design large sky coverage sound statistical plans well controlled systematics • The technology to store and access the data is here we are riding Moore’s law • Data mining will lead to stunning new discoveries • Integrating these archives is for the whole community => Virtual Observatory

Ongoing surveys • Large number of new surveys – multi-TB in size, 100 million objects or more – individual archives planned, or under way • Multi-wavelength view of the sky – more than 13 wavelength coverage in 5 years • Impressive early discoveries – finding exotic objects by unusual colors • L, T dwarfs, high-z quasars – finding objects by time variability • gravitational microlensing MACHO 2 MASS DENIS SDSS GALEX FIRST DPOSS GSC-II COBE MAP NVSS FIRST ROSAT OGLE. . .

The Necessity of the VO • Enormous scientific interest in the survey data • The environment to exploit these huge sky surveys does not exist today! – 1 Terabyte at 10 Mbyte/s takes 1 day – Hundreds of intensive queries and thousands of casual queries per-day – Data will reside at multiple locations, in many different formats – Existing analysis tools do not scale to Terabyte data sets • Acute need in a few years, solution will not just happen

VO- The challenges • Size of the archived data 40, 000 square degrees is 2 Trillion pixels – One band 4 Terabytes – Multi-wavelength 10 -100 Terabytes – Time dimension 10 Petabytes • Current techniques inadequate – new archival methods – new analysis tools – new standards • Hardware/networking requirements – scalable solutions required • Transition to the new astronomy

VO: A New Initiative • • • Priority in the Astronomy and Astrophysics Survey Enable new science not previously possible Maximize impact of large current and future efforts Create the necessary new standards Develop the software tools needed Ensure that the community has network and hardware resources to carry out the science

New Astronomy- Different! • Data “Avalanche” – the flood of Terabytes of data is already happening, whether we like it or not – our present techniques of handling these data do not scale well with data volume • Systematic data exploration – will have a central role – statistical analysis of the “typical” objects – automated search for the “rare” events • Digital archives of the sky – will be the main access to data – hundreds to thousands of queries per day

Examples: Data Pipelines

Examples: Rare Events Discovery of several new objects by SDSS & 2 MASS SDSS T-dwarf (June 1999)

Examples: Reprocessing Gravitational lensing 28, 000 foreground galaxies over 2, 045, 000 background galaxies in test data (Mc. Kay etal 1999)

Examples: Galaxy Clustering • Shape of fluctuation spectrum – cosmological parameters and initial conditions • The new surveys (SDSS) are the first when log. N~30 • Starts with a query • Compute correlation function – All pairwise distances N 2, N log N possible • Power spectrum – Optimal: the Karhunen-Loeve transform – Signal-to-noise eigenmodes – N 3 in the number of pixels • Needs to be done many times over

Relation to the HEP Problem • Similarities – – – need to handle large amounts of data is located at multiple sites data should be highly clustered substantial amounts of custom reprocessing need for a hierarchical organization of resources scalable solutions required • Differences of Astro from HEP – – data migration is in opposite direction the role of small queries is more important relations between separate data sets (same sky) data size currently smaller, we can keep it all on disk

Data Migration Path Tier 0 Tier 1 portal Tier 2 Tier 3 HEP Astro

Queries are I/O limited • In our applications few fixed access patterns – one cannot build indices for all possible queries – worst case scenario is linear scan of the whole table • Increasingly large differences between – Random access • controlled by seek time (5 -10 ms), <1000 random I/O /sec – Sequential I/O • dramatic improvements, 100 MB/sec per SCSI channel easy • reached 215 MB/sec on a single 2 -way Dell server • Often much faster to scan than to seek • Good layout => more sequential I/O

Distributed Archives • Networks are slower than disks: – minimize data transfer – run queries locally • I/O will scale linearly with nodes – 1 GB/sec aggregate I/O engine can be built for <$100 K • Non-trivial problems in – load balancing – query parallelization – queries across inhomogeneous data sources • These problems are not specific to astronomy – commercial solutions are around the corner

Geometric Approach • Main problem – fast, indexed searches of Terabytes in N-dim space – searches are not axis-parallel • simple B-tree indexing does not work • Geometric approach – use the geometric nature of the data – quantize data into containers of `friends’ • objects of similar colors • close on the sky • clustered together on disk – containers represent coarse-grained map of the data • multidimensional index-tree (eg KD-tree)

Geometric Indexing “Divide and Conquer” Partitioning Attributes Number Sky Position Multiband Fluxes Other 3 N = 5+ M= 100+ 3 N M Hierarchical Triangular Mesh Split as k-d tree Stored as r-tree of bounding boxes Using regular indexing techniques

SDSS: Distributed Archive User Interface Analysis Engine Master SX Engine Objectivity Federation Objectivity Slave Objectivity RAID

Computing Virtual Data • Analyze large output volumes next to the database – send results only (`Virtual Data’): the system `knows’ how to compute the result (Analysis Engine) • Analysis: different CPU to I/O ratio than database – multilayered approach • Highly scalable architecture required – distributed configuration – scalable to data grids • Multiply redundant network paths between data-nodes and compute-nodes – `Data-wolf’ cluster

SDSS Data Flow

A Data Grid Node Compute node Compute node Compute node Compute node Compute node Compute node Compute layer Hardware requirements 200 CPUs • Large distributed database engines – with few Gbyte/s aggregate I/O speed • High speed (>10 Gbit/s) backbones – cross-connecting the major archives • Scalable computing environment 10 Gbits/s Other nodes Objectivity RAID Objectivity RAID – with hundreds of CPUs for analysis RAID Interconnect layer 1 Gbits/sec/node Database layer 2 GBytes/sec

SDSS in Gri. Phy. N • Two Tier 2 Nodes (FNAL + JHU) – testing framework on real data in different scenarios • FNAL node – reprocessing of images • fast and full regeneration of catalogs from the images on disk • gravitational lensing, finer morphological classification • JHU node – statistical calculations, integrated with catalog database • tasks require lots of data, can be run in parallel • various statistical calculations, likelihood analyses • power spectra, correlation functions, Monte-Carlo

Clustering of Galaxies Generic features of galaxy clustering: • Self organized clustering driven by long range forces • These lead to clustering on all scales • Clustering hierarchy: distribution of galaxy counts is approximately lognormal • Scenarios: ‘top-down’ vs ‘bottom-up’

Clustering of Computers • Problem sizes have lognormal distribution – multiplicative process • Optimal queuing strategy – run smallest job in queue – median scale set by local resources: largest jobs never finish • Always need more computing – ‘infall’ to larger clusters nearby – asymptotically long-tailed distribution of compute power • Short range forces: supercomputers • Long range forces: onset of high speed networking • Self-organized clustering of computing resources – the Computational Grid

Conclusions • Databases became an essential part of astronomy: most data access will soon be via digital archives • Data at separate locations, distributed worldwide, evolving in time: move queries not data! • Computations in both processing and analysis will be substantial: need to create a `Virtual Data Grid’ • Problems similar to HEP, lot of commonalities, but data flow more complex • Interoperability of archives is essential: the Virtual Observatory is inevitable www. voforum. org www. sdss. org