A REVIEW: COMPARISON OF COOPERATIVE SCHEDULING MECHANISMS IN P2P COMPUTING SYSTEM
Journal Title: Indian Journal of Computer Science and Engineering - Year 2014, Vol 5, Issue 1
Abstract
Grid computing is an upcoming technology which combines the resources from different locations to solve large tasks.Peer to peer (P2P) computing is a kind of computing in which large number of computers are connected through internet and their resources are utilized to solve large problems or tasks. It uses the idle cycles of all the computers connected to the network for solving huge parallel applications. An efficient scheduling mechanism is the most important challenge taken by the peer to peer network for utilizing the resources properly and also to assign the tasks to the resources effectively. Cooperation is very important because users in P2P networks tend to use the resources without providing any profit in response. In this paper, a comparative study has been done about several cooperative scheduling mechanisms that show their efficiency of improving the poor resource utilization and scalability.
Authors and Affiliations
Ashwathy M. G , Arul Xavier V. M
Keywords
Related Articles
- EP ID EP126235
- DOI -
- Views 128
- Downloads 0
Countering the DDoS Attacks for a Secured Web Service
Web services are the most widely used technology today. SOAP messages are the building blocks of web services. Since web services mostly deal with confidential data they must be protected from intruders. Intruders can be...
PETRI NETS GENERATING KOLAM PATTERNS
Array Token Petri Nets are known to generate all the nine families generated by Array Grammars [10]. Application of two dimensional array grammars in kolam generation has been discussed [1]. Motivated by this we have use...
Analyzing Throughput of TCP in IEEE 802.11 Based Ad-hoc Networks
In order to allow programmers to follow conventional techniques while creating applications that uses an internet, software in the internet must provide the same semantics as a conventional computer system, it means it m...
IP RIGHTS AND DIGITIZED CONTENT
This paper lays the groundwork with a brief introduction to the issues relating to Intellectual Property in the digital world and a special reference to its impact on the society. It also focuses on its recent trends Int...
SUPER STRONGLY PERFECT NESS OF SOME INTERCONNECTION NETWORKS
A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal dominating set that meets all the maximal complete sub graphs of H. In this paper we have analyzed the structure of super st...