文章基本信息

标题：Complexity Analysis in Heterogeneous System
本地全文：下载
作者：Kuldeep Sharma ; Deepak Garg
期刊名称：Computer and Information Science
印刷版ISSN：1913-8989
电子版ISSN：1913-8997
出版年度：2009
卷号：2
期号：1
页码：48
DOI：10.5539/cis.v2n1P48
出版社：Canadian Center of Science and Education
摘要：Normal 0 7.8 ? 0 2 false false false MicrosoftInternetExplorer4  /* Style Definitions */ table.MsoNormalTable {mso-style-name:????; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-parent:""; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin:0cm; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:10.0pt; font-family:"Times New Roman"; mso-fareast-font-family:"Times New Roman"; mso-ansi-language:#0400; mso-fareast-language:#0400; mso-bidi-language:#0400;} Complexity analysis in heterogeneous system is one of the more complicated topics in the subject mathematics for computing. It involves an unusual concept and some tricky algebra. This paper shows how various algorithms take part in heterogeneous system and how they affect the overall system complexity? All analysis and methods are situation specific. Here we show a comparative study of various method and techniques of algorithm analysis giving their specific advantages and disadvantages. We will specify general guidelines for calculating the complexity of heterogeneous system which still gives sleepless nights to the researchers.