Skip to Content.
Sympa Menu

charm - Re: [charm] IO efficiency in Charm++

charm AT lists.cs.illinois.edu

Subject: Charm++ parallel programming system

List archive

Re: [charm] IO efficiency in Charm++


Chronological Thread 
  • From: Abhinav S Bhatele <bhatele AT illinois.edu>
  • To: Haowei Huang <huangh AT in.tum.de>
  • Cc: charm AT cs.illinois.edu
  • Subject: Re: [charm] IO efficiency in Charm++
  • Date: Thu, 1 Jul 2010 01:39:55 -0500
  • List-archive: <http://lists.cs.uiuc.edu/pipermail/charm>
  • List-id: CHARM parallel programming system <charm.cs.uiuc.edu>

Hi Haowei,

This is a problem (a serial bottleneck) and parallel I/O is needed to fix this.

Someone will correct me if I am wrong but currently Charm++ does not provide support
to applications for parallel I/O. The application developer has to write his own code for
reading input files in parallel at program startup.

- Abhinav


On Thu, Jul 1, 2010 at 1:33 AM, Haowei Huang <huangh AT in.tum.de> wrote:
Hi Phil:

         I have a question about IO efficiency in Charm++. As shown in your manual, each program has a main chare and all the other chares are created by main chare through entry method. Take MD as an example, main chare reads all data information from input file and creates all patches and distributes data to different patches. In this situation, processor 0 is busy with reading data from file and other processors keep idle. Do you think is it a problem or do you have other asynchronous way to handle it? Thanks a lot.

--
Haowei Huang
Ph.D. student
Technische Universitaet Muenchen
Institut fuer Informatik, I10
Boltzmannstr. 3
D-85748 Garching
Room 01.06.061
Phone: +49 (89) 289 18477
mailto: huangh AT in.tum.de

_______________________________________________
charm mailing list
charm AT cs.uiuc.edu
http://lists.cs.uiuc.edu/mailman/listinfo/charm




--
Abhinav S Bhatele
My work: http://charm.cs.illinois.edu/~bhatele/phd



Archive powered by MHonArc 2.6.16.

Top of Page