Title: Performance Study of Scheduling Mechanisms for Peer-to-Peer
           Computing Environments

Authors: Ilias Savvas and M-Tahar Kechadi

        Parallel Computational Research Group,
        Department of Computer Science,
        University College Dublin,
        Belfield, Dublin 4, Ireland.

e-mail: tahar.kechadi@ucd.ie, savvas@teilar.gr

Abstract:

Peer-to-peer (P2P) computing has emerged as an  alternative model of
communication and computation to client-server model. While, P2P
computing may significantly increase the performance and the
scalability of the whole system, they still facing many challenges in
achieving these goals. In this paper we study the problem of scheduling
a large number of tasks on such systems. We propose two techniques
based on heuristic approach: a Recursive Neighbour Search and an
Augmented Tabu-Search technique. These techniques do not address
directly the load-balancing  problem  since it is completely
unrealistic in such large environments, but we will show that even a
non-perfectly load-balanced system can behave reasonably well by taking
into account the tasks' time demands. These algorithms, are compared to
a well known scheduling algorithm in order validate their performance.