charm AT lists.cs.illinois.edu

Subject: Charm++ parallel programming system

List archive

[charm] IO efficiency in Charm++

From: Haowei Huang <huangh AT in.tum.de>
To: Phil Miller <unmobile AT gmail.com>, charm AT cs.illinois.edu
Subject: [charm] IO efficiency in Charm++
Date: Thu, 1 Jul 2010 08:33:36 +0200
List-archive: <http://lists.cs.uiuc.edu/pipermail/charm>
List-id: CHARM parallel programming system <charm.cs.uiuc.edu>

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] IO efficiency in Charm++, Haowei Huang, 07/01/2010
- Re: [charm] IO efficiency in Charm++, Abhinav S Bhatele, 07/01/2010
- Re: [charm] IO efficiency in Charm++, Kale, Laxmikant V, 07/01/2010