Building Scalable Scientific Applications with Work Queue Douglas Thain and Dinesh Rajan University of Notre Dame Applied Cyber Infrastructure Concepts.

Slides:



Advertisements
Similar presentations
Lecture 12: MapReduce: Simplified Data Processing on Large Clusters Xiaowei Yang (Duke University)
Advertisements

MAP REDUCE PROGRAMMING Dr G Sudha Sadasivam. Map - reduce sort/merge based distributed processing Best for batch- oriented processing Sort/merge is primitive.
1 Real-World Barriers to Scaling Up Scientific Applications Douglas Thain University of Notre Dame Trends in HPDC Workshop Vrije University, March 2012.
MapReduce Online Created by: Rajesh Gadipuuri Modified by: Ying Lu.
Experience with Adopting Clouds at Notre Dame Douglas Thain University of Notre Dame IEEE CloudCom, November 2010.
Introduction to Scalable Programming using Makeflow and Work Queue Dinesh Rajan and Mike Albrecht University of Notre Dame October 24 and November 7, 2012.
1 Condor Compatible Tools for Data Intensive Computing Douglas Thain University of Notre Dame Condor Week 2011.
1 High Throughput Scientific Computing with Condor: Computer Science Challenges in Large Scale Parallelism Douglas Thain University of Notre Dame UAB 27.
1 Opportunities and Dangers in Large Scale Data Intensive Computing Douglas Thain University of Notre Dame Large Scale Data Mining Workshop at SIGKDD August.
1 Scaling Up Data Intensive Science with Application Frameworks Douglas Thain University of Notre Dame Michigan State University September 2011.
1 Models and Frameworks for Data Intensive Cloud Computing Douglas Thain University of Notre Dame IDGA Cloud Computing 8 February 2011.
Work Queue: A Scalable Master/Worker Framework Peter Bui June 29, 2010.
Introduction to Makeflow Li Yu University of Notre Dame 1.
Building Scalable Elastic Applications using Makeflow Dinesh Rajan and Douglas Thain University of Notre Dame Tutorial at CCGrid, May Delft, Netherlands.
Building Scalable Scientific Applications using Makeflow Dinesh Rajan and Peter Sempolinski University of Notre Dame.
Building Scalable Applications on the Cloud with Makeflow and Work Queue Douglas Thain and Patrick Donnelly University of Notre Dame Science Cloud Summer.
Introduction to Makeflow and Work Queue CSE – Cloud Computing – Fall 2014 Prof. Douglas Thain.
The SAM-Grid Fabric Services Gabriele Garzoglio (for the SAM-Grid team) Computing Division Fermilab.
CONDOR DAGMan and Pegasus Selim Kalayci Florida International University 07/28/2009 Note: Slides are compiled from various TeraGrid Documentations.
Apache Airavata GSOC Knowledge and Expertise Computational Resources Scientific Instruments Algorithms and Models Archived Data and Metadata Advanced.
Design of an Active Storage Cluster File System for DAG Workflows Patrick Donnelly and Douglas Thain University of Notre Dame 2013 November 18 th DISCS-2013.
Distributed Systems Early Examples. Projects NOW – a Network Of Workstations University of California, Berkely Terminated about 1997 after demonstrating.
MapReduce.
Elastic Applications in the Cloud Dinesh Rajan University of Notre Dame CCL Workshop, June 2012.
Massively Parallel Ensemble Methods Using Work Queue Badi’ Abdul-Wahid Department of Computer Science University of Notre Dame CCL Workshop 2012.
Toward a Common Model for Highly Concurrent Applications Douglas Thain University of Notre Dame MTAGS Workshop 17 November 2013.
Introduction to Work Queue Applications CSE – Cloud Computing – Fall 2014 Prof. Douglas Thain.
Building Scalable Scientific Applications with Makeflow Douglas Thain and Dinesh Rajan University of Notre Dame Applied Cyber Infrastructure Concepts University.
Building Scalable Scientific Applications using Makeflow Dinesh Rajan and Douglas Thain University of Notre Dame.
The Cooperative Computing Lab  We collaborate with people who have large scale computing problems in science, engineering, and other fields.  We operate.
Introduction to Scalable Programming using Work Queue Dinesh Rajan and Ben Tovar University of Notre Dame October 10, 2013.
1 Computational Abstractions: Strategies for Scaling Up Applications Douglas Thain University of Notre Dame Institute for Computational Economics University.
Introduction to Work Queue Applications Applied Cyberinfrastructure Concepts Course University of Arizona 2 October 2014 Douglas Thain and Nicholas Hazekamp.
Stuart Wakefield Imperial College London Evolution of BOSS, a tool for job submission and tracking W. Bacchi, G. Codispoti, C. Grandi, INFN Bologna D.
MapReduce Kristof Bamps Wouter Deroey. Outline Problem overview MapReduce o overview o implementation o refinements o conclusion.
Ganga A quick tutorial Asterios Katsifodimos Trainer, University of Cyprus Nicosia, Feb 16, 2009.
Enabling Grids for E-sciencE EGEE-III INFSO-RI Using DIANE for astrophysics applications Ladislav Hluchy, Viet Tran Institute of Informatics Slovak.
Grid Computing at Yahoo! Sameer Paranjpye Mahadev Konar Yahoo!
 Apache Airavata Architecture Overview Shameera Rathnayaka Graduate Assistant Science Gateways Group Indiana University 07/27/2015.
Review of Condor,SGE,LSF,PBS
Introduction to Makeflow and Work Queue Prof. Douglas Thain, University of Notre Dame
Analyzing LHC Data on 10K Cores with Lobster and Work Queue Douglas Thain (on behalf of the Lobster Team)
Introduction to Scalable Programming using Work Queue Dinesh Rajan and Mike Albrecht University of Notre Dame October 24 and November 7, 2012.
A N I N - MEMORY F RAMEWORK FOR E XTENDED M AP R EDUCE 2011 Third IEEE International Conference on Coud Computing Technology and Science.
Building Scalable Elastic Applications using Work Queue Dinesh Rajan and Douglas Thain University of Notre Dame Tutorial at CCGrid, May Delft,
Demonstration of Scalable Scientific Applications Peter Sempolinski and Dinesh Rajan University of Notre Dame.
Building Scalable Scientific Applications with Work Queue Douglas Thain and Dinesh Rajan University of Notre Dame Applied Cyber Infrastructure Concepts.
Massively Parallel Molecular Dynamics Using Adaptive Weighted Ensemble Badi’ Abdul-Wahid PI: Jesús A. Izaguirre CCL Workshop 2013.
Geant4 GRID production Sangwan Kim, Vu Trong Hieu, AD At KISTI.
Introduction to Makeflow and Work Queue Nicholas Hazekamp and Ben Tovar University of Notre Dame XSEDE 15.
1 An unattended, fault-tolerant approach for the execution of distributed applications Manuel Rodríguez-Pascual, Rafael Mayo-García CIEMAT Madrid, Spain.
Instrumenting Badi Abdul-Wahid, RJ Nowling CSE Operating Systems Professor Striegel.
Fundamental Operations Scalability and Speedup
Introduction to Makeflow and Work Queue
Spark Presentation.
Scaling Up Scientific Workflows with Makeflow
PREGEL Data Management in the Cloud
Introduction to Makeflow and Work Queue
Integration of Singularity With Makeflow
Introduction to Makeflow and Work Queue
湖南大学-信息科学与工程学院-计算机与科学系
Introduction to Makeflow and Work Queue
Weaving Abstractions into Workflows
Introduction to Makeflow and Work Queue
Introduction to Makeflow and Work Queue with Containers
What’s New in Work Queue
Creating Custom Work Queue Applications
gLite Job Management Christos Theodosiou
Overview of Workflows: Why Use Them?
MapReduce: Simplified Data Processing on Large Clusters
Presentation transcript:

Building Scalable Scientific Applications with Work Queue Douglas Thain and Dinesh Rajan University of Notre Dame Applied Cyber Infrastructure Concepts University of Arizona, October 3, 2013

Go to:

Recap: Makeflow

4 An Old Idea: Makefiles part1 part2 part3: input.data split.py./split.py input.data out1: part1 mysim.exe./mysim.exe part1 > out1 out2: part2 mysim.exe./mysim.exe part2 > out2 out3: part3 mysim.exe./mysim.exe part3 > out3 result: out1 out2 out3 join.py./join.py out1 out2 out3 > result

5 Makeflow = Make + Workflow Makeflow LocalCondorTorque Work Queue Provides portability across batch systems. Enable parallelism (but not too much!) Fault tolerance at multiple scales. Data and resource management.

Makeflow + Work Queue

FutureGrid Torque Cluster Campus Condor Pool Public Cloud Provider Private Cluster Makefile Makeflow Local Files and Programs Makeflow + Work Queue W W W ssh WW W W torque_submit_workers W W W condor_submit_workers W W W Thousands of Workers in a Personal Cloud submit tasks

Advantages of Using Work Queue Harness multiple resources simultaneously. Hold on to cluster nodes to execute multiple tasks rapidly. (ms/task instead of min/task) Scale resources up and down as needed. Better management of data, with local caching for data intensive tasks. Matching of tasks to nodes with data.

Makeflow Great for static workflows! - Tasks/dependencies are known beforehand - Directed Acyclic Graphs Great for file-based workflows! - Input: files, Output: files

What if my workflow is dynamic? Write a native Work Queue program using Work Queue API

11 Work Queue API use work_queue; queue = work_queue_create(); while( not done ) { while (more work ready) { task = work_queue_task_create(); // add some details to the task work_queue_submit(queue, task); } task = work_queue_wait(queue); // process the completed task }

12 worker sim in.txtout.txt put sim.exe put in.txt exec sim.exe out.txt get out.txt 1000s of workers dispatched to clusters, clouds, & grids Work Queue System Work Queue Library Work Queue Program C / Python / Perl cache recently used files

Run One Task in Python from work_queue import * queue = WorkQueue( port = 0 ) queue.specify_name( “myproject” ); task = Task(“sim.exe –p 50 in.dat >out.txt”) ### Missing: Specify files needed by the task. queue.submit( task ) While not queue.empty(): task = queue.wait(60)

Run One Task in Perl use work_queue; $queue = work_queue_create( 0 ); work_queue_specify_name( “myproject” ); $task = work_queue_task_create(“sim.exe –p 50 in.dat >out.txt”); ### Missing: Specify files needed by the task. work_queue_submit( $queue, $task ); while(!work_queue_empty($queue)) { $task = work_queue_wait( $queue, 60 ); if($task) work_queue_task_delete( $task ); }

Run One Task in C #include “work_queue.h” struct work_queue *queue; struct work_queue_task *task; queue = work_queue_create( 0 ); work_queue_specify_name( “myproject” ); task = work_queue_task_create(“sim.exe –p 50 in.dat >out.txt”); /// Missing: Specify files needed by the task. work_queue_submit( queue, task ); while(!work_queue_empty(queue)) { task = work_queue_wait( queue, 60 ); if(task) work_queue_task_delete( task ); }

Python: Specify Files for a Task task.specify_file( “in.dat”, ”in.dat”, WORK_QUEUE_INPUT, cache = False ) task.specify_file( “calib.dat”, ”calib.dat”, WORK_QUEUE_INPUT, cache = False ) task.specify_file( “out.txt”, ”out.txt”, WORK_QUEUE_OUTPUT, cache = False ) task.specify_file( “sim.exe”, ”sim.exe”, WORK_QUEUE_INPUT, cache = True ) sim.exe in.dat calib.dat out.txt sim.exe in.dat –p 50 > out.txt

Perl: Specify Files for a Task sim.exe in.dat calib.dat out.txt sim.exe in.dat –p 50 > out.txt work_queue_task_specify_file( $task,“in.dat”,”in.dat”, $WORK_QUEUE_INPUT, $WORK_QUEUE_NOCACHE ); work_queue_task_specify_file( $task,“calib.dat”,”calib.dat”, $WORK_QUEUE_INPUT, $WORK_QUEUE_NOCACHE ); work_queue_task_specify_file( $task,“out.txt”,”out.txt”, $WORK_QUEUE_OUTPUT, $WORK_QUEUE_NOCACHE ); work_queue_task_specify_file( $task,“sim.exe”,”sim.exe”, $WORK_QUEUE_INPUT, $WORK_QUEUE_CACHE );

C: Specify Files for a Task work_queue_task_specify_file( task,“in.dat”,”in.dat”, WORK_QUEUE_INPUT, WORK_QUEUE_NOCACHE ); work_queue_task_specify_file( task,“calib.dat”,”calib.dat”, WORK_QUEUE_INPUT, WORK_QUEUE_CACHE ); work_queue_task_specify_file( task,“out.txt”,”out.txt”, WORK_QUEUE_OUTPUT, WORK_QUEUE_NOCACHE ); work_queue_task_specify_file( task,“sim.exe”,”sim.exe”, WORK_QUEUE_INPUT, WORK_QUEUE_CACHE ); sim.exe in.dat calib.dat out.txt sim.exe in.dat –p 50 > out.txt

You must state all the files needed by the command.

Running the Work Queue program Python: $ python work_queue_example.py Perl: $ perl work_queue_example.pl C: $ gcc work_queue_example.c -o work_queue_example -I~/cctools/include/cctools -L~/cctools/lib -ldttools -lm $./work_queue_example

Start workers for your Work Queue program Start one local worker: $ work_queue_worker $MASTERHOST $MASTERPORT Submit (10) workers to SGE: $ sge_submit_workers $MASTERHOST $MASTERPORT 10 Submit (10) workers to Condor: $ condor_submit_workers $MASTERHOST $MASTERPORT 10 $MASTERHOST = Name of machine where Work Queue program runs. (e.g., alamo.fgrid.org) $MASTERPORT = Port on which Work Queue program is listening. (e.g., 1024)

FutureGrid Torque Cluster Campus Condor Pool Public Cloud Provider Private Cluster Work Queue Master Local Files and Programs Harness resources from multiple platforms W W W ssh WW W W torque_submit_workers W W W condor_submit_workers W W W Thousands of Workers in a Personal Cloud submit tasks

Keeping track of port numbers gets old really fast

Use Project Names Worker work_queue_worker -a –N myproject Catalog connect to alamo:9037 advertise “myproject” is at alamo:9037 query Work Queue (port 9037) query work_queue_status

Specify Project Names in Work Queue Specify Project Name for Work Queue master: Python: Perl: C: q.specify_name (“arizona-tutorial”) work_queue_specify_name ($q, “arizona-tutorial”); work_queue_specify_name (q, “arizona-tutorial”);

Start Workers with Project Names Start one worker: $ work_queue_worker -N arizona-tutorial Start many workers: $ sge_submit_workers -N arizona-tutorial 5 $ condor_submit_workers -N arizona-tutorial 5

work_queue_status

Advanced Features

Work Queue Task Structure The Work Queue task structure contains information about the task and its execution. The following information is available in the task structure: Task command (command line arguments) Task output (stdout) Task return status (exit code of command) Task host (hostname and port on which it ran) Task submit time, Task completion time Task execution time (command) And more..

Accessing Work Queue Task structure # After ‘t’ has been retrieved through q.wait() print % t.output print % t.host Python: # After ‘t’ has been retrieved through work_queue_wait() print “$t->{output}\n”; print “$t->{host})\n”: Perl: // After ‘t’ has been retrieved through work_queue_wait() printf (“%s\n”, t->output); printf (“%s\n”, t->host): C:

Work Queue Statistics Work Queue collects statistics on tasks & workers during run time The statistics can be retrieved anytime during run time Global statistics – Total bytes sent, Total send time – Total bytes received, Total receive time – Total tasks dispatched, Total tasks complete – Total workers joined, Total workers removed Statistics on Tasks – Tasks running, Tasks complete, Tasks waiting Statistics on Workers – Workers ready, workers busy, workers cancelling And more…

Accessing Work Queue Statistics You can access the Work Queue statistics anytime during run time as follows: print q.stats print q.stats.tasks_running Python: my $work_queue_stats = work_queue_stats->new(); work_queue_get_stats ($q, $work_queue_stats); print “$work_queue_stats->{tasks_running}”; Perl:

Work Queue Statistics You can access the Work Queue statistics anytime during run time as follows: struct work_queue_stats *wq_stats; work_queue_get_stats (q, wq_stats); printf (“%d”, work_queue_stats->tasks_running); C:

Tag a Work Queue task You can specify a tag for a task – Batch together related tasks with a tag – Add a unique identifier as tag to quickly identify on completed. t.specify_tag(“iteration_1”) Python: work_queue_task_specify_tag($t, “iteration_1”); Perl: C: work_queue_task_specify_tag(t, “iteration_1”);

Cancel Work Queue task You can cancel any task anytime after it has been submitted to Work Queue as follows: q.cancel_by_taskid(q, cancel_taskid) q.cancel_by_tasktag(q, “redudant_task”) Python: work_queue_cancel_by_taskid($q, $cancel_taskid); work_queue_cancel_by_tasktag($q, “redudant_task”); Perl: work_queue_cancel_by_taskid(q, cancel_taskid); work_queue_cancel_by_tasktag(q, “redudant_task”); C:

Retry “slow” Work Queue tasks Running on large number of resources – High probability of stragglers – These stragglers slow down completion of your computation Work Queue has a “fast abort” feature to detect stragglers and migrate tasks to other available resources. – It keeps running average of the task execution times. – Activate fast abort by specifying a multiple of the average task execution time – Work Queue will abort any task executing beyond the specified multiple of the task execution time. – The aborted task will then be retried for execution on another available machine.

Activating fast abort in Work Queue #abort if task exceeds 2.5 * avg execution time q.activate_fast_abort (2.5) Python: work_queue_activate_fast_abort ($q, 2.5); Perl: work_queue_activate_fast_abort (q, 2.5); C:

Send intermediate buffer data as input file for Work Queue Task You may have data stored in a buffer (e.g., output of a computation) that will serve as input for a work queue task. To send buffer data as input to a task: buffer = “This is intermediate data” t.specify_buffer(buffer, input.txt, WORK_QUEUE_INPUT, cache=True) Python:

Send intermediate buffer data as input file for Work Queue Task const char * buffer = “This is intermediate buffer data”; int buff_len = strlen(buffer); work_queue_task_specify_buffer(t, buffer, buff_len, “input.txt”, WORK_QUEUE_CACHE); my $buffer = “This is intermediate buffer data” my $buff_len = length($buffer); work_queue_task_specify_buffer($t,$buffer,$buf_len, “input.txt”, $WORK_QUEUE_CACHE); Perl: C:

Password Authentication Authentication between Work Queue master (Makeflow) and Work Queue workers Set password to use at master Only workers started with the same password will be accepted by master Challenge-response authentication – Password not sent out in the open

WQ Pool 200 work_queue_pool –T sge Managing Your Workforce SGE Cluster Master A Master B Master C Condor Pool W W W W W W Submits new workers. Restarts failed workers. Removes unneeded workers. WQ Pool 200 work_queue_pool –T condor 500 0

Hierarchical Work Queue Hierarchy in Work Queue: Master, Foremen, Workers Master Foreman Thousands of Workers in XSEDE Thousands of Workers in FutureGrid Thousands of Workers in Condor Thousands of Workers in SGE

Work Queue Documentation

Sample Applications of Work Queue

Genome Assembly Christopher Moretti, Andrew Thrasher, Li Yu, Michael Olson, Scott Emrich, and Douglas Thain, A Framework for Scalable Genome Assembly on Clusters, Clouds, and Grids, IEEE Transactions on Parallel and Distributed Systems, 2012 Using WQ, we could assemble a human genome in 2.5 hours on a collection of clusters, clouds, and grids with a speedup of 952X. SAND filter master SAND align master Celera Consensus W W W W W W W Sequence Data Modified Celera Assembler

Adaptive Weighted Ensemble 46 Proteins fold into a number of distinctive states, each of which affects its function in the organism. How common is each state? How does the protein transition between states? How common are those transitions?

AWE on Clusters, Clouds, and Grids 47

Replica Exchange T=10KT=20K T=30KT=40K Replica Exchange Work Queue Simplified Algorithm: Submit N short simulations at different temps. Wait for all to complete. Select two simulations to swap. Continue all of the simulations. Dinesh Rajan, Anthony Canino, Jesus A Izaguirre, and Douglas Thain, Converting A High Performance Application to an Elastic Cloud Application, Cloud Com 2011.

Private Cluster Campus Condor Pool Public Cloud Provider Shared SGE Cluster Elastic Application Stack W W WW W W W W W Work Queue Library All-PairsWavefrontMakeflow Custom Apps Thousands of Workers in a Personal Cloud W

Go to: