1 / 14

Frédéric Gava

Design of. Departmental Metacomputing ML. Frédéric Gava. Goal. Computing Unit. Computing Unit. Storage. User. Bulk Synchronous Parallelism + Functional Programming = BSML. A d vantages of the BSP mod e l: P or tability Scalability, deadlock free

yetta-owen
Télécharger la présentation

Frédéric Gava

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Design of Departmental Metacomputing ML Frédéric Gava ICCS 2004 Gava

  2. Goal Computing Unit Computing Unit Storage User ICCS 2004 Gava

  3. Bulk Synchronous Parallelism + Functional Programming = BSML • Advantages of the BSP model: • Portability • Scalability, deadlock free • Simple cost model  Performance prediction • Advantages of functional programming: • High level features (higher order functions, pattern-matching, concrete types, etc…) • Savety of the environment • Programs Proofs ICCS 2004 Gava

  4. The BSP model 0 1 2 3 p-1 Proc. T(s) = (max0i<p wi) + hg + L

  5. The BSML language • Confluent language : deterministic algorithms • Library for the « Objective Caml » language (called BSMLlib) • Operations to access to the BSP parameters • 4 Operations on a parallel data structure called parallel vector • mkpar : create a parallel vector • apply : parallel point-wise application • put: send values • at : projection of a value

  6. Problems with BSP • Global synchronization is too expensive • No hierarchical network capacities • No heterogenelity ICCS 2004 Gava

  7. The MP model MP = messages passing No super-steps but m-steps Proc. 0 1 2 3 Local computing Communication

  8. New model: DMM • We have : • P BSP units • L, latency of the global network • G, time to send one word • List of nb of processes : • List of times for a barrier : • List of times for a 1-relation : • We have d-steps of super-steps ICCS 2004 Gava

  9. New communication BSP Unit i BSP Unit j G et L Intranet g et l i i g et l j j ICCS 2004 Gava

  10. New communication Unit i Unité j g et l i i ICCS 2004 Gava

  11. New language: DMML • Library for the « Objective Caml » language • Operations to access to the DMM parameters • Operations on departmental vectors • mkdpt : creation of a departmental vector • applydpt : departmental point-wise application • get : received values

  12. Conclusion • BSML = BSP + ML • New model for departmental meta-computing • New language called DMML ICCS 2004 Gava

  13. Future Work • Polymorphic type system for the language • Implementation of « big » applications • Static Dependent Costs for Estimating Execution Time ICCS 2004 Gava

  14. ICCS 2004 Gava

More Related