Herbordt, M. C., Corbett, J. C., Spalding, J., and Weems, C. C. Practical algorithms for online routing on xed and recongurable meshes. J. Par. Dist. Comp. 20, 3 (1994), 341-356.  Home/Search   Document Not in Database   Summary   Related Articles

....network that executes the operation in a time independent of the data, and the design has a non NEWS network that executes the operation in time dependent on the data. In the rst case, the communication operations are modeled entirely with deterministic operations as described in Section 5 and [16]. The second case falls into the category of features not modeled at the EDA level and so it is up to the user to estimate the operation latency. In the third case, the communication operation can either be modeled using one of the network simulators available with ENPASSANT or use the same ....

.... See Table 5 for the construct network combinations that result in direct support and those that require emulation: codes for the latter are in the Operator Emulation Library (OEL) The actual OEL functions are the product of a separate study in network emulations and are described elsewhere [16]. However, just because we can port code among SIMD arrays does not mean that the code will perform equally eciently with respect to the di erences in hardware. The reason is not just a question of the existence of suitable languages and compilers: it is that algorithms optimal for one parallel ....

Herbordt, M. C., Corbett, J. C., Spalding, J., and Weems, C. C. Practical algorithms for online routing on xed and recongurable meshes. J. Par. Dist. Comp. 20, 3 (1994), 341-356.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC