Charm++ parallel programming system

[Jonathan Lifflander <jliffl2 AT illinois.edu>]

So, if I understand correctly, you are trying to implement wordcount,
terasort, and grep in Charm++?

These all sound like map/reduce applications to me. Are trying to
compare Charm++ to other cloud platforms? What is your goal in
implementing these applications?

Charm++ does not currently have built-in functionality that you will
find in traditional map/reduce frameworks. Charm++ aims to be more
general purpose than map/reduce frameworks and is generally oriented
more toward high-performance computing. However, a former PhD student
who graduated, Abhishek Gupta
(http://charm.cs.uiuc.edu/people/abhishekgupta), researched how to
make HPC applications in Charm++ more adaptable to the cloud. You can
read his papers and thesis at the above hyperlink.

Jonathan

On 19 July 2015 at 17:11, Chintankumar Patel 
<cpatel35 AT hawk.iit.edu>
 wrote:
> Hi,
>
> I am trying to do benchmarking on charm++ with wordcount, terasort, grep
> applications. I have done with wordcount program. But I have written program
> in C syntax. I haven't found any related example/syntax for charm++ in
> manual/tutorial of charm++.
>
> Can anyone please help me to with this benchmarking applications?
>
> --
> Thanks,
> Chintan Patel
> Graduate Student - IIT/CS
> http://www.linkedin.com/in/chintanpatel08
> mail.chintan29 AT gmail.com
> +1-872-239-9575
>
> _______________________________________________
> charm mailing list
> charm AT cs.uiuc.edu
> http://lists.cs.uiuc.edu/mailman/listinfo/charm
>
> _______________________________________________
> ppl mailing list
> ppl AT cs.uiuc.edu
> http://lists.cs.uiuc.edu/mailman/listinfo/ppl
>