A Modular Implementation of Data Structures in Bulk-Synchronous Parallel ML

A functional data-parallel language called BSML has been designed for programming Bulk-Synchronous Parallel algorithms. Many sequential algorithms do not have parallel counterparts and many non-computer science researchers do not want to deal with parallel programming. In sequential programming environments, common data structures are often provided through reusable libraries to simplify the development of applications. A parallel representation of such data structures is thus a solution for writing parallel programs without suffering from disadvantages of all the features of a parallel language. In this paper we describe a modular implementation in BSML of some data structures and show how those data types can address the needs of many potential users of parallel machines who have so far been deterred by the complexity of parallelizing code.

• Type: Journal
• Year: 2008
• Where: PPL
• Authors: Frédéric Gava
• Keywords: Bulk-Synchronous Parallel Algorithms, Data Structures, Many Sequential Algorithms, PPL 2008