نتایج جستجو برای: Matrix multiplication

تعداد نتایج: 385488  

L Jokar

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...

Journal: :journal of sciences, islamic republic of iran 2010
l jokar

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...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه پیام نور - دانشکده علوم پایه 1386

چکیده ندارد.

Journal: :ACM Transactions on Computation Theory 2013

Journal: :Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics 2017

Journal: :ACM Transactions on Algorithms 2005

Journal: :IEEE Transactions on Information Theory 2021

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...

Journal: :Journal of Cyber Security and Mobility 2018

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید