Computing Real Time Jobs in P2P Networks

10 years 8 months ago
Computing Real Time Jobs in P2P Networks
— In this paper, we present a distributed computing framework designed to support higher quality of service and fault tolerance for processing deadline-driven tasks in a P2P environment. Our proposed strategy strives to build an open infrastructure that is accessible by ordinary users for both cycle donation and consumption. For jobs that fail to be locally accommodated, the proposed scheduler MET (Maximum Efficiency Tree) builds a dynamic multi-level resource tree with minimal yet sufficient power to process the job prior to its deadline. The peer selection policy is based on a joint evaluation of the computational power and communication bandwidth at the nodes. Further, with an optimal load sharing scheme, the resulting resource tree is guaranteed to be power efficient. The proposed computing protocol offers an approach for utilizing idle computing cycles of peer computers on the Internet in a P2P manner. The protocol exhibits three attractive features - decentralized operation,...
Jingnan Yao, Jian Zhou, Laxmi N. Bhuyan
Added 12 Jun 2010
Updated 12 Jun 2010
Type Conference
Year 2006
Where LCN
Authors Jingnan Yao, Jian Zhou, Laxmi N. Bhuyan
Comments (0)