The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...

the objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a fibonacci hypercube structure. most of the popular algorithms for parallel matrix multiplication can not run on fibonacci hypercube structure, therefore giving a method that can be run on all structures especially fibonacci hypercube structure is necessary for parallel matr...

In distributed computing systems slow working nodes, known as stragglers, can greatly extend finishing times. Coded is a technique that enables straggler-resistant computation. Most coded techniques presented to date provide robustness by ensuring the time finish depends only on set of fastest nodes. However, while stragglers do compute less work than non-stragglers, in real-world commercial cl...