Charm++ parallel programming system

["Totoni, Ehsan" <totoni2 AT illinois.edu>]

The format of the input file is Compressed Sparse Rows (CSR). The first
line contains the number of rows, the number of columns and the number of
non-zeros. The second line is the indices of rows and the third line is
the non-zero values. You can convert different matrices from the Florida
collection (just the lower triangular part).

Good luck,
-Ehsan

On 7/19/13 11:39 PM, "Jonathan Lifflander" 
<jliffl2 AT illinois.edu>
 wrote:

>I can't comment on the how to get a larger input since this is not my
>project (but I've specifically cc'ed Ehsan who wrote the code).
>However, when you say you are trying to "get the communication pattern
>of this application through Projections", what exactly are you trying
>to extract? If you are just trying to understand the communication
>conceptually, then looking at the code or reading the corresponding
>paper might be easier.
>
>Jonathan
>
>On Fri, Jul 19, 2013 at 2:10 PM, Chulian Zhang 
><zhang.chul AT husky.neu.edu>
>wrote:
>> Hi all,
>>
>> I got the triangularSolver from
>> git://charm.cs.illinois.edu/benchmarks/triangularsolver.git.
>>
>> I can compile it and run a test with the input file "nv_example.rcm".
>>But
>> since I want to get the communication pattern of this application
>>through
>> Projections, the example input seems "too small".
>>
>> Anyone knows how I can generate a bigger input? Or I can get it from
>> somewhere else? Thanks.
>>
>> Best,
>> Chulian
>>
>>
>> _______________________________________________
>> charm mailing list
>> charm AT cs.uiuc.edu
>> http://lists.cs.uiuc.edu/mailman/listinfo/charm
>>