King Saud University Repository >
King Saud University >
Science Colleges >
College of Computer and Information Sciences >
College of Computer and Information Sciences >

Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/15099

Title: Time Complexity of a Matrix Product on Message Passing Architectures
Authors: M. Amiripour
Keywords: Task Scheduling, Master-Slave, Super-Hypercube, Architecture, Matrix Product
تاريخ النشر: 2008
Publisher: Applied Computer & Applied Computational Science
Abstract: The use of an appropriate methodology for calculating the communication cost, time complexity and performing task scheduling in massively parallel processing systems plays a significant role in improving the functionality of a message-passing architecture. This paper presents an existing message passing architecture (MS3H 4-Cube) which is based on Master-Slave Super-Hypercube (MSSHP) topology. By applying matrix multiplication, we investigate the communication cost and time complexity on MSSHP topology. However, by means of mathematical simulation and graphical presentation, it is verified that the completion time of a matrix product is shorter when is applied on MSSHP compared with Hypercube (HP) topology.
URI: http://hdl.handle.net/123456789/15099
يظهر في المجموعات:College of Computer and Information Sciences

:الملفات في هذا العنصر

ملف وصف حجمالنوع
Dr.Abachi-Conf-2.docx11.58 kBMicrosoft Word XMLعرض\u0641تح

جميع جميع الابحاث محمية بموجب حقوق الطباعة، جميع الحقوق محفوظة.


البرمجيات DSpace حقوق المؤلف © 2002-2009 معهد ماساتشوستس للتكنولوجيا و Hewlet Packard - التغذية الراجعة