Advertisement
Published in:
2011 | OriginalPaper | Chapter
Measure Complexity in Heterogeneous System
Author : Kuldeep Sharma
Published in: High Performance Architecture and Grid Computing
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Heterogeneous systems are becoming advanced and more complex day by day. To acknowledge the complexity of such system is a significant challenge. Distributed systems reminiscent of grid systems, internet systems, ever-present computing environments, storage systems, sensor networks and online enterprise systems often contain massive numbers of heterogeneous and mobile nodes. These systems are highly dynamic and fault-prone as well. As an end result, it’s difficult to debug and developers find it easier said than done to program new applications and services for these systems; administrators find it complicated to manage and configure these complex, device-rich systems and end-users find it difficult to use these systems to perform tasks. In this context the aspects of complexity have been studied extensively. The concepts of time and space complexity of different kinds of algorithms are well understood. The complexity of heterogeneous systems for people has been broadly acknowledged to be a key problem.