logo Use CA10RAM to get 10%* Discount.
Order Nowlogo
(5/5)

How many fatal log entries in the month of December resulted from an \"invalid or missing program image\"?

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

1 Overview

In this project, you are required to develop a complex scalable cloud computing solution, which should be informed by best practice in the domain and documented in the form of a conference- style report. You will also be required to provide a complete archive of the code you developed and to prepare a video presentation demonstrating your working solution.

 

1.1 The data set

BGL is an open data set of logs collected from a BlueGene/L supercomputer at Lawrence Livermore National Labs. It is equipped with 131,072 processors and 32,768GB memory.

The log file can be downloaded from Zenodo1. A sample line from the log file is shown below.

- 1121707460 2005.07.18 R23-M1-N0-C:J05-U01 2005-07-18-10.24.20.440509 R23-M1-N0-C:J05-U01 RAS

KERNEL INFO generating core.7663

This can be parsed as show in table 1 below.

 

Table 1: Log file structure

Value Interpretation

- Alert message flag

1121707460 Timestamp

2005.07.18 Date

R23-M1-N0-C:J05-U01 Node

2005-07-18-10.24.20.440509 Date and Time

R23-M1-N0-C:J05-U01 Node (repeated) RAS Message Type

KERNEL System Component

INFO Level

generating core.7663 Message Content

 

Note that the first column may contain values other than the alert message flag.

 

1https://zenodo.org/record/3227177/files/BGL.tar.gz

 

2 Tasks

For this project you are required to programmatically acquire, store, pre-process, and perform data computation tasks on the BGL data set using MPI, MapReduce or Spark frameworks and appropriate design patterns. The data computation tasks should provide answers to the questions listed below.

The questions you are required to answer are dependent the last digit of your student number, as follows:

Please ensure you choose the correct questions as no marks will be awarded for code and answers relating to incorrect selections.

Questions

1. How many fatal log entries in the month of December resulted from an "invalid or missing program image"?

2. How many fatal log entries in the month of September resulted from a "major internal error"?

3. How many fatal log entries that occurred on a Monday resulted from a "machine check interrupt"?

4. How many fatal log entries that occurred on a Friday resulted from a "kernel panic"?

5. For each month, what is the average number of seconds during which EDRAM errors were detected and corrected?

6. For each day of the week, what is the average number of seconds over which "re-synch state events" occurred?

7. For each week, what is the average number of seconds during which "ddr errors" were detected and corrected? Assume a week runs from Monday to Sunday.

 

8. For each hour of the day, what is the average number of seconds during which "torus receiver z+ input pipe errors" were detected and corrected?

9. What are the top 5 most frequently occurring dates in the log?

10. What are the top 5 most frequently occurring days of the week in the log?

11. What are the top 5 most frequently occurring nodes in the log?

12. What are the top 5 most frequently occurring hours in the log?

13. Which node generated the largest number APPSEV events?

14. Which node generated the smallest number of KERNRTSP events?

15. Which node generated the largest number of APPBUSY events?

16. Which node generated the smallest number of APPUNAV events?

17. On which date was the latest fatal kernel error resulting in an rts panic?

18. On which date was the earliest fatal kernel error where the message contains "Power Good signal deactivated"?

19. On which date was the latest fatal app error where the message contains "Error reading message prefix"?

20. On which date was the earliest fatal kernel eror where the message contains the words "timed out"?

You may choose to extend beyond the questions listed above and to perform other computations that may provide useful insights into the data.

 

 

(5/5)
Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Um e HaniScience

689 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

503 Answers

Hire Me
expert
Husnain SaeedComputer science

762 Answers

Hire Me
expert
Atharva PatilComputer science

706 Answers

Hire Me
May
January
February
March
April
May
June
July
August
September
October
November
December
2025
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
SunMonTueWedThuFriSat
27
28
29
30
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30