Cloud Computing. Up until now
|
|
- Kenneth Sherman
- 5 years ago
- Views:
Transcription
1 Cloud Computing Lectures 3 and 4 Grid Schedulers: Condor, Sun Grid Engine Introduction. Up until now Definition of Cloud Computing. Grid Computing: Schedulers: Condor architecture. 1
2 Summary Condor: user perspective. Condor Flocking. Sun Grid Engine. Create a sub file: Job Submission % vi program.sub Submit the job: % condor_submit program.sub Universe = standard input = program.in output = program.out executable = program queue 3 2
3 Job Submission Executable = /bin/foo Arguments = xpto $(Process) Requirements = Memory >= 1024 && OpSys=="WINNT51" && Arch =="INTEL" Universe = vanilla input = test.data output = $(Process).out error = $(Process).error log = $(Process).log Initialdir = run_1 Queue 5 Initialdir = run_2 Queue 5 Arch, OpSys, Disk (KB), Memory (MB), Machine, Job Submission More: _Job.html 3
4 ClassAds ClassAds are Condor s mechanism for: Representing resources and clients within the system. Expressing client and machine preferences. Allocating resources. Sufficiently expressive for representing characteristics (features), requests and policies. Simple enough to allow matching (at the negotiator) between clients and resources. Can be listed using condor_status. Condor_status example 4
5 ClassAds MyType = Machine TargetType = Job Machine = n3.grid.com Arch = INTEL OpSys = Linux Disk = Rank = (Customer=john?1:0) MyType = Job TargetType = Machine Owner = john Cmd = /usr/bin/java Rank = Kflops * 10 + Disk Condor Scheduling Calculate the total available resources. Order requests by their users priority (lower is better). Priority starts with a configured value and decays with resource use for fairness. Calculate the proportional resource share by user priority. Start the jobs from the user with highest priority by order of machine preference followed by job preference. Continue with the next user. 5
6 Condor Applications Unix or Windows binary executables. Scripts. Interpreted programs (JVM, Mono, perl). MPI. PVM. Universe Types Condor provides different universes: vanilla UNIX jobs + no Remote I/O. standard UNIX jobs + Remote I/O. scheduler UNIX jobs with immediate local execution. globus UNIX jobs over Globus. java Javaapps. Finds and benchmarks the VM. pvm PVMjobs. Finds new nodes as the job progresses. mpi MPIjobs. Reserves nodes before starting job. vm Run a job inside a system virtual machine (VMWare or Xen). 6
7 vanilla Universe Allows users to submit any UNIX process to Condor. Pros: No program modification. Very flexible. Includes: Binaries. Scripts. Interpreted programs (java, perl). Multi-process jobs. Cons: vanilla Universe (cont.) No checkpointing. Limited I/O at remote machines: Explicit description of input files. Explicit descriptions of output files. Condor does not start vanillajobs at an unfriendly node. ClassAds: FilesystemDomain and UIDDomain must match. 7
8 When one connects clusters HELP! SOS! Cluster Cluster Cluster File Server File Server SOS! Cluster Cluster HELP! SOS! File Server File Server File Server File Server Unfriendly Environments An executable may run with: Correct OS and HW architecture and enough memory. But some elements may be missing: Input files. Disk space for output files. Absence of shared file system. No login. Run as nobody? 8
9 standard Universe Allows users to submit jobs with special Condor relinking. Pros: Checkpointing Remote I/O: Friendly environment anywhere. Data buffering. I/O performance monitoring and reporting. Remapping of file names. Cons: standard Universe (cont.) Applications must be relinked. Limited set of applications: Only single process UNIX apps. Certain system calls are restricted. 9
10 Restrictions on System Calls standard universe does not allow: Multiple processes: fork(), exec(), system() Inter-process communication : Semaphores, message passing, shared memory. Sophisticated I/O: mmap(), select(), poll(), non-blocking I/O, file locking. Threads. Remote I/O Starter!!! file_remaps = "data = 10
11 Brief I/O Summary % condor_q -io -- Schedd: c01.cs.wisc.edu : < :2016> ID OWNER READ WRITE SEEK XPUT BUFSIZE BLKSIZE joe KB KB KB/s KB 32.0 KB joe KB KB B /s KB 32.0 KB joe 44.7 KB 22.1 KB B /s KB 32.0 KB 3 jobs; 0 idle, 3 running, 0 held Great for performance debugging! Complete I/O Summary in Your condor job "/usr/joe/records.remote input output" exited with status 0. Total I/O: KB/s effective throughput 5 files opened 104 reads totaling KB 316 writes totaling 1.2 MB 102 seeks I/O by File: buffered file /usr/joe/output opened 2 times 4 reads totaling 12.4 KB 4 writes totaling 12.4 KB buffered file /usr/joe/input opened 2 times 100 reads totaling KB 311 write totaling 1.2 MB 101 seeks 11
12 File Remapping Suppose a program opens a file called data, but one wants to open a different file according to the process number. In the jobs sub file, add: file_remaps = "data = /home/john/data.$(process)" Process 1 gets /home/john/data.1 Process 2 gets /home/john/data.2 And so on And of course free access to distributed file systems. Relinking Use condor_compilebefore usual compilation commands: For example: gcc main.o utils.o -o program Becomes: condor_compile gcc main.o utils.o -o program Despite the name (compile), it s just relinking with Condor libraries. 12
13 Checkpoint To checkpoint an executing program is to take a snapshotof its current state in such a way that the program can be restarted from that stateat a later time possibly at a different resource. Provides: Preemptive-Resume scheduling. Fault Tolerance when checkpointing is done periodically. In Condor, checkpointing running jobs is optional. If it is needed, source should be linked with condor_syscall_lib. Checkpointing in Condor Implemented in condor_syscall_libas a signal handler When condor sends a signal to checkpoint, the handler saves process state informationin a checkpoint file From Core -contents of process uarea, data and stack segments From Executable symbol and debugging info, initialized data, text 13
14 Checkpointing & Restart Shadow sends the latest checkpoint file to the new Starter during restart The starter, reads the job state from the checkpoint file and the execution continues Starter periodically sends a checkpoint signal to the executing job Condor_syscall_lib makes job dump core and saves job state in the checkpoint file Checkpoint file temporarily Remote Machine Starter transfers latest checkpoint file to shadow when job vacated Checkpoint signal Starter process for the remote job Checkpoint file Code in condor_syscall_lib saves process state information Checkpoint file transferred when job vacated Checkpoint file transferred when job restarted Local File System Shadow process for the job Remote Machine Submit Machine Ganglia: GUI for Grid Monitoring 14
15 DAGMan Directed Acyclic Graph Manager Manages dependencies between processes: Don t run B before A finishes. The execution plan is represented as a directed acyclical graph (DAG), where: Nodes are processes. Edges are dependencies. Defining DAGs A DAG is specified in a.dagfile that lists the tasks and their dependencies. For example: # diamond.dag Job A a.sub Job B b.sub Job C c.sub Job D d.sub Parent A Child B C Parent B C Child D Job B Job A Job D Job C Each node corresponds to the job described in its.sub file. 15
16 Running a DAG % condor_submit_dag diamond.dag Starts a daemon process to follow the execution and interact with the schedd. It s a meta-scheduler: controls the scheduler. Only submits jobs when the plan allows for it. Processing the DAG results in a list of execution levels. Level 1 A Level 2 B C D Level 3 E DAG: other features Associate scripts to jobs: SCRIPT PRE e SCRIPT POST Rescue: If a job fails, DAGMangenerates a.dag.rescuefile with the missing part of the DAG. Retry: If a job fails, it may be reexecuted: RETRY A 5 Throttling: It is possible to limit the number of concurrent jobs: condor_submit_dag maxjobs N 16
17 Next time Globus. Condor-G. 17
! " # " $ $ % & '(()
!"# " $ $ % &'(() First These slides are available from: http://www.cs.wisc.edu/~roy/italy-condor/ 2 This Morning s Condor Topics * +&, & - *.&- *. & * && - * + $ 3 Part One Matchmaking: Finding Machines
More informationGrid Compute Resources and Grid Job Management
Grid Compute Resources and Job Management March 24-25, 2007 Grid Job Management 1 Job and compute resource management! This module is about running jobs on remote compute resources March 24-25, 2007 Grid
More informationGrid Compute Resources and Job Management
Grid Compute Resources and Job Management How do we access the grid? Command line with tools that you'll use Specialised applications Ex: Write a program to process images that sends data to run on the
More informationTutorial 4: Condor. John Watt, National e-science Centre
Tutorial 4: Condor John Watt, National e-science Centre Tutorials Timetable Week Day/Time Topic Staff 3 Fri 11am Introduction to Globus J.W. 4 Fri 11am Globus Development J.W. 5 Fri 11am Globus Development
More information! " #$%! &%& ' ( $ $ ) $*+ $
! " #$%! &%& ' ( $ $ ) $*+ $ + 2 &,-)%./01 ) 2 $ & $ $ ) 340 %(%% 3 &,-)%./01 ) 2 $& $ $ ) 34 0 %(%% $ $ %% $ ) 5 67 89 5 & % % %$ %%)( % % ( %$ ) ( '$ :!"#$%%&%'&( )!)&(!&( *+,& )- &*./ &*( ' 0&/ 1&2
More informationCloud Computing. Summary
Cloud Computing Lectures 2 and 3 Definition of Cloud Computing, Grid Architectures 2012-2013 Summary Definition of Cloud Computing (more complete). Grid Computing: Conceptual Architecture. Condor. 1 Cloud
More informationHTCONDOR USER TUTORIAL. Greg Thain Center for High Throughput Computing University of Wisconsin Madison
HTCONDOR USER TUTORIAL Greg Thain Center for High Throughput Computing University of Wisconsin Madison gthain@cs.wisc.edu 2015 Internet2 HTCondor User Tutorial CONTENTS Overview Basic job submission How
More informationHTCondor Essentials. Index
HTCondor Essentials 31.10.2017 Index Login How to submit a job in the HTCondor pool Why the -name option? Submitting a job Checking status of submitted jobs Getting id and other info about a job
More informationAN INTRODUCTION TO WORKFLOWS WITH DAGMAN
AN INTRODUCTION TO WORKFLOWS WITH DAGMAN Presented by Lauren Michael HTCondor Week 2018 1 Covered In This Tutorial Why Create a Workflow? Describing workflows as directed acyclic graphs (DAGs) Workflow
More informationSpecial Topics: CSci 8980 Edge History
Special Topics: CSci 8980 Edge History Jon B. Weissman (jon@cs.umn.edu) Department of Computer Science University of Minnesota P2P: What is it? No always-on server Nodes are at the network edge; come and
More informationHTCondor overview. by Igor Sfiligoi, Jeff Dost (UCSD)
HTCondor overview by Igor Sfiligoi, Jeff Dost (UCSD) Acknowledgement These slides are heavily based on the presentation Todd Tannenbaum gave at CERN in Feb 2011 https://indico.cern.ch/event/124982/timetable/#20110214.detailed
More informationFirst evaluation of the Globus GRAM Service. Massimo Sgaravatto INFN Padova
First evaluation of the Globus GRAM Service Massimo Sgaravatto INFN Padova massimo.sgaravatto@pd.infn.it Draft version release 1.0.5 20 June 2000 1 Introduction...... 3 2 Running jobs... 3 2.1 Usage examples.
More informationCondor and BOINC. Distributed and Volunteer Computing. Presented by Adam Bazinet
Condor and BOINC Distributed and Volunteer Computing Presented by Adam Bazinet Condor Developed at the University of Wisconsin-Madison Condor is aimed at High Throughput Computing (HTC) on collections
More informationIntroduction to Condor. Jari Varje
Introduction to Condor Jari Varje 25. 27.4.2016 Outline Basics Condor overview Submitting a job Monitoring jobs Parallel jobs Advanced topics Host requirements Running MATLAB jobs Checkpointing Case study:
More informationCondor and Workflows: An Introduction. Condor Week 2011
Condor and Workflows: An Introduction Condor Week 2011 Kent Wenger Condor Project Computer Sciences Department University of Wisconsin-Madison Outline > Introduction/motivation > Basic DAG concepts > Running
More informationAn Introduction to Using HTCondor Karen Miller
An Introduction to Using HTCondor 2014 Karen Miller The Team - 2013 Established in 1985, to do research and development of distributed high-throughput computing 2 HT Stands for High Throughput Throughput:
More informationAn Introduction to Using HTCondor Karen Miller
An Introduction to Using HTCondor 2015 Karen Miller The Team - 2014 Established in 1985, to do research and development of distributed high-throughput computing 2 HT Stands for High Throughput Throughput:
More informationCondor-G and DAGMan An Introduction
Condor-G and DAGMan An Introduction Condor Project Computer Sciences Department University of Wisconsin-Madison condor-admin@cs.wisc.edu / tutorials/miron-condor-g-dagmantutorial.html 2 Outline Overview
More informationAn introduction to checkpointing. for scientific applications
damien.francois@uclouvain.be UCL/CISM - FNRS/CÉCI An introduction to checkpointing for scientific applications November 2013 CISM/CÉCI training session What is checkpointing? Without checkpointing: $./count
More informationHPC Resources at Lehigh. Steve Anthony March 22, 2012
HPC Resources at Lehigh Steve Anthony March 22, 2012 HPC at Lehigh: Resources What's Available? Service Level Basic Service Level E-1 Service Level E-2 Leaf and Condor Pool Altair Trits, Cuda0, Inferno,
More informationProcess Migration via Remote Fork: a Viable Programming Model? Branden J. Moor! cse 598z: Distributed Systems December 02, 2004
Process Migration via Remote Fork: a Viable Programming Model? Branden J. Moor! cse 598z: Distributed Systems December 02, 2004 What is a Remote Fork? Creates an exact copy of the process on a remote system
More informationECE 550D Fundamentals of Computer Systems and Engineering. Fall 2017
ECE 550D Fundamentals of Computer Systems and Engineering Fall 2017 The Operating System (OS) Prof. John Board Duke University Slides are derived from work by Profs. Tyler Bletsch and Andrew Hilton (Duke)
More informationAN INTRODUCTION TO USING
AN INTRODUCTION TO USING Todd Tannenbaum June 6, 2017 HTCondor Week 2017 1 Covered In This Tutorial What is HTCondor? Running a Job with HTCondor How HTCondor Matches and Runs Jobs - pause for questions
More informationWhat s new in HTCondor? What s coming? European HTCondor Workshop June 8, 2017
What s new in HTCondor? What s coming? European HTCondor Workshop June 8, 2017 Todd Tannenbaum Center for High Throughput Computing Department of Computer Sciences University of Wisconsin-Madison Release
More informationProcesses. Process Scheduling, Process Synchronization, and Deadlock will be discussed further in Chapters 5, 6, and 7, respectively.
Processes Process Scheduling, Process Synchronization, and Deadlock will be discussed further in Chapters 5, 6, and 7, respectively. 1. Process Concept 1.1 What is a Process? A process is a program in
More informationDEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING UNIT I
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Year and Semester : II / IV Subject Code : CS6401 Subject Name : Operating System Degree and Branch : B.E CSE UNIT I 1. Define system process 2. What is an
More informationChapter 13: I/O Systems
Chapter 13: I/O Systems DM510-14 Chapter 13: I/O Systems I/O Hardware Application I/O Interface Kernel I/O Subsystem Transforming I/O Requests to Hardware Operations STREAMS Performance 13.2 Objectives
More informationWhat does an Operating System do?
February 5, 2007 Perspectives on an OS There are three perspectives on an OS: 1 The user is concerned with the services it provides. Perspectives on an OS There are three perspectives on an OS: 1 The user
More informationCondor-G Stork and DAGMan An Introduction
Condor-G Stork and DAGMan An Introduction Condor Project Computer Sciences Department University of Wisconsin-Madison condor-admin@cs.wisc.edu Outline Background and principals The Story of Frieda, the
More informationPresented by: Jon Wedell BioMagResBank
HTCondor Tutorial Presented by: Jon Wedell BioMagResBank wedell@bmrb.wisc.edu Background During this tutorial we will walk through submitting several jobs to the HTCondor workload management system. We
More informationGetting Started with OSG Connect ~ an Interactive Tutorial ~
Getting Started with OSG Connect ~ an Interactive Tutorial ~ Emelie Harstad , Mats Rynge , Lincoln Bryant , Suchandra Thapa ,
More informationChapter 13: I/O Systems. Operating System Concepts 9 th Edition
Chapter 13: I/O Systems Silberschatz, Galvin and Gagne 2013 Chapter 13: I/O Systems Overview I/O Hardware Application I/O Interface Kernel I/O Subsystem Transforming I/O Requests to Hardware Operations
More informationProcesses. CS 475, Spring 2018 Concurrent & Distributed Systems
Processes CS 475, Spring 2018 Concurrent & Distributed Systems Review: Abstractions 2 Review: Concurrency & Parallelism 4 different things: T1 T2 T3 T4 Concurrency: (1 processor) Time T1 T2 T3 T4 T1 T1
More informationChapter 2: Operating-System Structures. Operating System Concepts 9 th Edit9on
Chapter 2: Operating-System Structures Operating System Concepts 9 th Edit9on Silberschatz, Galvin and Gagne 2013 Objectives To describe the services an operating system provides to users, processes, and
More informationChapter 12: I/O Systems
Chapter 12: I/O Systems Chapter 12: I/O Systems I/O Hardware! Application I/O Interface! Kernel I/O Subsystem! Transforming I/O Requests to Hardware Operations! STREAMS! Performance! Silberschatz, Galvin
More informationChapter 13: I/O Systems
Chapter 13: I/O Systems Chapter 13: I/O Systems I/O Hardware Application I/O Interface Kernel I/O Subsystem Transforming I/O Requests to Hardware Operations STREAMS Performance Silberschatz, Galvin and
More informationChapter 12: I/O Systems. Operating System Concepts Essentials 8 th Edition
Chapter 12: I/O Systems Silberschatz, Galvin and Gagne 2011 Chapter 12: I/O Systems I/O Hardware Application I/O Interface Kernel I/O Subsystem Transforming I/O Requests to Hardware Operations STREAMS
More informationLinux Operating System
Linux Operating System Dept. of Computer Science & Engineering 1 History Linux is a modern, free operating system based on UNIX standards. First developed as a small but self-contained kernel in 1991 by
More informationCHAPTER 2: PROCESS MANAGEMENT
1 CHAPTER 2: PROCESS MANAGEMENT Slides by: Ms. Shree Jaswal TOPICS TO BE COVERED Process description: Process, Process States, Process Control Block (PCB), Threads, Thread management. Process Scheduling:
More informationCOSC243 Part 2: Operating Systems
COSC243 Part 2: Operating Systems Lecture 16: Threads and data sharing Zhiyi Huang Dept. of Computer Science, University of Otago Zhiyi Huang (Otago) COSC243 Lecture 16 1 / 24 Overview Last lecture: Hierarchical
More informationLecture 4: Memory Management & The Programming Interface
CS 422/522 Design & Implementation of Operating Systems Lecture 4: Memory Management & The Programming Interface Zhong Shao Dept. of Computer Science Yale University Acknowledgement: some slides are taken
More informationWhat s new in HTCondor? What s coming? HTCondor Week 2018 Madison, WI -- May 22, 2018
What s new in HTCondor? What s coming? HTCondor Week 2018 Madison, WI -- May 22, 2018 Todd Tannenbaum Center for High Throughput Computing Department of Computer Sciences University of Wisconsin-Madison
More informationCSC Operating Systems Spring Lecture - XII Midterm Review. Tevfik Ko!ar. Louisiana State University. March 4 th, 2008.
CSC 4103 - Operating Systems Spring 2008 Lecture - XII Midterm Review Tevfik Ko!ar Louisiana State University March 4 th, 2008 1 I/O Structure After I/O starts, control returns to user program only upon
More informationDay 9: Introduction to CHTC
Day 9: Introduction to CHTC Suggested reading: Condor 7.7 Manual: http://www.cs.wisc.edu/condor/manual/v7.7/ Chapter 1: Overview Chapter 2: Users Manual (at most, 2.1 2.7) 1 Turn In Homework 2 Homework
More informationProcess Description and Control. Chapter 3
Process Description and Control Chapter 3 Contents Process states Process description Process control Unix process management Process From processor s point of view execute instruction dictated by program
More informationOS lpr. www. nfsd gcc emacs ls 1/27/09. Process Management. CS 537 Lecture 3: Processes. Example OS in operation. Why Processes? Simplicity + Speed
Process Management CS 537 Lecture 3: Processes Michael Swift This lecture begins a series of topics on processes, threads, and synchronization Today: processes and process management what are the OS units
More informationSNS COLLEGE OF ENGINEERING
SNS COLLEGE OF ENGINEERING Coimbatore. Department of Computer Science and Engineering Question Bank- Even Semester 2015-2016 CS6401 OPERATING SYSTEMS Unit-I OPERATING SYSTEMS OVERVIEW 1. Differentiate
More informationChapter 8: Virtual Memory. Operating System Concepts
Chapter 8: Virtual Memory Silberschatz, Galvin and Gagne 2009 Chapter 8: Virtual Memory Background Demand Paging Copy-on-Write Page Replacement Allocation of Frames Thrashing Memory-Mapped Files Allocating
More informationIntroduction to HTCondor
Introduction to HTCondor Kenyi Hurtado June 17, 2016 1 Covered in this presentation What is HTCondor? How to run a job (and multiple ones) Monitoring your queue 2 What is HTCondor? A specialized workload
More informationDay 11: Workflows with DAGMan
Day 11: Workflows with DAGMan Suggested reading: Condor 7.7 Manual: http://www.cs.wisc.edu/condor/manual/v7.7/ Section 2.10: DAGMan Applications Chapter 9: condor_submit_dag 1 Turn In Homework 2 Homework
More informationChapter 2: System Structures. Operating System Concepts 9 th Edition
Chapter 2: System Structures Silberschatz, Galvin and Gagne 2013 Chapter 2: System Structures Operating System Services User Operating System Interface System Calls Types of System Calls System Programs
More informationOperating Systems. Computer Science & Information Technology (CS) Rank under AIR 100
GATE- 2016-17 Postal Correspondence 1 Operating Systems Computer Science & Information Technology (CS) 20 Rank under AIR 100 Postal Correspondence Examination Oriented Theory, Practice Set Key concepts,
More informationComputer Systems II. First Two Major Computer System Evolution Steps
Computer Systems II Introduction to Processes 1 First Two Major Computer System Evolution Steps Led to the idea of multiprogramming (multiple concurrent processes) 2 1 At First (1945 1955) In the beginning,
More informationChapter 8: Main Memory
Chapter 8: Main Memory Chapter 8: Memory Management Background Swapping Contiguous Memory Allocation Segmentation Paging Structure of the Page Table Example: The Intel 32 and 64-bit Architectures Example:
More informationProcess. Program Vs. process. During execution, the process may be in one of the following states
What is a process? What is process scheduling? What are the common operations on processes? How to conduct process-level communication? How to conduct client-server communication? Process is a program
More information2/26/2017. For instance, consider running Word Count across 20 splits
Based on the slides of prof. Pietro Michiardi Hadoop Internals https://github.com/michiard/disc-cloud-course/raw/master/hadoop/hadoop.pdf Job: execution of a MapReduce application across a data set Task:
More informationProcesses, PCB, Context Switch
THE HONG KONG POLYTECHNIC UNIVERSITY Department of Electronic and Information Engineering EIE 272 CAOS Operating Systems Part II Processes, PCB, Context Switch Instructor Dr. M. Sakalli enmsaka@eie.polyu.edu.hk
More informationProblem Set: Processes
Lecture Notes on Operating Systems Problem Set: Processes 1. Answer yes/no, and provide a brief explanation. (a) Can two processes be concurrently executing the same program executable? (b) Can two running
More informationDAGMan workflow. Kumaran Baskaran
DAGMan workflow Kumaran Baskaran NMRbox summer workshop June 26-29,2017 what is a workflow? Laboratory Publication Workflow management Softwares Workflow management Data Softwares Workflow management
More informationChapter 8: Memory-Management Strategies
Chapter 8: Memory-Management Strategies Chapter 8: Memory Management Strategies Background Swapping Contiguous Memory Allocation Segmentation Paging Structure of the Page Table Example: The Intel 32 and
More informationCS 471 Operating Systems. Yue Cheng. George Mason University Fall 2017
CS 471 Operating Systems Yue Cheng George Mason University Fall 2017 Outline o Process concept o Process creation o Process states and scheduling o Preemption and context switch o Inter-process communication
More informationCS420: Operating Systems. OS Services & System Calls
OS Services & System Calls James Moscola Department of Engineering & Computer Science York College of Pennsylvania Based on Operating System Concepts, 9th Edition by Silberschatz, Galvin, Gagne Operating
More informationHistory of SURAgrid Deployment
All Hands Meeting: May 20, 2013 History of SURAgrid Deployment Steve Johnson Texas A&M University Copyright 2013, Steve Johnson, All Rights Reserved. Original Deployment Each job would send entire R binary
More informationSystems Programming/ C and UNIX
Systems Programming/ C and UNIX Alice E. Fischer Lecture 6: Processes October 9, 2017 Alice E. FischerLecture 6: Processes Lecture 5: Processes... 1/26 October 9, 2017 1 / 26 Outline 1 Processes 2 Process
More informationBinghamton University. CS-220 Spring Sharing Resources. Computer Systems Chapter 8.2, 8.4
Sharing Resources Computer Systems Chapter 8.2, 8.4 Abstract View When I run my program, it has access to the entire computer, including the processor, memory, keyboard, display, disk drives, network connections,
More informationFour Components of a Computer System
Four Components of a Computer System Operating System Concepts Essentials 2nd Edition 1.1 Silberschatz, Galvin and Gagne 2013 Operating System Definition OS is a resource allocator Manages all resources
More informationAn introduction to checkpointing. for scientifc applications
damien.francois@uclouvain.be UCL/CISM An introduction to checkpointing for scientifc applications November 2016 CISM/CÉCI training session What is checkpointing? Without checkpointing: $./count 1 2 3^C
More informationBackground. Contiguous Memory Allocation
Operating System Lecture 8 2017.5.9 Chapter 8 (Main Memory) Background Swapping Contiguous Memory Allocation Segmentation - Paging Memory Management Selection of a memory-management method for a specific
More informationVEOS high level design. Revision 2.1 NEC
high level design Revision 2.1 NEC Table of contents About this document What is Components Process management Memory management System call Signal User mode DMA and communication register Feature list
More informationLi Yu. University of Notre Dame
Li Yu University of Notre Dame 1 Distributed systems are hard to use! An abstraction is a regular structure that can be efficiently scaled up to large problem sizes. We have implemented abstractions such
More informationChapter 2: Operating-System Structures. Operating System Concepts Essentials 8 th Edition
Chapter 2: Operating-System Structures Operating System Concepts Essentials 8 th Edition Silberschatz, Galvin and Gagne 2011 Chapter 2: Operating-System Structures Operating System Services User Operating
More informationProject Blackbird. U"lizing Condor and HTC to address archiving online courses at Clemson on a weekly basis. Sam Hoover
Project Blackbird U"lizing Condor and HTC to address archiving online courses at Clemson on a weekly basis Sam Hoover shoover@clemson.edu 1 Project Blackbird Blackboard at Clemson End of Semester archives
More informationRoadmap. Tevfik Ko!ar. CSC Operating Systems Fall Lecture - III Processes. Louisiana State University. Processes. September 1 st, 2009
CSC 4103 - Operating Systems Fall 2009 Lecture - III Processes Tevfik Ko!ar Louisiana State University September 1 st, 2009 1 Roadmap Processes Basic Concepts Process Creation Process Termination Context
More informationManagement of batch at CERN
Management of batch at CERN What is this talk about? LSF as a product basic commands user perspective basic commands admin perspective CERN installation Unix users/groups and LSF groups share management
More informationInterrupts, Fork, I/O Basics
Interrupts, Fork, I/O Basics 12 November 2017 Lecture 4 Slides adapted from John Kubiatowicz (UC Berkeley) 12 Nov 2017 SE 317: Operating Systems 1 Topics for Today Interrupts Native control of Process
More informationCS370 Operating Systems
CS370 Operating Systems Colorado State University Yashwant K Malaiya Spring 2018 Lecture 8 Threads and Scheduling Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 FAQ How many threads
More informationChapter 2: Operating-System
Chapter 2: Operating-System Structures Chapter 2: Operating-System Structures Operating System Services! User Operating System Interface! System Calls! Types of System Calls! System Programs! Operating
More informationCHAPTER 2: SYSTEM STRUCTURES. By I-Chen Lin Textbook: Operating System Concepts 9th Ed.
CHAPTER 2: SYSTEM STRUCTURES By I-Chen Lin Textbook: Operating System Concepts 9th Ed. Chapter 2: System Structures Operating System Services User Operating System Interface System Calls Types of System
More informationCondor-G: HTCondor for grid submission. Jaime Frey (UW-Madison), Jeff Dost (UCSD)
Condor-G: HTCondor for grid submission Jaime Frey (UW-Madison), Jeff Dost (UCSD) Acknowledgement These slides are heavily based on the presentation Jaime Frey gave at UCSD in Feb 2011 http://www.t2.ucsd.edu/twiki2/bin/view/main/glideinfactory1111
More informationThings you may not know about HTCondor. John (TJ) Knoeller Condor Week 2017
Things you may not know about HTCondor John (TJ) Knoeller Condor Week 2017 -limit not just for condor_history condor_q -limit Show no more than jobs. Ignored if Schedd is before 8.6 condor_status
More informationChapter 2: Operating-System Structures
Chapter 2: Operating-System Structures Chapter 2: Operating-System Structures Operating System Services User Operating System Interface System Calls Types of System Calls System Programs Operating System
More informationHIGH-THROUGHPUT COMPUTING AND YOUR RESEARCH
HIGH-THROUGHPUT COMPUTING AND YOUR RESEARCH Christina Koch, Research Computing Facilitator Center for High Throughput Computing STAT679, October 29, 2018 1 About Me I work for the Center for High Throughput
More informationChapter 8: Main Memory. Operating System Concepts 9 th Edition
Chapter 8: Main Memory Silberschatz, Galvin and Gagne 2013 Chapter 8: Memory Management Background Swapping Contiguous Memory Allocation Segmentation Paging Structure of the Page Table Example: The Intel
More informationQUESTION BANK UNIT I
QUESTION BANK Subject Name: Operating Systems UNIT I 1) Differentiate between tightly coupled systems and loosely coupled systems. 2) Define OS 3) What are the differences between Batch OS and Multiprogramming?
More informationNoorul Islam College Of Engineering, Kumaracoil MCA Degree Model Examination (October 2007) 5 th Semester MC1642 UNIX Internals 2 mark Questions
Noorul Islam College Of Engineering, Kumaracoil MCA Degree Model Examination (October 2007) 5 th Semester MC1642 UNIX Internals 2 mark Questions 1. What are the different parts of UNIX system? i. Programs
More informationChapter 2. Operating-System Structures
Chapter 2 Operating-System Structures 2.1 Chapter 2: Operating-System Structures Operating System Services User Operating System Interface System Calls Types of System Calls System Programs Operating System
More informationChapter 2: Operating-System Structures. Operating System Concepts 9 th Edition
Chapter 2: Operating-System Structures Silberschatz, Galvin and Gagne 2013 Chapter 2: Operating-System Structures Operating System Services User Operating System Interface System Calls Types of System
More informationChapter 8: Main Memory
Chapter 8: Main Memory Silberschatz, Galvin and Gagne 2013 Chapter 8: Memory Management Background Swapping Contiguous Memory Allocation Segmentation Paging Structure of the Page Table Example: The Intel
More informationECE 7650 Scalable and Secure Internet Services and Architecture ---- A Systems Perspective. Part I: Operating system overview: Memory Management
ECE 7650 Scalable and Secure Internet Services and Architecture ---- A Systems Perspective Part I: Operating system overview: Memory Management 1 Hardware background The role of primary memory Program
More informationUnix Processes. What is a Process?
Unix Processes Process -- program in execution shell spawns a process for each command and terminates it when the command completes Many processes all multiplexed to a single processor (or a small number
More informationRoadmap. Tevfik Ko!ar. CSC Operating Systems Spring Lecture - III Processes. Louisiana State University. Virtual Machines Processes
CSC 4103 - Operating Systems Spring 2008 Lecture - III Processes Tevfik Ko!ar Louisiana State University January 22 nd, 2008 1 Roadmap Virtual Machines Processes Basic Concepts Context Switching Process
More informationglideinwms UCSD Condor tunning by Igor Sfiligoi (UCSD) UCSD Jan 18th 2012 Condor Tunning 1
glideinwms Training @ UCSD Condor tunning by Igor Sfiligoi (UCSD) UCSD Jan 18th 2012 Condor Tunning 1 Regulating User Priorities UCSD Jan 18th 2012 Condor Tunning 2 User priorities By default, the Negotiator
More informationCPSC 341 OS & Networks. Introduction. Dr. Yingwu Zhu
CPSC 341 OS & Networks Introduction Dr. Yingwu Zhu What to learn? Concepts Processes, threads, multi-processing, multithreading, synchronization, deadlocks, CPU scheduling, networks, security Practice:
More informationCSE 153 Design of Operating Systems
CSE 153 Design of Operating Systems Winter 2018 Midterm Review Midterm in class on Monday Covers material through scheduling and deadlock Based upon lecture material and modules of the book indicated on
More informationITNPBD7 Cluster Computing Spring Using Condor
The aim of this practical is to work through the Condor examples demonstrated in the lectures and adapt them to alternative tasks. Before we start, you will need to map a network drive to \\wsv.cs.stir.ac.uk\datasets
More informationInteractive Scheduling
Interactive Scheduling 1 Two Level Scheduling Interactive systems commonly employ two-level scheduling CPU scheduler and Memory Scheduler Memory scheduler was covered in VM We will focus on CPU scheduling
More informationTwo Level Scheduling. Interactive Scheduling. Our Earlier Example. Round Robin Scheduling. Round Robin Schedule. Round Robin Schedule
Two Level Scheduling Interactive Scheduling Interactive systems commonly employ two-level scheduling CPU scheduler and Memory Scheduler Memory scheduler was covered in VM We will focus on CPU scheduling
More informationM. Roehrig, Sandia National Laboratories. Philipp Wieder, Research Centre Jülich Nov 2002
Category: INFORMATIONAL Grid Scheduling Dictionary WG (SD-WG) M. Roehrig, Sandia National Laboratories Wolfgang Ziegler, Fraunhofer-Institute for Algorithms and Scientific Computing Philipp Wieder, Research
More informationComp 310 Computer Systems and Organization
Comp 310 Computer Systems and Organization Lecture #9 Process Management (CPU Scheduling) 1 Prof. Joseph Vybihal Announcements Oct 16 Midterm exam (in class) In class review Oct 14 (½ class review) Ass#2
More informationLecture 2 - Fundamental Concepts
Lecture 2 - Fundamental Concepts Instructor : Bibhas Ghoshal (bibhas.ghoshal@iiita.ac.in) Autumn Semester, 2015 Bibhas Ghoshal IOSY 332C & IOPS 332C: OS Autumn Semester, 2015 1 / 43 Lecture Outline Operating
More information