Photo by homajob from unsplash
multi-bsp is a bridging model for algorithm design which takes into account hierarchical architectures. We discuss two questions about multi-bsp algorithms and their programming: (1) How to obtain a formal… Click to show full abstract
multi-bsp is a bridging model for algorithm design which takes into account hierarchical architectures. We discuss two questions about multi-bsp algorithms and their programming: (1) How to obtain a formal characterization of the class of multi-bsp algorithms or at least a tree-based hierarchical extension of bsp inspired by multi-bsp? (2) How can a programming language be proven algorithmically complete for such a class? Our solution is based on an extension of a bsp version of sequential abstract state machines (asms).
Journal Title: International Journal of Parallel Programming
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!