Re: [Gems-users] Average packet latency VS. Ruby cycles

[Dan Gibson <degibson@xxxxxxxx>]

1. Read section 6 of http://www.cs.wisc.edu/multifacet/papers/caecw02_workloads.pdf

2. Many protocols cause multiple traversals of the network -- 7% gain each time sums to greater than 11%.

Regards,

Dan

On Tue, Aug 24, 2010 at 9:04 PM, fubinzhang <fubinzhang@xxxxxxxxx> wrote:

Hi all,

       Recently, we simulate a new routing algorithm on GEMS with splash2,
and I get puzzled about the results.

For example, for application LU-non-contiguous, our routing algorithm
reduces the average packet latency by 7% compared with the default xy
routing.

However, the ruby cycles is reduced as much as 11%.

I remembered Dan has pointed out the performance uncertainty of parallel
applications. So, I run this application twice, but got the similar results.

How does this happen? Can 7% packet latency reduction lead to 11% execution
time reduction? Is it reasonable?

Thanks in advance.


P.S.
Network Topology: 4x4 mesh
Cache Protocol: MSI_MOSI_CMP_directory
VC per VN: 1
VC buffers: 4
Flow control: We modify the flow control to set an output unit free as soon
as the tail flit has been sent. Then, the VCallocator selects an output unit
once it is free, as well as it has credit.


Regards,

Fbz.

_______________________________________________
Gems-users mailing list
Gems-users@xxxxxxxxxxx
https://lists.cs.wisc.edu/mailman/listinfo/gems-users
Use Google to search the GEMS Users mailing list by adding "site:https://lists.cs.wisc.edu/archive/gems-users/" to your search.

-- 
http://www.cs.wisc.edu/~gibson [esc]:wq!