We present a cost model that relies on an asychronous and structured aprallel execution model for message passing.We show that it is possible to define a complexity function for programs that yields a symbolic data for each communication event.By ordering these dates,an upper bound for the network load can be computed.In contrast to classical approaches this cost computation can handle asynchronism for message passing and communication/computation overlap.
展开▼
