Impact of nodes distribution on the performance of a P2P computing middleware based on virtual rings

P2P computing middlewares are interesting options for grid computing applications that require scalability and resiliency. Nevertheless, most P2P computation systems rely on partially centralized or hybrid decentralized architectures to distribute tasks and collect the results, raising fault tolerance and bottleneck issues. CONFIIT (Computation Over Network with Finite number of Independent and Irregular Tasks) is a purely decentralized middleware for grid computing, relying on a virtual ring for topology management and for task scheduling. This paper evaluates the impact of node placement and task granularity on the performance of CONFIIT. We analyze how CONFIIT handles different distribution scenarios in a grid environment while solving the well-known Langford permutation problem.