Visualizing the Execution of Multi-processor Real-Time Programs

نویسندگان

  • Scott Flinn
  • William Cowan
چکیده

This paper describes a monitor designed to provide graphical display of the execution of multi-processor real-time programs. Two design principles, insisting that the monitor should run in real-time and putting no special hooks for the monitor into the operating system kernel , turn out to have far-reaching consequences: the monitor can detect only the state of the program, not its transactions, and any information displayed must be a translation of fast actions within the program into the slower time scale of human perception. The result is a statistical notion of program state. When this type of state is displayed graphically it is discovered to have desirable scaling properties. In addition to the temporal scaling that allows it to mediate between computer and human time scales, it scales well with graphical demands imposed by program complexity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Framework for the Optimization of the WCET of Programs on Multi-Core Processors

For a timing-critical system, it is mandatory to guarantee upper bounds on the execution times of its programs. Such bounds can be derived using worst-case execution time (WCET) analysis. WCET analysis for multi-core processors is challenging as the behavior of one processor core in general depends on the behavior of the other cores. A common option to reduce this dependency is the use of time ...

متن کامل

Multi-processor Schedulability Analysis of Preemptive Real-Time Tasks with Variable Execution Times

In this paper, we study schedulability analysis problems for multi-processor real-time systems. Assume a set of real time tasks whose execution times and deadlines are known. We use timed automata to describe the non-deterministic arrival times of tasks. The schedulability problem is to check whether the released task instances can be executed within their given deadlines on a multi-processor p...

متن کامل

Towards Transactional Memory for Real-Time Systems

In this paper, we explore a new synchronization paradigm for real-time systems: transactional memory for real-time systems. Transactional memory is considered as a solution for parallel programs on a shared memory chip multiprocessor. It simplifies the programming model and increases the average case throughput. However, in real-time systems we are interested in the worst-case execution time. I...

متن کامل

Static Timing Analysis of Parallel Systems Using Abstract Execution

The Power Wall has stopped the past trend of increasing processor throughput by increasing the clock frequency and the instruction level parallelism. Therefore, the current trend in computer hardware design is to expose explicit parallelism to the software level. This is most often done using multiple processing cores situated on a single processor chip. The cores usually share some resources o...

متن کامل

An Effective Task Scheduling Framework for Cloud Computing using NSGA-II

Cloud computing is a model for convenient on-demand user’s access to changeable and configurable computing resources such as networks, servers, storage, applications, and services with minimal management of resources and service provider interaction. Task scheduling is regarded as a fundamental issue in cloud computing which aims at distributing the load on the different resources of a distribu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015