Software Open Access

JAMPI: Efficient matrix multiplication in Spark using Barrier Execution Mode

Földi Tamás; Nicolas A Perez; Chris von Csefalvay

DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="" xmlns="" xsi:schemaLocation="">
  <identifier identifierType="DOI">10.5281/zenodo.3908556</identifier>
      <creatorName>Földi Tamás</creatorName>
      <creatorName>Nicolas A Perez</creatorName>
      <affiliation>HP Enterprise</affiliation>
      <creatorName>Chris von Csefalvay</creatorName>
    <title>JAMPI: Efficient matrix multiplication in Spark using Barrier Execution Mode</title>
    <date dateType="Issued">2020-06-25</date>
  <resourceType resourceTypeGeneral="Software"/>
    <alternateIdentifier alternateIdentifierType="url"></alternateIdentifier>
    <relatedIdentifier relatedIdentifierType="URL" relationType="IsSupplementTo"></relatedIdentifier>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsVersionOf">10.5281/zenodo.3908555</relatedIdentifier>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
    <description descriptionType="Abstract">&lt;p&gt;The new barrier mode in Apache Spark allows embedding distributed deep learning training as a Spark stage to simplify the distributed training workflow. In Spark, a task in a stage doesn&amp;rsquo;t depend on any other tasks in the same stage, and hence it can be scheduled independently. However, several algorithms require more sophisticated inter-task communications, similar to the MPI paradigm. By combining distributed message passing (using asynchronous network IO), OpenJDK&amp;#39;s new auto-vectorization and Spark&amp;#39;s barrier execution mode, we can add non-map/reduce based algorithms, such as Cannon&amp;#39;s distributed matrix multiplication to Spark. We document an efficient distributed matrix multiplication using Cannon&amp;#39;s algorithm, which improves significantly on the performance of the existing MLlib implementation. Used within a barrier task, the algorithm described herein results in an up to 24% performance increase on a 10,000x10,000 square matrix with a significantly lower memory footprint. Applications of efficient matrix multiplication include, among others, accelerating the training and implementation of deep convolutional neural network based workloads, and thus such efficient algorithms can play a ground-breaking role in faster, more efficient execution of even the most complicated machine learning tasks.&lt;/p&gt;</description>
All versions This version
Views 7979
Downloads 22
Data volume 39.3 MB39.3 MB
Unique views 6464
Unique downloads 22


Cite as