Hi Anushi, welcome to the community. A good start is to compile hpx and look at the examples. You also could join our irc channel #ste||ar at the freenode server.
I would recommend you to look into the code and find the places where GIDs are used ad start to ask questions. Please keep in midn that the deadline for submitting the proposal is soon. Best, Patrick On 15/03/18 02:14 AM, Anushi Maheshwari wrote: > Dear Mentors, > > I am Anushi Maheshwari, final year student of Harcourt Butler Technical > University(HBTU, Kanpur).Before contributing to open-source I used to do > Sports Coding (Codechef://anushi, Codeforces://Anushi1998).Therefore, I > have a good understanding of Algorithms and STL Containers.I also > possess some beginner skills in Open MP as well. > > I find this project "Implement a Faster Associative Container for GIDs" > intriguing and I would like to contribute to it through GSoC 2018.I am > familiar with the implementation of tries and I think suffix trees > provide memory efficient implementation when compared to tries.I was > looking this folder (hpx/src/runtime/agas/) to get a better > understanding of the current implementation of GID lookup system. > > I would be grateful if you provide some directions for this project. > > Thanks > > *Warm Regards* > *Anushi Maheshwari* > *B.Tech (ECE)* > *HBTU, Kanpur-208002* > * > * > > > > > <https://mailtrack.io/> Sent with Mailtrack > <https://mailtrack.io?utm_source=gmail&utm_medium=signature&utm_campaign=signaturevirality&;> > > > > _______________________________________________ > hpx-users mailing list > [email protected] > https://mail.cct.lsu.edu/mailman/listinfo/hpx-users > _______________________________________________ hpx-users mailing list [email protected] https://mail.cct.lsu.edu/mailman/listinfo/hpx-users
