GUI & Optimizer for the Virtual Pipeline Simulation Testbed Walamitien Oyenan November 10, 2003 MSE Presentation (Phase 2)

Slides:



Advertisements
Similar presentations
Algorithm Design Methods (I) Fall 2003 CSE, POSTECH.
Advertisements

U of Houston – Clear Lake
Gao Song 2010/04/27. Outline Concepts Problem definition Non-error Case Edge-error Case Disconnected Components Simulated Data Future Work.
Online Hotel Reservation System
Distributed Computations
Graph Algorithms: Minimum Spanning Tree We are given a weighted, undirected graph G = (V, E), with weight function w:
White Box Testing and Symbolic Execution Written by Michael Beder.
Key-Key-Value Stores for Efficiently Processing Graph Data in the Cloud Alexander G. Connor Panos K. Chrysanthis Alexandros Labrinidis Advanced Data Management.
Application architectures
Optimal binary search trees
Relations and Functions
1 ES 314 Advanced Programming Lec 2 Sept 3 Goals: Complete the discussion of problem Review of C++ Object-oriented design Arrays and pointers.
ECE669 L10: Graph Applications March 2, 2004 ECE 669 Parallel Computer Architecture Lecture 10 Graph Applications.
REAL TIME GPS TRACKING SYSTEM MSE PROJECT PHASE 2 PRESENTATION Bakor Kamal CIS 895.
BRUE Behavioral Reverse Engineering in UML as Eclipse Plugin MSE Presentation 1 Sri Raguraman.
Chapter 3 Operating Systems Introduction to CS 1 st Semester, 2015 Sanghyun Park.
Bogor-Java Environment for Eclipse MSE Presentation II Yong Peng.
CIS 895 – MSE Project KDD-Research Entity Search Tool (KREST) Presentation 2 Eric Davis
Network Aware Resource Allocation in Distributed Clouds.
NOVA: CONTINUOUS PIG/HADOOP WORKFLOWS. storage & processing scalable file system e.g. HDFS distributed sorting & hashing e.g. Map-Reduce dataflow programming.
Addressing design Goals  We decompose the system to address complexity  Assigning each subsystem to team to work on  But we also need to address system.
4/16/2004MSE Presentation II1 ESTMD System -- A Web-based EST Model Database System Yinghua Dong.
Introduction to Job Shop Scheduling Problem Qianjun Xu Oct. 30, 2001.
GUI For A Virtual Pipeline Simulation Testbed By, Revathi Manni Ranganathan Major Professor: Dr.Virgil Wallentine.
MSE Presentation 2 Lakshmikanth Ganti
Student Curriculum Planning System MSE Project Presentation I Kevin Sung.
REAL TIME GPS TRACKING SYSTEM MSE PROJECT PHASE I PRESENTATION Bakor Kamal CIS 895.
Student Curriculum Planning System MSE Project Presentation III Kevin Sung.
Spring 2007Graphs1 ORD DFW SFO LAX
Self-assembling Agent System Presentation 1 Donald Lee.
Background Nowadays, different software systems developed in- house are growing; companies or organization is facing problems of new collaborations and.
Semantic Wordfication of Document Collections Presenter: Yingyu Wu.
Apache JMeter By Lamiya Qasim. Apache JMeter Tool for load test functional behavior and measure performance. Questions: Does JMeter offers support for.
Graphical User Interface and Job Distribution Optimizer for a Virtual Pipeline Simulation Testbed Walamitien Oyenan October 8, 2003 MSE Presentation 1.
Computer Science: A Structured Programming Approach Using C Graphs A graph is a collection of nodes, called vertices, and a collection of segments,
CIS 895 – MSE Project KDD-Research Entity Search Tool (KREST) Presentation 3 Eric Davis
Natural Language to Machine Readable Format By: Damian Tamayo Presentation 2 – Nov. 13, 2009 CIS 895 – MSE Project.
The Structure of the Web. Getting to knowing the Web How big is the web and how do you measure it? How many people use the web? How many use search engines?
Performance Study of Message Passing in an Event Service: Java RMI vs. TCP Sockets Laxminarayan Muktinutalapati (Lux) Department of Computing and Information.
A * Search A* (pronounced "A star") is a best first, graph search algorithm that finds the least-cost path from a given initial node to one goal node out.
Design and Planning Or: What’s the next thing we should do for our project?
Graphs A graphs is an abstract representation of a set of objects, called vertices or nodes, where some pairs of the objects are connected by links, called.
Communication Model for Cooperative Robotics Simulator MSE Presentation 1 Acharaporn Pattaravanichanon.
Graphical Interface for Organizations in IPDS Presentation 3 Donald lee.
Tree - in “math speak” An ________ graph is a set of vertices/nodes and a set of edges, each edge connects two vertices. Any undirected graph in which.
Bogor-Java Environment for Eclipse MSE Presentation III Yong Peng.
Graphical editor for the Metropolis meta-model Jiagen Ding and Hongjing Zou Fall 2001.
Diagram Recognition  Tuan Van  Tony Vigil  Jack Herbert  Beau Crawford.
Requirements Analysis Review Modeling Team Matt Weyant 26 Oct 1999.
CSE 326: Data Structures Lecture #17 Heuristic Graph Search Henry Kautz Winter Quarter 2002.
Code: BCA302 Data Structures with C Prof. (Dr.) Monalisa Banerjee By.
Graphs – Breadth First Search
CSE 214 – Computer Science II Maps
Abstract Major Cloud computing companies have started to integrate frameworks for parallel data processing in their product portfolio, making it easy for.
CHAPTER 3 Architectures for Distributed Systems
Discrete Math 2 Weighted Graph Search Tree
Relations and Functions Pages
Relations vs. Functions Function Notation, & Evaluation
Lecture 13 CSE 331 Oct 1, 2012.
Graph Theory By Amy C. and John M..
Unit 3 Review.
Partner Whiteboard Review.
Graph the function, not by plotting points, but by starting with the graph of the standard functions {image} given in figure, and then applying the appropriate.
Lecture 12 CSE 331 Sep 26, 2011.
Lecture 12 CSE 331 Sep 22, 2014.
Graphs & Trees.
Graphing Quadratic Functions in Vertex form
Find the derivative of the following function:   {image} .
Lecture 15 CSE 331 Oct 4, 2010.
Review #1 Intro stuff What is a database, 4 parts, 3 users, etc.
Presentation transcript:

GUI & Optimizer for the Virtual Pipeline Simulation Testbed Walamitien Oyenan November 10, 2003 MSE Presentation (Phase 2)

Presentation Outline Updated Document Updated Document Sequence Diagram Sequence Diagram JGraph Design JGraph Design GUI Design GUI Design Optimizer Design Optimizer Design Other Documents Other Documents Demonstration Demonstration

Updated Document Software Requirement Specification: Software Requirement Specification: Web Start Web Start Checkpoint Checkpoint Replay Replay Directed Graph Directed Graph Cost Estimation Cost Estimation

Sequence Diagram Sequence Diagram Sequence Diagram

JGraph Design JGraph is a modification of JTree's source code. JGraph is a modification of JTree's source code. Trees are mostly used to display data structures Trees are mostly used to display data structures JGraph is typically used to modify a graph, and handle these modifications in an application-dependent way. JGraph is typically used to modify a graph, and handle these modifications in an application-dependent way.

JGraph Design - Model The model provides the data for the graph, consisting of the cells, which may be vertices, edges or ports, and the connectivity information. The model provides the data for the graph, consisting of the cells, which may be vertices, edges or ports, and the connectivity information.

JGraph Design - View JGraph's view just contains information about how to render components. JGraph's view just contains information about how to render components. The graph view also has a reference to a hash table, which is used to provide a mapping from cells to cell views. The graph view also has a reference to a hash table, which is used to provide a mapping from cells to cell views.

JGraph Design - Control The control defines the mapping from user events to methods of the graph. The control defines the mapping from user events to methods of the graph. The events dispatched by the model may be categorized into: The events dispatched by the model may be categorized into: Change notification Change notification History support History support

GUI - Design Most of the classes of the Pipeline Editor extend the classes of JGraph. Most of the classes of the Pipeline Editor extend the classes of JGraph. Class Diagram Class Diagram Class Diagram Class Diagram

Optimizer Design For each job j : For each job j : computation time Wj computation time Wj communication time Cj communication time Cj The objective is to minimize the load on the machines. The objective is to minimize the load on the machines.

Optimizer Design – cont. Depth-First Branch and Bound At each node, we minimize a cost function for the busiest machine. At each node, we minimize a cost function for the busiest machine. A vertex in the tree represents a partial/complete allocation of jobs on machines. A vertex in the tree represents a partial/complete allocation of jobs on machines. The root of the search tree is the empty allocation. The root of the search tree is the empty allocation. A vertex at level k in the tree represents an assignment of jobs {J1,…,Jk}. A vertex at level k in the tree represents an assignment of jobs {J1,…,Jk}.

Optimizer Design – cont. Cost function f(x) = g(x) + h(x) ; f(x) = g(x) + h(x) ; g(x) : actual cost for the current allocation. g(x) : actual cost for the current allocation. h(x) : load contribution on the busiest machine of the next job to be allocated. h(x) : load contribution on the busiest machine of the next job to be allocated. g(x) = ∑(Wj+Cj) for all j allocated to the busiest machine. g(x) = ∑(Wj+Cj) for all j allocated to the busiest machine. h(x) = min(Wi, Ci), i = next job to be allocated. h(x) = min(Wi, Ci), i = next job to be allocated.

Optimizer Design – cont.

Class Diagram Class Diagram Class Diagram Class Diagram

Other documents Formal Requirement Specification Formal Requirement Specification Spin Spin Test Plan Test Plan Formal Technical Inspection Formal Technical Inspection

Demonstration Demonstration of the GUI prototype Demonstration of the GUI prototype

THE END. Questions Questions Comments Comments Suggestions Suggestions