World Scientific
  • Search
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website www.worldscientific.com.

System Upgrade on Tue, Oct 25th, 2022 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

A FUNCTIONAL LANGUAGE FOR DEPARTMENTAL METACOMPUTING

    We have designed a functional data-parallel language called BSML for programming bulk synchronous parallel (BSP) algorithms. Deadlocks and indeterminism are avoided and the execution time can be then estimated. For very large scale applications more than one parallel machine could be needed. One speaks about metacomputing. A major problem in programming application for such architectures is their hierarchical network structures: latency and bandwidth of the network between parallel nodes could be orders of magnitude worse than those inside a parallel node. Here we consider how to extend both the BSP model and BSML, well-suited for parallel computing, in order to obtain a model and a functional language suitable for metacomputing.

    References

    • O. Aumageet al., Parallel Computing 28(4), 607 (2002). Crossref, ISIGoogle Scholar
    • P. B. Bhatet al., Parallel and Distributed Computation 59, 252 (1999). Crossref, ISIGoogle Scholar
    • V. Blancoet al., Parallel Computing 30, 337 (2004). Crossref, ISIGoogle Scholar
    • O. Bonorder, B. Juurlink, I. von Otte, and I. Rieping. The Paderborn University BSP (PUB) Library. Web pages at http://www.uni-paderborn.de/~bsp/, 2004 . Google Scholar
    • F. Cappello et al. , IPDPS'2001 ( IEEE Press , 2001 ) . Google Scholar
    • H. Cha and D. Lee, Supercomputing 18(1), 179 (2001). Crossref, ISIGoogle Scholar
    • F. Gava, PPL 13(3), 365 (2003). ISIGoogle Scholar
    • F. Gava, ICCS 2004, LNCS 3038, eds. M. Bubaket al. (Springer Verlag, 2004) pp. 50–53. CrossrefGoogle Scholar
    • F. Gava and F. Loulergue. A Static Analysis for Bulk Synchronous Parallel ML to Avoid Parallel Nesting. FGCS, 2004 . Google Scholar
    • T. Kielmannet al., Parallel Computing 27, 1431 (2001). Crossref, ISIGoogle Scholar
    • X. Leroy, D. Doligez, J. Garrigue, D. Rémy, and J. Vouillon. The Objective Caml System release 3.08.1. Web pages at www.ocaml.org, 2004 . Google Scholar
    • F. Loulergueet al., Int. Journal of Computer and Information Science 5(3), (2004). Google Scholar
    • F. Loulergue, G. Hains and C. Foisy, Science of Computer Programming 37(1-3), 253 (2000). Crossref, ISIGoogle Scholar
    • J. M. R. Martin and A. Tiskin. BSP modelling a two-tiered parallel architectures. In B. M. Cook, editor, WoTUG'99, pages 47–55, 1999 . Google Scholar
    • A. Plaat, H. E. Bal, and et al. Sensitivity of Parallel Applications to large differences in bandwidth and latency in two-layer interconnects. FGCS, 2004 . Google Scholar
    • A. L. Rosenberg, PDPTA'2000 (CSREA Press, 2000) pp. 413–419. Google Scholar
    • D. B. Skillicorn, J. M. D. Hill and W. F. McColl, Scientific Programming 6(3), 249 (1997). CrossrefGoogle Scholar
    • L. Smarr and C. E. Catlett, CACM 35(6), 44 (1992). Crossref, ISIGoogle Scholar
    • L. G. Valiant, CACM 33(8), 103 (1990). Crossref, ISIGoogle Scholar
    • T. L. Williams and R. J. Parsons, IEEE/ACM IPDPS'2001 (IEEE Press, 2001) pp. 140–147. Google Scholar