General Information & Proc.c General Information & Proc.c Juan Luis Pardo González Javier Lara Valtueña.

Slides:



Advertisements
Similar presentations
Processes and Threads Chapter 3 and 4 Operating Systems: Internals and Design Principles, 6/E William Stallings Patricia Roy Manatee Community College,
Advertisements

Lecture 8: Asynchronous Network Algorithms
Real-Time Library: RTX
Basic HTML Tags.
David Woo (dxw07u).  What is “White Box Testing”  Data Processing and Calculation Correctness Tests  Correctness Tests:  Path Coverage  Line Coverage.
Lesson 1-1 Example Example 1 Use a number line to graph the counting whole numbers greater than 2 and less than 9. 1.You are graphing whole numbers.
XENMON: QOS MONITORING AND PERFORMANCE PROFILING TOOL Diwaker Gupta, Rob Gardner, Ludmila Cherkasova 1.
March 25, R. McFadyen1 Metrics Fan-in/fan-out Lines of code Cyclomatic complexity Comment percentage Length of identifiers Depth of conditional.
Review: Chapters 1 – Chapter 1: OS is a layer between user and hardware to make life easier for user and use hardware efficiently Control program.
Nov R. McFadyen1 Metrics Fan-in/fan-out Lines of code Cyclomatic complexity* Comment percentage Length of identifiers Depth of conditional.
Timers in Hardware ECE152. Overview Why are timers important – Watchdog – Task switching – Accurate time of day Can use polling or interrupts.
C Programming Basics Lecture 5 Engineering H192 Winter 2005 Lecture 05
Operating Systems (CSCI2413) Lecture 4 Process Scheduling phones off (please)
Home: Phones OFF Please Unix Kernel Parminder Singh Kang Home:
March R. McFadyen1 Software Metrics Software metrics help evaluate development and testing efforts needed, understandability, maintainability.
24/06/2015Dr Andy Brooks1 MSc Software Maintenance MS Viðhald hugbúnaðar Fyrirlestur 41 Maintainability of OSS OSS Open Source Software CSS Closed Source.
Software Metrics Analysis Group 2. Description of the program used for the analysis Understand 2.0 is the tool we have chosen for the analysis.
Software Metrics Testing MINIX 3. Introduction What is Metrics Analysis? Metrics Analysis is a field of Static Analysis. Show us structural attributes.
Lab 10 RT methodology (cont’d) Example 1 – a counter Example 2 – a repetitive-adder multiplier.
Predicting Class Testability using Object-Oriented Metrics M. Bruntink and A. van Deursen Presented by Tom Chappell.
1 Process Description and Control Chapter 3 = Why process? = What is a process? = How to represent processes? = How to control processes?
Process Description and Control A process is sometimes called a task, it is a program in execution.
Threads Chapter 25. A PC actually does one task at a time but threads are activities that seem to all run at once Time slicing very tiny amounts of time.
 1  Outline  simulating GI/G/1 queues  M/M/1 queues  theoretical results of queueing systems  an inventory system  simulation program with an event.
1Chapter 05, Fall 2008 CPU Scheduling The CPU scheduler (sometimes called the dispatcher or short-term scheduler): Selects a process from the ready queue.
A Complexity Measure THOMAS J. McCABE Presented by Sarochapol Rattanasopinswat.
Real Time Operating System
Operating System Concepts and Techniques Lecture 5 Scheduling-1 M. Naghibzadeh Reference M. Naghibzadeh, Operating System Concepts and Techniques, First.
Nachos Phase 1 Code -Hints and Comments
Round Robin Scheduling A preemptive scheduling designed for Time Sharing Systems The Ready Queue is treated as a circular queue A small execution.
Scheduling Strategies Operating Systems Spring 2004 Class #10.
Software Metrics (Part II). Product Metrics  Product metrics are generally concerned with the structure of the source code (example LOC).  Product metrics.
REVIEW OF COMMONLY USED DATA STRUCTURES IN OS. NEEDS FOR EFFICIENT DATA STRUCTURE Storage complexity & Computation complexity matter Consider the problem.
C++ crash course Class 8 statements, sort, flight times program.
Engineering H192 - Computer Programming The Ohio State University Gateway Engineering Education Coalition Lect 5P. 1Winter Quarter C Programming Basics.
Hard Real-Time Scheduling for Low- Energy Using Stochastic Data and DVS Processors Flavius Gruian Department of Computer Science, Lund University Box 118.
SOFTWARE METRICS. Software Process Revisited The Software Process has a common process framework containing: u framework activities - for all software.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems with Multi-programming Chapter 4.
1 Chapter 4 Processes R. C. Chang. 2 Linux Processes n Each process is represented by a task_struct data structure (task and process are terms that Linux.
Engineering H192 - Computer Programming Gateway Engineering Education Coalition Lect 5P. 1Winter Quarter C Programming Basics Lecture 5.
CS140 Project 1: Threads Slides by Kiyoshi Shikuma.
ECGR-6185 µC/OS II Nayana Rao University of North Carolina at Charlotte.
DOCUMENTATION SECTION GLOBAL DECLARATION SECTION
Operating Systems 1 K. Salah Module 1.2: Fundamental Concepts Interrupts System Calls.
Software Testing White Box Testing. Agenda What is White Box Testing Correctness Tests and Path Coverage Correctness Tests and Line Coverage McCabe Cyclomatic.
Lecture 2a: Performance Measurement. Goals of Performance Analysis The goal of performance analysis is to provide quantitative information about the performance.
In a multitasking environment : what is a timeslice (quantum)? what is a context switch? When a large number of processes (jobs) are multitasking the actual.
Managing Processors Jeff Chase Duke University. The story so far: protected CPU mode user mode kernel mode kernel “top half” kernel “bottom half” (interrupt.
1 Akira Tsukamoto System Platform Laboratory NEC Corporation.
1 Run-to-Completion Non-Preemptive Scheduler. 2 In These Notes... What is Scheduling? What is non-preemptive scheduling? Examples Run to completion (cooperative)
Cyclomatic complexity (or conditional complexity) is a software metric (measurement). Its gives the number of indepented paths through strongly connected.
Cyclomatic Complexity Philippe CHARMAN Last update:
Core Focus on Decimals & Fractions Measuring in Centimeters Lesson 1.3.
Dynamic White-Box Testing What is code coverage? What are the different types of code coverage? How to derive test cases from control flows?
An operating system for a large-scale computer that is used by many people at once is a very complex system. It contains many millions of lines of instructions.
Lecture 5 Scheduling. Today CPSC Tyson Kendon Updates Assignment 1 Assignment 2 Concept Review Scheduling Processes Concepts Algorithms.
DATA STRUCURES II CSC QUIZ 1. What is Data Structure ? 2. Mention the classifications of data structure giving example of each. 3. Briefly explain.
Information Technology (IT). Information Technology – technology used to create, store, exchange, and use information in its various forms (business data,
CS140 Project Session Notes #1: Threads Haobo Xu, TA Fall Based on Ben Sapp’s slides Download these slides from
Lecture 9 Scheduling. Scheduling Policies Preemptive Priority Scheduling.
SOFTWARE TESTING TRAINING TOOLS SUPPORT FOR SOFTWARE TESTING Chapter 6 immaculateres 1.
Advanced OS Concepts (For OCR)
Lecture Topics: 11/1 Processes Process Management
CS1010 Programming Methodology
Semaphores -Gajendra Singh.
Halstead software science measures and other metrics for source code
Scheduling.
Process Description and Control
Operating System 3 PROCESS DESCRIPTION AND CONTROL
1. Cyclomatic complexity
Presentation transcript:

General Information & Proc.c General Information & Proc.c Juan Luis Pardo González Javier Lara Valtueña

General Information & Proc.c General Information & Proc.c -General Information: General Metrics Graphs -Proc.c: Proc.c Metrics Graphs.

General Information: General Metrics Graphs This round graph shows the percentage of Source Code,Comments,Blank Lines,Inactive and PreProcessor of the whole written code. Half of the code is Source Code,fourth part of the code is Comment Code. There is almost one line of Comment Code per two lines of Source Code. It is a GOOD MARK.

General Information: General Metrics Graphs This graph shows the five most commented functions. All functions have more than one of Comment Ratio.They have more comment lines than source lines.

General Information: General Metrics Graphs Sched(): This function determines the scheduling policy. It is called whenever a process must be added to one of the scheduling queues to decide where to insert it. As a side-effect the process' priority may be updated. do_revive(): Revive a process that was waiting for something. Clock_handler: This executes on each clock tick (i.e., every time the timer chip generates an interrupt). It does a little bit of work so the clock task does not have to be called on every tick.

General Information: General Metrics Graphs This graph shows the five Largest functions. All of them have more than 200 lines of code. Tcp_frag2conn() is by far the largest function,with more than 700 lines of code, when ip_ioctl() which is the second only has roughly 400 lines.

General Information: General Metrics Graphs This graph shows the five Largest files. All of them have more than 1000 lines of code. Two groups can be distinguished: The first three files with more than 2500 lines of code,and the rest with less than 2000 lines of code.

General Information: General Metrics Graphs This graph shows the five more complex files according to average cyclomatic complexity. All of them have an average complexity greater than 21. According to LaquSo methodology these are high risk parts of the program because its average cyclomatic complexity is greater than 21.

General Information: General Metrics Graphs This graph shows the five more complex functions according to cyclomatic complexity. All of them have a complexity greater than 50. According to LaquSo methodology these are the untestable functions of the program,because they have a cyclomatic complexity greater than 50. It makes them very high risk functions.

Proc.c: Proc.c Metrics Graphs. CountLineBlank -- Number of blank lines. CountLineCodeDecl -- Number of lines containing declarative source code. CountLineCodeExe -- Number of lines containing executable source code. CountLineComment -- Number of lines containing comment. Note that proc.c like almost all the code has one comment line per executable or declarative line.

Proc.c: Proc.c Metrics Graphs. MaxNesting -- Maximum nesting level of control constructs (if, while, for, switch, etc.) in the function.

Proc.c: Proc.c Metrics Graphs. CountPath -- Number of unique paths though a body of code, not counting abnormal exits or gotos.

Proc.c: Proc.c Metrics Graphs.