ECSS Symposium

ECSS staff share technical solutions to scientific computing challenges monthly in this open forum.

The ECSS Symposium allows the over 70 ECSS staff members to exchange on a monthly basis information about successful techniques used to address challenging science problems. Tutorials on new technologies may be featured. Two 30-minute, technically-focused talks are presented each month and include a brief question and answer period. This series is open to everyone.

Symposium coordinates

Day and Time: Third Tuesdays @ 1 pm Eastern / 12 pm Central / 10 am Pacific
Add this event to your calendar.

Webinar (PC, Mac, Linux, iOS, Android): Launch Zoom webinar

iPhone one-tap (US Toll): +14086380968,350667546#
(or): +16465588656,350667546#

Telephone (US Toll): Dial: +1 408 638 0968
(or) +1 646 558 8656
International numbers availableZoom International Dial-in Numbers
Meeting ID: 350 667 546

See the Events page for details of upcoming presentations. Upcoming events are also posted to the Training category of XSEDE News.

Due to the large number of attendees, only the presenters and host broadcast audio. Attendees may submit chat questions to the presenters through a moderator.

Video library

Videos and slides from past presentations are available (see below). Presentations from prior years that are not listed below may be available in the archive:

Key Points
Monthly technical exchange
ECSS community present
Open to everyone
Tutorials and talks with Q & A
Contact Information

January 15, 2013

Graph Analytics: An XSEDE Introduction
Presenter: Nick Nystrom (PSC)
Novel and Innovative Projects

Presentation Slides

Effectively analyzing "big data" is increasingly essential to problems of scientific and societal importance. That analysis can take on various forms, depending on the nature of both the data and the intended results. In particular, researchers often seek to discover relationships in complex networks of data that can be represented as sets of nodes and edges, i.e. graphs. Graphs can represent unstructured data in a very general and extensible way, with nodes and edges representing concepts and relationships that need not be defined in a priori schema. Complex networks are readily expressed as graphs include, for example, social networks, protein interaction and gene expression networks, epidemiology, security, citation and authorship networks, supply chains, and datasets for machine learning. The mathematical analysis of graphs is a well-developed field, and standards, software, and even purpose-built computers now support multiple approaches to computational graph analytics. In many cases the graphs of interest are not partitionable; that is, they cannot be divided into subgraphs that can be tackled separately and efficiently. This makes graph analytics a particularly challenging aspect of dealing with big data.

This XSEDE Symposium will cover the following topics:

  • an introduction to graph analytics, to establish motivation and terminology,
  • several important W3C standards and community software technologies, e.g. RDF, SPARQL, and GraphLab, that offer powerful capability for working with large graphs, and
  • XSEDE and other NSF-funded computational resources, namely Blacklight and Sherlock, that are well-suited to large-scale graph analytics.

 

 

(Videos not listed above, from prior years, can be found here)


December 18, 2012

Realizing the Universe on XSEDE: Simulation Support for the Dark Energy Survey
Presenter: Raminder Singh (IU)
Principal Investigator: August Evrard (University of Michigan)

Presentation Slides

The Dark Energy Survey Simulation Working group is using XSEDE resources to produce multiple synthetic sky surveys of galaxies and large-scale structure in support of science analysis for the Dark Energy Survey.  In order to scale up our production to the level of fifty 10-billion-particle simulations, we are collaborating with XSEDE ECSS group to embed production control using the Apache Airavata Science Gateway Framework.  I will talk about the current integration efforts and future plans to integrate post-processing steps.  Based on our set of production runs using Airavata, we find the workflow has reduced production time by more than 40% compared to manual management.

Computational Explorations in to Population Level Disease Spread using Agent Based Modeling
Presenter: David O'Neal (PSC)
Principal Investigator: Shawn Brown (University of Pittsburgh)

Presentation Slides

FRED (Framework for Reconstructing Epidemic Dynamics) is an open source agent-based modeling system that uses detailed synthetic populations derived from census data to capture geographic and demographic distributions. The original serial implementation required approximately 96 hours and 540 GB of memory to complete a 100-day US simulation. The current version completes the same analysis in 3-4 hours using less than 200 GB of memory.

Following brief overviews of the MIDAS project and FRED model, details of the ECSS collaboration that yielded these results will be presented.


September 18, 2012

DNS of Spatially Developing Turbulent Boundary Layers
PRESENTER(S): David Bock and Darren Adams (NCSA)
Principal Investigator: Antonio Ferrante (University of Washington)

[Presentation Slides]

Darren Adams and David Bock of NCSA will discuss their collaborative work for the ECSS project, "Direct Numerical Simulation of Spatially Developing Turbulent Boundary Layers" for PI Antonino Ferrante of the University of Washington. Specifically, Darren will outline his software development efforts providing a high-level HDF5 parallel IO library to assist in data management while David will discuss the processes involved in visualizing the data and demonstrate results with a variety of images and animations.

 

;

Efficient Implementation of Novel MD Simulation Methods in Optimized MD Codes
PRESENTER(S): Lonnie Crosby (NICS) and Phil Blood (PSC)
Principal Investigator: Greg Voth (University of Chicago)

[Presentation Slides]

Conducting molecular dynamics (MD) simulations involving chemical reactions in large-scale condensed phase systems (liquids, proteins, fuel cells, etc…) is a computationally prohibitive task.  Many force fields utilized in these simulations are not capable of simulating the breaking and forming of chemical bonds necessary to describe chemical reactions.  Additionally, chemical processes occur over a wide range of length scales and are coupled to slow (long time scale) system motions which make adequate sampling a challenge.  Ab initio methodologies are capable of describing these changing chemical bonds; however, these methods are computationally expensive which makes adequate sampling even more prohibitive.  Multistate methodologies, such as the multistate empirical valence bond (MS-EVB) method, which are based on effective force fields, are more computationally efficient and enable the simulation of chemical reactions over the necessary time and length scales to properly converge statistical properties.
The typical parallel scaling bottleneck in both reactive and nonreactive all-atom MD simulations is the accurate treatment of long-range electrostatic interactions. Currently, Ewald-type algorithms rely on three-dimensional Fast Fourier Transform (3D-FFT) calculations. The parallel scaling of these 3D-FFT calculations can be severely degraded at higher processor counts due to necessary MPI all-to-all communication. This poses an even bigger problem in MS-EVB calculations, since the electrostatics, and hence the 3D-FFT, must be evaluated many times during a single time step.
Due to the limited scaling of the 3D-FFT in MD simulations, the traditional single-program-multiple-data (SPMD) parallelism model is only able to utilize several hundred CPU cores, even for very large systems. However, with a proper implementation of a multi-program (MP) model, large systems can scale to thousands of CPU cores. This talk will discuss recent efforts in collaboration with XSEDE advanced support to implement the MS-EVB model in the scalable LAMMPS MD code, and to further improve parallel scaling by implementing MP parallelization algorithms in LAMMPS. These algorithms improve parallel scaling in both the standard LAMMPS code and LAMMPS with MS-EVB, thus facilitating the efficient simulation of large-scale condensed phase systems, which include the ability to model chemical reactions.
 


June 19, 2012

Prediction and Control of Compressible Turbulent Flows
Presenter: Robert McLay (TACC)
Principal Investigator: Daniel Bodony (University of Illinois at Urbana Champaign)

[Presentation Slides]

In this talk, I will review the lesson learned (or re-learned) in measuring and improving the performance of his code. The talk will break into two parts. The first part will focus on the measuring of his code with TAU and that the analysis showed. It will cover the overuse of MPI_Barrier and improving the communication pattern. The second part will focus on the replacing how solution files were generated. The code used separate files per task per unknown. A test program was created to show to write a single file using HDF5 in parallel. This single file contained all the unknowns. Even with a relatively small local size of 50K points per task, the test program was able to write 1.5GB/sec on Lonestar. This second part will focus on how to dynamically size the number of writers and number of stripes to maximize I/O performance.

Robert McLay can be reached via this website

 

P3DFFT introduction
Presenter: Dmitry Pekurovsky (SDSC)
Principal Investigator: P.K.Yeung (Georgia Tech)

[Presentation Slides]

Fourier and related types of transforms are widely used in scientific community. Three-dimensional Fast Fourier Transforms (3D FFT), for example, are used in many areas such as DNS turbulence, astrophysics, material science, chemistry, oceanography and X-ray crystallography. In many cases this is a very compute-intensive operation. Lately there has been a need for implementations of 3D FFT and related algorithms with good scaling on Petascale parallel machines. Most existing implementations of 3D FFT use one-dimensional task decomposition, and therefore are subject to scaling limitation when the number of cores reaches domain size. P3DFFT library overcomes this limitation. It is an open-source, easy-to-use software package providing general solution for 3D FFT based on two-dimensional decomposition. In this way it is different from majority of other libraries such as FFTW, PESSL, MKL and ACML. In this talk we will discuss what P3DFFT does, its evolution, and scaling on sub-petascale platforms.

Dmitry Pekurovsky can be reached via this website


May 8, 2012

Visualizing Residual Based Turbulence Models for Large Eddy Simulation
Presenter: Mark W. Vanmoer (NCSA)
Principal Investigator: Arif Masud (UIUC)

[Presentation Slides]

This ECSS project supplies visualization support for large eddy simulation (LES) on unstrucutred tetrahedral meshes using residual based turbulence models. LES aims to provide inexpensive solutions for turbulent flow problems. This residual based approach avoids the use of filter functions and is consistent with Navier-Stokes equations. The development of this computational method leads to testing against some standard turbulent flow problems: boxes with periodic boundaries, turbulent flows in channels, and flow around embedded objects. Visualization efforts consist of preparing animations and still shots for these various simulations.

http://vis.ncsa.illinois.edu/

Mark W. Vanmoer can be reached via this website

 

Running WIEN2K on Ranger with both Coarse and Fine Parallelism
Presenter: Hang Liu (TACC}
Principal Investigator: Luis Smith (Clark University}

[Presentation PDF]

Like some other DFT based packages, WIEN2K has typical coarse and fine parallelism implementation. However, it has its own internal management to handle the task geometry for that multi level parallel execution, which is not directly supported by the ibrun-like parallel job launching wrapper on Ranger. This ECSS project intends to figure out optimal compilation of WIEN2K on Ranger at first, and develop a utility script that can be used in usual SGE job script and generates the task geometry needed by parallel execution of WIEN2K.

Download video (.mov) file of these seminars here.

Hang Liu can be reached via this website


April 10, 2012

SCALing the knowledge base for the Never-Ending Language Learner (NELL): A step toward large-scale computing for automated learning
PRESENTER: Joel Welling (PSC)

[Presentation Slides]

The Never-Ending Language Learner is a system of Java programs which continuously learns new beliefs from the World Wide Web- see the twitter feed for 'cmunell' to follow its discoveries. This is a project of Tom Mitchell and William Cohen at the CMU CS department.  NELL learns by repeatedly cycling through a corpus of language statistics using information from its knowledge base.  The sizes of the corpus and of the knowledge base make each cycle a time-consuming process.  The ultimate goal of our interaction with this group is to bring this kind of work to high performance computing, allowing larger datasets and speeding the cycle time by a factor of hundreds.

Part of this project is just bringing up the necessary Java environment on Blacklight; I will discuss lessons learned in that process. The current ECCS project involves migrating the NELL ontology software from Tokyo Cabinet, a simple record-based database, to a graph database like Neo4J. This should provide a more natural representation for the ontology and will move the software from an obsolete base to a well-supported one. I will discuss the structure of the ontology and the representations of that structure under the new and old databases.

Joel Welling can be reached via this website

 

Use of Global Federated File System (GFFS)
PRESENTER: Andrew Grimshaw (University of Virginia)

The GFFS was born out of a need to access and manipulate remote resources such as file systems in a federated, secure, standardized, scalable, and transparent manner without requiring either data owners or applications developers and users to change how they store and access data in any way.

The GFFS accomplishes this by employing a global path-based namespace, e.g.,/data/bio/file1. Data in existing file systems, whether they are Windows file systems, MacOS file systems, AFS, Linux, or Lustre file systems can then be exported, or linked into the global namespace. For example, a user could export a local rooted directory structure on their "C" drive, C:\work\collaboration-with-Bob, into the global namespace at /data/bio/project-Phil. Files and directories on the user's "C" drive in \work\collaboration-with-bob would then, subject to access control, be accessible to users in the GFFS via the /data/bio/project-Bob path. Transparent access to data (and resources more generally) is realized by using OS-specific file system drivers (e.g. FUSE) that understand the underlying standard security, directory, and file access protocols employed by the GFFS.  These file system drivers map the GFFS global namespace onto a local file system mount. Data and other resources in the GFFS can then be accessed exactly the same way local files and directories are accessed - applications cannot tell the difference.

Three examples illustrate GFFS typical uses cases, accessing data at an NSF center from a home or campus, accessing data on a campus machine from an NSF center, and directly sharing data with a collaborator at another institution. In all three cases client access to data will be via the GFFS-aware FUSE driver.
 


March 13, 2012

GPU-based Radiation Treatment Planning Applications
Presenter: Dong Ju (DJ) Choi

[Presentation Slides]

Graphics processing unit (GPU) has been actively adopted on the developments of various applications in radiation treatment planning process. Recent progress in the GPU-based applications promise the ability to ideally deliver an optimal treatment in response to daily patient anatomic variation. In this talk we will show some of the applications developed for the research in radiation treatment planning process. We will introduce the applications with their thread parallelism scheme and computational performance improvements.

Dong Ju (DJ) Choi can be reached via this website

GPSI
Presenter: Thomas Uram

[Presentation Slides]

GPSI (pronounced "gypsy") provides computational scientists with a general purpose workbench for developing, testing, and using complex workflows for simulation and analysis. A key aspect that differentiates GPSI from other environments that support large parallel  workflows is that it's not tied to any particular science domain. GPSI provides tools that have emerged as common in many of our past science gateway efforts, doing the heavy lifting that is often required in starting a new science gateway, while facilitating customization to a particular domain or collaboration. The GPSI environment integrates support for job execution and management; data management and browsing; and application development and reuse. We are working with research groups in power grid simulation and analysis and in phylogenetics to improve productivity via GPSI.
 

Thomas Uram can be reached via this website


February 14, 2012

Modeling Studies of Nano and Biomolecular Systems
Presenter: Ross Walker, SDSC
Principal Investigator: Adrian Roitberg, University of Florida

[Presentation Slides]

Investigating large scale protein domain motions with GPU Accelerated AMD simulations: Sampling for the 99%.

This talk will cover recent developments in the acceleration of Molecular Dynamics Simulations using NVIDIA Graphics Processing units with the AMBER software package. In particular it will focus on recent algorithmic improvements aimed at accelerating the rate at which phase space is sampled. A recent success has been the reproduction of key results from the DE Shaw 1 millisecond Anton MD simulation of BPTI (Science, Vol. 330 no. 6002 pp. 341-346) with just 2.5 days of dihedral boosted AMD sampling on a single GPU workstation. These results show that with careful algorithm design it is possible to obtain key long timescale sampling data of enzymes using just a single $500 GTX580 Graphics Card.

Ross Walker can be reached via this website

 

Experiencing Developing Tools for Scientific Communities in the Apache Software Foundation: Beyond Open Source
Presenter: Marlon Pierce, Indiana University

[Presentation Slides]

Science Gateways provide Web-based environments for scientists and students to perform computational experiments online via Web interfaces using Web services and computational workflows.  Gateways rely on open source software, and many gateway developers have taken the extras step to make their own software open source, using tools like SourceForge, Github, and Google Code to make their codes available, easy to find, and open licensed. However, we believe there are important steps that should be taken to go beyond basic open source to address requirements for building open software communities.  In addition to licensing and support tools, open communities must have open processes for making design decisions, accepting code contributions, adding new project members, reporting and resolving problems, and making well-packaged and properly licensed software releases. The Apache Software Foundation provides the infrastructure and mentoring experience to help open source communities address these project governance issues.  Additionally, Apache has an interesting requirements (such as developer diversity) that are designed to emphasize the neutrality of the code base (encouraging competitors to have a safe place to cooperate), help sustain their projects through leadership turnover and funding cycles.  In this talk I present our group's efforts to convert two major pieces of the Open Gateway Computing Environments project, the Gadget Container and the Workflow Suite, into Apache Rave and Apache Airavata incubators, respectively. I discuss the implications of the Apache model, both positive and negative, on the science gateway community and cyberinfrastructure generally.

Marlon Pierce can be reached via this webite


January 10, 2012 Symposium

Condor
Presenter: Ben Cotton

[Presentation Slides]

Condor is a distributed batch scheduler specializing in high throughput and resource scavenging. Condor supports running thousands of jobs simultaneously across heterogeneous compute platforms.  This talk will discuss general Condor usage, including job creation and submission. Specifics of Purdue's Condor resource will also be presented. Sample computation types and workflows that best fit the resource will be shown.

Ben Cotton can be reached via this website

Visualization and analysis with Nautilus: From standard tools to unusual challenges
Presenter: Amy Szczepanski

[Presentation Slides]

Nautilus gives researchers great flexibility in visualizing and analyzing their data. One feature that enables these possibilities is Nautilus' 4 TB of global shared memory. In addition to the opportunities for keeping large data sets in memory, this architecture enables other types of analyses that are not well-suited for distributed memory systems. NICS/RDAV has developed an open-source tool, named Eden, that allows researchers to easily and efficiently perform parameter sweeps and other analyses that require independent runs of non-MPI code. We will start with a quick overview of Nautilus, its capabilities, and some of the standard visualization and analysis tools that are available on the system and then talk in more detail about Eden and how researchers have used this tool in their computational work.

Amy Szczepanski can be reached via this website


November 1, 2011 Symposium Talks

Large Synoptic Survey Telescope Data Challenge
Presenter: Darren Adams (NCSA)
PI: Tim Axelrod (University of Arizona)

[View Presentation Slides]

The ECSS team has collaborated with the Large Synoptic Survey Telescope (LSST) project in evaluating the Research and Education Data Depot network (REDDnet) project. LSST researchers are interested in ways to make very large datasets available to researchers in geographically distant locations. The REDDnet project has devised a system of storage "depots" that are geographically distributed.  Using the Logistical Storage (Lstore) system, also developed at Vanderbilt, files can be stored, replicated and striped based on user-defined policies.  Polies can be created to emphasize fault-tolerance, performance, and/or geographic availability.  The ECSS collaboration included integrating the LStore server with the NCSA Mass storage system and the loading of data sets from recent LSST data challenges.  New featuresi ncluding FUSE filesystem interface capabilities may make REDDnet a viable choice for the LSST team.

Archived Webcast:

Darren Adams can be reached via this website

 

Supporting Distributed and Loosely Coupled Parallel Molecular Simulations using SAGA
Presenters: Yaakoub El Kharma (TACC), Matt McKenzie (NICS)
PI: Ronald Levy (Rutgers)

[View Presentation Slides - no video] [Slide 21 movie] [Slide 24 movie]

This ECSS project is supporting an intense effort to understand important aspects of the physics of protein-ligand recognition by multidimensional replica exchange (RE) computer simulations. These are compute intensive calculations which are currently not well supported on XSEDE because they require both large numbers (10^3-10^4) of loosely coupled replicas and long simulation times (days to weeks). Our effort is focused resolving architectural and scalability issues associated with these large scale/high-throughput simulations. The framework we are using is the SAGA framework (Simple API for Grid Applications) and associated pilot job implementation: BigJob. The technical difficulties involved include job coordination across multiple resources, file and data movement, dynamic coupling of replicas and dynamic scheduling of resources. We will present the progress in implementing workflow managers, system monitors and data exchange mechanisms.

Archived Webcast:

Yaakoub El Kharma can be reached via this website


Showing 51 - 60 of 61 results.
Items per Page 10
of 7