By using this site, you agree to our updated Privacy Policy and our Terms of Use. Manage your Cookies Settings.
449,042 Members | 1,047 Online
Bytes IT Community
+ Ask a Question
Need help? Post your question and get tips & solutions from a community of 449,042 IT Pros & Developers. It's quick & easy.

Urgent ~~Simulator Question

P: n/a
Hi all,
Can anyone help me to do this Question. Coz this is my first time study C++
language and my lecture want me to do this kind of program, i really don't
have any ideal
pls help me

here is the Question::
Improve the following (badly written) matrix multiplicationprogram and
translate it into MIPs assembly language then assemble into machine language
(hexadecimal representation). You may use a compiler to produce an assembly
language file and SPIM to produce the final hexadecimal machine language but
it WILL be faster to compile the program manually given past experience by
students. It will also mean you need to implement less instructions in the
simulator, or put it another way, do LESS WORK.

#define n varies see belowtypedef char index_;typedef longint
matrix[n + 1][n + 1];main(){ index_ i, j, k; matrix a, b, c; for (j = 0;
j< n; j++) { for (i = 0; i< n; i++) { a[i][j] = i * j; b[i][j]
= a[i][j]; } } for (i = 0; i< n; i++) { for (k = 0; k< n; k++)
{ c[k][i] = 0.0; for (j = 0; j < n; j++) c[k][i] += a[k][j]
* b[j][i]; } }}
Write a simulator for the final version of the pipelined datapath from your
text book adding a 1-bit branch predictor and assuming two pipeline delays
for the data memory. The branch logic MUST remain in the ALU stage; do not
move it back to the register/decode stage. You MUST use branch flushing (do
NOT use branch delay slots), you MUST implement data forwarding and detect
and resolve load hazards.

Beware the text has a number of errors.

The simulator must display on screen the contents of pipeline and registers
being used and 8 memory locations commencing with one currently being
accessed. A simple text based display is acceptable as long as the screen
does not scroll every clock cycle! The simulator must also support single
step operation and be able to run until a particular instruction address is
reached. The simulator must read in the hexadecimal format machine
instructions. You may choose what language to use.

You are only required to implement the instructions used in the
multiplication program. For Assignment 1 use 16x16 matrices only. The Branch
Target Buffer must have only 1 entry only (to simplify the problem!).

~ Let us linux ~
-----= Posted via Newsfeeds.Com, Uncensored Usenet News =-----
http://www.newsfeeds.com - The #1 Newsgroup Service in the World!
-----== Over 100,000 Newsgroups - 19 Different Servers! =-----
Jul 22 '05 #1
Share this Question
Share on Google+
9 Replies


P: n/a
"Milk" <mi*********@yahoo.com> wrote...
Hi all,
Can anyone help me to do this Question. [...]


This is answered in the FAQ (http://www.parashift.com/c++-faq-lite/)
Enter "homework" into the search field.
Jul 22 '05 #2

P: n/a
"Milk" <mi*********@yahoo.com> wrote...
Hi all,
Can anyone help me to do this Question. [...]


This is answered in the FAQ (http://www.parashift.com/c++-faq-lite/)
Enter "homework" into the search field.
Jul 22 '05 #3

P: n/a
On 11 Apr 2004 00:50:16 +0800 in comp.lang.c++, "Milk"
<mi*********@yahoo.com> wrote,
Can anyone help me to do this Question. Coz this is my first time study C++
language and my lecture want me to do this kind of program, i really don't
have any ideal
"Don't have any idea" questions are often beyond the help that you can
expect from newsgroups. I think you should go talk to your instructor
about why his class is not working for you.
here is the Question::
Improve the following (badly written) matrix multiplicationprogram and
translate it into MIPs assembly language then assemble into machine language
Of course the assembly language part of that is not on topic here. Did
you have a question about the C++ part?
Write a simulator for the final version of the pipelined datapath from your
text book adding a 1-bit branch predictor and assuming two pipeline delays


That's a pretty large project; you should not expect to accomplish it
without spending some time on it. Your "Urgent" subject suggests that
you thought otherwise.

Jul 22 '05 #4

P: n/a
On 11 Apr 2004 00:50:16 +0800 in comp.lang.c++, "Milk"
<mi*********@yahoo.com> wrote,
Can anyone help me to do this Question. Coz this is my first time study C++
language and my lecture want me to do this kind of program, i really don't
have any ideal
"Don't have any idea" questions are often beyond the help that you can
expect from newsgroups. I think you should go talk to your instructor
about why his class is not working for you.
here is the Question::
Improve the following (badly written) matrix multiplicationprogram and
translate it into MIPs assembly language then assemble into machine language
Of course the assembly language part of that is not on topic here. Did
you have a question about the C++ part?
Write a simulator for the final version of the pipelined datapath from your
text book adding a 1-bit branch predictor and assuming two pipeline delays


That's a pretty large project; you should not expect to accomplish it
without spending some time on it. Your "Urgent" subject suggests that
you thought otherwise.

Jul 22 '05 #5

P: n/a
> [snip]

Your urgent request is important to us. Please stay on the newsgroup and a
representative will be with you as soon as possible.

The average wait time is...

THREE

....days.

<elevator music>
Jul 22 '05 #6

P: n/a
> [snip]

Your urgent request is important to us. Please stay on the newsgroup and a
representative will be with you as soon as possible.

The average wait time is...

THREE

....days.

<elevator music>
Jul 22 '05 #7

P: n/a
Hi, Victor Bazarov"
i really can't find it..coz a lot page so would u mind tell me which day and
year i need to looking for it?

"Milk" <mi*********@yahoo.com> 撰寫於郵件新聞:40******@lungfunggdn.org...
Hi all,
Can anyone help me to do this Question. Coz this is my first time study C++ language and my lecture want me to do this kind of program, i really don't
have any ideal
pls help me

here is the Question::
Improve the following (badly written) matrix multiplicationprogram and
translate it into MIPs assembly language then assemble into machine language (hexadecimal representation). You may use a compiler to produce an assembly language file and SPIM to produce the final hexadecimal machine language but it WILL be faster to compile the program manually given past experience by
students. It will also mean you need to implement less instructions in the
simulator, or put it another way, do LESS WORK.

#define n varies see belowtypedef char index_;typedef longint matrix[n + 1][n + 1];main(){ index_ i, j, k; matrix a, b, c; for (j = 0; j< n; j++) { for (i = 0; i< n; i++) { a[i][j] = i * j; b[i][j] = a[i][j]; } } for (i = 0; i< n; i++) { for (k = 0; k< n; k++)
{ c[k][i] = 0.0; for (j = 0; j < n; j++) c[k][i] += a[k][j] * b[j][i]; } }}
Write a simulator for the final version of the pipelined datapath from your text book adding a 1-bit branch predictor and assuming two pipeline delays
for the data memory. The branch logic MUST remain in the ALU stage; do not
move it back to the register/decode stage. You MUST use branch flushing (do NOT use branch delay slots), you MUST implement data forwarding and detect
and resolve load hazards.

Beware the text has a number of errors.

The simulator must display on screen the contents of pipeline and registers being used and 8 memory locations commencing with one currently being
accessed. A simple text based display is acceptable as long as the screen
does not scroll every clock cycle! The simulator must also support single
step operation and be able to run until a particular instruction address is reached. The simulator must read in the hexadecimal format machine
instructions. You may choose what language to use.

You are only required to implement the instructions used in the
multiplication program. For Assignment 1 use 16x16 matrices only. The Branch Target Buffer must have only 1 entry only (to simplify the problem!).

~ Let us linux ~

~ Let us linux ~
-----= Posted via Newsfeeds.Com, Uncensored Usenet News =-----
http://www.newsfeeds.com - The #1 Newsgroup Service in the World!
-----== Over 100,000 Newsgroups - 19 Different Servers! =-----
Jul 22 '05 #8

P: n/a
Hi, Victor Bazarov"
i really can't find it..coz a lot page so would u mind tell me which day and
year i need to looking for it?

"Milk" <mi*********@yahoo.com> 撰寫於郵件新聞:40******@lungfunggdn.org...
Hi all,
Can anyone help me to do this Question. Coz this is my first time study C++ language and my lecture want me to do this kind of program, i really don't
have any ideal
pls help me

here is the Question::
Improve the following (badly written) matrix multiplicationprogram and
translate it into MIPs assembly language then assemble into machine language (hexadecimal representation). You may use a compiler to produce an assembly language file and SPIM to produce the final hexadecimal machine language but it WILL be faster to compile the program manually given past experience by
students. It will also mean you need to implement less instructions in the
simulator, or put it another way, do LESS WORK.

#define n varies see belowtypedef char index_;typedef longint matrix[n + 1][n + 1];main(){ index_ i, j, k; matrix a, b, c; for (j = 0; j< n; j++) { for (i = 0; i< n; i++) { a[i][j] = i * j; b[i][j] = a[i][j]; } } for (i = 0; i< n; i++) { for (k = 0; k< n; k++)
{ c[k][i] = 0.0; for (j = 0; j < n; j++) c[k][i] += a[k][j] * b[j][i]; } }}
Write a simulator for the final version of the pipelined datapath from your text book adding a 1-bit branch predictor and assuming two pipeline delays
for the data memory. The branch logic MUST remain in the ALU stage; do not
move it back to the register/decode stage. You MUST use branch flushing (do NOT use branch delay slots), you MUST implement data forwarding and detect
and resolve load hazards.

Beware the text has a number of errors.

The simulator must display on screen the contents of pipeline and registers being used and 8 memory locations commencing with one currently being
accessed. A simple text based display is acceptable as long as the screen
does not scroll every clock cycle! The simulator must also support single
step operation and be able to run until a particular instruction address is reached. The simulator must read in the hexadecimal format machine
instructions. You may choose what language to use.

You are only required to implement the instructions used in the
multiplication program. For Assignment 1 use 16x16 matrices only. The Branch Target Buffer must have only 1 entry only (to simplify the problem!).

~ Let us linux ~

~ Let us linux ~
-----= Posted via Newsfeeds.Com, Uncensored Usenet News =-----
http://www.newsfeeds.com - The #1 Newsgroup Service in the World!
-----== Over 100,000 Newsgroups - 19 Different Servers! =-----
Jul 22 '05 #9

P: n/a
"Milk" <mi*********@hotmail.com> wrote...
Hi, Victor Bazarov"
i really can't find it..coz a lot page so would u mind tell me which day and year i need to looking for it?


i have no ideal what you wrote.
Jul 22 '05 #10

This discussion thread is closed

Replies have been disabled for this discussion.