| Abstract |
|---|
| We compare the BSP and the LogP model from a practical point of view. We improve the (best known) simulations of BSP programs on LogP machines by a factor of O(log P) for oblivious programs by using compilation instead of interpretation. We show that the runtime decreases for classes of oblivious BSP programs if they are compiled into LogP programs instead of executed directly using a BSP runtime library. Measurements support the statements above. |
| Contact |
| Welf Loewe Institut für Programmstrukturen und Datenorganisation ,Fakultät für Informatik ,Universität Karlsruhe ,Zirkel 2 ,,76128 Karlsruhe, GERMANY loewe@ipd.info.uni-karlsruhe.de |