Reference no: EM1379651
A text document with machine code (not assembly code) for little man's computer following instruction set. Instructions are in different lines (no need for semicolon at the end of each instruction)
Arithmetic 1xx ADD
2xx SUB
Data Movement 3xx STORE
5xx LOAD
BR 6xx JUMP
BRZ 7xx BRANC ON 0
BRP 8xx BRANCH ON +
Input/Output 901 INPUT
902 OUTPUT
Machine Control 000 HALT
(coffee break) COB
Output:
Any output specified in the input file by 902 will be displayed on screen
Computer specification:
· Two digits memory (mail box) address: 00-99
· Three digits instruction or data in each memory slot
· One calculator, one program counter
· The program in the input file needs to be loaded into memory first and stored in consecutive slots starting from address 00
· 901 instruction will ask user's input from keyboard, 902 displays content in calculator
Other requirements:
Your program should accept any length of input program that can be fit in little man's 100 memory slots and generate correct result and/or output on screen.
Submit the source code together with readme file with instruction to compile, build and use your program.
Example:
Input file contains following code (return positive difference):
901
310
901
311
210
808
510
211
902
000
Running of the program with this input will ask user to input 2 numbers, let's say 5 and 10, the program will output the positive difference on the screen, which is 5.
|
Computing the access time
: Main memory uses a block transfer capability & has 1st word (four bytes) access time of fifty ns and access time for following words as 5 ns.
|
|
Determine the format of main memory address
: Given that a system has two way set associative cache of size eight KBytes, with sixteen bytes cache lines, and a byte-addressable main memory of size 64 MBytes.
|
|
Creating programs to compute
: Compare zero-, one-, two-, and three-address machines through writing programs to compute X = (A+B X C)/D - E X F)
|
|
Evaluate a dbms in terms of lock granularity
: Suppose you are asked to evaluate a DBMS in terms of lock granularity and the different locking levels. Create a simple database environment in which these features would be important.
|
|
Creating a c++ program
: A text document with machine code for little man's computer following instruction set. Instructions are in different lines.
|
|
Define cache and its purpose
: Describe what a cache is and what its purpose is. Also explain what data gets placed into the cache, and when it is put there.
|
|
Direct mapped cache- word, block, tag
: Think about a byte addressable computer with twenty-four bit addresses, a cache capable of storing a total of 64KB of data, and blocks of 32 bytes.
|
|
Find the sizes of the tag, block and word fields
: Assume that a computer using direct mapped cache has 2^24 words of main memory and a cache of sixty-four blocks, where each cache block contains sixteen words.
|
|
Format of a memory address
: Assume that a computer using a set associative cache has 2^16 words of main memory and a cache of thirty-two blocks, where each cache block contains eight words.
|