Efficiently Rationing Resources for Grid and P2P Computing
نویسندگان
چکیده
As Grid and P2P computing become more and more popular, many schedule algorithms based on economics rather than traditional pure computing theory have been proposed. Such algorithms mainly concern balancing resource supply and resource demand via economic measures. As we know, fairness and efficiency are two conflicting goals. In this paper, we argue that overbooking resources can greatly improve usage rates of resources and simultaneously reduce responsive time of tasks by shortening schedule time especially under extreme overload, while maintaining schedule principles. This is accomplished by scheduling more eligible tasks above resource capacity in advance, therefore overbooking the resource. We verify our claim on Grid Market[1].
منابع مشابه
P2P Network Trust Management Survey
Peer-to-peer applications (P2P) are no longer limited to home users, and start being accepted in academic and corporate environments. While file sharing and instant messaging applications are the most traditional examples, they are no longer the only ones benefiting from the potential advantages of P2P networks. For example, network file storage, data transmission, distributed computing, and co...
متن کاملTrust Management in the P2P Grid
Peer-to-peer (P2P) Grid Computing has gained its popularity in many large scale distributed applications. Within such an environment, trust management is a complex and difficult task since the Grid harnesses a large variety of geographically distributed resources in virtual organizations (VOs) across multiple domains. This paper proposes a reputation framework for trust management in the P2P Gr...
متن کاملIncentive-Based P2P Scheduling in Grid Computing
Grid computing has emerged as an attractive computing paradigm recently. In typical grid environments, there are two distinct parties, resource consumers and resource providers, which have different optimization objectives. Enabling an effective interaction between the two parties (i.e., scheduling jobs of consumers across resources of providers) is particularly challenging due to the distribut...
متن کاملTrade-offs in matching jobs and balancing load for distributed desktop grids
Desktop grids can achieve tremendous computing power at low cost through opportunistic sharing of resources. However, traditional client–server Grid architectures do not deal with all types of failures, and do not always cope well with very dynamic environments. This paper describes the design of a desktop grid implemented over a modified Peer-to-Peer (P2P) architecture. The underlying P2P syst...
متن کاملNew Approaches with Chord in Efficient P2P Grid Resource Discovery
Grid computing is a type of distributed computing which allows sharing of computer resources through Internet. It not only allows us to share files but also most of the software and hardware resources. An efficient resource discovery mechanism is the fundamental requirements for grid computing systems, as it supports resource management and scheduling of applications. Among various discovery me...
متن کامل