1 Work Package 2 Identification and Formalization of Knowledge  “(The report proposes) a generic technique for defining programming model specific abstractions.

Slides:



Advertisements
Similar presentations
Visual Formalisms Message Sequence Charts Book: Chapter 10.
Advertisements

PROGRAMMING LANGUAGE (JAVA) UNIT 42 BY ROBERT BUTTERFIELD TELEPHONE Data Structures and Algorithms.
purpose Search : automation methods for device driver development in IP-based embedded systems in order to achieve high reliability, productivity, reusability.
Stack & Queues COP 3502.
Building a Better Backtrace: Techniques for Postmortem Program Analysis Ben Liblit & Alex Aiken.
Lecture 10: Heap Management CS 540 GMU Spring 2009.
An Introduction to Java Programming and Object- Oriented Application Development Chapter 8 Exceptions and Assertions.
Template, Command, Iterator and Composite CSE 111 5/9/20151Copyright W. Howden.
Chapter 12: Expert Systems Design Examples
Object-Oriented Analysis and Design
© 2006 Pearson Addison-Wesley. All rights reserved7A-1 Chapter 7 Stacks.
© Copyright Eliyahu Brutman Exceptions. © Copyright Eliyahu Brutman Exceptions and Design Patterns - 2 Introduction to Exception Handling Definition:
Use Cases Chapter 4. After Scenarios Find all the use cases in the scenario that specifies all possible instances of how to report a fire –Ex: “Report.
Automatically Extracting and Verifying Design Patterns in Java Code James Norris Ruchika Agrawal Computer Science Department Stanford University {jcn,
Presenter: PCLee Design Automation Conference, ASP-DAC '07. Asia and South Pacific.
1 Process Description and Control Chapter 3 = Why process? = What is a process? = How to represent processes? = How to control processes?
Final Year Project LYU0301 Location-Based Services Using GSM Cell Information over Symbian OS Mok Ming Fai CEG Lee Kwok Chau CEG.
Chapter 2: Algorithm Discovery and Design
C++ fundamentals.
Intrusion and Anomaly Detection in Network Traffic Streams: Checking and Machine Learning Approaches ONR MURI area: High Confidence Real-Time Misuse and.
Katanosh Morovat.   This concept is a formal approach for identifying the rules that encapsulate the structure, constraint, and control of the operation.
1 Chapter Eight Exception Handling. 2 Objectives Learn about exceptions and the Exception class How to purposely generate a SystemException Learn about.
© 2006 Pearson Addison-Wesley. All rights reserved7A-1 Chapter 7 Stacks.
Introduction to Data Structures. Definition Data structure is representation of the logical relationship existing between individual elements of data.
Chapter 8 Data Abstractions Introduction to CS 1 st Semester, 2015 Sanghyun Park.
Stacks and Queues Introduction to Computing Science and Programming I.
Chapter 41 Processes Chapter 4. 2 Processes  Multiprogramming operating systems are built around the concept of process (also called task).  A process.
CY2003 Computer Systems Lecture 7 Petri net. © LJMU, 2004CY2003- Week 72 Overview Petri net –concepts –Petri net representation –Firing a transition –Marks.
Microsoft Office Outlook 2013 Microsoft Office Outlook 2013 Courseware # 3252 Lesson 6: Organizing Information.
9-1 Abstract Data Types Abstract data type A data type whose properties (data and operations) are specified independently of any particular implementation.
CS 153: Concepts of Compiler Design October 5 Class Meeting Department of Computer Science San Jose State University Fall 2015 Instructor: Ron Mak
Lexi case study (Part 2) Presentation by Matt Deckard.
DATA STRUCTURE & ALGORITHMS (BCS 1223) NURUL HASLINDA NGAH SEMESTER /2014.
Chapter 1 Object Oriented Programming. OOP revolves around the concept of an objects. Objects are created using the class definition. Programming techniques.
Chapter 8 Object Design Reuse and Patterns. Object Design Object design is the process of adding details to the requirements analysis and making implementation.
OBJECT-ORIENTED PROGRAMMING (OOP) WITH C++ Instructor: Dr. Hany H. Ammar Dept. of Electrical and Computer Engineering, WVU.
CS 153: Concepts of Compiler Design September 16 Class Meeting Department of Computer Science San Jose State University Fall 2015 Instructor: Ron Mak
02/04/2008 A Concrete Syntax for UML 2.1 Action Semantics Using +CAL 13th IEEE International Conference on Engineering of Complex Computer Systems – ICECCS.
Stacks The content for these slides was originally created by Gerard Harrison. Ported to C# by Mike Panitz.
1 UML Modeling of Spacecraft Onboard Instruments Takahiro Yamada, JAXA/ISAS April 2005.
Software Engineering Laboratory, Department of Computer Science, Graduate School of Information Science and Technology, Osaka University 1 Extracting Sequence.
1. 2 Purpose of This Presentation ◆ To explain how spacecraft can be virtualized by using a standard modeling method; ◆ To introduce the basic concept.
User Interface Generation From The Data Schema Akhilesh Bajaj Jason Knight University of Tulsa May 13, 2007 Sixth AIS SIGSAND Symposium, Tulsa, OK.
Relational Operator Evaluation. overview Projection Two steps –Remove unwanted attributes –Eliminate any duplicate tuples The expensive part is removing.
Lecture10 Exception Handling Jaeki Song. Introduction Categories of errors –Compilation error The rules of language have not been followed –Runtime error.
AUTOMATIC GENERATION OF MODEL TRAVERSALS FROM METAMODEL DEFINITIONS Authors: Tomaž Lukman, Marjan Mernik, Zekai Demirezen, Barrett Bryant, Jeff Gray ACM.
Presented by Jack Dongarra University of Tennessee and Oak Ridge National Laboratory KOJAK and SCALASCA.
Introduction to UML and Rational Rose UML - Unified Modeling Language Rational Rose 98 - a GUI tool to systematically develop software through the following.
Profiling: What is it? Notes and reflections on profiling and how it could be used in process mining.
ISBN Chapter 12 Support for Object-Oriented Programming.
Model Checking Early Requirements Specifications in Tropos Presented by Chin-Yi Tsai.
Profiling: What is it? Notes and reflections on profiling and how it could be used in process mining.
Chapter 6 A Stacks. © 2004 Pearson Addison-Wesley. All rights reserved6 A-2 The Abstract Data Type: Developing an ADT During the Design of a Solution.
Design issues for Object-Oriented Languages
Chapter 0: Introduction
Data Abstraction & Problem Solving with C++
Set Collection A Bag is a general collection class that implements the Collection interface. A Set is a collection that resembles a Bag with the provision.
Stacks The content for these slides was originally created by Gerard Harrison. Ported to C# by Mike Panitz.
The Movement To Objects
Chapter 14: System Protection
Chapter 15 Lists Objectives
CS 1114: Implementing Search
CS 153: Concepts of Compiler Design October 5 Class Meeting
Data Structures Interview / VIVA Questions and Answers
Chapter 6: Design of Expert Systems
Chapter 7 Stack.
Introduction to Data Structures
Process Description and Control
How to Create a Microsoft Access 2007 Database
CMPE 152: Compiler Design September 17 Class Meeting
Presentation transcript:

1 Work Package 2 Identification and Formalization of Knowledge  “(The report proposes) a generic technique for defining programming model specific abstractions allowing a simple description of compound runtime events in the context of that programming model.” a technique for detecting the existence of behaviors that lead to reduced performance  General Idea: A Compound Runtime Event (CRE) is built from primitive events (trace file entries) such as those associated with entering a program region or seinding a message. A CRE can also be regarded as an event pattern that can be found by applying pattern matching algorithms  For these methods to work it is necessary for trace files to include timestamp and location of execution AND some information regarding what state the program is in. Ex. Send and Recv pair messages, Enter and Exit pair for region

2 Primitive Event Objects  Class “Event” is defined, and subclasses of events inherit from it  Events have data fields and pointers All object of class “Event” have a “enterptr” which points back to the “Enter” “Receive” objects also have a “sendptr”  Define two state functions to represent state of execution R(l) l=location and M(s,d) s=sender d=receiver.  R(l) represents the region stack  M(s, d) represents the message queue At each event the two the state of the functions is updated according to transition rules.  send, and enter add new messages to the message queue, and regions to the region stack  recv, and exit remove messages from the queue, and pop region from region stack  Using these functions one can define pattern (CRE) to check for at event as the trace is traversed

3 Compound Runtime Events A Compound Runtime Event is then specified in terms of “partitions” of events (root, send_msg,enter_send, enter_send) using a simple search algorithm  Ex. Late Sender

4 Compound Runtime Events It is possible to extend this concept to the APART Specification Language. ASL data model  Mainly concentrates on profiling data, i.e. summary information Examples are given. This approach is based on EARL trace analysis language.  EXPERT tool is based on top of EARL EXPERT is a part of KOJAK, to be evaluated later this semester Trace examination speedup may be gained by automating the process, and specifying significant CREs before the process begins.