16 Pages

ev-results

Course: CS 290, Fall 2009
School: UCSB
Rating:
 
 
 
 
 

Word Count: 11710

Document Preview

Programs Writing that Run EveryWare on the Computational Grid Rich Wolski, John Brevik, Graziano Obertelli, Neil Spring, and Alan Su A BSTRACT The Computational Grid [12] has been proposed for the implementation of high-performance applications using widely dispersed computational resources. The goal of a Computational Grid is to aggregate ensembles of shared, heterogeneous, and distributed resources...

Register Now

Unformatted Document Excerpt

Coursehero >> California >> UCSB >> CS 290

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Programs Writing that Run EveryWare on the Computational Grid Rich Wolski, John Brevik, Graziano Obertelli, Neil Spring, and Alan Su A BSTRACT The Computational Grid [12] has been proposed for the implementation of high-performance applications using widely dispersed computational resources. The goal of a Computational Grid is to aggregate ensembles of shared, heterogeneous, and distributed resources (potentially controlled by separate organizations) to provide computational power to an application program. In this paper, we provide a toolkit for the development of globally deployable Grid applications. The toolkit, called EveryWare, enables an application to draw computational power transparently from the Grid. It consists of a portable set of processes and libraries that can be incorporated into an application so that a wide variety of dynamically changing distributed infrastructures and resources can be used together to achieve supercomputer-like performance. We provide our experiences gained while building the EveryWare toolkit prototype and an its use in implementing a large-scale Grid application. Keywords: Computational Grid, EveryWare, Ramsey Number search, grid infrastructure, ubiquitous computing, distributed supercomputer I. I NTRODUCTION Increasingly, the high-performance computing community is blending parallel and distributed computing technologies to meet its performance needs. A new architecture, known as The Computational Grid [12], has recently been proposed which frames the software infrastructure required to implement high-performance applications using widely dispersed computational resources. The goal of a Computational Grid is to aggregate ensembles of shared, heterogeneous, and distributed resources, potentially controlled by separate organizations, to provide computational Supported by the National Partnership for Advanced Computational Infrastructure (NPACI), NSF grant ASC-9701333, Advanced Research Projects Agency/ITO under contract #N66001-97-C-8531. University of California, Santa Barbara rich@cs.ucsb.edu Holycross University brevik@math.holycross.edu University of Calfornia, San Diego graziano@cs.ucsd.edu University of Washington nspring@cs.washington.edu University of California, San Diego alsu@cs.ucsd.edu power to an application program. Applications should be able to draw compute cycles, network bandwidth, and storage capacity seamlessly from the Grid in a way analogous to the way in which household appliances draw electrical power from a power utility. The framers of the Computational Grid paradigm identify four qualitative criteria for the concept to be realized. According to [12] (page 18), a Computational Grid must deliver consistent, dependable, pervasive, and inexpensive cycles to the end user. In this paper, we outline ve quantitative requirements which, if met, fulll the qualitative criteria from [12]. We also describe EveryWare a toolkit for constructing Computational Grid programs and evaluate quantitatively how well an example EveryWare program fullls the Computational Grid vision. Our evaluation is based on ve quantitative metrics: 1. Execution Rate: measures the sustained computational performance of the entire application. Although not mentioned explicitly as a criterion, the Grid must be able to deliver efcient execution performance which we measure in terms of sustained execution rate. 2. Adaptivity: measures the difference between the performance variability exhibited by the underlying resources and the performance variability exhibited by the application itself. If program execution is stable, independent of uctuations in resource performance (i.e. the program adapts to varying performance conditions successfully) we suggest that the program is able to sustain consistent execution. 3. Robustness: measures the overall duration of continuous program execution in the presence of resource failures. A program that can continue to execute effectively in the presence of unpredictable resource failure is a dependable program. 4. Ubiquity: measures the the degree of heterogeneity a program can exploit in terms of the number of different resource types used by the application. If a program can execute using any and all available resources (both software and hardware) it is a pervasive program. 5. Expense: measures the cost of the resources necessary to implement the infrastructure. This metric maps directly to the the expense criterion described in [12]. We will capitalize the word Grid when referring to Computational Grid throughout this paper. 2 Therefore, a program that achieves a high execution rate, which is able to adapt to rapidly changing performance conditions, which is robust to resource failures, which can execute ubiquitously and which requires little added expense over a single-machine program possess all of the qualities described in [12] that a Grid program must possess. EveryWare is a software toolkit consisting of of three separate components: a portable lingua franca that is designed to allow processes using different infrastructures and operating systems to communicate, a set of performance forecasting libraries that enable an application to make short-term resource and application performance predictions in near-real time, and a distributed state exchange service that allows application components to manage and synchronize program state in a dynamic environment. The goal is to allow a user to write Grid programs that combine the best features of different Grid infrastructures such as Globus [11], Legion [19], Condor [36], or NetSolve [6] as well as the native functionality provided by Java [18], Windows NT [27], and Unix to the performance advantage of the application. EveryWare is implemented as a highly portable set of libraries and processes that can glue different locally available infrastructures together so that a program may draw upon these resources seamlessly. If sophisticated systems such as Globus, Legion, or Condor are available, the EveryWare program must be able to use the features provided by those systems effectively. If only basic operating system functionality is present, however, an EveryWare program should be able to extract what ever functionality it can, realizing that these resources may be less effective than those supporting better infrastructure. The ability to execute ubiquitously with respect to all of the resources accessible by the user is key to meeting the pervasiveness criterion. By leveraging the most performance-efcient infrastructure that is present on those resources, an EveryWare application can ensure the best possible execution performance and the greatest degree of robustness possible. Designed to be quickly and easily portable, EveryWare is intended to be the thinnest middleware layer capable of unifying heterogeneous resources with various software infrastructures to accomplish a computational task. In a Grid environment with several incompatible software infrastructure choices, it has been challenging to build a distributed application running everywhere, until EveryWare. We have implemented a prototype toolkit to test the efcacy of the EveryWare approach. In an experiment entered as a contestant in the High-Performance Computing Challenge [22] at SC98, we were able to use this prototype to leverage Globus, Legion, Condor, and NetSolve Grid computing infrastructures, the Java language and execution environment, native Windows NT, and native Unix systems simultaneously in a single, globally distributed application. The application, a program that searches for Ramsey Number counter-examples, does not perform an exhaustive search, but instead uses search heuristics such as simulated annealing to negotiate the enormous search space. Effectively implementing this approach requires careful dynamic scheduling to avoid substantial communicati...
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

UCSB - CS - 290
Common Software ServicesThe Globus Projecthttp:/www.globus.org/Argonne National Laboratory USC Information Sciences InstututeCommon ServicesqPortability Aids: Assist in writing portable Makefiles, shell scripts, and programs Collection of f
UCSB - CS - 290
3X3 384.0188 39.4383 78.3099 79.8440 91.1647 19.7551 33.5223 76.8230 27.7775 Y3 355.3970 47.7397 62.8871 36.4784 51.3401 95.2230 91.6195 63.5712 71.7297 Z3 314.1603 60.6969 1.6301 24.2887 13.7232 80.4177 15.6679 40.0944 12.9790
UCSB - CS - 290
16Ma200 20033.2010311846719 66.8238386602269 82.7312285118875 62.6147685895326 70.2538143040403 79.1368548976592 38.0488028420896 20.1647141058025 91.585038252234 64.8495586415038 5.37512756580263 13.331378599603 70.1403558749906 92.074184290847 2
Georgia Tech - PHYSICS - 4267
EXERCISES Exercise 11.6185Unimodal map symbolic dynamics. Show that the tent map point (S + ) with future itinerary S + is given by converting the sequence of sn s into a binary number by the algorithm (11.11). This follows by inspection from the
Georgia Tech - ECE - 8833
Current Biology, Vol. 14, 257262, February 3, 2004, 2004 Elsevier Science Ltd. All rights reserved. DOI 10.1016/j.cub.2004.01.029The Ventriloquist Effect Results from Near-Optimal Bimodal IntegrationDavid Alais1,2 and David Burr1,3,* 1 Istituto di
Georgia Tech - ECE - 8833
Exp Brain Res (2007) 179:595606 DOI 10.1007/s00221-006-0814-yR E S E A R C H A RT I C L EOptimal integration of shape information from vision and touchHannah B. Helbig Marc O. ErnstReceived: 29 September 2006 / Accepted: 21 November 2006 / Pu
Georgia Tech - ECE - 8833
ARTICLES 2006 Nature Publishing Group http:/www.nature.com/natureneuroscienceBayesian inference with probabilistic population codesWei Ji Ma1,3, Jeffrey M Beck1,3, Peter E Latham2 & Alexandre Pouget1Recent psychophysical experiments indicate th
Georgia Tech - PHYSICS - 4267
Chapter 11Qualitative dynamics, for pedestriansThe classication of the constituents of a chaos, nothing less is here essayed. Herman Melville, Moby Dick, chapter 32In this chapter we begin to learn how to use qualitative properties of a ow in or
Georgia Tech - CS - 3510
CS 3510: Design and Analysis of AlgorithmsProblem Set 1 Due May 31, 2007Problem 1Consider the following variant of Merge Sort: Divide the input sequence into 3 subsequences (instead of 2 subsequences) of equal length, sort the 3 subsequences recu
Georgia Tech - CS - 4496
Modifying Motion DataReadingsBodenheimer, B., Rose, C., Rosenthal, S., and Pella, J., `The Process of Motion Capture: Dealing with the Data', Computer Animation and Simulation '97, [PDF] Gleicher. "Motion Path Editing". Proceedings Witkin , Popovi
Georgia Tech - CS - 8803
CS8803D Course Reading SummariesPaper #: 111Title: Generating Representative Web Workloads for Network and Server Performance Evaluation(1) ProblemsGenerating server workloads is a useful tool that can assist management andcapacity planning
Georgia Tech - CS - 4235
CS4235 Website Documentation Final Project 04/11/2006 Internet Security Team 3 (Cross-Site Scripting) Shannon Quinn Laura Rouse Mike Sanders Documentation for XSS For Techies XSS For Techies is an informative website designed to help both users and d
UCSB - ECON - 150
UCSB - ECON - 100
Internet Job Search and Unemployment DurationsPeter KuhnUniversity of California, Santa Barbara and IZA BonnMikal SkuterudStatistics Canada, OttawaDiscussion Paper No. 613 October 2002IZA P.O. Box 7240 D-53072 Bonn Germany Tel.: +49-228-3894
UCSB - ECON - 150
University of California, Santa Barbara Department of Economics Economics 150A Labor Economics Course Overview and Objectives:Olivier Deschnes Winter 2008This is the first of two courses in undergraduate labor economics at UC Santa Barbara. The c
UCSB - ECON - 245
University of California, Santa Barbara Department of Economics Economics 245C/250B Applied Econometrics Course Overview and Objectives:Olivier Deschnes Spring 2009This course in applied econometrics is part of the econometrics and labor economic
UCSB - ECON - 150
UCSB - ANTH - 151
Review: Learning Not simple association based on temporal contiguity: Background rate (causation) Food avoidance learning (tastenausea) Shift vs. stay learning in hummingbirds Food vs. water in Tmaze Starcompass learning in birds Vector summing in d
UCSB - ANTH - 151
[review] Facultative adaptations (e.g., sun tanning, mate guarding): track environmental variation and adjust phenotype to maximize fitness prospects. HeritabilityNorm of reaction: Evolved pattern of response to environment. Different from sus
UCSB - ANTH - 151
Evolutionary Psychology (EP) The evolutionary biology of mind, brain and behavior. Synthesis of: evolutionary biology biological anthropology psychology
UCSB - ANTH - 151
Molecular Genetics Goals: 1.Understand the structure of genes. 2.Understand how this structure allows them to make precise copies. 3.Understand how this structure allows them to shape phenotypes.Gene structure Three elements: 1.Phosphates (invarian
UCSB - CS - 170
1. Putting your code in a dir. that is the same as your login (5 points)2. Proper locking and unlocking rooms when moving (10 points)3. Thread do not unlock other thread's locks (10 points)4. Using Conditional Variable properly (15 points)5. Thre
UCSB - CS - 130
CS130 A: Data S tructure and Algorithm s sFocus of thecourse : Data structure and re s late algorithm d s C orre ss and (tim and space com xity ctne e ) ple s Pre quisite re s C 20: stacks, que s, lists, binary se S ue arch tre s, . e C 40: func
UCSB - CS - 170
GDB Quick ReferenceTo start debugging an executable foo 1) You need to tell the compiler first that you are planning to debug the executable. bash-$ gcc g foo.c o foo 2) Start the debugger bash-$ gdb foo GDB commands Breakpoints To set breakpoints i
UCSB - CS - 130
HASHING: A great practical tool, with interesting & subtle theory too.Basic setting: We have a set of items we want to store for efficient lookup.Two versions: - STATIC: Given a set S of items, store them for effficient lookup. - DYNAMIC: Th
UCSB - CS - 130
GRAPHS.1. Graphs are useful models for reasoning about relations among objects and combinatorial problems. Many real-life problems can be solved by converting them to graphs. Proper application of graph theory ideas can drastically reduc
UCSB - CS - 130
B-Trees.[Cormen-Leiserson-Rivest]1. Search trees designed to minimize IO operations to secondary memory. When database is too large to fit in main memory, some parts will be stored in disk. A single access to disk can be 10^3 to 10^5 times
UCSB - CS - 170
New elevator 0 starting on floor 1Forking elevator 0Forking person 0 (Phil Fulmer)Forking person 1 (Pat Summitt)0 Phil Fulmer: Sleeping for 14 seconds0 Pat Summitt: Sleeping for 3 seconds3 Pat Summitt: On floor 1. Want to get to floor 94 Elev
UCSB - CS - 263
Ruby under Scanner: Comparison with JavaSudipto Das, Vinod Kone sudipto@cs, vinod@cs University of California, Santa Barbara ABSTRACTIn this paper we aim to compare the Ruby programming language with one the most popular Object Oriented Programming
UCSB - ECE - 224
Lecture 3 Mixed Signal TestingDC and Parametric Test Continuity Testing Detect onchip ESD devices Validate Connection of Device to Tester Eliminate DC Package Bridging Faults 0.11.0mA current (over voltage) Parallel testing to speed pr
UCSB - ECE - 124
UCSB - ECE - 224
UCSB - ECE - 224
Errata: Answers to Exercises/Problems An Introduction To Mixed-Signal IC Test and Measurement, Burns/Roberts, Oxford University Press. Updated March 27, 2003Chapter 1Solution set at back of book had an extra answer that did not belong there. Probl
UCSB - ECE - 224
Introduction to mixed-signal testing using the IEEE P1149.4 standard7. Introduction to mixed-signal testing using the IEEE P1149.4 standardIt was already mentioned in previous chapters that the IEEE 1149.1 standard (BST) was developed with the spe
UCSB - ECE - 224
TECHNICAL INFORMA TIONDECOUPLING: BASICSby Arch Martin AVX Corporation Myrtle Beach, S.C.Abstract:This paper discusses the characteristics of multilayer ceramic capacitors in decoupling applications and compares their performance with other type
UCSB - ECE - 224
TECHNICAL INFORMATIONIntroduction to Choosing MLC Capacitors For Bypass/Decoupling ApplicationsYun Chase AVX Corporation 801 17th Avenue South Myrtle Beach, SC 29577Abstract:Methods to ensure signal integrity using decoupling capacitors have bee
UCSB - ECE - 124
ECE 124ALab #3Fall, 2002Lab #3 Latch, Flip-Flop, and PrescalerObjectiveBuild a latch and a master-slave D-type ip-op. Then design and build a high speed divide-by-ve prescaler with the DFF you made.Design guidelines For any measureme
UCSB - ECE - 124
ECE 124AFall, 2002Lab #1Introduction to MAX and HSPICEObjectiveTo learn how to lay out VLSI circuits by using MAX, and simulate the circuits using HSPICE. Students are required to build a ring oscillator circuit and simulate it.Environment S
UCSB - ECE - 124
ECE 124ALab #2Fall, 2002Lab #2 4X4 Unsigned Array MultiplierObjective Use SUE to design and optimize a 4x4 unsigned array multiplier and convert the design into MAX layout by using MAX Layout Generator. Then simulate the layout by using HSpice
UCSB - ECE - 124
tsmc025.txtMon Oct 08 18:02:24 20011MOSIS PARAMETRIC TEST RESULTS RUN: T17B TECHNOLOGY: SCN025 VENDOR: TSMC FEATURE SIZE: 0.25 micronsINTRODUCTION: This report contains the lot average results obtained by MOSIS from measurements of MOSIS test
UCSB - ECE - 124
ECE124aUniversity of California, Santa Barbara Department of Electrical and Computer Engineering Fall 2002Class Room: Labs: Brda 2019B Monday 6:00-8:50 Friday 12:00-3:00 Instructor: Ofce Hours: TA: Tu-Th 3:30-4:45 Engr1 ECI (TBA) Engr1 ECI (TBA)F
UCSB - ECE - 253
ECE 253 Embedded System DesignF. Brewer (9/2008)I.Overview of Embedded SystemsA. B. C. Constraints in Hardware and Software Design Functionality Constraints and Reliability/Robust Design Configurable Systems: Hardware, Stiffware, Firmware, Soft
UCSB - ECE - 124
UCSB - ECE - 224
textTue Apr 13 10:00:29 20041Im looking into using www.sierraprotoexpress.com. Theyre inexpensive, $51 per board for 4 layer up to 85 square inches. Same price for all sizes up to 85. Boards must conform to their rules: 2 boards minimum order,
UCSB - ECE - 124
UCSB - ECE - 224
Lecture 4 SamplingOverview of Sampling Theory Sampling Continuous Signals Sample Period is T, Frequency is 1/T x[n] = xa(n) = x(t)|t=nT Samples of x(t) from an infinite discrete sequence Continuoustime SamplingDelta function (
UCSB - ECE - 181
Thursday, May 27, 2004A System for Largescale, Contentbased Web Image Retrieval and the Semantics withinTill QuackThursday, May 27, 2004Task Create a content-based image retrieval system for the WWW Large-scale, one order of magnitude lar
UCSB - ECE - 002
DISCRETE SEMICONDUCTORSDATA SHEETM3D1761N4148; 1N4448 High-speed diodesProduct specification Supersedes data of 2002 Jan 23 2004 Aug 10Philips SemiconductorsProduct specificationHigh-speed diodesFEATURES Hermetically sealed leaded glas
UCSB - ECE - 594
910IEEE TRANSACTIONS ON MICROWAVE THEORY AND TECHNIQUES, VOL. 50, NO. 3, MARCH 2002Terahertz TechnologyPeter H. Siegel, Fellow, IEEEInvited PaperAbstractTerahertz technology applications, sensors, and sources are briefly reviewed. Emphasis is
UCSB - ECE - 002
ECE2A Fall 2008 Lab #11Basic Measurements / Resistive CircuitsObjective: To learn to use two basic lab tools - the Digital Multimeter (DMM) and the DC power supply and to use these tools to evaluate resistive circuits. Background Information Bre
UCSB - ECE - 125
AvanWaves ManualRelease 2001.2 June 2001AvanWaves Manual, Release 2001.2 Copyright 2001Avant! Corporation and Avant! subsidiary. All rights reserved. Unpublished-rights reserved under the copyright laws of the United States. Use of copyright not
UCSB - ECE - 220
Pre-deposition and Drive-in Diffusion Profiles: Solutions to Ficks 2nd LawErfc (complementary error function) infinite source Gaussian: finite sourceForming an electronic junction in a semiconductorDiffusionPre-deposition does NOT mean that the
UCSB - ECE - 146
ECE 146A: Analog Communication Theory and Techniques Lab 4: Angle Modulation and DemodulationLab Report Due: 5:00 p.m., Tuesday, February 26, 2008 (Place in the ECE 146A Homework Box on the 3rd Floor of Harold Frank Hall or Bring to Class)1Objec
UCSB - ECE - 228
Lecture 2- Photon Statistics and Basics of Propagation in Dielectric MediaECE 228A Fall 2007Daniel J. Blumenthal2.1 PhotodetectionECE 228A Fall 2007Daniel J. Blumenthal2.2 Detection of Optical Signals Thermal: Temperature change with ph
UCSB - ECE - 194
Problem Set 2Prof. Luke Theogarajan ECE 194A/594A Department of Electrical & Computer Engineering, University of California, Santa Barbara Due October 24, 2008Problem 1Figure 1: Figure for Problem 1 The circuit in gure 1 is called the regulated
UCSB - ECE - 162
ECE 162A Mat 162A Lecture #2: W lik Properties of Lt #2 Wavelike P ti f Matter Read Chapter 3 of Eisberg,ResnickJohn Bowers Bowers@ece.ucsb.eduBowers ECE/Mat 162A What is the classical theory of light?Bowers ECE/Mat 162AMaxwells Equations!D
UCSB - ECE - 215
ECE215A/MAT206A, Winter 2009 E.R. Brown HW 4 Solutions 1. Monotomic linear lattice, mass m, spacing a, nearest neighbor interaction (spring constant) C. a) Consider longitudinal wave: rs u s = u cos ( t ska ) . The total energy of the wave is the s
UCSB - ECE - 594
Notes #6, ECE594I, Fall 2008, E.R. BrownGaussian-beam methodology A key assumption behind the predictions given from scalar diffraction theory is that the illumination across the aperture is uniform. This is a good assumption in some circumstances
UCSB - ECE - 594
ECE594I, Prof. Brown, Fall 2008 Solutions#6 1. Comparison of radar and radiometry. (a) For the double-sideband receiver at 650 GHz, the antenna gain G = 50 dB = 105 16/2 , or = 0.0127 rad = 0.7 deg. The angle subtended by 1-ft-wide body at 30 ft is
UCSB - ECE - 220
ECE 220A/MAT 215A Lab Procedures for Diffusion Doping Phosphorous Predeposition Source Treatment in the phosphorous diffusion furnace You will be using the PDS (planar diffusion source) n-type solid sources. The sources may be used at a variety of fu
UCSB - ECE - 124
Name: Solutions Perm No. _ECE 124AFall 2008UNIVERSITY OF CALIFORNIA, SANTA BARBARADepartment of Electrical and Computer EngineeringMIDTERM EXAMINATION-ECE124ARoom: ESB-Cooper Lab, November 7, 4:10-6:10 PMREAD CAREFULLY: This is a CLOSED BOO