24.12.2012 Views

Chapter 4 - DSpace at Waseda University

Chapter 4 - DSpace at Waseda University

Chapter 4 - DSpace at Waseda University

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

43<br />

<strong>Chapter</strong> 4<br />

bugs per 1000 lines”. It means there is a possibility of a problem occurrence in<br />

embedded systems. Generally, as the development period of an embedded system is<br />

pretty short, it lacks enough test and verific<strong>at</strong>ion. Therefore, we need to consider how<br />

to solve such a problem. The answer is to solve quickly using event logs when a<br />

problem occurred. It is a job of a developer or an administr<strong>at</strong>or to find out the cause<br />

of the problem.<br />

4.2.1.3 Process Flow of DL<br />

In DL, a problem is found by logged event inform<strong>at</strong>ion. To find a problem by using KAS, it<br />

is needed to define the problem which one would like to find out (for instance, for timer:<br />

algorithm on whether a timer has passed deadline or not). It is easy to define the timer l<strong>at</strong>ency<br />

problem because we only need to check whether it passed the deadline of a process. In Figure<br />

4.4 HRTimer_Tick means the deadline (expired time of task) of a high-resolution timer and<br />

HRTimer_L<strong>at</strong>ency means the whole time before the high-resolution timer expired (including<br />

l<strong>at</strong>ency). Therefore, the problem of a timer can be defined as whether running time of a<br />

certain process has passed or not passed to the deadline.<br />

Figure 4.5 is the flow of DL’s processing. Firstly, as shows in Figure 4.4, DL defines a<br />

problem and checks the whole d<strong>at</strong>a from the top to bottom and find out problems. If the<br />

problems are not found, it continues to check without any results but if there is a problem, it<br />

saves the line inform<strong>at</strong>ion and checks how many times the problem has occurred. When the<br />

search is finished to the bottom, Separ<strong>at</strong>ion Layer, which is the next layer, will be processed.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!