Progress Report 2015/08/31. Previously Energy Aware Scheduling Kernel Summit 2014 ◦ rt-app: creates workload patterns based on workload description.

Slides:



Advertisements
Similar presentations
Background Virtual memory – separation of user logical memory from physical memory. Only part of the program needs to be in memory for execution. Logical.
Advertisements

CSC 360- Instructor: K. Wu Overview of Operating Systems.
Mutual Exclusion.
Silberschatz, Galvin and Gagne ©2013 Operating System Concepts Essentials – 9 th Edition Chapter 6: CPU Scheduling.
Concurrency: Threads, Address Spaces, and Processes Sarah Diesburg Operating Systems COP 4610.
Why Concurrency? Allows multiple applications to run at the same time  Analogy: juggling.
Chapter 5 CPU Scheduling. CPU Scheduling Topics: Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling.
Chapter 6: CPU Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 7 th Edition, Feb 2, 2005 Chapter 6: CPU Scheduling Basic.
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.
The new The new MONARC Simulation Framework Iosif Legrand  California Institute of Technology.
Fall 2001CS 4471 Chapter 2: Performance CS 447 Jason Bakos.
CPS110: Implementing threads/locks on a uni-processor Landon Cox.
Operating System Process Scheduling (Ch 4.2, )
Slides Prepared from the CI-Tutor Courses at NCSA By S. Masoud Sadjadi School of Computing and Information Sciences Florida.
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.
Operating Systems Part III: Process Management (CPU Scheduling)
Silberschatz, Galvin, and Gagne  Applied Operating System Concepts Module 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.
BlueECG System Software Design Western Washington University By: Corey Williamson.
IAY 0600 Digitaalsüsteemide disain Event-Driven Simulation Alexander Sudnitson Tallinn University of Technology.
Multiple Processor Systems. Multiprocessor Systems Continuous need for faster and powerful computers –shared memory model ( access nsec) –message passing.
Grid Data Management A network of computers forming prototype grids currently operate across Britain and the rest of the world, working on the data challenges.
Chapter 5 – CPU Scheduling (Pgs 183 – 218). CPU Scheduling  Goal: To get as much done as possible  How: By never letting the CPU sit "idle" and not.
Concurrency: Threads, Address Spaces, and Processes Andy Wang Operating Systems COP 4610 / CGS 5765.
Getting Started with the µC/OS-III Real Time Kernel Akos Ledeczi EECE 6354, Fall 2015 Vanderbilt University.
Page 1 2P13 Week 9. Page 2 Table 9.2 Scheduling Criteria User Oriented, Performance Related Turnaround time This is the interval of time between the submission.
MACCE and Real-Time Schedulers Steve Roberts EEL 6897.
4.1 Advanced Operating Systems Desktop Scheduling You are running some long simulations. In the mean time, why not watch an illegally downloaded Simpsons.
Silberschatz and Galvin  Operating System Concepts Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor.
Games Development 2 Concurrent Programming CO3301 Week 9.
ICOM Noack Scheduling For Distributed Systems Classification – degree of coupling Classification – granularity Local vs centralized scheduling Methods.
Scheduling Lecture 6. What is Scheduling? An O/S often has many pending tasks. –Threads, async callbacks, device input. The order may matter. –Policy,
Progress Report 2015/08/03. Related Works Materials from ◦ Energy Aware Scheduling Kernel Summit 2014 ◦ Energy-aware Scheduling and CPU Power.
Operating Systems Scheduling. Bursts of CPU usage alternate with periods of waiting for I/O. (a) A CPU-bound process. (b) An I/O-bound process. Scheduling.
Chapter 2 Processes and Threads Introduction 2.2 Processes A Process is the execution of a Program More specifically… – A process is a program.
CPS110: Implementing threads Landon Cox. Recap and looking ahead Hardware OS Applications Where we’ve been Where we’re going.
1 11/29/2015 Chapter 6: CPU Scheduling l Basic Concepts l Scheduling Criteria l Scheduling Algorithms l Multiple-Processor Scheduling l Real-Time Scheduling.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 3: Process-Concept.
15.1 Threads and Multi- threading Understanding threads and multi-threading In general, modern computers perform one task at a time It is often.
CS399 New Beginnings Jonathan Walpole. 2 Concurrent Programming & Synchronization Primitives.
Processes, Threads, and Process States. Programs and Processes  Program: an executable file (before/after compilation)  Process: an instance of a program.
Software Transactional Memory Should Not Be Obstruction-Free Robert Ennals Presented by Abdulai Sei.
1 CS.217 Operating System By Ajarn..Sutapart Sappajak,METC,MSIT Chapter 5 CPU Scheduling Slide 1 Chapter 5 CPU Scheduling.
IAY 0600 Digital Systems Design Event-Driven Simulation VHDL Discussion Alexander Sudnitson Tallinn University of Technology.
Lab 4 : Real-Time OS Team #7 P 李彥勳 P 謝嵩淮 R 侯凱文.
Multithreading & Synchronized Algoritma Pemrograman 3 Sistem Komputer – S1 Universitas Gunadarma 1.
Multithreading. Multitasking The multitasking is the ability of single processor to perform more than one operation at the same time Once systems allowed.
Implementing Lock. From the Previous Lecture  The “too much milk” example shows that writing concurrent programs directly with load and store instructions.
SMP Basics KeyStone Training Multicore Applications Literature Number: SPRPxxx 1.
Process Control Management Prepared by: Dhason Operating Systems.
Chapter 4 CPU Scheduling. 2 Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation.
Implementing Mutual Exclusion Andy Wang Operating Systems COP 4610 / CGS 5765.
Basic Concepts Maximum CPU utilization obtained with multiprogramming
Lecture 3. Performance Prof. Taeweon Suh Computer Science & Engineering Korea University COSE222, COMP212, CYDF210 Computer Architecture.
Advanced Operating Systems CS6025 Spring 2016 Processes and Threads (Chapter 2)
Processes and threads.
TrueTime.
IAY 0600 Digitaalsüsteemide disain
Threads and Scheduling
Ching-Chi Lin Institute of Information Science, Academia Sinica
Threads and Locks.
Concurrency: Threads, Address Spaces, and Processes
Department of Computer Science University of California, Santa Barbara
Sarah Diesburg Operating Systems COP 4610
A Simulator to Study Virtual Memory Manager Behavior
Chapter 6: CPU Scheduling
Lesson Objectives Aims Key Words
Overview of the Lab 2 Assignment: Multicore Real-Time Tasks
Linux Process State Scheduling information Identifiers
Department of Computer Science University of California, Santa Barbara
Presentation transcript:

Progress Report 2015/08/31

Previously Energy Aware Scheduling Kernel Summit 2014 ◦ rt-app: creates workload patterns based on workload description files (current JSON).

rt-app A test application that starts multiple periodic threads in order to simulate a real-time periodic load. Not only the sleep and run pattern can be emulated, but also the dependency between tasks. ◦ accessing same critical resources, creating sequential wake up or syncing the wake up of threads. The use case is described in a json like file

Workloads Main objects ◦ Global objects  Duration, Calibration, default_policy, io_device, … ◦ Tasks/Threads  Instance, priority, cpus, phases, …  run, sleep, mem, iorun, timer, lock, wait, sync, …

Run event Emulate the execution of a load. ◦ The duration is defined in usec, but the run event will effectively run a number of time a loop that waste cpu cycles. ◦ The duration is transformed in a number of loop by the ns per loop value defined in calibration.  Default: CPU[0] ◦ The actual duration will vary with the frequency or the compute capacity of the CPU.

Outputs Log some metrics for each phase that is executed by a thread ◦ perf: number of loop that has been executed by run events ◦ run: time spent by the thread to execute the run events ◦ period: duration to execute the complete phase ◦ start/end : absolute start and end time of a phase. ◦ rel_st: start time of a phase relatively to the begin of the use case.

Example Output – web-BrowserMain-0.log # Policy : SCHED_OTHER priority : 0 #idx perf run period start end rel_st …

Examples [power/rt-app.git] / doc / examples / ◦ browser-long.json ◦ browser-short.json ◦ mp3-long.json ◦ mp3-short.json ◦ spreading-tasks.json ◦ video-long.json ◦ video-short.json

Next cpufreq_governor_efficiency ◦ Measure the efficiency of cpufreq governors using rt-app Cross-compile rt-app and try it on Juno board