• Andrew Denton Interviews Former Ku Klux Klan leader Johnny Lee Clary https:// What kind of Asian are you?  https:// You Can’t Ask That: Indigenous Australians  http://iview.abc.net.au/programs/you-cant-ask-that/LE1517H008S00 

• Insight: I’m Not Racist But… http://edutv.informit.com.au.ez.library.latrobe.edu.au/watch-screen.php?videoID=226949

• I’m Not Your Inspiration, Thank You Very Much – Stella Young  https:// Yes I can video: https:// Jackson Katz uses language to explain why violence is not just a women’s issue https:// Ash Beckam explaining why things are not ‘gay’ https:// on readings in the list and/or additional sources, write a 1,500 report about what it means to respect difference.  The report should include the following:

• Introduction
• A critical analysis of the readings related to defining communities, creating inclusive/exclusive communities, and the challenges that arise;
• The role and responsibilities of being an ethical professional when working with diverse communities;
• A statement about the value of self-reflection in personal and professional life;
• If and why/why not the videos that you are required to watch in preparation for the first session about Recognising & Respecting Difference might influence your engagement with diverse communities.   

Word count: 1500 

Question from Computer Architecture – A quantitative approach by hennessy fifth ed,

Appendix B, Page B-60, Q1. 

 You are trying to appreciate how important the principle of

locality is in justifying the use of a cache memory, so you experiment with a

computer having an L1 data cache and a main memory (you exclusively focus on

data accesses). The latencies (in CPU cycles) of the different kinds of accesses

are as follows: cache hit, 1 cycle; cache miss, 105 cycles; main memory access

with cache disabled, 100 cycles.

a.  When you run a program with an overall miss rate of 5%, what

will the average memory access time (in CPU cycles) be?

b. Next, you run a program specifically designed to produce completely random data addresses with no locality. Toward that end, you use an

array of size 256 MB (all of it fits in the main memory). Accesses to random

elements of this array are continuously made (using a uniform random number

generator to generate the elements indices). If your data cache size is 64 KB,

what will the average memory access time be?

c. If you compare the result obtained in part (b) with the main memory access time when the cache is disabled, what can you conclude about the

role of the principle of locality in justifying the use of cache memory?