Complexity Analysis in Heterogeneous System

  • Sharma K
  • Garg D
N/ACitations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Sharma, K., & Garg, D. (2009). Complexity Analysis in Heterogeneous System. Computer and Information Science, 2(1). https://doi.org/10.5539/cis.v2n1p48

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free